Related papers: Efficiently and Effectively Recognizing Toricity o…

The toric code can be constructed as a gauge theory of finite groups on oriented two dimensional lattices. Here we construct analogous models with the gauge fields belonging to groupoids, which are categories where every morphism has an…

A classical set of birational invariants of a variety are its spaces of pluricanonical forms and some of their canonically defined subspaces. Each of these vector spaces admits a typical metric structure which is also birationally…

We study the dependence of geometric quantization of the standard symplectic torus on the choice of invariant polarization. Real and mixed polarizations are interpreted as degenerate complex structures. Using a weak version of the equations…

Datasets can be biased due to societal inequities, human biases, under-representation of minorities, etc. Our goal is to certify that models produced by a learning algorithm are pointwise-robust to potential dataset biases. This is a…

Periodic point sets model all solid crystalline materials (crystals) whose atoms can be considered zero-sized points with or without atomic types. This paper addresses the fundamental problem of checking whether claimed crystals are novel,…

In this paper, we consider the problem of deciding the existence of real solutions to a system of polynomial equations having real coefficients, and which are invariant under the action of the symmetric group. We construct and analyze a…

We prove a rigidity theorem for the Poisson automorphisms of the function fields of tori with quadratic Poisson structures over fields of characteristic 0. It gives an effective method for classifying the full Poisson automorphism groups of…

The motivation for this paper is to detect when an irreducible projective variety V is not toric. We do this by analyzing a Lie group and a Lie algebra associated to V. If the dimension of V is strictly less than the dimension of the above…

We describe a new incomplete but terminating method for real root finding for large multivariate polynomials. We take an abstract view of the polynomial as the set of exponent vectors associated with sign information on the coefficients.…

We study strong types and Galois groups in model theory from a topological and descriptive-set-theoretical point of view, leaning heavily on topological dynamical tools. More precisely, we give an abstract (not model theoretic) treatment of…

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…

BosonSampling is the leading candidate for demonstrating quantum computational advantage in photonic systems. While we have recently seen many impressive experimental demonstrations, there is still a formidable distance between the…

We investigate the computational complexity of problems on toric ideals such as normal forms, Gr\"obner bases, and Graver bases. We show that all these problems are strongly NP-hard in the general case. Nonetheless, we can derive efficient…

We develop a principled methodology to infer assortative communities in networks based on a nonparametric Bayesian formulation of the planted partition model. We show that this approach succeeds in finding statistically significant…

The purpose of this paper is to give an explicit formula which allows one to compute the dimension of the cohomology groups of the sheaf $\Omega_{\P}^p(D)$ of p-th differential forms of Zariski twisted by an ample invertible sheaf on a…

The real solutions to a system of sparse polynomial equations may be realized as a fiber of a projection map from a toric variety. When the toric variety is orientable, the degree of this map is a lower bound for the number of real…

We propose a quantum tomography scheme for pure qudit systems which adopts random base measurements and generative learning methods, along with a built-in fidelity estimation approach to assess the reliability of the tomographic states. We…

Following Stolarsky, we say that a natural number n is flimsy in base b if some positive multiple of n has smaller digit sum in base b than n does; otherwise it is sturdy. We develop algorithmic methods for the study of sturdy and flimsy…

Suppose X is the complex zero set of a finite collection of polynomials in Z[x_1,...,x_n]. We show that deciding whether X contains a point all of whose coordinates are d_th roots of unity can be done within NP^NP (relative to the sparse…

<p>We address the general problem of determining the validity of boolean combinations of equalities and inequalities between real-valued expressions. In particular, we consider methods of establishing such assertions using only restricted…