Related papers: Normal ordered grammars

This paper was motivated by a conjecture of Br\"{a}nd\'{e}n (European J. Combin. \textbf{29} (2008), no.~2, 514--531) about the divisibility of the coefficients in an expansion of generalized Eulerian polynomials, which implies the…

Colored multiset Eulerian polynomials are a common generalization of MacMahon's multiset Eulerian polynomials and the colored Eulerian polynomials, both of which are known to satisfy well-studied distributional properties including…

Fast-growing hierarchies are sequences of functions obtained through various processes similar to the ones that yield multiplication from addition, exponentiation from multiplication, etc. We observe that fast-growing hierarchies can be…

We give several families of polynomials which are related by Eulerian summation operators. They satisfy interesting combinatorial properties like being integer-valued at integral points. This involves nearby-symmetries and a recursion for…

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…

We develop a nonstandard approach to exploring polynomials associated with peaks and runs of permutations. With the aid of a context-free grammar, or a set of substitution rules, one can perform a symbolic calculus, and the computation…

We establish a form of the Gotzmann representation of the Hilbert polynomial based on rank and generating degrees of a module, which allow for a generalization of Gotzmann's Regularity Theorem. Under an additional assumption on the…

We provide combinatorial interpretation for the $\gamma$-coefficients of the basic Eulerian polynomials that enumerate permutations by the excedance statistic and the major index as well as the corresponding $\gamma$-coefficients for…

In this paper, we introduce a new class of polynomials, called probabilistic q-Bernstein polynomials, alongside their generating function. Assuming Y is a random variable satisfying moment conditions, we use the generating function of these…

Using notions of composita and composition of generating functions we obtain explicit formulas for Chebyshev polynomials, Legendre polynomials, Gegenbauer polynomials, Associated Laguerre polynomials, Stirling polynomials, Abel polynomials,…

The Eulerian idempotents, first introduced for the symmetric group and later extended to all reflection groups, generate a family of representations called the Eulerian representations that decompose the regular representation. In Type $A$,…

The dominant approach to sequence generation is to produce a sequence in some predefined order, e.g. left to right. In contrast, we propose a more general model that can generate the output sequence by inserting tokens in any arbitrary…

Quaternionic polynomials occur naturally in applications of quaternions in science and engineering, and normalization of quaternionic polynomials is a basic manipulation. Once a Groebner basis is certified for the defining ideal I of the…

This paper develops the theory of Macdonald-Koornwinder polynomials in parallel analogy with the work done for the $GL_n$ case in [CR22]. In the context of the type $CC_n$ affine root system the Macdonald polynomials of other root systems…

Since 1950s, mathematicians have successfully interpreted the traditional Eulerian numbers and $q-$Eulerian numbers combinatorially. In this paper, the authors give a combinatorial interpretation to the general Eulerian numbers defined on…

We apply a symbolic approach of the general quadratic decomposition of polynomial sequences - presented in a previous article referenced herein - to polynomial sequences fulfilling specific orthogonal conditions towards two given…

This thesis is intended to provide an account of the theory and applications of Operational Methods that allow the "translation" of the theory of special functions and polynomials into a "different" mathematical language. The language we…

In this paper we give an ordinal analysis of the theory of second order arithmetic. We do this by working with proof trees -- that is, "deductions" which may not be well-founded. Working in a suitable theory, we are able to represent…

In this paper we discourse basises of representable algebras. This question lead to arithmetic problems. We prove algorithmical solvability of exponential-Diophantine equations in rings represented by matrices over fields of positive…

One of the key ingredients in the recent construction of the generalized doubling method is a new class of models, called $(k,c)$ models, for local components of generalized Speh representations. We construct a family of $(k,c)$…