Related papers: Grassmann and Flag Varieties in Linear Algebra, Op…
Given a probability measure on the unit disk, we study the problem of deciding whether, for some threshold probability, this measure is supported near a real algebraic variety of given dimension and bounded degree. We call this "testing the…
We study an optimization problem with the feasible set being a real algebraic variety $X$ and whose parametric objective function $f_u$ is gradient-solvable with respect to the parametric data $u$. This class of problems includes Euclidean…
This paper aims to focus on Richardson varieties on symplectic groups, especially their combinatorial characterization and defining equations. Schubert varieties and opposite Schubert varieties have profound significance in the study of…
Efficient algorithms for many problems in optimization and computational algebra often arise from casting them as systems of polynomial equations. Blum, Shub, and Smale formalized this as Hilbert's Nullstellensatz Problem $HN_R$: given…
Tur\'an problems in extremal combinatorics ask to find asymptotic bounds on the edge densities of graphs and hypergraphs that avoid specified subgraphs. The theory of flag algebras proposed by Razborov provides powerful methods based on…
We present an algebraic characterization of the complexity classes Logspace and Nlogspace, using an algebra with a composition law based on unification. This new bridge between unification and complexity classes is rooted in proof theory…
The (torsion) complexity of a finite edge-weighted graph is defined to be the order of the torsion subgroup of the abelian group presented by its Laplacian matrix. When G is d-periodic (i.e., G has a free action of the rank-d free abelian…
In the first part of this paper we study geometric formality for generalized flag manifolds, including full flag manifolds of exceptional Lie groups. In the second part we deal with the problem of the classification of invariant almost…
The interplay rich between algebraic geometry and string and gauge theories has recently been immensely aided by advances in computational algebra. However, these symbolic (Gr\"{o}bner) methods are severely limited by algorithmic issues…
Many combinatorial problems can be formulated as a polynomial optimization problem that can be solved by state-of-the-art methods in real algebraic geometry. In this paper we explain many important methods from real algebraic geometry, we…
In 1983, Faltings proved that there are only finitely many abelian varieties over a number field of fixed dimension and with good reduction outside a given set of places. In this paper, we consider the analogous problem for other algebraic…
Recent advances in computer vision and machine learning suggest that a wide range of problems can be addressed more appropriately by considering non-Euclidean geometry. In this paper we explore sparse dictionary learning over the space of…
We report on experience with an investigation of the analytic structure of the solution of certain algebraic complex equations. In particular the behavior of their series expansions around the origin is discussed. The investigation imposes…
Some recent works in machine learning and computer vision involve the solution of a bi-level optimization problem. Here the solution of a parameterized lower-level problem binds variables that appear in the objective of an upper-level…
We use an embedding of the symmetric $d$th power of any algebraic curve $C$ of genus $g$ into a Grassmannian space to give algorithms for working with divisors on $C$, using only linear algebra in vector spaces of dimension $O(g)$, and…
We develop an algebraic version of Cartan method of equivalence or an analog of Tanaka prolongation for the (extrinsic) geometry of curves of flags of a vector space $W$ with respect to the action of a subgroup $G$ of the $GL(W)$. Under…
A proper labeling of a graph is an assignment of integers to some elements of a graph, which may be the vertices, the edges, or both of them, such that we obtain a proper vertex coloring via the labeling subject to some conditions. The…
We identify a fragment of Presburger arithmetic enriched with free function symbols and cardinality constraints for interpreted sets, which is amenable to automated analysis. We establish decidability and complexity results for such a…
Inspired by notorious combinatorial optimization problems on graphs, in this paper we consider a series of related problems defined using a metric space and topology determined by a graph. Particularly, we present the Independent Set,…
The aim of the paper is to discuss the relations between the three kinds of objects named in the title. In a sense, this is a survey of such relations; however, some new directions are also considered. This relates, especially, to sections…