相关论文: Cyclic sieving on permutations -- an analysis of m…
In this paper, we perform a systematic study of permutation statistics and bijective maps on permutations in which we identify and prove 122 instances of the homomesy phenomenon. Homomesy occurs when the average value of a statistic is the…
We study cyclic sieving phenomena (CSP) on combinatorial objects from an abstract point of view by considering a rational polyhedral cone determined by the linear equations that define such phenomena. Each lattice point in the cone…
We will exhibit several instances of the cyclic sieving phenomenon involving statistics and involutions on the following combinatorial families of objects: permutations, set partitions, perfect matchings, D-permutations (and its…
Reiner-Stanton-White defined the cyclic sieving phenomenon (CSP) associated to a finite cyclic group action and a polynomial. A key example arises from the length generating function for minimal length coset representatives of a parabolic…
We introduce consecutive-pattern-avoiding stack-sorting maps $\text{SC}_\sigma$, which are natural generalizations of West's stack-sorting map $s$ and natural analogues of the classical-pattern-avoiding stack-sorting maps $s_\sigma$…
The cyclic sieving phenomenon (CSP) provides valuable data about symmetry classes of cyclic actions, and has applications to representation theory. In this paper, we enumerate domino tableaux of shape 2-by-n, and use this result to prove a…
Verifying a suspicion of Propp and Reiner concerning the cyclic sieving phenomenon (CSP), M. Thiel introduced a Catalan object called noncrossing $(1,2)$-configurations (denoted by $X_n$), which is a class of set partitions of $[n-1]$. More…
We exhibit two instances of the cyclic sieving phenomenon - one on dissections of a polygon of a fixed type and one on triangulations of a once-punctured polygon. We use these results to give refined enumerations of certain families of…
Theorems relating permutations with objects in other fields of mathematics are often stated in terms of avoided patterns. Examples include various classes of Schubert varieties from algebraic geometry (Billey and Abe 2013), commuting…
We present an algorithm, called BiSC, that describes the patterns avoided by a given set of permutations. It automatically conjectures the statements of known theorems such as the descriptions of stack-sortable (Knuth 1975) and…
Homomesy is an invariance phenomenon in dynamical algebraic combinatorics which occurs when the average value of some statistic on a set of combinatorial objects is the same over each orbit generated by a map on these objects. In this paper…
This paper proposes convolutional filtering for data whose structure can be modeled by a simplicial complex (SC). SCs are mathematical tools that not only capture pairwise relationships as graphs but account also for higher-order network…
Dokos et. al. studied the distribution of two statistics over permutations $\mathfrak{S}_n$ of $\{1,2,\dots, n\}$ that avoid one or more length three patterns. A permutation $\sigma\in\mathfrak{S}_n$ contains a pattern…
We give a cyclic sieving phenomenon for symplectic $\lambda$-tableaux $SP(\lambda,2m)$, where $\lambda$ is a partition of an odd integer $n$ and $gcd(m,p)=1$ for any odd prime $p\leq n$. We use the crystal structure on Kashiwara-Nakashima…
We extend so-called slit-slide-sew bijections to constellations and quasiconstellations. We present an involution on the set of hypermaps given with an orientation, one distinguished corner, and one distinguished edge leading away from the…
In this paper, we present examples of the cyclic sieving phenomenon coming from studying independent sets in graphs of a fixed size k. Given a graph G, and a cyclic group C acting on the graph, then C also acts on the collection of…
When $\lambda$ is a partition, the specialized non-symmetric Macdonald polynomial $E_{\lambda}(x;q;0)$ is symmetric and related to a modified Hall--Littlewood polynomial. We show that whenever all parts of the integer partition $\lambda$ is…
An invariant descriptor captures meaningful structural features of networks, useful where traditional visualizations, like node-link views, face challenges like the hairball phenomenon (inscrutable overlap of points and lines). Designing…
Algorithms for resolving majority cycles in preference aggregation have been studied extensively in computational social choice. Several sophisticated cycle-resolving methods, including Tideman's Ranked Pairs, Schulze's Beat Path, and…
Consider a permutation p to be any finite list of distinct positive integers. A statistic is a function St whose domain is all permutations. Let S(p,q) be the set of shuffles of two disjoint permutations p and q. We say that St is shuffle…