Skip to main content

All Questions

10 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
10 votes
0 answers
222 views

Asymptotics of subgraph densities in graphons

In Pittel (1989)'s solution to a problem of Knuth (1976) on the expected number of stable matchings between $n$ men and $n$ women under uniform random preferences, it was shown that, as $n \to \infty$,...
Yufei Zhao's user avatar
5 votes
0 answers
240 views

Paths in Pascal's triangle; or balanced $0-1$ initial segments

Here is a problem arising (via a tortuous path) from trying to determine the spectrum of Vershik's adic map on Pascal's triangle (a moderately well-known question: is the spectrum trivial, that is, is ...
David Handelman's user avatar
5 votes
0 answers
215 views

Asymptotics of a Splitting Process

Consider $p(n)$ defined recursively by $p(1)=1$ and $\displaystyle p(n)=\frac{1}{(n-1)^n}\sum_{i=1}^{n-1}\left\{\sum_{j=i}^{n-1}(-1)^{j-i}{n \choose j}{j\choose i}(n-j)^j(n-j-1)^{n-j}\right\}p(i)$. ...
Wiley's user avatar
  • 667
5 votes
0 answers
227 views

Number of times lead changes in a multi-candidate election (reference-request)

In a two candidate election where votes are distributed uniformly at random between the candidates, the probability that the lead changes when tallying the $i$-th vote is the same as the probability ...
Kev's user avatar
  • 51
4 votes
0 answers
150 views

Dividing a finite arithmetic progression into two sets of same sum: always the same asymptotics?

This is inspired by the recent question How many solutions $\pm1\pm2\pm3…\pm n=0$. The oeis entries A063865 linked to this question and A292476/A156700 for the related one "How many solutions $\pm1\...
Wolfgang's user avatar
  • 13.4k
3 votes
0 answers
157 views

Growth of inner products between two random vectors on the sparse hypercube

We define the $s$-sparse hypercube in $\mathbb{R}^d$ as \begin{align} \mathbb{H}_s = \bigl \{ {\bf{v}} \in \{ -1, 0 , 1\}^d \colon \| {\bf{v}} \|_0 = s \bigr\}, \end{align} where $ \| {\bf v} \|_0 $ ...
Steve's user avatar
  • 1,127
3 votes
0 answers
268 views

A generalization of coupon collector problem - $\geq1$ pick per experiment

Mix $T\geq1$ coupons numbered $1$ to $T$ with a set of $S\geq0$ number of dummy coupons with no numbers. Select $N\geq1$ coupons at each trial at random and put them back. $N=1$ is standard coupon ...
user avatar
1 vote
0 answers
122 views

On the derivation of some asymptotic expressions involving combinatorics

My questions come from the supplementary material in a recent preprint Nonequilibrium statistical mechanics of money/energy exchange models. My first question comes from page 35. Specifically, suppose ...
Fei Cao's user avatar
  • 730
1 vote
0 answers
273 views

A natural sum over multisets (expectation over multinomial)

I think this is a natural question but am not sure where to find resources. Consider the possible multisets arising from choosing $n$ times an item from one of $k$ categories. We can represent one ...
usul's user avatar
  • 4,529
1 vote
0 answers
243 views

Factorization of permutations.

Let $n,k$ be positive integers such that $3n=2k$ and $N = \lfloor \alpha n\rfloor$ for some constant $0<\alpha<1$. Let $S_{3n}$ denote the permutation group of order $3n$. Consider the following ...
gmath's user avatar
  • 141