Related papers: Increasing Subsequences and Kronecker Coefficients
The expected length of longest common subsequences is a problem that has been in the literature for at least twenty five years. Determining the limiting constants \gamma_k appears to be quite difficult, and the current best bounds leave…
We provide upper and lower bounds for the expected length $\mathbb E(L_{n,m})$ of the longest common pattern contained in $m$ random permutations of length $n$. We also address the tightness of the concentration of $L_{n,m}$ around $\mathbb…
The Brunn-Minkowski and Pr\'{e}kopa-Leindler inequalities admit a variety of proofs that are inspired by convexity. Nevertheless, the former holds for compact sets and the latter for integrable functions so it seems that convexity has no…
We investigate stochastic comparisons between exponential family distributions and their mixtures with respect to the usual stochastic order, the hazard rate order, the reversed hazard rate order, and the likelihood ratio order. A general…
We consider the problem of computing the maximum likelihood multivariate log-concave distribution for a set of points. Specifically, we present an algorithm which, given $n$ points in $\mathbb{R}^d$ and an accuracy parameter $\epsilon>0$,…
Considered are the large $N$, or large intensity, forms of the distribution of the length of the longest increasing subsequences for various models. Earlier work has established that after centring and scaling, the limit laws for these…
The log-concave maximum likelihood estimator (MLE) problem answers: for a set of points $X_1,...X_n \in \mathbb R^d$, which log-concave density maximizes their likelihood? We present a characterization of the log-concave MLE that leads to…
We construct an analogue of the Lyndon-Hochschild-Serre spectral sequence in the context of polynomial cohomology, for group extensions. If G is an extension of Q by H, then the spectral sequence converges to the polynomial cohomology of G.…
We give an upper and lower estimate for the maximal commutator length of a noncentral element of the elementary subgroup of the general linear group over a skew-field based on the maximal commutator length of an element of the…
We study the upper tail of the number of arithmetic progressions of a given length in a random subset of {1,...,n}, establishing exponential bounds which are best possible up to constant factors in the exponent. The proof also extends to…
We establish two-sided bounds for expectations of order statistics ($k$-th maxima) of moduli of coordinates of centered log-concave random vectors with uncorrelated coordinates. Our bounds are exact up to multiplicative universal constants…
As is the case for many curved exponential families, the computation of maximum likelihood estimates in a multivariate normal model with a Kronecker covariance structure is typically carried out with an iterative algorithm, specifically, a…
In this paper, we study two problems: (1) estimation of a $d$-dimensional log-concave distribution and (2) bounded multivariate convex regression with random design with an underlying log-concave density or a compactly supported…
The Brownian separable permutons are a one-parameter family -- indexed by $p\in(0,1)$ -- of universal limits of random constrained permutations. We show that for each $p\in (0,1)$, there are explicit constants $1/2 < \alpha_*(p) \leq…
One method to generate random permutations involves using Gaussian elimination with partial pivoting (GEPP) on a random matrix $A$ and storing the permutation matrix factor $P$ from the resulting GEPP factorization $PA=LU$. We are…
The motivation of this paper is to investigate the joint distribution of succession and Eulerian statistics. We first investigate the enumerators for the joint distribution of descents, big ascents and successions over all permutations in…
We investigate the behavior of the length of the longest weakly increasing subsequences (weak LIS) of $n$-step random walks with nonzero integer increments $k = \pm 1, \pm 2, \dots$ given by a zero-mean, symmetric heavy tailed mass…
We establish uniform estimates for order statistics of sequences of independent identically distributed random variables with log-concave distribution in terms of Orlicz norms associated with the distribution function of the random…
We extend the Langevin Monte Carlo (LMC) algorithm to compactly supported measures via a projection step, akin to projected Stochastic Gradient Descent (SGD). We show that (projected) LMC allows to sample in polynomial time from a…
Let $S_n$ denote the set of permutations of $[n]$ and let $\sigma=\sigma_1\cdots\sigma_n\in S_n$. For a subsequence $\{\sigma_{i_j}\}_{j=1}^k$ of $\{\sigma_i\}_{i=1}^n$ of length $k\ge2$, construct the ``up/down'' sequence $V_1\cdots…