Related papers: Hitting Sets and Reconstruction for Dense Orbits i…

The best known size lower bounds against unrestricted circuits have remained around $3n$ for several decades. Moreover, the only known technique for proving lower bounds in this model, gate elimination, is inherently limited to proving…

We study a family of polynomials which are orthogonal with respect to the varying, highly oscillatory complex weight function $e^{ni\lambda z}$ on $[-1,1]$, where $\lambda$ is a positive parameter. This family of polynomials has appeared in…

We show that if X_n is a variety of cxn-matrices that is stable under the group Sym([n]) of column permutations and if forgetting the last column maps X_n into X_{n-1}, then the number of Sym([n])-orbits on irreducible components of X_n is…

Let $G$ be a compact group of linear transformations of an Euclidean space $V$. The $G$-invariant $C^\infty$ functions can be expressed as $C^\infty$ functions of a finite basic set of $G$-invariant homogeneous polynomials, called an…

We study algebraic complexity classes and their complete polynomials under \emph{homogeneous linear} projections, not just under the usual affine linear projections that were originally introduced by Valiant in 1979. These reductions are…

We study the complexity of the Hitting Set problem in set systems (hypergraphs) that avoid certain sub-structures. In particular, we characterize the classical and parameterized complexity of the problem when the Vapnik-Chervonenkis…

Consider the representations of an algebraic group G. In general, polynomial invariant functions may fail to separate orbits. The invariant subring may not be finitely generated, or the number and complexity of the generators may grow…

We study $\textrm{Sym}(\infty)$-orbit closures of not necessarily closed points in the Zariski spectrum of the infinite polynomial ring $\mathbb{C}[x_{ij}:\, i\in\mathbb{N},\,j\in[n]]$. Among others, we characterize invariant prime ideals…

We study deformations of orbit closures for the action of a connected semisimple group $G$ on its Lie algebra $\mathfrak{g}$, especially when $G$ is the special linear group. The tools we use are on the one hand the invariant Hilbert scheme…

Polynomial factorization is a fundamental problem in computational algebra. Over the past half century, a variety of algorithmic techniques have been developed to tackle different variants of this problem. In parallel, algebraic complexity…

We study several natural instances of the geometric hitting set problem for input consisting of sets of line segments (and rays, lines) having a small number of distinct slopes. These problems model path monitoring (e.g., on road networks)…

We prove super-polynomial lower bounds for low-depth arithmetic circuits using the shifted partials measure [Gupta-Kamath-Kayal-Saptharishi, CCC 2013], [Kayal, ECCC 2012] and the affine projections of partials measure [Garg-Kayal-Saha, FOCS…

A new scheme of first-principles computation for strongly correlated electron systems is proposed. This scheme starts from the local-density approximation (LDA) at high-energy band structure, while the low-energy effective Hamiltonian is…

Starting from de la Vall\'ee Poussin type (VP) interpolation, the authors have recently introduced a family of interpolating polynomial scaling and wavelet bases generating the approximation and detail spaces of a non-standard…

Connecting orbits are important invariant structures in the state space of nonlinear systems and various techniques are designed for their computation. However, a uniform analytic approximation of the whole orbit seems rare. Here, based on…

Let $\Sigma_{g,p}$ be the genus--$g$ oriented surface with $p$ punctures, with either $g>0$ or $p>3$. We show that $MCG(\Sigma_{g,p})/DT$ is acylindrically hyperbolic where $DT$ is the normal subgroup of the mapping class group…

The theory of orthogonal polynomials on the unit circle is developed for a general class of weights leading to systems of recurrence relations and derivatives of the polynomials and their associated functions, and to functional-difference…

We introduce and explore an approach for constructing force fields for small molecules, which combines intuitive low body order empirical force field terms with the concepts of data driven statistical fits of recent machine learned…

The one-dimensional orbit set $\langle F : s \rangle$ is formed by the images of a number $s$ under the action of a semigroup generated by integer affine functions $f_i=a_i x+b_i$ taken from the set $F=\{f_1,\ldots,f_n\}$. P.Erd\H{o}s…

Let G:=SO(n,1)^\circ and \Gamma be a geometrically finite Zariski dense subgroup with critical exponent delta bigger than (n-1)/2. Under a spectral gap hypothesis on L^2(\Gamma \ G), which is always satisfied for delta>(n-1)/2 for n=2,3 and…