English
Related papers

Related papers: Shape and pattern containment of separable permuta…

200 papers

This paper investigates type isomorphism in a lambda-calculus with intersection and union types. It is known that in lambda-calculus, the isomorphism between two types is realised by a pair of terms inverse one each other. Notably,…

Logic in Computer Science · Computer Science 2015-08-12 Mario Coppo , Mariangiola Dezani-Ciancaglini , Ines Margaria , Maddalena Zacchi

It is shown that the maximum number of patterns that can occur in a permutation of length $n$ is asymptotically $2^n$. This significantly improves a previous result of Coleman.

Combinatorics · Mathematics 2012-02-14 M. H. Albert , Micah Coleman , Ryan Flynn , Imre Leader

We investigate pattern avoidance in alternating permutations and generalizations thereof. First, we study pattern avoidance in an alternating analogue of Young diagrams. In particular, we extend Babson-West's notion of shape-Wilf…

Combinatorics · Mathematics 2014-10-21 Nihal Gowravaram , Ravi Jagadeesan

An ordered set partition of $\{1,2,\ldots,n\}$ is a partition with an ordering on the parts. Let $\mathcal{OP}_{n,k}$ be the set of ordered set partitions of $[n]$ with $k$ blocks. Godbole, Goyt, Herdan and Pudwell defined…

Combinatorics · Mathematics 2018-12-18 Dun Qiu , Jeffrey Remmel

We prove that the number of permutations which avoid 132-patterns and have exactly one 123-pattern equals (n-2)2^(n-3). We then give a bijection onto the set of permutations which avoid 123-patterns and have exactly one 132-pattern.…

Combinatorics · Mathematics 2007-05-23 Aaron Robertson

This paper establishes an analogue of the Robinson--Schensted correspondence for cylindric tableaux. In particular, for any pair of positive integers $(d,L)$, we construct a bijection between permutations that avoid the patterns $d\cdots 1…

Combinatorics · Mathematics 2026-03-17 Alexander Dobner

For the vanishing deformation parameter $\lambda$, the full structure of the (anti)commutator relations in the ${\cal N}=4$ supersymmetric linear $W_{\infty}[\lambda=0]$ algebra is obtained for arbitrary weights $h_1$ and $h_2$ of the…

High Energy Physics - Theory · Physics 2023-08-02 Changhyun Ahn

We show that any smooth permutation $\sigma\in S_n$ is characterized by the set ${\mathbf{C}}(\sigma)$ of transpositions and $3$-cycles in the Bruhat interval $(S_n)_{\leq\sigma}$, and that $\sigma$ is the product (in a certain order) of…

Combinatorics · Mathematics 2021-07-21 Shoni Gilboa , Erez Lapid

The simple permutations in two permutation classes --- the 321-avoiding permutations and the skew-merged permutations --- are enumerated using a uniform method. In both cases, these enumerations were known implicitly, by working backwards…

Combinatorics · Mathematics 2013-01-15 Michael H. Albert , Vincent Vatter

A {\em square} is a word of the form $uu$. In this paper we prove that for a given finite word $w$, the number of distinct square factors of $w$ is bounded by $|w|-|\Alphabet(w)|+1$, where $|w|$ denotes the length of $w$ and…

Combinatorics · Mathematics 2022-04-27 Srečko Brlek , Shuo Li

We examine words w satisfying the following property: if x is a subword of w and |x| is at least k for some fixed k, then the reversal of x is not a subword of w.

Combinatorics · Mathematics 2007-05-23 Narad Rampersad , Jeffrey Shallit

We consider avoidance of permutation patterns with designated gap sizes between pairs of consecutive letters. We call the patterns having such constraints distant patterns (DPs) and we show their relation to other pattern notions…

Combinatorics · Mathematics 2021-05-24 Stoyan Dimitrov

We study scaling limits of random permutations ("permutons") constrained by having fixed densities of a finite number of patterns. We show that the limit shapes are determined by maximizing entropy over permutons with those constraints. In…

Combinatorics · Mathematics 2015-09-01 Richard Kenyon , Daniel Kral , Charles Radin , Peter Winkler

A square-free word $w$ over a fixed alphabet $\Sigma$ is extremal if every word obtained from $w$ by inserting a single letter from $\Sigma$ (at any position) contains a square. Grytczuk et al. recently introduced the concept of extremal…

Combinatorics · Mathematics 2020-02-03 Lucas Mol , Narad Rampersad

We establish a bijection from the set of all permutations (of a given length) that avoid a pattern $q$ and a context-sensitive language.

Combinatorics · Mathematics 2007-05-23 Murray Elder

Let $f_W(n)$ be the number of different factors of length $n$ appearing in $W$. A classical result of Morse and Hedlund, stated in 1938, asserts that an infinite word $W$ is ultimately periodic if and only if $f_W(n)\leq n$ for some $n\in…

Rings and Algebras · Mathematics 2026-05-04 M. A. Khrystik

Given permutations $\pi \in S_n$ and $\sigma \in S_k$, let $N_\sigma(\pi)$ denote the number of occurrences of $\sigma$ in $\pi$. While pattern avoidance and the distribution of pattern occurrences in permutations have been extensively…

Combinatorics · Mathematics 2023-10-31 Jonas Iskander

A locally uniform random permutation is generated by sampling $n$ points independently from some absolutely continuous distribution $\rho$ on the plane and interpreting them as a permutation by the rule that $i$ maps to $j$ if the $i$th…

Probability · Mathematics 2023-03-07 Jonas Sjöstrand

Let $\mu$ be the geometric realization on $[0,1]$ of a Gibbs measure on $\Sigma=\{0,1\}^{\mathbb{N}}$ associated with a H\"older potential. The thermodynamic and multifractal properties of $\mu$ are well known to be linked via the…

Mathematical Physics · Physics 2015-12-15 Julien Barral , Stéphane Seuret

We derive expressions for the critical density for jamming in a hyper-rhomboid system of arbitrary shape in any dimension for the Kob-Andersen and Fredrickson-Andersen kinetically-constrained models. We find that changing the system's shape…

Statistical Mechanics · Physics 2014-05-02 Eial Teomy , Yair Shokef