Related papers: A polynomial composites
The notion of block divisibility naturally leads one to introduce unitary cyclotomic polynomials. We formulate some basic properties of unitary cyclotomic polynomials and study how they are connected with cyclotomic, inclusion-exclusion and…
In this paper, we derive some interesting symmetric properties for the geenralized Euler numbers and polynomials.
Volume polynomials form a distinguished class of log-concave polynomials with remarkable analytic and combinatorial properties. I will survey realization problems related to them, review fundamental inequalities they satisfy, and discuss…
This paper introduces and investigates some properties of algebras constructed from the algebra of polynomials via derivation and integration operators using a process presented by Dzhumadildaev in a previous work. In particular, we…
There is a commutative algebra of differential-difference operators, with two parameters, associated to any dihedral group with an even number of reflections. The intertwining operator relates this algebra to the algebra of partial…
A common theme of enumerative combinatorics is formed by counting functions that are polynomials evaluated at positive integers. In this expository paper, we focus on four families of such counting functions connected to hyperplane…
We study the monodromy groups of compositions of two indecomposable polynomials. In particular, we show that such monodromy groups either fulfill a certain "largeness" property, or are in an explicit list of exceptions. Such largeness…
In this paper we introduce three combinatorial models for symmetrized poly-Bernoulli numbers. Based on our models we derive generalizations of some identities for poly-Bernoulli numbers. Finally, we set open questions and directions of…
Polynomial Lie (super)algebras $g_{pd}$ are introduced via $G_{i}$-invariant polynomial Jordan maps in quantum composite models with Hamiltonians $H$ having invariance groups $G_{i}$. Algebras $g_{pd}$ have polynomial structure functions in…
Relative notions of combinatorial asphericity have been used to prove that injective labeled oriented trees (which encode spines of ribbon 2-knots) are aspherical. This article presents an overview and comparison of the different notions of…
The Poupard polynomials are polynomials in one variable with integer coefficients, with some close relationship to Bernoulli and tangent numbers. They also have a combinatorial interpretation. We prove that every Poupard polynomial has all…
The polynomials that arise as coefficients when a power series is raised to the power $x$ include many important special cases, which have surprising properties that are not widely known. This paper explains how to recognize and use such…
In this paper, we present a general framework for the derivation of interesting finite combinatorial sums starting with certain classes of polynomial identities. The sums that can be derived involve products of binomial coefficients and…
Inspired by the framework of operational methods and based on the generating functions of Legendre-Gould Hopper polynomials and Sheffer sequences, we discuss certain new mixed type polynomials and their important properties. We show that…
S. Cappell and J. Shaneson constructed a pair of inequivalent embeddings of $(n-1)$-spheres in homotopy $(n+1)$-spheres for every square matrix of order $n$ with special properties (a Cappell-Shaneson matrix). A Cappell-Shaneson polynomial…
Some important properties of the chromatic polynomial also hold for any polynomial set map satisfying p_S(x+y)=\sum_{T\uplus U=S}p_T(x)p_U(y). Using umbral calculus, we give a formula for the expansion of such a set map in terms of any…
The chromatic polynomials are studied by several authors and have important applications in different frameworks, specially, in graph theory and enumerative combinatorics. The aim of this work is to establish some properties of the…
For non-negative integers $k\leq n$, we prove a combinatorial identity for the $p$-binomial coefficient $\binom{n}{k}_p$ based on abelian p-groups. A purely combinatorial proof of this identity is not known. While proving this identity, for…
We introduce the characteristic numbers and the chromatic polynomial of a tensor. Our approach generalizes and unifies the chromatic polynomial of a graph and of a matroid, characteristic numbers of quadrics in Schubert calculus, Betti…
This is the first paper that provides a systematic treatment of the $r$-dimensional PTE problem in additive number theory, abbreviated by PTE$_r$, through its connection with combinatorial design theory, the branch of combinatorial…