Related papers: Normal ordered grammars
The classical Eulerian polynomials can be expanded in the basis $t^{k-1}(1+t)^{n+1-2k}$ ($1\leq k\leq\lfloor (n+1)/2\rfloor$) with positive integral coefficients. This formula implies both the symmetry and the unimodality of the Eulerian…
Charlier configurations provide a combinatorial model for Charlier polynomials. We use this model to give a combinatorial proof of a multilinear generating function for Charlier polynomials. As special cases of the multilinear generating…
This paper introduces a degenerate version of the Euler-Seidel matrix method by incorporating a parameter lambda into the classical recurrence relation. The standard Euler-Seidel method relates the generating functions of an initial…
This paper examines the characterization and learning of grammars defined with enriched representational models. Model-theoretic approaches to formal language theory traditionally assume that each position in a string belongs to exactly one…
Starting from the moment sequences of classical orthogonal polynomials we derive the orthogonality purely algebraically. We consider also the moments of ($q=1$) classical orthogonal polynomials, and study those cases in which the…
Euler graphs are characterized by the simple criterion that degree of each node is even. By restricting on the cycle types yet additional intrinsic properties of Euler graphs are unveiled. For example, regularity higher than degree two is…
The Sturm sequence is generated by a pair of polynomials $P(x)$ and $P'(x)$, where $P(x)$ is assumed to have simple real roots. Euclidean algorithm generates then a finite sequence of polynomials orthogonal on the grid $x_s$ of roots of the…
The numbers of even and odd permutations with a given ascent number are investigated using an operator that was previously introduced by the author. Their difference is called a signed Eulerian number. By means of the operator the…
We study generating functions in the context of Rota-Baxter algebras. We show that exponential generating functions can be naturally viewed in a very special case of complete free commutative Rota-Baxter algebras. This allows us to use free…
Graph products of cyclic groups and Coxeter groups are two families of groups that are defined by labeled graphs. The family of Dyer groups contains these both families and gives us a framework to study these groups in a unified way. This…
Certain generalization of Euler numbers was defined in 1935 by Lehmer using cubic roots of unity, as a natural generalization of Bernoulli and Euler numbers. In this paper, we define a new polynomial related to the higher-order generalized…
The purpose of this paper is to show that some combinatorial sequences, such as second-order Eulerian numbers and Eulerian numbers of type $B$, can be generated by context-free grammars.
Many research works have concerned normality-preserving selection rules and operations on the sequence of digits of a given normal number that maintain or violate normality. This leads us to introduce rearrangement operations on finite…
Probability distributions supported on the simplex enjoy a wide range of applications across statistics and machine learning. Recently, a novel family of such distributions has been discovered: the continuous categorical. This family enjoys…
In this paper we give an alternative exposition of a recent paper regarding the classification of growth rates of real functions. We take a different point of view, focussing on understanding possible growth rates between polynomial and…
The s-ordered form of any product of single-mode boson creation and annihilation operators, containing only a single annihilator, is computed explicitly. The s-ordering concept originated in quantum optics, but subsumes normal, symmetric…
Umbral extensions of the stirling numbers of the second kind are considered and the resulting dobinski-like various formulas including new ones are presented. These extensions naturally encompass the two well known q-extensions. The further…
We give the normal and anti-normal order expressions of the number operator to the power $k$ by using the commutation relation between the annihilation and creation operators. We use those expressions to give general formulae for functions…
In this paper, we discuss sums of powers of the positive integers and compute both the exponential and ordinary generating functions for these sums. We express these generating functions in terms of exponential and geometric polynomials and…
We give a new construction of q-Genocchi numbers, Euler numbers of higher order, which are different than the q-Genocchi numbers of Cangul-Ozden-Simsek. By using our q-Genoucchi, Euler nimbers of higher order, we can investigate the…