Related papers: Combinatorial approach to generalized Bell and Sti…
We introduce a family of block-additive automatic sequences, that are obtained by allocating a weight to each couple of digits, and defining the $n$th term of the sequence as being the total weight of the integer $n$ written in base $k$.…
We introduce the theory of normal ordered grammars, which gives a natural generalization of the normal ordering problem. To illustrate the main idea, we explore normal ordered grammars associated with the Eulerian polynomials and the…
We give series solutions to single insertion place propagator-type systems of Dyson--Schwinger equations using binary tubings of rooted trees. These solutions are combinatorially transparent in the sense that each tubing has a…
In a soliton sector of a quantum field theory, it is often convenient to expand the quantum fields in terms of normal modes. Normal mode creation and annihilation operators can be normal ordered, and their normal ordered products have…
We study generalized sums of linear orders. These are binary operations that, given linear orders $A$ and $B$, return an order $A \oplus B$ that can be decomposed as an isomorphic copy of $A$ interleaved with a copy of $B$. We show that…
In this paper, we investigate fractional B splines and their connections with Fourier analysis, and establish connections with generalized Stirling-type numbers and distribution theory. Employing a generating function approach inspired by…
We derive new formulas for the number of unordered (distinct) factorizations with $k$ parts of a positive integer $n$ as sums over the partitions of $k$ and an auxiliary function, the number of partitions of the prime exponents of $n$,…
We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…
A common theme in mathematics is to define generalized solutions to deal with problems that potentially do not have solutions. A classical example is the introduction of least squares solutions via the normal equations associated with a…
In this paper, we consider a generalization of the Stirling number sequence of both kinds by using a specialization of a new family of symmetric functions. We give combinatorial interpretations for this symmetric functions by means of…
Motivated by a historical combinatorial problem that resembles the well-known Josephus problem, we investigate circular partition algorithms and formulate problems in deterministic finite automata with practical algorithms. The historical…
Combinatorial optimization is a fundamental problem found in many fields. In many real life situations, the constraints and the objective function forming the optimization problem are naturally distributed amongst different sites in some…
Solutions to the Markov equation appear in many mathematical contexts. We aim to build on the understanding of them by proving a recent conjecture about Markov polynomials; solutions to a generalised version of the Markov equation. The…
We introduce a family of sequence transformations, defined via partial Bell polynomials, that may be used for a systematic study of a wide variety of problems in enumerative combinatorics. This family includes some of the transformations…
We present a refinement of Ramsey numbers by considering graphs with a partial ordering on their vertices. This is a natural extension of the ordered Ramsey numbers. We formalize situations in which we can use arbitrary families of…
In this study, we introduce the generalized Tribonacci hyperbolic spinors and properties of this new special numbers system by the generalized Tribonacci numbers, which are one of the most general form of the third-order recurrence…
The Poisson structure arising in the Hamiltonian approach to the rational Gaudin model looks very similar to the so-called modified Reflection Equation Algebra. Motivated by this analogy, we realize a braiding of the mentioned Poisson…
In [1] a new bosonization procedure has been illustrated, which allows to express a fermionic gaussian system in terms of commuting variables at the price of introducing an extra dimension. The Fermi-Bose duality principle established in…
Several combinatorial identities are presented, involving Stirling functions of the second kind with a complex variable. The identities involve also Stirling numbers of the first kind, binomial coefficients and harmonic numbers.
The generalized Poisson distribution is well known to be a compound Poisson distribution with Borel summands. As a generalization we present closed formulas for compound Bartlett and Delaporte distributions with Borel summands and a…