Related papers: Self-modified difference ascent sequences
Ascent sequences and their modified version play a central role in the bijective framework relating several combinatorial structures counted by the Fishburn numbers. Ascent sequences are positive integer sequences defined by imposing a…
Ascent sequences were introduced by Bousquet-M\'elou, Claesson, Dukes and Kitaev, and are in bijection with unlabeled $(2+2)$-free posets, Fishburn matrices, permutations avoiding a bivincular pattern of length $3$, and Stoimenow matchings.…
The in-order traversal provides a natural correspondence between binary trees with a decreasing vertex labeling and endofunctions on a finite set. By suitably restricting the vertex labeling we arrive at a class of trees that we call…
In 2011, Duncan and Steingr\'imsson conjectured that modified ascent sequences avoiding any of the patterns 212, 1212, 2132, 2213, 2231 and 2321 are counted by the Bell numbers. Furthermore, the distribution of the number of ascents is the…
A Fishburn permutation is a permutation which avoids the bivincular pattern $(231, \{1\}, \{1\})$, while an ascent sequence is a sequence of nonnegative integers in which each entry is less than or equal to one more than the number of…
We initiate an in-depth study of pattern avoidance on modified ascent sequences. Our main technique consists in using Stanley's standardization to obtain a transport theorem between primitive modified ascent sequences and permutations…
Inspired by the definition of modified ascent sequences, we introduce a new class of integer sequences called revised ascent sequences. These sequences are defined as Cayley permutations where each entry is a leftmost occurrence if and only…
Ascent sequences form a central class of combinatorial objects, as they are in bijection with several important families such as (2+2)-free posets, Stoimenow matchings, and other Fishburn objects, and are enumerated by the Fishburn numbers.…
Ascent sequences are sequences of nonnegative integers with restrictions on the size of each letter, depending on the number of ascents preceding it in the sequence. Ascent sequences have recently been related to (2+2)-free posets and…
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…
We take the first steps in developing a theory of transport of patterns from Fishburn permutations to (modified) ascent sequences. Given a set of pattern avoiding Fishburn permutations, we provide an explicit construction for the basis of…
A sequence is difference algebraic (or D-algebraic) if finitely many shifts of its general term satisfy a polynomial relationship; that is, they are the coordinates of a generic point on an affine hypersurface. The corresponding equations…
A direct saddle-point analysis (without relying on any modular forms, identities or functional equations) is developed to establish the asymptotics of Fishburn matrices and a large number of other variants with a similar sum…
We study growth rates of generalised Fibonacci sequences of a particular structure. These sequences are constructed from choosing two real numbers for the first two terms and always having the next term be either the sum or the difference…
Difference sets and their generalisations to difference families arise from the study of designs and many other applications. Here we give a brief survey of some of these applications, noting in particular the diverse definitions of…
We show that essentially the Fibonacci sequence is the unique binary recurrence which contains infinitely many three-term arithmetic progressions. A criterion for general linear recurrences having infinitely many three-term arithmetic…
As shown by Bousquet-M\'elou--Claesson--Dukes--Kitaev (2010), ascent sequences can be used to encode $({\bf2+2})$-free posets. It is known that ascent sequences are enumerated by the Fishburn numbers, which appear as the coefficients of the…
We associate a combinatorial object to sequences of point blow-ups over perfect fields, the weighted directed graph, and another one to the composition of all blow-ups, which we call associated sequential morphisms, the $d-$ary intersection…
We establish a connection between dependence structures and subclasses of distortion riskmetrics under which the latter are additive. A new notion of positive dependence, called partial comonotonicity, is developed, which nests the existing…
This paper presents a bijection between ascent sequences and upper triangular matrices whose non-negative entries are such that all rows and columns contain at least one non-zero entry. We show the equivalence of several natural statistics…