English
Related papers

Related papers: Circular Peaks and Hilbert Series

200 papers

Let $A$ be a set of natural numbers and let $S_{n,A}$ be the set of all permutations of $[n]=\{1,2,...,n\}$ with cycle lengths belonging to $A$. For $A(n)=A\cap [n]$, the limit $\rho=\lim_{n\to\infty}\mid A(n)\mid/n$ (if it esists) is…

Combinatorics · Mathematics 2021-10-05 Ljuben Mutafchiev

Let $\Psi$ be the projectivization (i.e., the set of one-dimensional vector subspaces) of a vector space of dimension $\ge 3$ over a field. Let $H$ be a closed (in the pointwise convergence topology) subgroup of the permutation group…

Group Theory · Mathematics 2017-03-07 Fedor Bogomolov , Marat Rovinsky

A base of a permutation group (X,G) is a subset B of X such that its pointwise stabilizer is the trivial group. A list (x1,x2, ... ,xk) of elements of X is irredundant if each element is not in the pointwise stabilizer of its predecessors.…

Group Theory · Mathematics 2026-02-17 Stuart Margolis , John Rhodes

A family $\mathcal{G}$ of sets is a(n induced) copy of a poset $P=(P,\leqslant)$ if there exists a bijection $b:P\rightarrow \mathcal{G}$ such that $p\leqslant q$ holds if and only if $b(p)\subseteq b(q)$. The induced saturation number…

Combinatorics · Mathematics 2025-11-04 Shengjin Ji , Balázs Patkós , Erfei Yue

Denote the alternating and symmetric groups of degree $n$ by $A_n$ and $S_n$ respectively. Consider a permutation $\sigma\in S_n$ all of whose nontrivial cycles are of the same length. We find the minimal polynomials of $\sigma$ in the…

Group Theory · Mathematics 2020-05-05 Nanying Yang , Alexey Staroletov

A permutation array $A$ is a set of permutations on a finite set $\Omega$, say of size $n$. Given distinct permutations $\pi, \sigma\in \Omega$, we let $hd(\pi, \sigma) = |\{ x\in \Omega: \pi(x) \ne \sigma(x) \}|$, called the Hamming…

Combinatorics · Mathematics 2018-09-12 Sergey Bereg , Zevi Miller , Luis Gerardo Mojica , Linda Morales , I. H. Sudborough

We study new statistics on permutations that are variations on the descent and the inversion statistics. In particular, we consider the alternating descent set of a permutation sigma = sigma_1sigma_2...sigma_n defined as the set of indices…

Combinatorics · Mathematics 2008-04-14 Denis Chebikin

We consider the action of the symmetric group $S_n$ on the permutahedron $\Pi_n$. We prove that if $\sigma$ is a permutation of $S_n$ which has $m$ cycles of lengths $l_1, \ldots, l_m$, then the subpolytope of $\Pi_n$ fixed by $\sigma$ has…

Combinatorics · Mathematics 2019-11-27 Federico Ardila , Anna Schindler , Andrés R. Vindas-Meléndez

A set $P = H \cup \{w\}$ of $n+1$ points in general position in the plane is called a wheel set if all points but $w$ are extreme. We show that for the purpose of counting crossing-free geometric graphs on such a set $P$, it suffices to…

Computational Geometry · Computer Science 2019-09-02 Alexander Pilz , Emo Welzl , Manuel Wettstein

We investigate the descriptional complexity of operations on semilinear sets. Roughly speaking, a semilinear set is the finite union of linear sets, which are built by constant and period vectors. The interesting parameters of a semilinear…

Formal Languages and Automata Theory · Computer Science 2017-08-23 Simon Beier , Markus Holzer , Martin Kutrib

Let $p$ be an odd prime and let $n$ be a natural number. In this article we determine the irreducible constituents of the permutation module induced by the action of the symmetric group $\mathfrak{S}_n$ on the cosets of a Sylow $p$-subgroup…

Representation Theory · Mathematics 2017-12-08 Eugenio Giannelli , Stacey Law

A sequence $\pi_1,\pi_2,\dots$ of permutations is said to be "quasirandom" if the induced density of every permutation $\sigma$ in $\pi_n$ converges to $1/|\sigma|!$ as $n\to\infty$. We prove that $\pi_1,\pi_2,\dots$ is quasirandom if and…

Combinatorics · Mathematics 2024-10-07 Gabriel Crudele , Peter Dukes , Jonathan A. Noel

Let $\pi$ be a cycle permutation that can be expressed as one-line $\pi = \pi_1\pi_2 \cdot\cdot\cdot \pi_n$ and a cycle form $\pi = (c_1,c_2, ..., c_n)$. Archer et al. introduced the notion of pattern avoidance of one-line and all cycle…

Combinatorics · Mathematics 2024-09-27 Junyao Pan

Let $G$ be a permutation group on a set $\Omega$ of size $t$. We say that $\Lambda\subseteq\Omega$ is an independent set if its pointwise stabilizer is not equal to the pointwise stabilizer of any proper subset of $\Lambda$. We define the…

Group Theory · Mathematics 2021-03-26 Nick Gill , Bianca Lodá , Pablo Spiga

We show the existence of a unital subalgebra of the symmetric group algebra linearly spanned by sums of permutations with a common peak set, which we call the peak algebra. We show that this algebra is the image of the descent algebra of…

Combinatorics · Mathematics 2016-11-08 Marcelo Aguiar , Nantel Bergeron , Kathryn Nyman

Let $A$ be a set of natural numbers and let $S_{n,A}$ be the set of all permutations of $[n]=\{1,2,...,n\}$ with cycle lengths belonging to $A$. Furthermore, let $\mid A(n)\mid$ denote the cardinality of the set $A(n)=A\cap [n]$. The limit…

Combinatorics · Mathematics 2022-06-28 Ljuben Mutafchiev

A permutation $\pi$ of a multiset is said to be a {\em quasi-Stirling } permutation if there does not exist four indices $i<j<k<\ell$ such that $\pi_i=\pi_k$ and $\pi_j=\pi_{\ell}$. Define $$ \overline{Q}_{\mathcal{M}}(t,u,v)=\sum_{\pi\in…

Combinatorics · Mathematics 2021-06-09 Sherry H. F. Yan , Lihong Yang , Yunwei Huang , Xue Zhu

We consider convergence sets of formal power series of the form $f(z,t)=\sum_{n=0}^{\infty} f_n(z)t^n$, where $f_n(z)$ are holomorphic functions on a domain $\Omega$ in $\mathbb{C}$. A subset $E$ of $\Omega$ is said to be a convergence set…

Complex Variables · Mathematics 2017-07-14 Basma Al-Shutnawi , Hua Liu , Daowei Ma

Assuming Stanley's $P$-partition conjecture holds, the regular Schur labeled skew shape posets with underlying set $\{1,2,\ldots, n\}$ are precisely the posets $P$ such that the $P$-partition generating function is symmetric and the set of…

Representation Theory · Mathematics 2025-01-22 Young-Hun Kim , So-Yeon Lee , Young-Tak Oh

Let G be a group of permutations of a denumerable set E. The profile of G is the function phi which counts, for each n, the number phi(n) of orbits of G acting on the n-subsets of E. Counting functions arising this way, and their associated…

Combinatorics · Mathematics 2020-06-01 Justine Falque , Nicolas M. Thiéry