相关论文: A multivariate interlace polynomial

The tree-width of a multivariate polynomial is the tree-width of the hypergraph with hyperedges corresponding to its terms. Multivariate polynomials of bounded tree-width have been studied by Makowsky and Meer as a new sparsity condition…

We present new techniques for reducing a multivariate sparse polynomial to a univariate polynomial. The reduction works similarly to the classical and widely-used Kronecker substitution, except that we choose the degrees randomly based on…

In this paper we consider iterated integrals of multiple polylogarithm functions and prove some explicit relations of multiple polylogarithm functions. Then we apply the relations obtained to find numerous formulas of alternating multiple…

In this paper, we introduce the so-called elliptic Askey-Wilson polynomials which are homogeneous polynomials in two special theta functions. With regard to the significance of polynomials of such kind, we establish some general elliptic…

We show how Viennot's combinatorial theory of orthogonal polynomials may be used to generalize some recent results of Sukumar and Hodges on the matrix entries in powers of certain operators in a representation of su(1,1). Our results link…

For a polynomial in several variables depending on some parameters, we discuss some results to the effect that for almost all values of the parameters the polynomial is irreducible. In particular we recast in this perspective some results…

We study solutions of exponential polynomials over the complex field. Assuming Schanuel's conjecture we prove that certain polynomials have generic solutions in the complex field.

Interpolation theory for complex polynomials is well understood. In the non-commutative quaternionic setting, the polynomials can be evaluated "on the left" and "on the right". If the interpolation problem involves interpolation conditions…

The adjoint polynomial of $G$ is \[h(G,x)=\sum_{k=1}^n(-1)^{n-k}a_k(G)x^k,\] where $a_k(G)$ denotes the number of ways one can cover all vertices of the graph $G$ by exactly $k$ disjoint cliques of $G$. In this paper we show the the adjoint…

Some sorts of generalized morphisms are defined from very basic mathematical objects such as sets, functions, and partial functions. A wide range of mathematical notions such as continuous functions between topological spaces, ring…

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…

We study Laurent polynomials in any number of variables that are sums of at most $k$ monomials. We first show that the Mahler measure of such a polynomial is at least $h/2^{k-2}$, where $h$ is the height of the polynomial. Next, restricting…

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 define and study when a polynomial mapping has a local or global time average. We conjecture that a polynomial f in the complex plane has a time average near a point z if and only if z is eventually mapped into a Siegel-disc of f. We…

The spectrum of the normalized graph Laplacian yields a very comprehensive set of invariants of a graph. In order to understand the information contained in those invariants better, we systematically investigate the behavior of this…

We present new examples of superintegrable matrix/eigenvalue models. These examples arise as a result of the exploration of the relationship between the theory of superintegrability and multivariate orthogonal polynomials. The new…

The classical multidimensional resultant can be defined as the, suitably normalized, generator of a projective elimination ideal in the ring of universal coefficients. This is the approach via the so-called inertia forms or…

The objective of this paper is, in the main, twofold: Firstly, to develop an algebraic setting for dealing with Bell polynomials and related extensions. Secondly, based on the author's previous work on multivariate Stirling polynomials…

A univariate trace polynomial is a polynomial in a variable x and formal trace symbols Tr(x^j). Such an expression can be naturally evaluated on matrices, where the trace symbols are evaluated as normalized traces. This paper addresses…

The notion of multipolynomials was recently introduced and explored by T. Velanga in [10] as an attempt to encompass the theories of polynomials and multi- linear operators. In the present paper we push this subject further, by proving…