相关论文: Cyclic sieving of noncrossing partitions for compl…

Let $a < b$ be coprime positive integers. Armstrong, Rhoades, and Williams defined a set $\mathsf{NC}(a,b)$ of `rational noncrossing partitions', which form a subset of the ordinary noncrossing partitions of $\{1, 2, \dots, b-1\}$.…

We define a notion of total acyclicity for complexes of flat quasi-coherent sheaves over a semi-separated noetherian scheme, generalising complete flat resolutions over a ring. By studying these complexes as objects of the pure derived…

A set partition is said to be $(k,d)$-noncrossing if it avoids the pattern $12... k12... d$. We find an explicit formula for the ordinary generating function of the number of $(k,d)$-noncrossing partitions of $\{1,2,...,n\}$ when $d=1,2$.

In this paper we prove instances of the cyclic sieving phenomenon for finite Grassmannians and partial flag varieties, which carry the action of various tori in the finite general linear group GL_n(F_q). The polynomials involved are sums of…

We prove the Complete nontrivial cycle-intersection theorem for systems of permutations.

We investigate the poset structure on the alternating group that arises when the latter is generated by 3-cycles. We study intervals in this poset and give several enumerative results, as well as a complete description of the orbits of the…

We show that the set R(w_0) of reduced expressions for the longest element in the hyperoctahedral group exhibits the cyclic sieving phenomenon. More specifically, R(w_0) possesses a natural cyclic action given by moving the first letter of…

In this paper, we introduce polynomial time algorithms that generate random 3-noncrossing partitions and 2-regular, 3-noncrossing partitions with uniform probability. A 3-noncrossing partition does not contain any three mutually crossing…

Prompted by a question of Jim Propp, this paper examines the cyclic sieving phenomenon (CSP) in certain cyclic codes. For example, it is shown that, among dual Hamming codes over $F_q$, the generating function for codedwords according to…

The cyclic sieving phenomenon of Reiner, Stanton, and White characterizes the stabilizers of cyclic group actions on finite sets using q-analogue polynomials. Eu and Fu demonstrated a cyclic sieving phenomenon on generalized cluster…

In this paper, we introduce polynomial time algorithms that generate random $k$-noncrossing partitions and 2-regular, $k$-noncrossing partitions with uniform probability. A $k$-noncrossing partition does not contain any $k$ mutually…

We introduce and study the model of simply generated non-crossing partitions, which are, roughly speaking, chosen at random according to a sequence of weights. This framework encompasses the particular case of uniform non-crossing…

We prove that the noncrossing partition lattices associated with the complex reflection groups $G(d,d,n)$ for $d,n\geq 2$ admit symmetric decompositions into Boolean subposets. As a result, these lattices have the strong Sperner property…

We construct highly singular projective curves and surfaces defined by invariants of primitive complex reflection groups.

The material gives a new combinatorial proof of the multiplicative property of the S-transform. In particular, several properties of the coefficients of its inverse are connected to non-crossing linked partitions and planar trees.

All crossed products of two cyclic groups are explicitly described using generators and relations. A necessary and sufficient condition for an extension of a group by a group to be a cyclic group is given.

We address the question of whether a reflecting stationary set may be partitioned into two or more reflecting stationary subsets, providing various affirmative answers in ZFC. As an application to singular cardinals combinatorics, we infer…

We give a group theoretic proof of the splitting of sharply 2-transitive groups of characteristic 3.

We study a two-species bidirectional exclusion process, and a single species variant, which is motivated by the motion of organelles and vesicles along microtubules. Specifically, we are interested in the clustering of the particles and…

We prove that, in both real and complex cases, there exists a pair of matrices that generates a dense subsemigroup of the set of $n\times n$ matrices.