English
Related papers

Related papers: Wilf equivalences between vincular patterns in inv…

200 papers

Consider two inverse problems for Sturm-Liouville problems on the unit interval. It means that there are two corresponding mappings $F, f$ from a Hilbert space of potentials $H$ into their spectral data. They are called isomorphic if $F$ is…

Mathematical Physics · Physics 2023-01-13 Evgeny Korotyaev

Building off recent work of Garg and Peng, we continue the investigation into classical and consecutive pattern avoidance in rooted forests. We prove a forest analogue of the Stanley-Wilf conjecture for avoiding a single pattern as well as…

Combinatorics · Mathematics 2023-10-05 Michael Ren

We introduce "fertility Wilf equivalence," "strong fertility Wilf equivalence," and "postorder Wilf equivalence," three variants of Wilf equivalence for permutation classes that formalize some phenomena that have appeared in the study of…

Combinatorics · Mathematics 2020-01-13 Colin Defant

We study the enumerative and analytic properties of some sequences constructed using tensor invariant theory. The octant sequences are constructed from the exceptional Lie group $G_2$ and the quadrant sequences from the special linear group…

Combinatorics · Mathematics 2022-04-21 Alin Bostan , Jordan Tirrell , Bruce W. Westbury , Yi Zhang

Let alpha = a_1 a_2 ... a_n be a sequence of nonnegative integers. The ascent set of alpha, Asc(alpha), consists of all indices k where a_{k+1} > a_k. An ascent sequence is alpha where the growth of the a_k is bounded by the elements of…

Combinatorics · Mathematics 2023-11-28 Mark Dukes , Bruce Sagan

We show that the sequence of dimensions of the linear spaces, generated by a given rank-metric code together with itself under several applications of a field automorphism, is an invariant for the whole equivalence class of the code. The…

Information Theory · Computer Science 2020-09-17 Alessandro Neri , Sven Puchinger , Anna-Lena Horlemann-Trautmann

In recent years, there has been increasing interest in consecutive pattern avoidance in permutations. In this paper, we introduce two approaches to counting permutations that avoid a set of prescribed patterns consecutively. These algoritms…

Combinatorics · Mathematics 2011-02-15 Brian Nakamura

Ascent sequences were introduced by Bousquet-M\'{e}lou, Claesson, Dukes and Kitaev in their study of $(\bf{2+2})$-free posets. An ascent sequence of length $n$ is a nonnegative integer sequence $x=x_{1}x_{2}... x_{n}$ such that $x_{1}=0$…

Combinatorics · Mathematics 2012-06-22 William Y. C. Chen , Alvin Y. L. Dai , Theodore Dokos , Tim Dwyer , Bruce E. Sagan

We propose a natural, bivariate, generalization of the nonsingular similarity relations considered by T. Fine. We also provide an enumeration formulae and a generating tree for those relations. The latter allow us to give a new bijection…

Combinatorics · Mathematics 2009-09-29 Olivier Guibert , Sylvain Pelat-Alloin

A sequence $(a_1, \ldots, a_n)$ of nonnegative integers is an {\em ascent sequence} if $a_0 =0$ and for all $i \geq 2$, $a_i$ is at most 1 plus the number of ascents in $(a_1, \ldots, a_{i-1})$. Ascent sequences were introduced by…

Combinatorics · Mathematics 2015-03-04 Sergey Kitaev , Jeffrey Remmel

Starting from some considerations we make about the relations between certain difference statistics and the classical permutation statistics we study permutations whose inversion number and excedance difference coincide. It turns out that…

Combinatorics · Mathematics 2007-05-23 Astrid Reifegerste

We study the $\{1234, 3412\}$ pattern-replacement equivalence relation on the set $S_n$ of permutations of length $n$, which is conceptually similar to the Knuth relation. In particular, we enumerate and characterize the nontrivial…

Combinatorics · Mathematics 2020-08-07 Quinn Perian , Bella Xu , Alexander Lu Zhang

A tableau inversion is a pair of entries in row-standard tableau $T$ that lie in the same column of $T$ yet lack the appropriate relative ordering to make $T$ column-standard. An $i$-inverted Young tableau is a row-standard tableau along…

Combinatorics · Mathematics 2015-06-24 Jonathan E. Beagley , Paul Drube

Super-strong (elsewhere referred to as strong) Wilf equivalence is a type of Wilf equivalence on words that was introduced by Kitaev et al. in 2009. We provide a necessary and sufficient condition for two permutations in $n$ letters to be…

Combinatorics · Mathematics 2017-06-23 Demetris Hadjiloucas , Ioannis Michos , Christina Savvidou

An ascent sequence is one consisting of non-negative integers in which the size of each letter is restricted by the number of ascents preceding it in the sequence. Ascent sequences have recently been shown to be related to (2+2)-free posets…

Combinatorics · Mathematics 2012-07-17 Toufik Mansour , Mark Shattuck

Complementary symmetric Rote sequences are binary sequences which have factor complexity $\mathcal{C}(n) = 2n$ for all integers $n \geq 1$ and whose languages are closed under the exchange of letters. These sequences are intimately linked…

Combinatorics · Mathematics 2018-12-11 Kateřina Medková , Edita Pelantová , Laurent Vuillon

We show that cyclic permutations avoiding $321$ are precisely those permutations whose image under the fundamental bijection avoid a set of vincular patterns. We do this by using pattern functions and arrow patterns, in combination with the…

Combinatorics · Mathematics 2025-05-12 Robert P. Laudone

Two permutation classes, the X-class and subpermutations of the increasing oscillation are shown to exhibit an exponential Wilf-collapse. This means that the number of distinct enumerations of principal subclasses of each of these classes…

Combinatorics · Mathematics 2023-06-22 Michael Albert , Vít Jelínek , Michal Opler

Ordered sequences of univariate or multivariate regressions provide statistical models for analysing data from randomized, possibly sequential interventions, from cohort or multi-wave panel studies, but also from cross-sectional or…

Methodology · Statistics 2015-03-19 Nanny Wermuth , Kayvan Sadeghi

In this note we present a characterisation of all unary and binary patterns that do not only contain variables, but also reversals of their instances. These types of variables were studied recently in either more general or particular…

Formal Languages and Automata Theory · Computer Science 2015-08-20 Robert Mercaş