English
Related papers

Related papers: Cyclic sieving on noncrossing (1,2)-configurations

200 papers

We investigate the divisibility properties of \sigma(C_n), the sum-of-divisors function applied to Catalan numbers, in relation to other number-theoretic functions. We establish conditions under which C_n has prime factors of the form 6k-1,…

Combinatorics · Mathematics 2025-02-10 Volkan Yildiz

Recently, Armon and Swanson introduced signed standard tableaux and a corresponding super major index that refines the classical major index. In this paper, we prove that signed standard tableaux of rectangular shape exhibit a cyclic…

Combinatorics · Mathematics 2026-03-18 Stephan Pfannerer

Denote by $G$ a finite group and by $\psi(G)$ the sum of element orders in $G$. If $t$ is a positive integer, denote by $C_t$ the cyclic group of order $t$ and write $\psi(t)=\psi(C_t)$. In this paper we proved the following Theorem A: Let…

Group Theory · Mathematics 2019-05-30 Marcel Herzog , Patrizia Longobardi , Mercede Maj

Let $\hat{A}_n$ be the completion by the degree of a differential operator of the $n$-th Weyl algebra with generators $x_1,\ldots,x_n,\partial^1,\ldots,\partial^n$. Consider $n$ elements $X_1,\ldots,X_n$ in $\hat{A}_n$ of the form $$ X_i =…

Quantum Algebra · Mathematics 2020-06-05 Zoran Škoda

A non-crossing pairing on a bitstring matches 1s and 0s in a manner such that the pairing diagram is nonintersecting. By considering such pairings on arbitrary bitstrings $1^{n_1} 0^{m_1} ... 1^{n_r} 0^{m_r}$, we generalize classical…

Combinatorics · Mathematics 2009-06-17 Todd Kemp , Karl Mahlburg , Amarpreet Rattan , Clifford Smyth

In this paper, we extend to a non-consecutive case, the study of the pattern matching condition on the wreath product of the cyclic group and the symmetric group initiated by the authors in a previous paper. The main focus of our paper is…

Combinatorics · Mathematics 2009-10-19 Sergey Kitaev , Jeffrey Remmel , Manda Riehl

We introduce a new statistic, skip, on rational $(3,n)$-Dyck paths and define a marked rank word for each path when $n$ is not a multiple of 3. If a triple of valid statistics (area,skip,dinv) are given, we have an algorithm to construct…

Combinatorics · Mathematics 2015-10-14 Ryan Kaliszewski , Huilan Li

A subspace $U$ of $\mathbb{F}_q^n$ is called \textit{cyclically covering} if the whole space $\mathbb{F}_q^n$ is the union of the cyclic shifts of $U$. The case $\mathbb{F}_q^n$ itself is the only covering subspace, is of particular…

Number Theory · Mathematics 2026-01-01 Shuang Li , Pingzhi Yuan

We show how the set of Dyck paths of length 2n naturally gives rise to a matroid, which we call the "Catalan matroid" C_n. We describe this matroid in detail; among several other results, we show that C_n is self-dual, it is representable…

Combinatorics · Mathematics 2007-05-23 Federico Ardila

We call $n$ a cyclic number if every group of order $n$ is cyclic. It is implicit in work of Dickson, and explicit in work of Szele, that $n$ is cyclic precisely when $\gcd(n,\phi(n))=1$. With $C(x)$ denoting the count of cyclic $n\le x$,…

Number Theory · Mathematics 2020-07-28 Paul Pollack

We characterize the algebraic structure of semi-direct product of cyclic groups, $\Z_{N}\rtimes\Z_{p}$, where $p$ is an odd prime number which does not divide $q-1$ for any prime factor $q$ of $N$, and provide a polynomial-time quantum…

Quantum Physics · Physics 2013-07-05 Jeong San Kim , Eunok Bae , Soojoon Lee

In this paper, we study the distribution of the number of occurrences of the simplest frame pattern, called the $\mu$ pattern, in $n$-cycles. Given an $n$-cycle $C$, we say that a pair $\langle i,j \rangle$ matches the $\mu$ pattern if $i <…

Combinatorics · Mathematics 2013-11-15 Miles Jones , Sergey Kitaev , Jeffrey Remmel

Let $\Theta_n = (\theta_1, \dots, \theta_n)$ and $\Xi_n = (\xi_1, \dots, \xi_n)$ be two lists of $n$ variables and consider the diagonal action of $\mathfrak{S}_n$ on the exterior algebra $\wedge \{ \Theta_n, \Xi_n \}$ generated by these…

Combinatorics · Mathematics 2022-04-14 Jesse Kim

Recent work by Huang, Lewis, Morales, Reiner, and Stanton suggests that the regular elliptic elements of $\mathrm{GL}_n \mathbb{F}_q$ are somehow analogous to the $n$-cycles of the symmetric group. In 1981, Stanley enumerated the…

Combinatorics · Mathematics 2020-01-30 Graham Gordon

A subset of $[n] = \{1,2,\ldots,n\}$ is called stable if it forms an independent set in the cycle on the vertex set $[n]$. In 1978, Schrijver proved via a topological argument that for all integers $n$ and $k$ with $n \geq 2k$, the family…

Data Structures and Algorithms · Computer Science 2023-07-04 Ishay Haviv

We resolve affirmatively some conjectures of Reiner, Stanton, and White \cite{ReinerComm} regarding enumeration of transportation matrices which are invariant under certain cyclic row and column rotations. Our results are phrased in terms…

Combinatorics · Mathematics 2010-05-17 Brendon Rhoades

Motivated by classical nontransitivity paradoxes, we call an $n$-tuple $(x_1,\dots,x_n) \in[0,1]^n$ \textit{cyclic} if there exist independent random variables $U_1,\dots, U_n$ with $P(U_i=U_j)=0$ for $i\not=j$ such that…

Probability · Mathematics 2021-08-10 Pavle Vuksanovic , A. J. Hildebrand

Fix an integer $t \geq 2$ and a primitive $t^{\text{th}}$ root of unity $\omega$. We consider the specialized skew hook Schur polynomial $\text{hs}_{\lambda/\mu}(X,\omega X,\dots,\omega^{t-1}X/Y,\omega Y,\dots,\omega^{t-1}Y)$, where…

Combinatorics · Mathematics 2025-12-19 Nishu Kumari

The {\em Prym} of a cyclic covering of smooth projective curves is the ``new'' part of the Jacobian: the quotient of the Jacobian of the covering curve by the Jacobians of the intermediate covers. Given a family of such coverings, the…

Number Theory · Mathematics 2025-12-23 Eric M. Rains

We define a new family of noncommutative generalizations of cluster algebras called polygonal cluster algebras. These algebras generalize the noncommutative surfaces of Berenstein-Retakh, and are inspired by the emerging theory of…

Representation Theory · Mathematics 2024-10-14 Zachary Greenberg , Dani Kaufman , Merik Niemeyer , Anna Wienhard