Related papers: Actions on permutations and unimodality of descent…
A $k$-Stirling permutation of order $n$ is said to be "flattened" if the leading terms of its increasing runs are in ascending order. We show that flattened $k$-Stirling permutations of order $n+1$ are in bijection correspondence with a…
We discuss two surprising properties of a family of polynomials that generalize the Mahonian $q$-Catalan polynomials, and more generally the $q$-Schr\"oder polynomials. By interpreting them as $\mathfrak{sl}_2$-characters, we show that the…
In this paper, we first give formulas for the order polynomial $\Omega (\Pw; t)$ and the Eulerian polynomial $e(\Pw; \lambda)$ of a finite labeled poset $(P, \omega)$ using the adjacency matrix of what we call the $\omega$-graph of $(P,…
It is well known that descents and excedances are equidistributed in the symmetric group. We show that the descent and excedance enumerators, summed over permutations with a fixed first letter are identical when we perform a simple change…
Permutation polynomials over finite fields are fundamental objects as they are used in various theoretical and practical applications in cryptography, coding theory, combinatorial design, and related topics. This family of polynomials…
A precise tie between a univariate spline's knots and its zeros abundance and dissemination is formulated. As an application, a conjecture formulated by De Concini and Procesi is shown to be true in the special univariate, unimodular case.…
In this paper, we first present combinatorial proofs of a kind of expansions of the Eulerian polynomials of types A and B, and then we introduce Stirling permutations of the second kind. In particular, we count Stirling permutations of the…
We show that an arbitrary nilprogression can be approximated by a proper coset nilprogression in upper-triangular form. This can be thought of as a nilpotent version of the Freiman-Bilu result that a generalised arithmetic progression can…
Given an abstract simplicial complex G, the connection graph G' of G has as vertex set the faces of the complex and connects two if they intersect. If A is the adjacency matrix of that connection graph, we prove that the Fredholm…
A spline is an assignment of polynomials to the vertices of a graph, where the difference of two polynomials along an edge must belong to the ideal labeling that edge. We consider a ring of splines $\mathcal{M}_{H}$ constructed on a graph…
We prove that the polynomial invariants of a permutation group are Cohen-Macaulay for any choice of coefficient field if and only if the group is generated by transpositions, double transpositions, and 3-cycles. This unites and generalizes…
For given linear action of a finite group on a lattice and a positive integer q, we prove that the mod q permutation representation is a quasi-polynomial in q. Additionally, we establish several results that can be considered as mod…
We study the counts of smooth permutations and smooth polynomials over finite fields. For both counts we prove an estimate with an error term that matches the error term found in the integer setting by de Bruijn more than 70 years ago. The…
Arc permutations and unimodal permutations were introduced in the study of triangulations and characters. This paper studies combinatorial properties and structures on these permutations. First, both sets are characterized by pattern…
One of the most central result in combinatorics says that the descent statistic and the excedance statistic are equidistribued over the symmetric group. As a continuation of the work of Shareshian-Wachs (Adv. Math., 225(6) (2010),…
It is known that, when $n$ is even, the number of permutations of $\{1,2,\dots,n\}$ all of whose cycles have odd length equals the number of those all of whose cycles have even length. Adin, Heged\H{u}s and Roichman recently found a…
Weights of permutations were originally introduced by Dugan, Glennon, Gunnells, and Steingr\'imsson (Journal of Combinatorial Theory, Series A 164:24-49, 2019) in their study of the combinatorics of tiered trees. Given a permutation…
Permutation polynomials with coefficients 1 over finite fields attract researchers' interests due to their simple algebraic form. In this paper, we first construct four classes of fractional permutation polynomials over the cyclic subgroup…
We show that polar actions of cohomogeneity two on simple compact Lie groups of higher rank, endowed with a biinvariant Riemannian metric, are hyperpolar. Combining this with a recent result of the second-named author, we are able to prove…
Wang and Yeh proved that if $P(x)$ is a polynomial with nonnegative and nondecreasing coefficients, then $P(x+d)$ is unimodal for any $d>0$. A mode of a unimodal polynomial $f(x)=a_0+a_1x+\cdots + a_mx^m$ is an index $k$ such that $a_k$ is…