中文
相关论文

相关论文: Statistics on the multi-colored permutation groups

200 篇论文

Let Sym_n denote the symmetric group of all permutations pi = a_1...a_n of {1,...,n}. An index i is a peak of pi if a_{i-1} < a_i > a_{i+1} and we let P(pi) be the set of peaks of pi. Given any set S of positive integers we define P(S;n) to…

组合数学 · 数学 2012-09-05 Sara Billey , Krzysztof Burdzy , Bruce Sagan

Using the theory of representations of the symmetric group, we propose an algorithm to compute the invariant ring of a permutation group. Our approach have the goal to reduce the amount of linear algebra computations and exploit a thinner…

组合数学 · 数学 2015-11-04 Nicolas Borie

Centrosymmetric involutions in the symmetric group S_{2n} are permutations \pi such that \pi=\pi^{-1} and \pi(i)+\pi(2n+1-i)=2n+1 for all i, and they are in bijection with involutions of the hyperoctahedral group. We describe the…

组合数学 · 数学 2015-09-01 Marilena Barnabei , Flavio Bonetti , Sergi Elizalde , Matteo Silimbani

Using a result of Gessel and Reutenauer, we find a simple formula for the number of cyclic permutations with a given descent set, by expressing it in terms of ordinary descent numbers (i.e., those counting all permutations with a given…

组合数学 · 数学 2019-07-16 Sergi Elizalde , Justin M. Troyka

We prove a formula for the asymptotic number of edge-colored regular graphs with a prescribed set of allowed vertex-incidence structures. The formula depends on specific critical points of a polynomial encoding the vertex-incidences. As an…

组合数学 · 数学 2026-01-28 Michael Borinsky , Chiara Meroni , Maximilian Wiesmann

We define a new family of generalized Stirling permutations that can be interpreted in terms of ordered trees and forests. We prove that the number of generalized Stirling permutations with a fixed number of ascents is given by a natural…

组合数学 · 数学 2021-05-11 J. Fernando Barbero G. , Jesús Salas , Eduardo J. S. Villaseñor

We define the \emph{occurrence graph} $G_p(\pi$) of a pattern $p$ in a permutation $\pi$ as the graph with the occurrences of $p$ in $\pi$ as vertices and edges between the vertices if the occurrences differ by exactly one element. We then…

组合数学 · 数学 2019-08-14 Bjarni Jens Kristinsson , Henning Ulfarsson

A ballot permutation is a permutation $\pi$ such that in any prefix of $\pi$ the descent number is not more than the ascent number. By using a reversal concatenation map, we give a formula for the joint distribution (pk, des) of the peak…

组合数学 · 数学 2020-09-16 David G. L. Wang , T. Zhao

We enumerate derangements with descents in prescribed positions. A generating function was given by Guo-Niu Han and Guoce Xin in 2007. We give a combinatorial proof of this result, and derive several explicit formulas. To this end, we…

组合数学 · 数学 2008-11-13 Niklas Eriksen , Ragnar Freij , Johan Wastlund

We examine the distribution and popularity of different parameters (such as the number of descents, runs, valleys, peaks, right-to-left minima, and more) on the sets of increasing and flattened permutations. For each parameter, we provide…

组合数学 · 数学 2024-10-22 Jean-Luc Baril , José L. Ramírez

A descent $k$ of a permutation $\pi=\pi_{1}\pi_{2}\dots\pi_{n}$ is called a big descent if $\pi_{k}>\pi_{k+1}+1$; denote the number of big descents of $\pi$ by $\operatorname{bdes}(\pi)$. We study the distribution of the…

组合数学 · 数学 2024-09-02 Sergi Elizalde , Johnny Rivera , Yan Zhuang

In this paper, we define a set which has a finite group action and is generated by a finite color set, a set which has a finite group action, and a subset of the set of non negative integers. we state its properties to apply one of solution…

组合数学 · 数学 2017-03-21 Tomoyuki Tamura

We study the mixing properties of permutations obtained as a product of two uniformly random permutations of fixed cycle types. For instance, we give an exact formula for the probability that elements $1,2,...,k$ are in distinct cycles of…

In this paper we use a probabilistic approach to derive the expressions for the characteristic functions of basic statistics defined on permutation tableaux. Since our expressions are exact, we can identify the distributions of basic…

组合数学 · 数学 2009-04-09 Pawel Hitczenko , Svante Janson

We obtain upper bounds on the composition length of a finite permutation group in terms of the degree and the number of orbits, and analogous bounds for primitive, quasiprimitive and semiprimitive groups. Similarly, we obtain upper bounds…

群论 · 数学 2018-03-15 S. P. Glasby , Cheryl E. Praeger , Kyle Rosa , Gabriel Verret

Visontai conjectured in 2013 that the joint distribution of ascent and distinct nonzero value numbers on the set of subexcedant sequences is the same as that of descent and inverse descent numbers on the set of permutations. This conjecture…

离散数学 · 计算机科学 2016-06-28 Jean-Luc Baril , Vincent Vajnovszki

We construct here the first known examples of non-split sharply 2-transitive groups of bounded exponent in odd positive characteristic for every large enough prime $p \equiv 3 \pmod{4}$. In fact, we show that there are countably many…

群论 · 数学 2025-09-17 Marco Amelio

As mathematical model for the evolutionary equations of species the masterequation is choiced. Two formulations will be demonstrated to include the changes of parameters into the masterequation - that is, on the one hand, the formation of a…

种群与进化 · 定量生物学 2007-05-23 Ingrid Hartmann

We construct two bijections of the symmetric group S_n onto itself that enable us to show that three new three-variable statistics are equidistributed with classical statistics involving the number of fixed points. The first one is…

组合数学 · 数学 2007-05-23 Dominique Foata , Guo-Niu Han

We define a deterministic family of permutations generated by an alternating center-edge extraction process on the ordered set [n] = {1,2,...,n}. Starting from the ordered list (1,2,...,n), one repeatedly removes the median element or…

综合数学 · 数学 2026-03-19 David Carr