Related papers: Efficiently and Effectively Recognizing Toricity o…
In this paper, we present a computational approach to certify almost sure reachability for discrete-time polynomial stochastic systems by turning drift--variant criteria into sum-of-squares (SOS) programs solved with standard semidefinite…
We study quotients of principally polarized abelian varieties with real multiplication by Galois-stable finite subgroups and describe when these quotients are principally polarizable. We use this characterization to provide an algorithm to…
A polynomial complexity algorithm is designed which tests whether a point belongs to a given tropical linear variety.
We classify real Poisson structures on complex toric manifolds of type $(1,1)$ and initiate an investigation of their Poisson cohomology. For smooth toric varieties, such structures are necessarily algebraic and are homogeneous quadratic in…
We explore systems of polynomial equations where we seek complex solutions with absolute value 1. Geometrically, this amounts to understanding intersections of algebraic varieties with tori -- Cartesian powers of the unit circle. We study…
A coset relation algebra is one embeddable into some full coset relation algebra, the latter is an algebra constructed from a system of groups, a coordinated system of isomorphisms between quotients of these groups, and a system of cosets…
We study the motivic Serre invariant of a smoothly bounded algebraic or rigid variety $X$ over a complete discretely valued field $K$ with perfect residue field $k$. If $K$ has characteristic zero, we extend the definition to arbitrary…
We present theory and practice for robust implementations of bivariate Jacobi set and Reeb space algorithms. Robustness is a fundamental topic in computational geometry that deals with the issues of numerical errors and degenerate cases in…
Consider an involution of a smooth projective variety over a field of characteristic not two. We look at the relations between the variety and the fixed locus of the involution from the point of view of cobordism. We show in particular that…
Many combinatorial proofs rely on induction. When these proofs are formulated in traditional language, they can be bulky and unmanageable. Coalgebras provide a language which can reduce reduce many inductive proofs in graded poset theory to…
We describe and analyze a numerical algorithm for computing the homology (Betti numbers and torsion coefficients) of real projective varieties. Here numerical means that the algorithm is numerically stable (in a sense to be made precise).…
We introduce a new family of invariants of real algebraic sets defined in terms of the topology of their complexifications and compute some of these invariants for spheres. This allows us to completely classify topological isomorphism…
We present a fast algorithm for global rigid symmetry detection with approximation guarantees. The algorithm is guaranteed to find the best approximate symmetry of a given shape, to within a user-specified threshold, with very high…
Topological orders can be used as media for topological quantum computing --- a promising quantum computation model due to its invulnerability against local errors. Conversely, a quantum simulator, often regarded as a quantum computing…
Motivated by the study of the secant variety of the Segre-Veronese variety we propose a general framework to analyze properties of the secant varieties of toric embeddings of affine spaces defined by simplicial complexes. We prove that…
Building on the recent computation of the cohomology rings of smooth toric varieties and partial quotients of moment-angle complexes, we investigate the naturality properties of the resulting isomorphism between the cohomology of such a…
In this work, we consider the sample complexity required for testing the monotonicity of distributions over partial orders. A distribution $p$ over a poset is monotone if, for any pair of domain elements $x$ and $y$ such that $x \preceq y$,…
This paper invents the notion of torified varieties: A torification of a scheme is a decomposition of the scheme into split tori. A torified variety is a reduced scheme of finite type over $\Z$ that admits a torification. Toric varieties,…
We study the question of testing structured properties (classes) of discrete distributions. Specifically, given sample access to an arbitrary distribution $D$ over $[n]$ and a property $\mathcal{P}$, the goal is to distinguish between…
The Computational Algebraic Geometry applied in Algebraic Statistics; are beginning to exploring new branches and applications; in artificial intelligence and others areas. Currently, the development of the mathematics is very extensive and…