Related papers: On a Generalization of the van der Waerden Theorem

Let A be an nxn (entrywise) positive matrix and let f(t)=det(I-t A). We prove that there always exists a positive integer N such that 1-f(t)^{1/N} has positive coefficients.

We consider properties of polynomials with coefficients in division rings. A theorem on the decomposition of a polynomial with coefficients in an arbitrary division ring is obtained. It is shown that if a non-central element is not a root…

Let $A$ be a $W$-algebra over a field $F$ of characteristic zero, where $W$ is any $F$-algebra. We first develop a comprehensive theory of generalized identities independent of the algebraic structure of $W$, using the multiplier algebra of…

We develop a polynomial analogue of Meinardus' Thoerem for bivariate Euler products and apply it to the study of complex multiplicatively weighted partitions.

We compute two parametric determinants in which rows and columns are indexed by compositions, where in one determinant the entries are products of binomial coefficients, while in the other the entries are products of powers. These results…

We prove a stronger version of Jarden's Theorem for recurrence of powers of recursive functions

We study the equipotential surfaces around of a two particle system in 3-d under a pairwise good potential as the one of Van der Waals. The level sets are completely determined by the solutions of polynomials of at most fourth degree that…

We consider here a particular quadratic equation linking two elements of a C-Algebra. By analysing powers of the unknowns, it appears a double sequence of polynomials related to classical Bernoulli polynomials. We get the generating…

Given finitely many consecutive terms of an infinite sequence, we discuss the construction of a polynomial difference equation that the sequence may satisfy. We also present a method to seek a candidate polynomial differential equation for…

We investigate algebraic and arithmetic properties of a class of sequences of sparse polynomials that have binomial coefficients both as exponents and as coefficients. In addition to divisibility and irreducibility results we also consider…

A classical theorem of P. McMullen describes all valuations on polytopes that are invariant under translations and weakly continuous, i.e., continuous with respect to parallel displacements of the facets of a polytope. While it is typically…

This extended abstract gives a construction for lifting a Gr\"obner basis algorithm for an ideal in a polynomial ring over a commutative ring R under the condition that R also admits a Gr\"obner basis for every ideal in R.

In this paper, we tackle the following problem: compute the gcd for several univariate polynomials with parametric coefficients. It amounts to partitioning the parameter space into ``cells'' so that the gcd has a uniform expression over…

A well-known generalisation of positional numeration systems is the case where the base is the residue class of $x$ modulo a given polynomial $f(x)$ with coefficients in (for example) the integers, and where we try to construct finite…

We study content ideals of polynomials and their behavior under multiplication. We give a generalization of the Lemma of Dedekind-Mertens and prove the converse under suitable dimensionality restrictions.

We answer a number of questions of Erd\H{o}s on the existence of arithmetic progressions in $k$-full numbers (i.e. integers with the property that every prime divisor necessarily occurs to at least the $k$-th power). Further, we deduce a…

We look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{\kappa \ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding…

Power series are introduced that are simultaneously convergent for all real and p-adic numbers. Our expansions are in some aspects similar to those of exponential, trigonometric, and hyperbolic functions. Starting from these series and…

Linear differential equations of arbitrary order with polynomial coefficients are considered. Specifically, necessary and sufficient conditions for the existence of polynomial solutions of a given degree are obtained for these equations. An…

The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…