Related papers: Longest increasing subsequences, Plancherel-type m…
The work of Vershik and Kerov [1977], Logan and Shepp [1977] established that the shape of the scaled random young diagram in Russian notation, as determined by the Plancherel measure, converges to a deterministic shape. In this article, we…
Using the Berele/Remmel/Kerov/Vershik variation of the Robinson-Schensted-Knuth correspondence, we study the cycle and increasing subsequence structure after various methods of shuffling. One consequence is a cycle index for shuffles like:…
Our interest is in the cumulative probabilities Pr(L(t) \le l) for the maximum length of increasing subsequences in Poissonized ensembles of random permutations, random fixed point free involutions and reversed random fixed point free…
We survey connections between the theory of bi-Lipschitz embeddings and the Sparsest Cut Problem in combinatorial optimization. The story of the Sparsest Cut Problem is a striking example of the deep interplay between analysis, geometry,…
Our main result is a limit shape theorem for the two-dimensional surface defined by a uniform random n-by-n square Young tableau. The analysis leads to a calculus of variations minimization problem that resembles the minimization problems…
For a regular, compact, polynomially convex circled set K in C^2, we construct a sequence of pairs {P_n,Q_n} of homogeneous polynomials in two variables with deg P_n = deg Q_n = n such that the sets K_n: = {(z,w) \in C^2 : |P_n(z,w)| \leq…
We present a new family of hook-length formulas for the number of standard increasing tableaux which arise in the study of factorial Grothendieck polynomials. In the case of straight shapes our formulas generalize the classical hook-length…
This paper develops and analyzes some interior penalty discontinuous Galerkin methods using piecewise linear polynomials for the Helmholtz equation with the first order absorbing boundary condition in the two and three dimensions. It is…
The analysis of rank ordered data has a long history in the statistical literature across a diverse range of applications. In this paper we consider the Extended Plackett-Luce model that induces a flexible (discrete) distribution over…
In this paper we study the asymptotic of multiplicities of irreducible representations in large tensor products of finite dimensional representations of simple Lie algebras and their statistics with respect to Plancherel and character…
The Kemeny aggregation problem consists of computing the consensus rankings of an election with respect to the well-known Kemeny-Young voting method. These consensus rankings satisfy various fundamental properties and are the geometric…
Given a basic compact semi-algebraic set $\K\subset\R^n$, we introduce a methodology that generates a sequence converging to the volume of $\K$. This sequence is obtained from optimal values of a hierarchy of either semidefinite or linear…
In this paper, we show how various combinatorial algorithms of Young tableaux naturally arise from the WKB approximation of the connection matrix of quantum confluent hypergeometric equation, including the Robinson-Schensted algorithm, the…
We show that Kerov's central limit theorem related to the fluctuations of Young diagrams under the Plancherel measure extends to the case of Schur-Weyl measures, which are the probability measures on partitions associated to the…
This paper introduces a new method to tackle the issue of the almost sure convergence of stochastic approximation algorithms defined from a differential inclusion. Under the assumption of slowly decaying step-sizes, we establish that the…
Shroer, Sauer, Ott and Yorke conjectured in 1998 that the Takens delay embedding theorem can be improved in a probabilistic context. More precisely, their conjecture states that if $\mu$ is a natural measure for a smooth diffeomorphism of a…
A K-theoretic analogue of RSK insertion and Knuth equivalence relations was first introduced in 2006 by Buch, Kresch, Shimozono, Tamvakis, and Yong. The resulting K-Knuth equivalence relations on words and increasing tableaux on [n] has…
We apply ideas from the theory of limits of dense combinatorial structures to study order types, which are combinatorial encodings of finite point sets. Using flag algebras we obtain new numerical results on the Erd\H{o}s problem of finding…
This paper makes a combinatorial study of the two monoids and the two types of tableaux that arise from the two possible generalizations of the Patience Sorting algorithm from permutations (or standard words) to words. For both types of…
Certain optimization problems in communication systems, such as limited-feedback constant-envelope beamforming or noncoherent $M$-ary phase-shift keying ($M$PSK) sequence detection, result in the maximization of a fixed-rank positive…