Related papers: Andre Permutation Calculus; a Twin Seidel Matrix S…
In this work, we analyze the combinatorial properties of cylinders and subdivisions of augmented semi-simplicial sets. These constructions are obtained as particular cases of a certain action from a co-semi-simplicial set on an augmented…
We consider a family of integer sequences generated by nonlinear recurrences of the second order, which have the curious property that the terms of the sequence, and integer multiples of the ratios of successive terms (which are also…
We present exponential generating function analogues to two classical identities involving the ordinary generating function of the complete homogeneous symmetric functions. After a suitable specialization the new identities reduce to…
We introduce a new permutation statistic, namely, the number of cycles of length $q$ consisting of consecutive integers, and consider the distribution of this statistic among the permutations of $\{1,2,...,n\}$. We determine explicit…
The excedance number for S_n is known to have an Eulerian distribution. Nevertheless, the classical proof uses descents rather than excedances. We present a direct recursive proof which seems to be folklore and extend it to the colored…
A sequence inverse relationship can be defined by a pair of infinite inverse matrices. If the pair of matrices are the same, they define a dual relationship. Here presented is a unified approach to construct dual relationships via…
We provide a context around a conjectured closed form for the Hankel transform of linear combinations of consecutive pairs of Catalan numbers. This generalizes the formula for the Hankel transforms of the shifted Catalan numbers and the…
Tandem duplication is an evolutionary process whereby a segment of DNA is replicated and proximally inserted. The different configurations that can arise from this process give rise to some interesting combinatorial questions. Firstly, we…
Inversion sequences, also known as subexcedant sequences, form a fundamental class of objects in enumerative combinatorics. In this paper, we study the joint distribution of five statistics on inversion sequences. While several statistics…
Arc permutations, which were originally introduced in the study of triangulations and characters, have recently been shown to have interesting combinatorial properties. The first part of this paper continues their study by providing signed…
In this work we obtain recurrent formulae for the number of permutations with either increasing or monotonic (i.e., both increasing and decreasing) runs of bounded length. Our formulae allow one to efficiently compute the number of such…
A permutation $\sigma$ of a multiset is called Stirling permutation if $\sigma(s)\ge \sigma(i)$ as soon as $\sigma(i)=\sigma(j)$ and $i<s<j.$ In our paper we study Stirling polynomials that arise in the generating function for descent…
The derivative polynomials introduced by Knuth and Buckholtz in their calculations of the tangent and secant numbers are extended to a multivariable $q$--environment. The $n$-th $q$-derivatives of the classical $q$-tangent and $q$-secant…
We introduce a generalization of the Stirling numbers via symmetric functions involving two weight functions. The resulting extension unifies previously known Stirling-type sequences with known symmetric function forms, as well as other…
This paper deals with Fountain codes, and especially with their encoding matrices, which are required here to be invertible. A result is stated that an encoding matrix induces a permutation. Also, a result is that encoding matrices form a…
Given two infinite sequences with known binomial transforms, we compute the binomial transform of the product sequence. Various identities are obtained and numerous examples are given involving sequences of special numbers: Harmonic…
New class of special functions of three real variables, based on the alternating subgroup of the permutation group $S_3$, is studied. These functions are used for Fourier-like expansion of digital data given on lattice of any density and…
In this paper, algorithms are developed for computing the Stirling transform and the inverse Stirling transform; specifically, we investigate a class of sequences satisfying a two-term recurrence. We derive a general identity which…
We prove an important property of the binomial transform: it converts multiplication by the discrete variable into a certain difference operator. We also consider the case of dividing by the discrete variable. The properties presented here…
Nested sums containing binomial coefficients occur in the computation of massive operator matrix elements. Their associated iterated integrals lead to alphabets including radicals, for which we determined a suitable basis. We discuss…