Related papers: Complexity and speed of semi-algebraic multi-persi…
We give the first sorting algorithm with bounds in terms of higher-order entropies: let $S$ be a sequence of length $m$ containing $n$ distinct elements and let (H_\ell (S)) be the $\ell$th-order empirical entropy of $S$, with (n^{\ell + 1}…
The Massively Parallel Computation (MPC) model serves as a common abstraction of many modern large-scale data processing frameworks, and has been receiving increasingly more attention over the past few years, especially in the context of…
Let $\mathrm{R}$ be a real closed field. The problem of obtaining tight bounds on the Betti numbers of semi-algebraic subsets of $\mathrm{R}^k$ in terms of the number and degrees of the defining polynomials has been an important problem in…
If a sparse semidefinite program (SDP), specified over $n\times n$ matrices and subject to $m$ linear constraints, has an aggregate sparsity graph $G$ with small treewidth, then chordal conversion will sometimes allow an interior-point…
Quantum computers can sometimes exponentially outperform classical ones, but only for problems with sufficient structure. While it is well known that query problems with full permutation symmetry can have at most polynomial quantum speedup…
We introduce an algebraicity criteria. It has the following form: under certain conditions, an analytic subvariety of some algebriac variety over a global field $K$, if it contains many $K$-points, then it is algebraic over $K.$ This gives…
Let $\RR$ be a real closed field (e.g. the field of real numbers) and $\mathscr{S} \subset \RR^n$ be a semi-algebraic set defined as the set of points in $\RR^n$ satisfying a system of $s$ equalities and inequalities of multivariate…
The symmetric simple exclusion process (SEP), where diffusive particles cannot overtake each other, is a paradigmatic model of transport in the single-file geometry. In this model, the study of currents has attracted a lot of attention, but…
In this paper, we introduce a new class of nonsmooth convex functions called SOS-convex semialgebraic functions extending the recently proposed notion of SOS-convex polynomials. This class of nonsmooth convex functions covers many common…
Let $\mathrm{R}$ be a real closed field and $\mathrm{D} \subset \mathrm{R}$ an ordered domain. We consider the algorithmic problem of computing the generalized Euler-Poincar\'e characteristic of real algebraic as well as semi-algebraic…
This paper studies how to solve semi-infinite polynomial programming (SIPP) problems by semidefinite relaxation method. We first introduce two SDP relaxation methods for solving polynomial optimization problems with finitely many…
Let $R$ be a real closed field. We consider basic semi-algebraic sets defined by $n$-variate equations/inequalities of $s$ symmetric polynomials and an equivariant family of polynomials, all of them of degree bounded by $2d < n$. Such a…
Consider the problem of minimizing a lower semi-continuous semi-algebraic function $f \colon \mathbb{R}^n \to \mathbb{R} \cup \{+\infty\}$ on an unbounded closed semi-algebraic set $S \subset \mathbb{R}^n.$ Employing adequate tools of…
Persistent homology encodes the evolution of homological features of a multifiltered cell complex in the form of a multigraded module over a polynomial ring, called a multiparameter persistence module, and quantifies it through invariants…
The time-harmonic Maxwell equations at high wavenumber k in domains with an analytic boundary and impedance boundary conditions are considered. A wavenumber-explicit stability and regularity theory is developed that decomposes the solution…
We present the first rigorous convergence analysis of the smoothed adaptive finite element method (S-AFEM) proposed in [Mulita, Giani, Heltai: SIAM J. Sci. Comput. 43, 2021]. S-AFEM modifies the classical adaptive finite element method…
We prove general results about separation and weak$^\#$-convergence of boundedly finite measures on separable metric spaces and Souslin spaces. More precisely, we consider an algebra of bounded real-valued, or more generally a $*$-algebra…
In this paper, we present a novel approach to synthesize invariant clusters for polynomial programs. An invariant cluster is a set of program invariants that share a common structure, which could, for example, be used to save the needs for…
We propose a sparse algebra for samplet compressed kernel matrices, to enable efficient scattered data analysis. We show the compression of kernel matrices by means of samplets produces optimally sparse matrices in a certain S-format. It…
Persistent homology tracks topological features across geometric scales, encoding birth and death of cycles as barcodes. We develop a complementary theory where the filtration parameter is algebraic precision rather than geometric scale.…