English
Related papers

Related papers: Maximizing the Edelman-Greene statistic

200 papers

Motivated by the work of Lubotzky, we use Galois cohomology to study the difference between the number of generators and the minimal number of relations in a presentation of the Galois group $G_S(k)$ of the maximal extension of a global…

Number Theory · Mathematics 2025-04-23 Yuan Liu

We present a simple formula for the expected number of inversions in a permutation of size $n$ obtained by applying $t$ random (not necessarily adjacent) transpositions to the identity permutation. More general, for any finite irreducible…

Combinatorics · Mathematics 2010-11-25 Jonas Sjostrand

Let $i_t(G)$ be the number of independent sets of size $t$ in a graph $G$. Engbers and Galvin asked how large $i_t(G)$ could be in graphs with minimum degree at least $\delta$. They further conjectured that when $n\geq 2\delta$ and $t\geq…

Combinatorics · Mathematics 2019-02-20 Wenying Gan , Po-Shen Loh , Benny Sudakov

The maximum drop size of a permutation $\pi$ of $[n]=\{1,2,\ldots, n\}$ is defined to be the maximum value of $i-\pi(i)$. Chung, Claesson, Dukes and Graham obtained polynomials $P_k(x)$ that can be used to determine the number of…

Combinatorics · Mathematics 2013-06-25 Joanna N. Chen , William Y. C. Chen

We establish a rather unexpected and simple criterion for the boundedness of Schur multipliers $S_M$ on Schatten $p$-classes which solves a conjecture proposed by Mikael de la Salle. Given $1 < p < \infty$, a simple form our main result…

Functional Analysis · Mathematics 2023-04-03 José M. Conde-Alonso , Adrián M. González-Pérez , Javier Parcet , Eduardo Tablate

We introduce inversions tableaux, a new combinatorial model for Schubert polynomials and Stanley symmetric functions that directly specializes to semi-standard Young tableaux in the Grassmannian case. They are a modification of the balanced…

Combinatorics · Mathematics 2025-07-17 Ilani Axelrod-Freed

Denote by $u(n)$ the largest principal specialization of the Schubert polynomial: $ u(n) := \max_{w \in S_n} \mathfrak{S}_w(1,\ldots,1) $ Stanley conjectured in [arXiv:1704.00851] that there is a limit $\lim_{n\to \infty} \, \frac{1}{n^2}…

Combinatorics · Mathematics 2018-05-14 Alejandro H. Morales , Igor Pak , Greta Panova

Let $A_n\subseteq S_n$ denote the alternating and the symmetric groups on $1,...,n$. MacMahaon's theorem, about the equi-distribution of the length and the major indices in $S_n$, has received far reaching refinements and generalizations,…

Combinatorics · Mathematics 2007-05-23 Amitai Regev , Yuval Roichman

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…

Combinatorics · Mathematics 2024-01-09 Shi-Mei Ma , Hao Qi , Jean Yeh , Yeong-Nan Yeh

It is known that Euler numbers, defined as the Taylor coefficients of the tangent and secant functions, count alternating permutations in the symmetric group. Springer defined a generalization of these numbers for each finite Coxeter group…

Combinatorics · Mathematics 2018-01-09 Matthieu Josuat-Vergès

We determine the scaling limit for permutations conditioned to have longest decreasing subsequence of length at most $d$. These permutations are also said to avoid the pattern $(d+1)d \cdots 2 1$ and they can be written as a union of $d$…

Probability · Mathematics 2023-01-09 Christopher Hoffman , Douglas Rizzolo , Erik Slivken

Chen proposed a conjecture on the log-concavity of the generating function for the symmetric group with respect to the length of longest increasing subsequences of permutations. Motivated by Chen's log-concavity conjecture, B\'{o}na,…

Combinatorics · Mathematics 2017-03-21 Alice L. L. Gao , Matthew H. Y. Xie , Arthur L. B. Yang

Defant and Zheng introduced a consecutive-pattern-avoiding stack sort map $SC_{\sigma}$, where the stack must avoid a consecutive pattern $\sigma$. Seidel and Sun disproved a conjecture in Defant and Zheng's paper about the maximum…

Combinatorics · Mathematics 2026-04-22 Kai Yi

We present exponential generating function analogues to two classical identities involving the ordinary generating function of the complete homogeneous symmetric functions. After a suitable specialization the new identities reduce to…

Combinatorics · Mathematics 2017-12-01 Rafael S. González D'León

We establish a scaling limit result for the length $\operatorname{LIS}(\sigma_n)$ of the longest increasing subsequence of a permutation $\sigma_n$ of size $n$ sampled from the Brownian separable permuton $\boldsymbol{\mu}_p$ of parameter…

Probability · Mathematics 2025-06-25 Arka Adhikari , Jacopo Borga , Thomas Budzinski , William Da Silva , Delphin Sénizergues

The shifted Schur measure introduced by Tracy and Widom is a measure on the set of all strict partitions, which is defined by Schur $Q$-functions. The main aim of this paper is to calculate the correlation function of this measure, which is…

Combinatorics · Mathematics 2007-05-23 Sho Matsumoto

We prove an inequality, valid on any finitely generated group with a fixed finite symmetric generating set, involving the growth of successive balls, and the average length of an element in a ball. It generalizes recent improvements of the…

Group Theory · Mathematics 2022-11-08 Christophe Pittet , Bogdan Stankov

The objects of our interest are the so-called $A$-permutations, which are permutations whose cycle length lie in a fixed set $A$. They have been extensively studied with respect to the uniform or the Ewens measure. In this paper, we extend…

Probability · Mathematics 2013-02-26 Ashkan Nikeghbali , Julia Storm , Dirk Zeindler

In 2020, Bloom and Sagan defined subsets of the symmetric group $\mathfrak{S}_n$ called partial shuffles, and proved a formula for the Schur expansion of the pattern quasisymmetric function associated with a partial shuffle. In their proof,…

Combinatorics · Mathematics 2025-12-25 Michael Albert , Dominic Searles , Matthew Slattery-Holmes

We define a new statistic $\mathsf{sor}$ on the set of colored permutations $\mathsf{G}_{r,n}$ and prove that it has the same distribution as the length function. For the set of restricted colored permutations corresponding to the…

Combinatorics · Mathematics 2014-10-08 Sen-Peng Eu , Yuan-Hsun Lo , Tsai-Lien Wong