English
Related papers

Related papers: On two-sided gamma-positivity for simple permutati…

200 papers

We give a combinatorial proof that the product of a Schubert polynomial by a Schur polynomial is a nonnegative sum of Schubert polynomials. Our proof uses Assaf's theory of dual equivalence to show that a quasisymmetric function of Bergeron…

Combinatorics · Mathematics 2014-05-13 Sami Assaf , Nantel Bergeron , Frank Sottile

Let $\gamma(t)=(P_1(t),\ldots,P_n(t))$ where $P_i$ is a real polynomial with zero constant term for each $1\leq i\leq n$. We will show the existence of the configuration $\{x,x+\gamma(t)\}$ in sets of positive density $\epsilon$ in…

Classical Analysis and ODEs · Mathematics 2024-10-14 Xuezhi Chen , Changxing Miao

Ulmer and Kaissl formulas for the deconvolution of one-dimensional Gaussian kernels are generalized to the three-dimensional case. The generalization is based on the use of the scalar version of the Grad's multivariate Hermite polynomials…

Data Analysis, Statistics and Probability · Physics 2019-09-24 Z. K. Silagadze

We consider quotients of the unit cube semigroup algebra by particular $\mathbb{Z}_r\wr S_n$-invariant ideals. Using Gr\"obner basis methods, we show that the resulting graded quotient algebra has a basis where each element is indexed by…

Combinatorics · Mathematics 2018-04-11 Benjamin Braun , McCabe Olsen

We extend Stanley's work on alternating permutations with extremal number of fixed points in two directions: first, alternating permutations are replaced by permutations with a prescribed descent set; second, instead of simply counting…

Combinatorics · Mathematics 2007-06-22 Guo-Niu Han , Guoce Xin

For any finite partially ordered set $P$, the $P$-Eulerian polynomial is the generating function for the descent number over the set of linear extensions of $P$, and is closely related to the order polynomial of $P$ arising in the theory of…

Combinatorics · Mathematics 2024-09-11 T. Kyle Petersen , Yan Zhuang

We show that an apparently overlooked result of Euler from \cite{E421} is essentially equivalent to the general multiplication formula for the $\Gamma$-function that was proven by Gauss in \cite{Ga28}.

History and Overview · Mathematics 2019-01-14 Alexander Aycock

We generalize the polynomial Szemer\'{e}di theorem to intersective polynomials over the ring of integers of an algebraic number field, by which we mean polynomials having a common root modulo every ideal. This leads to the existence of new…

Dynamical Systems · Mathematics 2014-09-29 Vitaly Bergelson , Donald Robertson

We prove that every sufficiently long simple permutation contains two long almost disjoint simple subsequences. This result has applications to the enumeration of restricted permutations. For example, it immediately implies a result of Bona…

Combinatorics · Mathematics 2007-05-23 Robert Brignall , Sophie Huczynska , Vince Vatter

Using a result of Gessel and Reutenauer, we find a simple formula for the number of cyclic permutations with a given descent set, by expressing it in terms of ordinary descent numbers (i.e., those counting all permutations with a given…

Combinatorics · Mathematics 2019-07-16 Sergi Elizalde , Justin M. Troyka

In 1982, Tamaki Yano proposed a conjecture predicting the set of b-exponents of an irreducible plane curve singularity germ which is generic in its equisingularity class. In \cite{ACLM-Yano2} we proved the conjecture for the case in which…

Algebraic Geometry · Mathematics 2016-11-04 E. Artal Bartolo , Pi. Cassou-Noguès , I. Luengo , A. Melle-Hernández

Godsil observed the simple fact that the multiplicity of 0 as a root of the matching polynomial of a graph coincides with the classical notion of deficiency. From this fact he asked to what extent classical results in matching theory…

Combinatorics · Mathematics 2008-07-01 Cheng Yeaw Ku , William Chen

The $(q,r)$-Eulerian polynomials are the $(\maj-$$\exc,\fix,\exc)$ enumerative polynomials of permutations. Using Shareshian and Wachs' exponential generating function of these Eulerian polynomials, Chung and Graham proved two symmetrical…

Combinatorics · Mathematics 2013-03-12 Zhicong Lin

In 1995, the first author introduced a multivariate generating function {$G$} that tracks the distribution of ascents and descents in labeled binary trees. In addition to proving that $G$ is symmetric, he conjectured that $G$ is Schur…

Combinatorics · Mathematics 2019-09-30 Ira M. Gessel , Sean T. Griffin , Vasu Tewari

The notion of a Galvin orientation of a line graph is introduced, generalizing the idea used by Galvin in his landmark proof of the list-edge-colouring conjecture for bipartite graphs. If L(G) has a proper Galvin orientation with respect to…

Combinatorics · Mathematics 2015-08-11 Jessica McDonald

It was shown by E. Gluskin and V.D. Milman in [GAFA Lecture Notes in Math. 1807, 2003] that the classical arithmetic-geometric mean inequality can be reversed (up to a multiplicative constant) with high probability, when applied to…

Classical Analysis and ODEs · Mathematics 2018-10-16 Zakhar Kabluchko , Joscha Prochno , Vladislav Vysotsky

The aim of the inverse Galois problem is to find extensions of a given field whose Galois group is isomorphic to a given group. In this article, we are interested in subgroups of GL(2,Z/nZ) where n is an integer. We know that, in general,…

Number Theory · Mathematics 2023-10-11 Zoé Yvon

In two recent articles we have examined a generalization of the binomial distribution associated with a sequence of positive numbers, involving asymmetric expressions of probabilities that break the symmetry {\it win-loss}. We present in…

Mathematical Physics · Physics 2015-06-17 H. Bergeron , E. M. F. Curado , J. P. Gazeau , Ligia M. C. S. Rodrigues

We prove a conjecture of Haglund which can be seen as an extension of the equidistribution of the inversion number and the major index over permutations to ordered set partitions. Haglund's conjecture implicitly defines two statistics on…

Combinatorics · Mathematics 2014-09-04 Jeffrey B. Remmel , Andrew Timothy Wilson

We introduce the binomial-Stirling-Eulerian polynomials, denoted $\tilde{A}_n(x,y|{\alpha})$, which encompass binomial coefficients, Eulerian numbers and two Stirling statistics: the left-to-right minima and the right-to-left minima. When…

Combinatorics · Mathematics 2023-10-24 Kathy Q. Ji , Zhicong Lin