Related papers: Self-reciprocal polynomials connecting unsigned an…
We study signed differential posets, a signed version of differential posets. These posets satisfy enumerative identities which are signed analogues of those satisfied by differential posets. Our main motivations are the sign-imbalance…
The different notions of matings of pairs of equal degree polynomials are introduced and are related to each other as well as known results on matings. The possible obstructions to matings are identified and related. Moreover the relations…
Motivated by the definition of the edge elimination polynomial of a graph we define the covered components polynomial counting spanning subgraphs with respect to their number of components, edges and covered components. We prove a…
The first author introduced a sequence of polynomials (\cite{8}, sequence A174531) defined recursively. One of the main results of this study is proof of the integrality of its coefficients.
We establish a novel connection between the central binomial coefficients $\binom{2n}{n}$ and Gould's sequence through the construction of a specialized multivariate polynomial quotient ring. Our ring structure is characterized by ideals…
In this paper, by the umbral calculus method, we give a remarkable congruence involving Appell polynomials. Some applications on derangement polynomials are also presented.
In this paper, we consider sequences of polynomials that satisfy differential--difference recurrences. Our interest is motivated by the fact that polynomials satisfying such recurrences frequently appear as generating polynomials of integer…
We consider polynomial maps described by so-called "(multivariate) linearized polynomials". These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps…
Decoupling multivariate polynomials is useful for obtaining an insight into the workings of a nonlinear mapping, performing parameter reduction, or approximating nonlinear functions. Several different tensor-based approaches have been…
Arthur Cohn's irreducibility criterion for polynomials with integer coefficients and its generalization connect primes to irreducibles, and integral bases to the variable $x$. As we follow this link, we find that these polynomials are ready…
We complete the determination of the signed graphs for which the adjacency matrix has all but at most two eigenvalues equal to $\pm 1$. The unsigned graphs and the disconnected, the bipartite and the complete signed graphs with this…
This paper studies symmetric tensor decompositions. For symmetric tensors, there exist linear relations of recursive patterns among their entries. Such a relation can be represented by a polynomial, which is called a generating polynomial.…
In this note, we introduce and investigate the Hermite-based Tangent numbers and polynomials, Hermite-based modifieed degenerate- Tangent polynomials, poly-Tangent polynomials. We give some identities and relations for these polynomials.
The discrete orthogonality relations hold for all the orthogonal polynomials obeying three term recurrence relations. We show that they also hold for multi-indexed Laguerre and Jacobi polynomials, which are new orthogonal polynomials…
We study the zero sets of the independence polynomial on recursive sequences of graphs. We prove that for a maximally independent starting graph and a stable and expanding recursion algorithm, the zeros of the independence polynomial are…
In a companion paper [On semiclassical orthogonal polynomials via polynomial mappings, J. Math. Anal. Appl. (2017)] we proved that the semiclassical class of orthogonal polynomials is stable under polynomial transformations. In this work we…
We obtain upper bounds, independent of the ambient dimension, for the number of realizable zero-nonzero patterns and (over ordered fields) sign conditions of a finite family of polynomials $\mathcal P$ restricted to an algebraic subset $V$…
We continue our study on relationships between Bernoulli polynomials and balancing (Lucas-balancing) polynomials. From these polynomial relations, we deduce new combinatorial identities with Fibonacci (Lucas) and Bernoulli numbers.…
The Rogers-Szeg\"o polynomials are natural q-analogues of Newton binomials. In general they have no closed expression. We consider some exceptional cases which are products of a factor with a closed formula and another one with nice values…
We present a simplification of the recursive algorithm for the evaluation of intersection numbers for differential $n$-forms, by combining the advantages emerging from the choice of delta-forms as generators of relative twisted cohomology…