English
Related papers

Related papers: Consecutive and quasi-consecutive patterns: $\math…

200 papers

We investigate a generalization of stacks that we call $\mathcal{C}$-machines. We show how this viewpoint rapidly leads to functional equations for the classes of permutations that $\mathcal{C}$-machines generate, and how these systems of…

Combinatorics · Mathematics 2018-01-30 Michael H. Albert , Cheyne Homberger , Jay Pantone , Nathaniel Shar , Vincent Vatter

We recover Gessel's determinantal formula for the generating function of permutations with no ascending subsequence of length m+1. The starting point of our proof is the recursive construction of these permutations by insertion of the…

Combinatorics · Mathematics 2025-09-26 Mireille Bousquet-Mélou

We study sorting operators $\mathbf{A}$ on permutations that are obtained composing Knuth's stack sorting operator $\mathbf{S}$ and the reversal operator $\mathbf{R}$, as many times as desired. For any such operator $\mathbf{A}$, we provide…

Combinatorics · Mathematics 2014-02-11 Michael Albert , Mathilde Bouvel

The study of pattern avoidance in linear permutations has been an active area of research for almost half a century now, starting with the work of Knuth in 1973. More recently, the question of pattern avoidance in circular permutations has…

Combinatorics · Mathematics 2022-04-26 Krishna Menon , Anurag Singh

In this thesis, we consider the problem of characterizing and enumerating sets of polyominoes described in terms of some constraints, defined either by convexity or by pattern containment. We are interested in a well known subclass of…

Combinatorics · Mathematics 2014-05-14 Daniela Battaglino

Any permutation has a disjoint cycle decomposition and concept generates an equivalence class on the symmetry group called the cycle-type. The main focus of this work is on permutations of restricted cycle-types, with particular emphasis on…

Combinatorics · Mathematics 2014-06-11 Tewodros Amdeberhan , Victor H. Moll

We investigate the spectral statistics of chaotic quasi one dimensional systems such as long wires. To do so we represent the spectral correlation function $R(\epsilon)$ through derivatives of a generating function and semiclassically…

Chaotic Dynamics · Physics 2009-06-11 Petr Braun , Sebastian Müller , Fritz Haake

Recently Albert and Bousquet-M\'elou \cite{AB15} obtained the solution to the long-standing problem of the number of permutations sortable by two stacks in parallel (tsip). Their solution was expressed in terms of functional equations. We…

Combinatorics · Mathematics 2020-02-18 Andrew Elvey Price , Anthony J. Guttmann

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…

Combinatorics · Mathematics 2020-09-16 David G. L. Wang , T. Zhao

The theory of Wilson loops for gauge theories with unitary gauge groups is formulated in the language of symmetric functions. The main objects in this theory are two generating functions, which are related to each other by the involution…

High Energy Physics - Theory · Physics 2019-11-20 Wolfgang Mück

In this paper, we find an explicit formula for the generating function that counts the circular permutations of length n avoiding the pattern 23 4 1 whose enumeration was raised as an open problem by Rupert Li. This then completes in all…

Combinatorics · Mathematics 2021-11-09 Toufik Mansour , Mark Shattuck

We give some results about a bijection associating each permutation with a subexcedant function. This function is related to a particular decomposition of the permutation as a product of transpositions and therefore it has been called…

Combinatorics · Mathematics 2022-08-17 Fufa Beyene , Roberto Mantaci

A permutation is (1-23-4)-avoiding if it contains no four entries, increasing left to right, with the middle two adjacent in the permutation. Here we give a 2-variable recurrence for the number of such permutations, improving on the…

Combinatorics · Mathematics 2010-08-16 David Callan

A systematic study of avoidance of mesh patterns of length 2 was conducted by Hilmarsson et al., where 25 out of 65 non-equivalent cases were solved. In this paper, we give 27 distribution results for these patterns including 14…

Combinatorics · Mathematics 2019-06-03 Sergey Kitaev , Philip B. Zhang

A grid class consists of permutations whose pictorial depiction can be partitioned into increasing and decreasing parts as determined by a given matrix. In this paper, we introduce a method for enumerating cyclic permutations in vector grid…

Combinatorics · Mathematics 2018-08-27 Kassie Archer , L. -K. Lauderdale

In this work, we prove the existence of linear recurrences of order M with a non-trivial solution vanishing exactly on the set of gaps (or a subset) of a numerical semigroup S finitely generated by a1 < a2 <...< aN and M = aN. Keywords:…

Commutative Algebra · Mathematics 2013-11-01 Ivan Martino , Luca Martino

We present a new approach to the problem of enumerating permutations of length n that avoid a fixed consecutive pattern of length m. We use this idea to give explicit upper and lower bounds on the number of permutations avoiding a pattern…

Combinatorics · Mathematics 2012-08-29 Guillem Perarnau

Gravitationally collapsed objects are known to be biased tracers of an underlying density contrast. Using symmetry arguments, generalised biasing schemes have recently been developed to relate the halo density contrast $\delta_h$ with the…

Cosmology and Nongalactic Astrophysics · Physics 2018-02-14 Dipak Munshi

In a recent article a generalization of the binomial distribution associated with a sequence of positive numbers was examined. The analysis of the nonnegativeness of the formal expressions was a key-point to allow to give them a statistical…

Mathematical Physics · Physics 2015-06-04 H. Bergeron , E. M. F. Curado , J. P. Gazeau , Ligia M. C. S. Rodrigues

We give multiple proofs of two formulas concerning the enumeration of permutations avoiding a monotone consecutive pattern with a certain value for the inverse peak number or inverse left peak number statistic. The enumeration in both cases…

Combinatorics · Mathematics 2023-01-12 Justin M. Troyka , Yan Zhuang