English
Related papers

Related papers: Maximizing the Edelman-Greene statistic

200 papers

We reinterpret an inequality, due originally to Sidorenko, for linear extensions of posets in terms of convex subsets of the symmetric group $\mathfrak{S}_n$. We conjecture that the analogous inequalities hold in arbitrary…

Combinatorics · Mathematics 2022-11-02 Christian Gaetz , Yibo Gao

It has been conjectured by W. Chen that the distribution of the length of the longest increasing subsequence in a uniformly random permutation is log-concave. We propose a stronger version of this conjecture which involves the Kronecker…

Combinatorics · Mathematics 2020-06-24 Jonathan Novak , Brendon Rhoades

It is an important problem in algebraic combinatorics to deduce the Schur function expansion of a symmetric function whose expansion in terms of the fundamental quasisymmetric function is known. For example, formulas are known for the…

Combinatorics · Mathematics 2025-03-20 Rosa Orellana , Franco Saliola , Anne Schilling , Mike Zabrocki

This paper discusses the asymptotic behaviour of the number of descents in a random signed permutation and its inverse, which was posed as an open problem by Chatterjee and Diaconis in a recent publication. For that purpose, we generalize…

Probability · Mathematics 2021-06-17 Frank Röttger

A new descent set statistic on involutions, defined geometrically via their interpretation as matchings, is introduced in this paper, and shown to be equi-distributed with the standard one. This concept is then applied to construct explicit…

Combinatorics · Mathematics 2023-01-03 Ron M. Adin , Yuval Roichman

This paper proves a combinatorial rule expressing the product $s_\tau(s_{\lambda/\mu} \circ p_r)$ of a Schur function and the plethysm of a skew Schur function with a power sum symmetric function as an integral linear combination of Schur…

Combinatorics · Mathematics 2016-10-11 Mark Wildon

The block number of a permutation is the maximal number of components in its expression as a direct sum. We show that, for $321$-avoiding permutations, the set of left-to-right maxima has the same distribution when the block number is…

Combinatorics · Mathematics 2017-09-08 Ron M. Adin , Eli Bagno , Yuval Roichman

We consider the complex case of the so-called S-inequality. It concerns the behaviour of the Gaussian measures of dilations of convex and rotationally symmetric sets in C^n (rotational symmetry is invariance under the multiplication by…

Probability · Mathematics 2011-01-13 Tomasz Tkocz

We formulate a generalization of the volume conjecture for planar graphs. Denoting by <G, c> the Kauffman bracket of the graph G whose edges are decorated by real "colors" c, the conjecture states that, under suitable conditions, certain…

Geometric Topology · Mathematics 2014-03-11 Francesco Costantino , François Guéritaud , Roland van der Veen

We construct a statistic-swapping involution on the Cartesian product of the generalized symmetric group $S(k,n)$ with the symmetric group $S_{kn}$, which swaps the number of fixed points in the generalized symmetric group element with the…

Combinatorics · Mathematics 2026-02-12 Peter Kagey , Kai Mawhinney

Let $P_N$ be a uniform random $N\times N$ permutation matrix and let $\chi_N(z)=\det(zI_N- P_N)$ denote its characteristic polynomial. We prove a law of large numbers for the maximum modulus of $\chi_N$ on the unit circle, specifically, \[…

Probability · Mathematics 2018-06-21 Nicholas Cook , Ofer Zeitouni

In this paper we consider Tyler's robust covariance M-estimator under group symmetry constraints. We assume that the covariance matrix is invariant to the conjugation action of a unitary matrix group, referred to as group symmetry. Examples…

Applications · Statistics 2015-09-30 Ilya Soloveychik , Dmitry Trushin , Ami Wiesel

Let $\Gamma$ be a Zariski dense Kleinian Schottky subgroup of PSL2(C). Let $\Lambda(\Gamma)$ be its limit set, endowed with a Patterson-Sullivan measure $\mu$ supported on $\Lambda(\Gamma)$. We show that the Fourier transform…

Dynamical Systems · Mathematics 2023-02-22 Jialun Li , Frederic Naud , Wenyu Pan

It is a well-known conjecture, sometimes attributed to Frankl, that for any family of sets which is closed under the union operation, there is some element which is contained in at least half of the sets. Gilmer was the first to prove a…

Combinatorics · Mathematics 2022-11-24 Luke Pebody

A permutation statistic $\operatorname{st}$ is said to be shuffle-compatible if the distribution of $\operatorname{st}$ over the set of shuffles of two disjoint permutations $\pi$ and $\sigma$ depends only on $\operatorname{st}\pi$,…

Combinatorics · Mathematics 2023-09-29 Jinting Liang , Bruce E. Sagan , Yan Zhuang

It is known that the number of permutations in the symmetric group $S_{2n}$ with cycles of odd lengths only is equal to the number of permutations with cycles of even lengths only. We prove a refinement of this equality, involving descent…

Combinatorics · Mathematics 2025-02-07 Ron M. Adin , Pál Hegedűs , Yuval Roichman

We compute the expansion of the cohomology class of the permutahedral variety in the basis of Schubert classes. The resulting structure constants $a_w$ are expressed as a sum of \emph{normalized} mixed Eulerian numbers indexed naturally by…

Combinatorics · Mathematics 2023-06-22 Philippe Nadeau , Vasu Tewari

We consider random walks on ``balanced multislices'' of any ``grid'' that respects the ``symmetries'' of the grid, and show that a broad class of such walks are good spectral expanders. (A grid is a set of points of the form $\mathcal{S}^n$…

Computational Complexity · Computer Science 2025-07-16 Prashanth Amireddy , Amik Raj Behera , Srikanth Srinivasan , Madhu Sudan

We explore the asymptotic distributions of sequences of integer-valued additive functions defined on the symmetric group endowed with the Ewens probability measure as the order of the group increases. Applying the method of factorial…

Combinatorics · Mathematics 2013-04-10 Tatjana Bakšajeva , Eugenijus Manstavičius

It is shown that the maximum number of patterns that can occur in a permutation of length $n$ is asymptotically $2^n$. This significantly improves a previous result of Coleman.

Combinatorics · Mathematics 2012-02-14 M. H. Albert , Micah Coleman , Ryan Flynn , Imre Leader