English
Related papers

Related papers: Efficiently and Effectively Recognizing Toricity o…

200 papers

We describe a generalization of the group testing problem termed symmetric group testing. Unlike in classical binary group testing, the roles played by the input symbols zero and one are "symmetric" while the outputs are drawn from a…

Information Theory · Computer Science 2011-08-16 Amin Emad , Jun Shen , Olgica Milenkovic

We prove a general representation stability result for polynomial coefficient systems which lets us prove representation stability and secondary homological stability for many families of groups with polynomial coefficients. This gives two…

Algebraic Topology · Mathematics 2021-06-22 Jeremy Miller , Peter Patzt , Dan Petersen

We describe a class of affine toric varieties $V$ that are set-theoretically minimally defined by codim $V+1$ binomial equations over fields of any characteristic.

Algebraic Geometry · Mathematics 2007-05-23 Margherita Barile

In this paper, we prove that: For any given finitely many distinct points $P_1,...,P_r$ and a closed subvariety $S$ of codimension $\geq 2$ in a complete toric variety over a uncountable (characteristic 0) algebraically closed field, there…

Algebraic Geometry · Mathematics 2009-05-12 Yifei Chen , Vyacheslav Shokurov

A theory of modules over posets is developed to define computationally feasible, topologically interpretable data structures, in terms of birth and death of homology classes, for persistent homology with multiple real parameters. To replace…

Algebraic Topology · Mathematics 2020-08-13 Ezra Miller

This is a note from a series of lectures at Encuentro Colombiano de Computacion Cuantica, Universidad de los Andes, Bogota, Colombia, 2015. The purpose is to introduce additive quantum error correcting codes, with emphasis on the use of…

Quantum Physics · Physics 2019-04-01 Jeongwan Haah

We consider the problem of testing whether an unknown $n$-qubit quantum state $|\psi\rangle$ is a stabilizer state, with only single-copy access. We give an algorithm solving this problem using $O(n)$ copies, and conversely prove that…

Quantum Physics · Physics 2025-07-25 Marcel Hinsche , Jonas Helsen

We present a new method for solving symbolically zero--dimensional polynomial equation systems in the affine and toric case. The main feature of our method is the use of problem adapted data structures: arithmetic networks and…

alg-geom · Mathematics 2008-02-03 M. Giusti , J. Heintz , J. E. Morais , J. Morgenstern , L. M. Pardo

We consider the problem of counting the number of varieties in a family over a number field which contain a rational point. In particular, for products of Brauer-Severi varieties and closely related counting functions associated to Brauer…

Number Theory · Mathematics 2016-05-16 Daniel Loughran

We extend classical methods of computational complexity to the realm of distributed computing, where they sometimes prove more effective than in their original context. Our focus is on decision problems in the LOCAL model, a setting in…

Distributed, Parallel, and Cluster Computing · Computer Science 2025-09-08 Fabian Reiter

Toric varieties are perhaps the most accessible class of algebraic varieties. They often arise as varieties parameterized by monomials, and their structure may be completely understood through objects from geometric combinatorics. While…

Algebraic Geometry · Mathematics 2024-01-17 Frank Sottile

The inevitable presence of decoherence effects in systems suitable for quantum computation necessitates effective error-correction schemes to protect information from noise. We compute the stability of the toric code to depolarization by…

A real symmetric matrix (resp., tensor) is said to be copositive if the associated quadratic (resp., homogeneous) form is greater than or equal to zero over the nonnegative orthant. The problem of detecting their copositivity is NP-hard.…

Optimization and Control · Mathematics 2017-11-13 Jiawang Nie , Zi Yang , Xinzhen Zhang

We investigate means to describe the non-local properties of quantum systems and to test if two quantum systems are locally equivalent. For this we consider quantum systems that consist of several subsystems, especially multiple qubits. We…

Quantum Physics · Physics 2023-11-27 Markus Grassl , Martin Roetteler , Thomas Beth

This paper is the third in a series that researches the Morse Theory, gradient flows, concavity and complexity on smooth compact manifolds with boundary. Employing the local analytic models from \cite{K2}, for \emph{traversally generic…

Geometric Topology · Mathematics 2014-08-11 Gabriel Katz

This paper is a journal counterpart to our FOCS 2021 paper, in which we initiate the study of property testing problems concerning a finite system of relations $E$ between permutations, generalizing the study of stability in permutations.…

Group Theory · Mathematics 2024-07-11 Oren Becker , Alexander Lubotzky , Jonathan Mosheiff

The complexity of a pair $(X,B)$ is an invariant that relates the dimension of $X$, the rank of the group of divisors, and the coefficients of $B$. If the complexity is less than one, then $X$ is a toric variety. We prove that if the…

Algebraic Geometry · Mathematics 2025-04-25 Joshua Enwright , Jennifer Li , José Ignacio Yáñez

Using the existing classification of all alternatives to the measurement postulates of quantum theory we study the properties of bi-partite systems in these alternative theories. We prove that in all these theories the purification…

Quantum Physics · Physics 2018-11-08 Thomas D. Galley , Lluis Masanes

Let $X$ be a smooth projective real algebraic variety. We give new positive and negative results on the problem of approximating a submanifold of the real locus of $X$ by real loci of subvarieties of $X$, as well as on the problem of…

Algebraic Geometry · Mathematics 2024-07-24 Olivier Benoist

We report an ongoing work on clustering algorithms for complex roots of a univariate polynomial $p$ of degree $d$ with real or complex coefficients. As in their previous best subdivision algorithms our root-finders are robust even for…

Symbolic Computation · Computer Science 2019-11-18 Rémi Imbach , Victor Y. Pan