Related papers: Reconstruction of algebraic-exponential data from …
In general dimension, there is no known total polynomial algorithm for either convex hull or vertex enumeration, i.e. an algorithm whose complexity depends polynomially on the input and output sizes. It is thus important to identify…
For a particular experimental design, there is interest in finding which polynomial models can be identified in the usual regression set up. The algebraic methods based on Groebner bases provide a systematic way of doing this. The algebraic…
Polynomial system solving is a classical problem in mathematics with a wide range of applications. This makes its complexity a fundamental problem in computer science. Depending on the context, solving has different meanings. In order to…
We study the set of algebraic objects known as vanishing polynomials (the set of polynomials that annihilate all elements of a ring) over general commutative rings with identity. These objects are of special interest due to their close…
We introduce the broad subclass of algebraic compressed sensing problems, where structured signals are modeled either explicitly or implicitly via polynomials. This includes, for instance, low-rank matrix and tensor recovery. We employ…
We study the convergence of a random iterative sequence of a family of operators on infinite dimensional Hilbert spaces, inspired by the Stochastic Gradient Descent (SGD) algorithm in the case of the noiseless regression, as studied in [1].…
We propose a semi-partitioned Generalized Method of Moments (GMM) framework for analyzing longitudinal data with time-dependent covariates, within a marginal modeling paradigm. This approach addresses limitations of both aggregated and…
Determination of linear combination of exponential functions with unknown rate constants from its sampled values is a problem of considerable interest. Here we present a constructive and explicit solution to this problem. Moments of such…
Given a compact parameter set $Y\subset R^p$, we consider polynomial optimization problems $(P_y$) on $R^n$ whose description depends on the parameter $y\inY$. We assume that one can compute all moments of some probability measure $\phi$ on…
We present an algorithm to solve a system of diagonal polynomial equations over finite fields when the number of variables is greater than some fixed polynomial of the number of equations whose degree depends only on the degree of the…
In the paper we prove for every finite algebra A that either it has the polynomially generated powers (PGP) property, or it has the exponentially generated powers (EGP) property. For idempotent algebras we give a simple criteria for the…
Let us be given two graphs $\Gamma_1$, $\Gamma_2$ of $n$ vertices. Are they isomorphic? If they are, the set of isomorphisms from $\Gamma_1$ to $\Gamma_2$ can be identified with a coset $H\cdot\pi$ inside the symmetric group on $n$…
Let G be a semisimple linear algebraic group defined over rational numbers, K be a maximal compact subgroup of its real points and {\Gamma} be an arithmetic lattice. One can associate a probability measure {\mu}(H) on {\Gamma}\G for each…
This short note gives a sufficient condition for having the class of polynomials dense in the space of square integrable functions with respect to a finite measure dominated by the Lebesgue measure in the real line, here denoted by $L^2$.…
Employing Hilbert-Schmidt measure, we explicitly compute and analyze a number of determinantal product (bivariate) moments |rho|^k |rho^{PT}|^n, k,n=0,1,2,3,..., PT denoting partial transpose, for both generic (9-dimensional) two-rebit…
This paper aims at showing the stability of the recovery of a smooth planar domain with a real algebraic boundary from a finite number of its generalized polarization tensors. It is a follow-up of the work [H. Ammari et al., Math. Annalen,…
Let g be a nonconstant rational map from the projective line to itself that has degree greater than one and is defined over a number field. The map g gives rise to generalized Mahler measures for polynomials in one variable. We use…
Recent results from real algebraic geometry and the theory of polynomial optimization are related in a new framework to the existence question of multivariate tight wavelet frames whose generators have at least one vanishing moment. Namely,…
We present the formula for the number of monic irreducible polynomials of degree $n$ over the finite field $\mathbb F_q$ where the coefficients of $x^{n-1}$ and $x$ vanish for $n\ge3$. In particular, we give a relation between rational…
We propose an efficient meta-algorithm for Bayesian estimation problems that is based on low-degree polynomials, semidefinite programming, and tensor decomposition. The algorithm is inspired by recent lower bound constructions for…