Related papers: Reconstruction of algebraic-exponential data from …

We study algorithmic randomness notions via effective versions of almost-everywhere theorems from analysis and ergodic theory. The effectivization is in terms of objects described by a computably enumerable set, such as lower semicomputable…

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…

There has been significant interest in studying the asymptotics of certain generalised moments, called the moments of moments, of characteristic polynomials of random Haar-distributed unitary and symplectic matrices, as the matrix size $N$…

The main purpose of this paper is to study the NP-complete subset-sum problem, not in the usual context of time-complexity-based classification of the algorithms (exponential/polynomial), but through a new kind of algorithmic classification…

For random matrix ensembles with unitary symmetry, there is interest in the large $N$ form of the moments of the absolute value of the characteristic polynomial for their relevance to the Riemann zeta function on the critical line, and to…

We propose efficient techniques for generating independent identically distributed uniform random samples inside semialgebraic sets. The proposed algorithm leverages recent results on the approximation of indicator functions by polynomials…

Let T(x) in k[x] be a monic non-constant polynomial and write R=k[x] / (T) the quotient ring. Consider two bivariate polynomials a(x, y), b(x, y) in R[y]. In a first part, T = p^e is assumed to be the power of an irreducible polynomial p. A…

Learning from data in the presence of outliers is a fundamental problem in statistics. In this work, we study robust statistics in the presence of overwhelming outliers for the fundamental problem of subspace recovery. Given a dataset where…

This paper introduces and develops the algebraic framework of moment polynomials, which are polynomial expressions in commuting variables and their formal mixed moments. Their positivity and optimization over probability measures supported…

Let $\mathcal S$ be a set of monic degree $2$ polynomials over a finite field and let $C$ be the compositional semigroup generated by $\mathcal S$. In this paper we establish a necessary and sufficient condition for $C$ to be consisting…

Reconstructing an infinite-dimensional signal from a finite set of measurements is a fundamental problem in approximation theory and signal processing. While the generalized sampling (GS) framework provides a robust methodology for…

This paper proposes and analyzes a gradient-type algorithm based on Burer-Monteiro factorization, called the Asymmetric Projected Gradient Descent (APGD), for reconstructing the point set configuration from partial Euclidean distance…

We give an incremental polynomial time algorithm for enumerating the vertices of any polyhedron $\mathcal{P}(A,\mathbf{1})=\{x\in\RR^n \mid Ax\geq \b1,~x\geq \b0\}$, when $A$ is a totally unimodular matrix. Our algorithm is based on…

Standard approaches to probabilistic reasoning require that one possesses an explicit model of the distribution in question. But, the empirical learning of models of probability distributions from partial observations is a problem for which…

Let $V$ be a two-dimensional vector space over a field $\mathbb F$ of characteristic not $2$ or $3$. We show there is a canonical surjection $\nu$ from the set of suitably generic commutative algebra structures on $V$ modulo the action of…

The Waring Problem over polynomial rings asks for how to decompose an homogeneous polynomial of degree $d$ as a finite sum of $d^{th}$ powers of linear forms. First, we give a constructive method to obtain a real Waring decomposition of any…

We study the 'critical moments' of subcritical Gaussian multiplicative chaos (GMCs) in dimensions $d \leq 2$. In particular, we establish a fully explicit formula for the leading order asymptotics, which is closely related to large…

We investigate geometric aspects of co-equational parametric resurgence, by studying physical problems whose formal asymptotic solutions give rise to Borel transforms lying on an algebraic curve. This perspective allows us to elucidate…

We consider the problem of approximating numerically the moments and the supports of measures which are invariant with respect to the dynamics of continuous- and discrete-time polynomial systems, under semialgebraic set constraints. First,…

In this paper, we investigate the sample size requirement for exact recovery of a high order tensor of low rank from a subset of its entries. We show that a gradient descent algorithm with initial value obtained from a spectral method can,…