Related papers: On cyclic descents for tableaux
The study of pattern containment and avoidance for linear permutations is a well-established area of enumerative combinatorics. A cyclic permutation is the set of all rotations of a linear permutation. Callan initiated the study of…
For a finite subset $I$ of positive integers, the descent polynomial $\mathcal{D}(I;n)$ counts the number of permutations in $S_n$ that have descent set $I$. We generalize descent polynomials by considering permutations with a specific…
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…
We prove that the cycle-valued logarithmic Gromov--Witten theory of a product of simple normal crossings pairs $X\times Y$ decomposes into a product of pieces coming from $X$ and $Y$, provided that the decomposition is considered over a…
We generalize permutative representations of the Cuntz algebras for the \cka\ $\coa$ for any $A$. We characterize cyclic permutative representations by notions of cycle and chain, and show their existence and uniqueness. We show necessary…
The Grassmannian admits an action by a finite cyclic group via the cyclic shift map. We give a simple description of the points fixed by each element of this cyclic group, extending Karp's description of the points fixed by the cyclic shift…
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…
We establish bijections between three classes of combinatorial objects that have been studied in very different contexts: lattice walks in simplicial regions as introduced by Mortimer--Prellberg, standard cylindric tableaux as introduced by…
Following the lead of Stanley and Gessel, we consider a morphism which associates to an acyclic directed graph (or a poset) a quasi-symmetric function. The latter is naturally defined as multivariate generating series of non-decreasing…
First and second fundamental theorems are given for polynomial invariants of a class of pseudo-reflection groups (including the Weyl groups of type $B_n$), under the assumption that the order of the group is invertible in the base field.…
A tableau inversion is a pair of entries from the same column of a row-standard tableau that lack the relative ordering necessary to make the tableau column-standard. An $i$-inverted Young tableau is a row-standard tableau with precisely…
We examine doing probabilistic descent over manifolds implicitly defined by a set of polynomials with rational coefficients. The system of polynomials is assumed to be triangularized. An application of Whitney's embedding theorem allows us…
The Leibniz rule for derivations is invariant under cyclic permutations of co-multiples within the arguments of derivations. We explore the implications of this principle: in effect, we construct a class of noncommutative bundles in which…
We generalize the cohomology theory for linear cycle sets introduced by Lebed and Vendramin. Our cohomology classifies extensions of linear cycle sets by trivial ideals, whereas the cohomology of Lebed and Vendramin only deals with central…
We provide an algorithmic framework for the computation of explicit representing matrices for all irreducible representations of a generalized symmetric group $\Grin_n$, i.e., a wreath product of cyclic group of order $r$ with the symmetric…
This paper introduces an analogue of the Solomon descent algebra for the complex reflection groups of type $G(r,1,n)$. As with the Solomon descent algebra, our algebra has a basis given by sums of `distinguished' coset representatives for…
We give a new cyclic sieving phenomenon for semistandard Young tableaux $SSYT(\lambda,\mu)$ of shape $\lambda=(m,n^b)$ and content $\mu$, a $(b+2)$-tuple. We prove that $(SSYT(\lambda,\mu),\langle \partial^{b+2} \rangle, f(q))$ exhibits the…
This paper presents a solution of the polycirculant conjecture which states that every vertex-transitive graph G has an automorphism that permutes the vertices in cycles of the same length. This is done by identifying vertex-transitive…
A differential version of the classical Weil descent is established in all characteristics. It yields a theory of differential restriction of scalars for differential varieties over finite differential field extensions. This theory is then…
We introduce a class of cycles, called nondegenerate, strictly decomposable cycles, and show that the image of each cycle in this class under the refined cycle map to an extension group in the derived category of arithmetic mixed Hodge…