Related papers: Algebraic Distance Optimization in Polyhedral Norm…

Solenoids induced by split sequences are introduced, as the inverse limit object of a sequence of fold maps. The topology of a solenoid is explored, and it is established that solenoids have naturally arising singular foliated structures.…

Modelling the substitution of nucleotides along a phylogenetic tree is usually done by a hidden Markov process. This allows to define a distribution of characters at the leaves of the trees and one might be able to obtain polynomial…

We present a low order virtual element discretization for time dependent Maxwell's equations, which allow for the use of general polyhedral meshes. Both the semi- and fully-discrete schemes are considered. We derive optimal a priori…

We consider the classical minimum and maximum cut problems: find a partition of vertices of a graph into two disjoint subsets that minimize or maximize the sum of the weights of edges with endpoints in different subsets. It is known that if…

A polynomial of the form $x^\alpha - p(x)$, where the degree of $p$ is less than the total degree of $x^\alpha$, is said to be least deviation from zero if it has the smallest uniform norm among all such polynomials. We study polynomials of…

Consider the polynomial optimization problem whose objective and constraints are all described by multivariate polynomials. Under some genericity assumptions, %% on these polynomials, we prove that the optimality conditions always hold on…

Many geometric optimization problems can be reduced to finding points in space (centers) minimizing an objective function which continuously depends on the distances from the centers to given input points. Examples are $k$-Means, Geometric…

An important application of distance geometry to biochemistry studies the embeddings of the vertices of a weighted graph in the three-dimensional Euclidean space such that the edge weights are equal to the Euclidean distances between…

Let $d \in \mathbb{N}$, $\delta \in (0, 1/2)$, and $X > 0$. Denote by $N_d(X, \delta)$ the maximum number of points in a subset of the closed Euclidean ball of radius $X$ in $\mathbb{R}^d$ such that every pairwise distance is at least…

We design the conforming virtual element method for the numerical approximation of the two dimensional elastodynamics problem. We prove stability and convergence of the semi-discrete approximation and derive optimal error estimates under…

By discrete trigonometric norming inequalities on subintervals of the period, we construct norming meshes with optimal cardinality growth for algebraic polynomials on sections of sphere, ball and torus.

To every finite metric space $X$, including all connected unweighted graphs with the minimum edge-distance metric, we attach an invariant that we call its blowup-polynomial $p_X(\{ n_x : x \in X \})$. This is obtained from the blowup…

For every compact K\"ahler manifold $X$ of algebraic dimension $a(X) = \dim X - 1$, we prove that $X$ has arbitrarily small deformations to some projective manifolds.

For a metrizable space $X$, we denote by $\mathrm{Met}(X)$ the space of all metric that generate the same topology of $X$. The space $\mathrm{Met}(X)$ is equipped with the supremum distance. In this paper, for every strongly…

Consider an operator that takes the Fourier transform of a discrete measure supported in $\mathcal{X}\subset[-\frac 12,\frac 12)^d$ and restricts it to a compact $\Omega\subset\mathbb{R}^d$. We provide lower bounds for its smallest singular…

Let $K$ be a field and $R=K[x_1,\ldots, x_n]$ be the polynomial ring in $n$ variables over a field $K$. Let $\Delta$ be a simplicial complex on $n$ vertices and $I=I_{\Delta}$ be its Stanley-Reisner ideal. In this paper, we show that if $I$…

Following the success of the so-called algebraic approach to the study of decision constraint satisfaction problems (CSPs), exact optimization of valued CSPs, and most recently promise CSPs, we propose an algebraic framework for valued…

Suppose M is a closed submanifold in a Euclidean ball of sufficiently large dimension. We give an optimal bound on the normal curvatures, guaranteeing that M is a sphere. The border cases consist of Veronese embeddings of the four…

In this paper we study the problem of maximizing the distance to a given point over an intersection of balls. It was already known that this problem can be solved in polynomial time and space if the given point is not in the convex hull of…

Let $\mathrm{R}$ be a real closed field, and $\mathrm{D} \subset \mathrm{R}$ an ordered domain. We describe an algorithm that given as input a polynomial $P \in \mathrm{D} [ X_{1},\ldots,X_{k} ]$, and a finite set, $\mathcal{A}= \{ p_{1},…