Related papers: Problems around polynomials - the good, the bad an…
This is an update of my problem list.
The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…
In this paper we consider linear combinations of two trivariate homogeneous polynomials of second degree. We formulate and solve two problems: i) Characterization of polynomials for which all linear combinations are factorizable. ii) How…
We tabulate polynomials in Z[t] with a given factorization partition, bad reduction entirely within a given set of primes, and satisfying auxiliary conditions associated to 0, 1, and infinity. We explain how these sets of polynomials are of…
We study several related problems on polynomials with integer coefficients. This includes the integer Chebyshev problem, and the Schur problems on means of algebraic numbers. We also discuss interesting applications to approximation by…
A number of unsolved problems and open questions about the nature and the properties of supernovae are identified and briefly discussed. Some suggestions and directions toward possible solutions are also considered.
This paper addresses the problem of deciding the lower-boundedness of an arbitrary real polynomial p in n variables.
In this article we give a survey on open problems and conjectures concerning L^2-invariants. We cover the whole portfolio and not only certain aspects as they are considered in the previous more specialized (and within their scope more…
We present a list of open questions in the theory of holomorphic foliations, possibly with singularities. Some problems have been around for a while, others are very accessible.
This note is an introduction to the properties of stable polynomials in several variables with real or complex coefficients. These polynomials are defined in terms of where the polynomial is non-vanishing. We do not cover well-known topics…
Answering a question of Haugland, we show that the pooling problem with one pool and a bounded number of inputs can be solved in polynomial time by solving a polynomial number of linear programs of polynomial size. We also give an overview…
We prove that the Eulerian polynomial satisfies certain polynomial congruences. Furthermore, these congruences characterize the Eulerian polynomial.
In this paper, we study some properties of associated sequaences in umbral calculus. From these properties, we derive new and interesting identities of several kinds of polynomials.
We announce numerous new results in the theory of orthogonal polynomials on the unit circle.
Polynomials related to rational solutions of Painleve' equations satisfy certain difference equations. Conditions are given to acertain that all solutions really are polynomials.
We define generalized bivariate polynomials, from which upon specification of initial conditions the bivariate Fibonacci and Lucas polynomials are obtained. Using essentially a matrix approach we derive identities and inequalities that in…
We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed. For the optimization of an…
Problems in additive number theory related to sum and difference sets, more general binary linear forms, and representation functions of additive bases for the integers and nonnegative integers.
Over 300 sequences and many unsolved problems and conjectures related to them are presented herein together with theorems corollaries, formulae, examples, mathematical criteria, etc. (about integer sequences, numbers, quotients, residues,…
In this paper, we consider higher-order Bernoulli and poly-Bernoulli mixed type polynomials and we give some interesting identities of those polynomials arising from umbral calculus.