Related papers: Convex hulls of polynomial Julia sets

This study presents a novel algorithm for identifying the set of extreme points that constitute the exact convex hull of a point set in high-dimensional Euclidean space. The proposed method iteratively solves a sequence of dynamically…

Arithmetic automata recognize infinite words of digits denoting decompositions of real and integer vectors. These automata are known expressive and efficient enough to represent the whole set of solutions of complex linear constraints…

We prove bounds for the absolute sum of all level-$k$ Fourier coefficients for $(-1)^{p(x)}$, where polynomial $p:\mathbf{F}_2^n \to \mathbf{F}_2$ is of degree $1$ or degree $2$.

Given $S= \{v_1, \dots, v_n\} \subset \mathbb{R} ^m$ and $p \in \mathbb{R} ^m$, testing if $p \in conv(S)$, the convex hull of $S$, is a fundamental problem in computational geometry and linear programming. First, we prove a Euclidean {\it…

Let $p(x_1,...,x_n) =\sum_{(r_1,...,r_n) \in I_{n,n}} a_{(r_1,...,r_n)} \prod_{1 \leq i \leq n} x_{i}^{r_{i}}$ be homogeneous polynomial of degree $n$ in $n$ real variables with integer nonnegative coefficients. The support of such…

We show that various identities from [1] and [3] involving Gould-Hopper polynomials can be deduced from the real but also complex orthogonal invariance of multivariate Gaussian distributions. We also deduce from this principle a useful…

We prove constant degree polynomial algorithms cannot optimize pure spherical $p$-spin Hamiltonians beyond the algorithmic threshold $\mathsf{ALG}(p)=2\sqrt{\frac{p-1}{p}}$. The proof goes by transforming any hypothetical such algorithm…

In this paper, we investigate the polyhedral structure of two submodular sets with generalized upper bound (GUB) constraints, which arise as important substructures in various real-world applications. We derive a class of strong valid…

We obtain matching direct and inverse theorems for the degree of weighted $L_p$-approximation by polynomials with the Jacobi weights $(1-x)^\alpha (1+x)^\beta$. Combined, the estimates yield a constructive characterization of various…

The first part of this paper complements previous results on characterization of polynomials of least deviation from zero in Sobolev $p$-norm ($1<p<\infty$) for the case $p=1$. Some relevant examples are indicated. The second part deals…

We relate the combinatorics of Hall-Littlewood polynomials to that of abelian $p$-groups with alternating or Hermitian perfect pairings. Our main result is an analogue of the classical relationship between the Hall algebra of abelian…

We derive necessary and sufficient conditions for an ambiskew polynomial ring to have a Hopf algebra structure of a certain type. This construction generalizes many known Hopf algebras, for example U(sl2), U_q(sl2) and the enveloping…

We study the convex hull property for systems of partial differential equations. This is a generalisation of the maximum principle for a single equation. We show that the convex hull property holds for a class of elliptic and parabolic…

In the present paper we show a dichotomy theorem for the complexity of polynomial evaluation. We associate to each graph H a polynomial that encodes all graphs of a fixed size homomorphic to H. We show that this family is computable by…

We obtain formulae for the numbers of isomorphism and conjugacy classes of non-identity proper subgroups of the groups $G={\rm PSL}_2(p)$, $p$ prime, and for the numbers of those conjugacy classes which do or do not consist of…

We introduce a new problem on the elementary symmetric polynomials $\sigma_k$, stemming from the constraint equations of some modified gravity theory. For which coefficients is a linear combination of $\sigma_k$ $1/p$-concave, with $0 \leq…

Let $p$ be a prime number. The $p$-power cyclic resultant of a polynomial is the determinant of the Sylvester matrix of $t^{p^n}-1$ and the polynomial. It is known that the sequence of $p$-power cyclic resultants and its non-$p$-parts…

We prove Odoni's conjecture in all prime degrees; namely, we prove that for every positive prime $p$, there exists a degree $p$ polynomial $\varphi\in\mathbb{Z}[x]$ with surjective arboreal Galois representation. We also show that Vojta's…

A quadratically constrained quadratic program (QCQP) is an optimization problem in which the objective function is a quadratic function and the feasible region is defined by quadratic constraints. Solving non-convex QCQP to global…

Let $f(x)$ be a monic polynomial in $\dZ[x]$ with no rational roots but with roots in $\dQ_p$ for all $p$, or equivalently, with roots mod $n$ for all $n$. It is known that $f(x)$ cannot be irreducible but can be a product of two or more…