Related papers: Fertility Monotonicity and Average Complexity of t…

Given a polynomial map $\psi:S^m\to \mathbb{R}^k$ with components of degree $d$, we investigate the structure of the semialgebraic set $Z\subseteq S^m$ consisting of those points where $\psi$ and its derivatives satisfy a given list of…

Feldman and Karlin conjectured that the number of isolated fixed points for deterministic models of viability selection and recombination among n possible haplotypes has an upper bound of 2^n - 1. Here a proof is provided. The upper bound…

For $d \geq 2$ and $n \in \mathbb{N}$, let $\mathsf{W}_n$ denote the uniform law on self-avoiding walks of length $n$ beginning at the origin in the nearest-neighbour integer lattice $\mathbb{Z}^d$, and write $\Gamma$ for a…

We give a simple proof of the matrix Spencer conjecture up to poly-logarithmic rank: given symmetric $d \times d$ matrices $A_1,\ldots,A_n$ each with $\|A_i\|_{\mathsf{op}} \leq 1$ and rank at most $n/\log^3 n$, one can efficiently find…

Several sequences of free cumulants that count binary plane trees correspond to sequences of classical cumulants that count the decreasing versions of the same trees. Using two new operations on colored binary plane trees that we call…

Let $F_n$ be an $n$ by $n$ symmetric matrix whose entries are bounded by $n^{\gamma}$ for some $\gamma>0$. Consider a randomly perturbed matrix $M_n=F_n+X_n$, where $X_n$ is a random symmetric matrix whose upper diagonal entries $x_{ij}$…

Let $P(n)$ be the probability that two independent, uniformly random permutations of $[n]$ have the same order, and let $K(n)$ be the probability that they are in the same conjugacy class. Answering a question of Thibault Godin, we prove…

The Schnorr-Stimm dichotomy theorem concerns finite-state gamblers that bet on infinite sequences of symbols taken from a finite alphabet $\Sigma$. In this paper we use the Kullback-Leibler divergence to formulate the $\textit{lower…

Let $S_n$ denote the group all permutations of $n$. For every permutation $\sigma$, we let $\mathrm{des}(\sigma)$ denote the number of descents in $\sigma$ and $\mathrm{LRMin}(\sigma)$ denote the number of left-to-right minima of $\sigma$.…

We use various combinatorial and probabilistic techniques to study growth rates for the probability that a random permutation from the Mallows distribution avoids consecutive patterns. The Mallows distribution behaves like a $q$-analogue of…

Given a permutation w, we look at the range of how often a simple reflection s_k appears in reduced decompositions of w. We compute the minimum and give a sharp upper bound on the maximum. That bound is in terms of 321- and 3412-patterns in…

The set of stable matchings induces a distributive lattice. The supremum of the stable matching lattice is the boy-optimal (girl-pessimal) stable matching and the infimum is the girl-optimal (boy-pessimal) stable matching. The classical…

Let $P(n)$ be the number of polyominoes of $n$ cells and $\lambda$ be Klarner's constant, that is, $\lambda=\lim_{n\to\infty} \sqrt[n]{P(n)}$. We show that there exist some positive numbers $A,T$, so that for every $n$ \[ P(n) \ge…

We exhibit a bijection between recently-introduced combinatorial objects known as valid hook configurations and certain weighted set partitions. When restricting our attention to set partitions that are matchings, we obtain three new…

We initiate a probabilistic study of forward stability for products of Schubert polynomials through the record statistic (left-to-right maxima) of permutations. Building on the explicit record formula for forward stability obtained by Hardt…

We find optimal (up to constant) bounds for the following measures for the regularity of the Schramm-Loewner evolution (SLE): variation regularity, modulus of continuity, and law of the iterated logarithm. For the latter two we consider the…

We introduce a novel stochastic growth process, the record-driven growth process, which originates from the analysis of a class of growing networks in a universal limiting regime. Nodes are added one by one to a network, each node…

We consider a Wigner-type ensemble, i.e. large hermitian $N\times N$ random matrices $H=H^*$ with centered independent entries and with a general matrix of variances $S_{xy}=\mathbb E|H_{xy}|^2$. The norm of $H$ is asymptotically given by…

Monotone triangles are a rich extension of permutations that biject with alternating sign matrices. The notions of weak order and descent sets for permutations are generalized here to monotone triangles, and shown to enjoy many analogous…

We prove a central limit theorem for the length of the longest subsequence of a random permutation which follows one of a class of repeating patterns. This class includes every fixed pattern of ups and downs having at least one of each,…