Related papers: Dembowski-Ostrom polynomials and Dickson polynomia…
We study a family of bivariate orthogonal polynomials associated to the deltoid curve. These polynomials arise when classifying bivariate diffusion operators that have discrete spectral decomposition given by orthogonal polynomials with…
We consider image sets of differentially $d$-uniform maps of finite fields. We present a lower bound on the image size of such maps and study their preimage distribution, by extending methods used for planar maps. We apply the results to…
We develop a theory of Jacobi polynomials for parabolic subgroups of finite reflection groups that specializes to the cases studied by Heckman and Opdam in which the whole group and the trivial group are considered. For the intermediate…
Boole polynomials play an important role in the area of number theory, algebra and umbral calculus. In this paper, we investigate some properties of Boole polynomials and consider Witt-type formulas for the Boole numbers and polynomials.…
Gr\"obner bases are a fundamental tool when studying ideals in multivariate polynomial rings. More recently there has been a growing interest in transferring techniques from the field case to other coefficient rings, most notably Euclidean…
In this paper, by the generalized Bell umbra and Rolle's theorem, we give some results on the real rootedness of polynomials. Some applications on partition polynomials and the sigma polynomials of graphs are given.
Double coverings of the orthogonal groups of the real and complex spaces are considered. The relation between discrete transformations of these spaces and fundamental automorphisms of Clifford algebras is established, where an isomorphism…
This paper puts forward a new generalized polynomial dimensional decomposition (PDD), referred to as GPDD, comprising hierarchically ordered measure-consistent multivariate orthogonal polynomials in dependent random variables. Unlike the…
Polynomial, or Delsarte's, method in coding theory accounts for a variety of structural results on, and bounds on the size of, extremal configurations (codes and designs) in various metric spaces. In recent works of the authors the…
Consider a polynomial $F$ in $m$ variables and a finite point ensemble $S=S_1 \times ... \times S_m$. When given the leading monomial of $F$ with respect to a lexicographic ordering we derive improved information on the possible number of…
We investigate the structure of ideals generated by binomials (polynomials with at most two terms) and the schemes and varieties associated to them. The class of binomial ideals contains many classical examples from algebraic geometry, and…
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…
In this paper, we investigate the trigonometric Heckman-Opdam polynomials of type $A_1$. We establish connections with ultraspherical polynomials and derive an explicit expression for the associated Poisson kernel. Using the product…
Graph polynomials encode fundamental combinatorial invariants of graphs. Their computation is investigated using tree and path decomposition frameworks, with formal definitions of treewidth, k-trees, and pathwidth establishing the…
This paper contains the results collected so far on polynomial composites in terms of many basic algebraic properties. Since it is a polynomial structure, results for monoid domains come in here and there. The second part of the paper…
The behavior under iteration of the critical points of polynomial maps plays an essential role in understanding its dynamics. We study the special case where the forward orbits of the critical points are finite. Thurston's theorem tells us…
We give formulas for the number of polynomials over a finite field with given root multiplicities, in particular in cases when the formula is surprisingly simple (a power of q). Besides this concrete interpretation, we also prove an…
We give necessary conditions satisfied by the set of odd prime divisors of binary perfect polynomials. This allows us to get a new characterization of all the known perfect binary polynomials.
We study multivariate polynomials over `structured' grids. We begin by proposing an interpretation as to what it means for a finite subset of a field to be structured; we do so by means of a numerical parameter, the nullity. We then extend…
Orthogonal polynomials have very useful properties in the solution of mathematical problems, so recent years have seen a great deal in the field of approximation theory using orthogonal polynomials. In this paper, we characterize the…