Related papers: On a Fejer-Riesz factorization of generalized trig…
We define an infinite sequence of generalizations, parametrized by an integer $m \ge 1$, of the Stieltjes--Rogers and Thron--Rogers polynomials; they arise as the power-series expansions of some branched continued fractions, and as the…
In this article, some factorization properties of polynomials over discrete valuation domains are elucidated. These properties along with the notion of Newton index of a polynomial leads to a generalization of the main result proved by…
This paper settles the computational complexity of the problem of integrating a polynomial function f over a rational simplex. We prove that the problem is NP-hard for arbitrary polynomials via a generalization of a theorem of Motzkin and…
Here we introduce a way to construct generalized trigonometric functions associated with any complex polynomials, and the well known trigonometric functions can be seen to associate with polynomial $x^2-1$. We will show that those…
We investigate the mean number of real zeros over an interval $[a,b]$ of a random trigonometric polynomial of the form $\sum_{k=1}^n a_k \cos(kt)+b_k \sin(kt)$ where the coefficients are i.i.d. random variables. Under mild assumptions on…
We study Noether's normalization lemma for finitely generated algebras over a division algebra. In its classical form, the lemma states that if $I$ is a proper ideal of the ring $R=F[t_1,\ldots,t_n]$ of polynomials over a field $F$, then…
This paper surveys recent developments in the sampling discretization of integral and uniform norms for functions in general finite-dimensional spaces. These results generalize the classical Marcinkiewicz-Zygmund inequalities for…
We develop a theory of multiplicities and mixed multiplicities of filtrations, extending the theory for filtrations of $m$-primary ideals to arbitrary (not necessarily Noetherian) filtrations. The mixed multiplicities of $r$ filtrations on…
Using Newton polygons, a key factorization result for polynomials over discrete valuation domains is proved, which in particular yields new irreducibility criteria including a generalization of the classical irreducibility criterion of…
In this note we prove positivity of Maclaurin coefficients of polynomials written in terms of rising factorials and arbitrary log-concave sequences. These polynomials arise naturally when studying log-concavity of rising factorial series.…
Recently, Jack polynomials have been proposed as natural generalizations of Z_k Read-Rezayi states describing non-Abelian fractional quantum Hall systems. These polynomials are conjectured to be related to correlation functions of a class…
Complete monotonicity is a strong positivity property for real-valued functions on convex cones. It is certified by the kernel of the inverse Laplace transform. We study this for negative powers of hyperbolic polynomials. Here the…
We study the problem of representing multivariate polynomials with rational coefficients, which are nonnegative and strictly positive on finite semialgebraic sets, using rational sums of squares. We focus on the case of finite semialgebraic…
These are notes of a talk based on the work arXiv:1212.3630 joint with A. Aizenbud. Let V be a finite-dimensional vector space over a local field F of characteristic 0. Let f be a function on V of the form $f(x)= \psi (P(x))$, where P is a…
We prove two criteria for direct sum decomposability of homogeneous polynomials. For a homogeneous polynomial with a non-zero discriminant, we interpret direct sum decomposability of the polynomial in terms of factorization properties of…
Classes of simple polynomial and simple trigonometric splines given by Fourier series are considered. It is shown that the class of simple trigonometric splines includes the class of simple polynomial splines. For some parameter values, the…
We provide an introduction to logarithmic potential theory in the complex plane that particularly emphasizes its usefulness in the theory of polynomial and rational approximation. The reader is invited to explore the notions of Fekete…
Linearization is a standard approach in the computation of eigenvalues, eigenvectors and invariant subspaces of matrix polynomials and rational matrix value functions. An important source of linearizations are the so called Fiedler…
We show in this paper that after proper scalings, the characteristic polynomial of a random unitary matrix converges almost surely to a random analytic function whose zeros, which are on the real line, form a determinantal point process…
The notion of Ehrhart tensor polynomials, a natural generalization of the Ehrhart polynomial of a lattice polytope, was recently introduced by Ludwig and Silverstein. We initiate a study of their coefficients. In the vector and matrix…