Related papers: Closed-form expansions for the universal edge elim…
Bicliques are complements of bipartite graphs; as such each consists of two cliques joined by a number of edges. In this paper we study algebraic aspects of the chromatic polynomials of these graphs. We derive a formula for the chromatic…
This paper extends previous work on linear correlations of representation functions of positive definite binary quadratic forms to allow indefinite forms.
Highly efficient and even nearly optimal algorithms have been developed for the classical problem of univariate polynomial root-finding (see, e.g., \cite{P95}, \cite{P02}, \cite{MNP13}, and the bibliography therein), but this is still an…
We start by presenting a generalization of a discrete wave equation that is particularly satisfied by the entries of the matrix coefficients of the refinement equation corresponding to the multiresolution analysis of Alpert. The entries are…
Colored knot polynomials possess a peculiar Z-expansion in certain combinations of differentials, which depends on the representation. The coefficients of this expansion are functions of the three variables (A,q,t) and can be considered as…
It is shown that the expansion methods developed in refs. arXiv:hep-th/0212347 and arXiv:hep-th/0401033v2 can be generalized so that they permit to study the expansion of algebras of loops, both when the compact finite-dimensional algebra…
The notion of a root functional of a system of polynomials or ideal of polynomials is a generalization of the notion of a root, in particular, for a multiple root. A root functional is a linear functional that is defined on a polynomial…
We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…
We present an exact and complete algorithm to isolate the real solutions of a zero-dimensional bivariate polynomial system. The proposed algorithm constitutes an elimination method which improves upon existing approaches in a number of…
We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…
Commutative complex numbers of the form u=x+\alpha y+\beta z+\gamma t in 4 dimensions are studied, the variables x, y, z and t being real numbers. Four distinct types of multiplication rules for the complex bases \alpha, \beta and \gamma…
We introduce a new type of reduction of inversive difference polynomials that is associated with a partition of the basic set of automorphisms $\sigma$ and uses a generalization of the concept of effective order of a difference polynomial.…
This essay summarizes the state of the art on some aspects of the dynamics of polynomial diffeomorphsms in complex dimension two, and it presents a number of open questions.
We show that the use of generalized multivariable forms of Hermite polynomials provide an useful tool for the evaluation of families of elliptic type integrals often encountered in electrostatic and electrodynamics
We introduce classes of graphs with bounded expansion as a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, the greatest reduced average density (grad) of G with rank…
In this paper, a construction of complete permutation polynomials over finite fields of even characteristic proposed by Tu et al. recently is generalized in a recursive manner. Besides, several classes of complete permutation polynomials…
We prove two "master" convolution theorems for multivariate determinantal polynomials. The methods used include basic properties of what we call a "minor-orthogonal" ensemble as well as properties of the mixed discriminant of matrices. We…
In this paper, we present grammatical descriptions of several polynomials associated with Eulerian polynomials, including q-Eulerian polynomials, alternating run polynomials and derangement polynomials. As applications, we get several…
A polynomial is expansive if all of its roots lie outside the unit circle. We define some special determinants involving the coefficients of a real polynomial and formulate necessary and sufficient conditions for expansivity using these…
We investigate when a computable automorphism of a computable field can be effectively extended to a computable automorphism of its (computable) algebraic closure. We then apply our results and techniques to study effective embeddings of…