相关论文: The dinner table problem: the rectangular case
We study spherical quadrilaterals whose angles are odd multiples of pi/2, and the equivalent accessory parameter problem for the Heun equation. We obtain a classification of these quadrilaterals up to isometry. For given angles, there are…
We study how the order of N independent random walks in one dimension evolves with time. Our focus is statistical properties of the inversion number m, defined as the number of pairs that are out of sort with respect to the initial…
If the step distribution in a renewal process has finite mean and regularly varying tail with index -{\alpha}, 1<{\alpha}<2, the first two terms in the asymptotic expansion of the renewal function have been known for many years. Here we…
We study the asymptotics of bounded lecture hall tableaux. Limit shapes form when the bounds of the lecture hall tableaux go to infinity linearly in the lengths of the partitions describing the large-scale shapes of these tableaux. We prove…
A star of n (n greater than or equal to 2) line segments (needles) of equal length with common endpoint and constant angular spacing is randomly placed onto a lattice which is the union of two families of equidistant lines in the plane with…
Fix an integer $l$ such that $|l|$ is a prime $3$ modulo $4$. Let $d > 0$ be a squarefree integer and let $N_d(x, y)$ be the principal binary quadratic form of $\mathbb{Q}(\sqrt{d})$. Building on a breakthrough of Alexander Smith, we give…
We consider $\Phi(x)=x^{-\frac{1}{4}}\left[1-2\sqrt{x}\Sigma e^{-p^2\pi x}\ln p\right]$ on $x>0$, where the sum is over all primes $p$. If $\Phi$ is bounded on $x>0$, then the Riemann hypothesis is true or there are infinitely many zeros…
Motivated by the numerical investigation by Aoki et al. [1], we study a rarefied gas flow between two parallel infinite plates of the same temperature governed by the Boltzmann equation with diffuse reflection boundaries, where one plate is…
The analysis of strings of $n$ random variables with geometric distribution has recently attracted renewed interest: Archibald et al. consider the number of distinct adjacent pairs in geometrically distributed words. They obtain the…
In the two-type Richardson model on a graph $\mathcal{G}=(\mathcal{V},\mathcal{E})$, each vertex is at a given time in state $0$, $1$ or $2$. A $0$ flips to a $1$ (resp.\ $2$) at rate $\lambda_1$ ($\lambda_2$) times the number of…
Attractors in asymmetric neural networks with deterministic parallel dynamics were shown to present a "chaotic" regime at symmetry eta < 0.5, where the average length of the cycles increases exponentially with system size, and an…
We give the asymptotic behavior of the ratio of two neighboring multiple orthogonal polynomials under the condition that the recurrence coefficients in the nearest neighbor recurrence relations converge.
We prove the computational intractability of rotating and placing $n$ square tiles into a $1 \times n$ array such that adjacent tiles are compatible--either equal edge colors, as in edge-matching puzzles, or matching tab/pocket shapes, as…
An integer partition of $n$ is a decreasing sequence of positive integers that add up to $[n]$. Back in $1979$ Macdonald posed a question about the limit value of the probability that two partitions chosen uniformly at random, and…
Starting from an n-by-n matrix of zeros, choose uniformly random zero entries and change them to ones, one-at-a-time, until the matrix becomes invertible. We show that with probability tending to one as n tends to infinity, this occurs at…
Consider a coin tossing experiment which consists of tossing one of two coins at a time, according to a renewal process. The first coin is fair and the second has probability $1/2 + \theta$, $\theta \in [-1/2,1/2]$, $\theta$ unknown but…
We consider the Dirichlet problem $-\Delta u=\lambda f(u)$ with $\lambda<0$ and $f$ non-negative and non-decreasing. We show existence and uniqueness of solutions $u_\lambda$ for any $\lambda$ and discuss their asymptotic behavior as…
Given a positive integer $n$, consider a random permutation $\tau$ of the set $\{1,2,\ldots, n\}$. In $\tau$, we look for sequences of consecutive integers that appear in adjacent positions: a maximal such a sequence is called a block. Each…
We recall the directed graph of _juggling states_, closed walks within which give juggling patterns, as studied by Ron Graham in [w/Chung, w/Butler]. Various random walks in this graph have been studied before by several authors, and their…
Using a result of Gessel and Reutenauer, we find a simple formula for the number of cyclic permutations with a given descent set, by expressing it in terms of ordinary descent numbers (i.e., those counting all permutations with a given…