English
Related papers

Related papers: The cyclic sieving phenomenon: a survey

200 papers

A cyclic order may be thought of informally as a way to seat people around a table, perhaps for a game of chance or for dinner. Given a set of agents such as $\{A,B,C\}$, we can formalize this by defining a cyclic order as a permutation or…

Computer Science and Game Theory · Computer Science 2024-07-23 Karl-Dieter Crisman , Abraham Holleran , Micah Martin , Josephine Noonan

A {\em cyclic graph} is a graph with at each vertex a cyclic order of the edges incident with it specified. We characterize which real-valued functions on the collection of cubic cyclic graphs are partition functions of a real vertex model…

Quantum Algebra · Mathematics 2016-08-02 Guus Regts , Alexander Schrijver , Bart Sevenster

We perform a systematic study of permutation statistics and bijective maps on permutations using SageMath to search the FindStat combinatorial statistics database to identify apparent instances of the cyclic sieving phenomenon (CSP). Cyclic…

We construct a (bi)cyclic sieving phenomenon on the union of dominant maximal weights for level $\ell$ highest weight modules over an affine Kac-Moody algebra with exactly one highest weight being taken for each equivalence class, in a way…

Representation Theory · Mathematics 2019-09-17 Young-Hun Kim , Se-jin Oh , Young-Tak Oh

Cyclotomic polynomials are basic objects in Number Theory. Their properties depend on the number of distinct primes that intervene in the factorization of their order, and the binary case is thus the first nontrivial case. This paper sees…

Number Theory · Mathematics 2024-11-07 Antonio Cafure , Eda Cesaratto

Interpretations for the q-binomial coefficient evaluated at -q are discussed. A (q,t)-version is established, including an instance of a cyclic sieving phenomenon involving unitary spaces.

Combinatorics · Mathematics 2011-08-25 Shishuo Fu , Victor Reiner , Dennis Stanton , Nathaniel Thiem

The cycle polynomial of a finite permutation group $G$ is the generating function for the number of elements of $G$ with a given number of cycles: \[F_G(x) = \sum_{g\in G}x^{c(g)},\] where $c(g)$ is the number of cycles of $g$ on $\Omega$.…

Combinatorics · Mathematics 2019-05-31 Peter J. Cameron , Jason Semeraro

In this note, we provide a short proof of Theorem 3.3 in the paper titled \emph{Crystals, semistandard tableaux and cyclic sieving phenomenon}, by Y.-T.~Oh and E.~Park, which concerns a cyclic sieving phenomenon on semi-standard Young…

Combinatorics · Mathematics 2023-10-04 Per Alexandersson

A monic polynomial $f(x)\in {\mathbb Z}[x]$ of degree $N$ is called monogenic if $f(x)$ is irreducible over ${\mathbb Q}$ and $\{1,\theta,\theta^2,\ldots ,\theta^{N-1}\}$ is a basis for the ring of integers of ${\mathbb Q}(\theta)$, where…

Number Theory · Mathematics 2025-03-19 Joshua Harrington , Lenny Jones

Given $n\times n$ symmetric matrices $A$ and $B$, Dines in 1941 proved that the joint range set $\{(x^TAx,x^TBx)|~x\in\mathbb{R}^n\}$ is always convex. Our paper is concerned with non-homogeneous extension of the Dines theorem for the range…

Optimization and Control · Mathematics 2025-03-04 Huu-Quang Nguyen , Ya-Chi Chu , Ruey-Lin Sheu

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…

Combinatorics · Mathematics 2023-10-04 Per Alexandersson , Joakim Uhlin

For each nonnegative integer $i$, let $a_i$ be the number of $i$-subsets of $V(G)$ that induce an acyclic subgraph of a given graph $G$. We define $A(G,x) = \sum_{i \geq 0} a_i x^i$ (the generating function for $a_i$) to be the acyclic…

Combinatorics · Mathematics 2022-02-07 Caroline Barton , Jason I. Brown , David A. Pike

We establish a new mixing theorem for quasirandom groups (finite groups with no low-dimensional unitary representations) $G$ which, informally speaking, asserts that if $g, x$ are drawn uniformly at random from $G$, then the quadruple…

Dynamical Systems · Mathematics 2013-08-05 Vitaly Bergelson , Terence Tao

Given an abelian variety $A$ defined over a finite field $k$, we say that $A$ is "cyclic" if its group $A(k)$ of rational points is cyclic. In this paper we give a bijection between cyclic abelian varieties of an ordinary isogeny class…

Algebraic Geometry · Mathematics 2020-01-30 Alejandro José Giangreco-Maidana

We conjecture that, if the quotient of two $q$-binomial coefficients with the same top argument is a polynomial, then it has non-negative coefficients. We summarise what is known about the conjecture and prove it in two non-trivial cases.…

Combinatorics · Mathematics 2026-01-05 Mona Gatzweiler , Christian Krattenthaler

An element of a Coxeter group $W$ is called fully commutative if any two of its reduced decompositions can be related by a series of transpositions of adjacent commuting generators. In the preprint "Fully commutative elements in finite and…

Combinatorics · Mathematics 2014-07-23 Frédéric Jouhet , Philippe Nadeau

Let a polynomial $f \in \mathbb{Z}[X_1,\ldots,X_n]$ be given. The square sieve can provide an upper bound for the number of integral $\mathbf{x} \in [-B,B]^n$ such that $f(\mathbf{x})$ is a perfect square. Recently this has been generalized…

Number Theory · Mathematics 2026-03-25 Dante Bonolis , Lillian B. Pierce

We consider the problem of characterizing all functions $f$ defined on the set of integers modulo $n$ with the property that an average of some $n$th roots of unity determined by $f$ is always an algebraic integer. Examples of such…

Number Theory · Mathematics 2016-10-25 Chatchawan Panraksa , Pornrat Ruengrot

The set of forks is a class of quivers introduced by M. Warkentin, where every connected mutation-infinite quiver is mutation equivalent to infinitely many forks. Let $Q$ be a fork with $n$ vertices, and $\boldsymbol{w}$ be a…

Combinatorics · Mathematics 2024-10-14 Tucker J. Ervin , Blake Jackson , Kyungyong Lee , Son Dang Nguyen

By the Chinese remainder theorem, the canonical map \[\Psi_n: R[X]/(X^n-1)\to \oplus_{d|n} R[X]/\Phi_d(X)\] is an isomorphism when $R$ is a field whose characteristic does not divide $n$ and $\Phi_d$ is the $d$th cyclotomic polynomial. When…

Number Theory · Mathematics 2015-12-11 Kamalakshya Mahatab , Kannappan Sampath