Related papers: A combinatorial interpretation of the eigensequenc…
A generalization of the Catalan numbers is considered. New results include binomial identities, recursive relations and a close formula for the multivariate generating function. A simple expression for the Catalan determinant is derived.
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…
Motivated by Vassiliev's knot invariants, Stoimenow introduced a special class of matchings, now known as Stoimenow matchings. These matchings have since been linked to various combinatorial structures enumerated by the Fishburn numbers. In…
The beta transformation is the iterated map $\beta x\,\mod1$; it generates the base-$\beta$ expansion of a real number x. Every iterated piece-wise monotonic map is topologically conjugate to the beta transformation. For all but a countable…
We find the number of compositions over finite abelian groups under two types of restrictions: (i) each part belongs to a given subset and (ii) small runs of consecutive parts must have given properties. Waring's problem over finite fields…
Multiple harmonic-like numbers are studied using the generating function approach. A closed form is stated for binomial sums involving these numbers and two additional parameters. Several corollaries and examples are presented which are…
Permutations are usually enumerated by size, but new results can be found by enumerating them by inversions instead, in which case one must restrict one's attention to indecomposable permutations. In the style of the seminal paper by Simion…
A structured approach for the Collatz conjecture is presented using just the odd integers that are, in turn, divided into categories based on the roles they play such as Starter, Intermediary and Terminal. The expression 4x+1 is used as a…
In this paper, we use Hasse diagrams and generating functions to count alternating permutations with restricted prefix and suffix of lengths 3 and 4. In other words, for an alternating permutation…
The collection of reflecting hyperplanes of a finite Coxeter group is called a reflection arrangement and it appears in many subareas of combinatorics and representation theory. We focus on the problem of counting regions of reflection…
In the dependency pair framework for proving termination of rewriting systems, polynomial interpretations are used to transform dependency chains into bounded decreasing sequences of integers, and they play an important role for the success…
Large language models trained under diverse objectives and architectures have been shown to develop increasingly similar internal representations, an observation formalized as the Platonic Representation Hypothesis. Whether this…
$\lambda\upsilon$ is an extension of the $\lambda$-calculus which internalises the calculus of substitutions. In the current paper, we investigate the combinatorial properties of $\lambda\upsilon$ focusing on the quantitative aspects of…
It is known that the monodromy group of each cover of a general curve of genus g>3 equals either the symmetric or the alternating group. The classical Catalan numbers count the minimal degree covers (with symmetric monodromy) of a general…
A classical bijection relates certain Kostka numbers, the Catalan numbers, and permutations of length $n$ with longest increasing subsequence (LIS) of length at most $2.$ We generalize this bijection and find Kostka numbers which count the…
The extent to which a sequence of finite length differs from a shifted version of itself is measured by its aperiodic autocorrelations. Of particular interest are sequences whose entries are 1 or -1, called binary sequences, and sequences…
We initiate a general approach for the fast enumeration of permutations with a prescribed number of occurrences of `forbidden' patterns, that seems to indicate that the enumerating sequence is always P-recursive. We illustrate the method…
We discuss the properties of the Hankel transformation of a sequence whose elements are the sums of consecutive generalized Catalan numbers and find their values in the closed form.
In 2012 B\'ona showed the rather surprising fact that the cumulative number of occurrences of the classical patterns $231$ and $213$ are the same on the set of permutations avoiding $132$, beside the pattern based statistics $231$ and $213$…
We prove various congruences for Catalan and Motzkin numbers as well as related sequences. The common thread is that all these sequences can be expressed in terms of binomial coefficients. Our techniques are combinatorial and algebraic:…