Related papers: Irrational mixed decomposition and sharp fewnomial…

For systems of polynomial equations, we study the problem of computing the Newton polytope of their eliminants. As was shown by Esterov and Khovanskii, such Newton polytopes are mixed fiber polytopes of the Newton polytopes of the input…

Using PET and quantitative concatenation techniques, we establish box-norm control with the "expected" directions for counting operators for general multidimensional polynomial progressions, with at most polynomial losses in the parameters.…

We prove a multilevel non-shadow refinement of the Alon--Babai--Suzuki (ABS) nonuniform restricted-intersection theorem. Let $K=\{k_1,\dots,k_r\}$ and let $L$ be a set with $|L|=s$. If $\mathcal{F}\subseteq \bigcup_{k\in K}\binom{[n]}{k}$…

We present an effective method for computing parametric primary decomposition via comprehensive Gr\"obner systems. In general, it is very difficult to compute a parametric primary decomposition of a given ideal in the polynomial ring with…

In this paper it is proved that the ideal $I_w$ of the weak polynomial identities of the superalgebra $M_{1,1}(E)$ is generated by the proper polynomials $[x_1,x_2,x_3]$ and $[x_2,x_1][x_3,x_1][x_4,x_1]$. This is proved for any infinite…

We consider the planar orthogonal polynomial $p_{n}(z)$ with respect to the measure supported on the whole complex plane $${\rm e}^{-N|z|^2} \prod_{j=1}^\nu |z-a_j|^{2c_j}\,{\rm d} A(z)$$ where ${\rm d} A$ is the Lebesgue measure of the…

Minkowski sums are of theoretical interest and have applications in fields related to industrial backgrounds. In this paper we focus on the specific case of summing polytopes as we want to solve the tolerance analysis problem described in…

Polynomial approximations to boolean functions have led to many positive results in computer science. In particular, polynomial approximations to the sign function underly algorithms for agnostically learning halfspaces, as well as…

A new primal-dual weak Galerkin (PD-WG) finite element method was developed and analyzed in this article for first-order linear convection equations in non-divergence form. The PD-WG method results in a symmetric discrete system involving…

The extremal values of multivariate trigonometric polynomials are of interest in fields ranging from control theory to filter design, but finding the extremal values of such a polynomial is generally NP-Hard. In this paper, we develop…

We present methods for bounding infinite-time averages in dynamical systems governed by nonlinear PDEs. The methods rely on auxiliary functionals, which are similar to Lyapunov functionals but satisfy different inequalities. The…

We define certain natural finite sums of $n$'th roots of unity, called $G_P(n)$, that are associated to each convex integer polytope $P$, and which generalize the classical $1$-dimensional Gauss sum $G(n)$ defined over $\mathbb Z/ {n…

We study some discrete invariants of Newton non-degenerate polynomial maps $f : \mathbb{K}^n \to \mathbb{K}^n$ defined over an algebraically closed field of Puiseux series $\mathbb{K}$, equipped with a non-trivial valuation. It is known…

In the class of normalized sine-polynomials $S(t),$ non-negative on $[0,\pi],$ W.Rogosinski and G.Szeg\H{o} 1950 considered a number of extremal problems and proved, among other things, sharp upper and lower estimates for the coefficient…

We study extreme values of Dirichlet polynomials with multiplicative coefficients, namely \[D_N(t) : = D_{f,\, N}(t)= \frac{1}{\sqrt{N}} \sum_{n\leqslant N} f(n) n^{it}, \] where $f$ is a completely multiplicative function with $|f(n)|=1$…

Call a Laurent polynomial $W$ `complete' if its Newton polytope is full-dimensional with zero in its interior. We show that if $W$ is any complete Laurent polynomial with coefficients in the positive part of the field $K$ of generalised…

For fixed compact connected Lie groups H \subseteq G, we provide a polynomial time algorithm to compute the multiplicity of a given irreducible representation of H in the restriction of an irreducible representation of G. Our algorithm is…

It is well-known that every non-negative univariate real polynomial can be written as the sum of two polynomial squares with real coefficients. When one allows a weighted sum of finitely many squares instead of a sum of two squares, then…

We study linear polynomial approximation of functions in weighted Sobolev spaces $W^r_{p,w}(\mathbb{R}^d)$ of mixed smoothness $r \in \mathbb{N}$, and their optimality in terms of Kolmogorov and linear $n$-widths of the unit ball…

Aggregations of flexible loads can provide several power system services through demand response programs, for example load shifting and curtailment. The capabilities of demand response should therefore be represented in system operators'…