Related papers: Gr\"obner geometry of vertex decompositions and of…
We study a family of determinantal ideals whose decompositions encode the structural zeros in conditional independence models with hidden variables. We provide explicit decompositions of these ideals and, for certain subclasses of models,…
We provide a method for gluing (small) resolutions of singularities of Schubert varieties \(X_w\). An explicit isomorphism of \(X_w\) with an (iterated) bundle is constructed when \(w\) has an (iterated) BP decomposition. Combined with the…
Questions at the intersection of the AdS/CFT correspondence and quantum information theory motivate the study of projectors in sequences of subalgebras of finite-dimensional commutative associative semisimple algebras $\mathcal{A}$,…
Generalized diagonal matrices are matrices that have two ladders of entries that are zero in the upper right and bottom left corners. The minors of generic generalized diagonal matrices have square-free initial ideals. We give a description…
We prove the decomposition of arbitrary diagonal operators into tensor and matrix products of smaller matrices, focusing on the analytic structure of the resulting formulas and their inherent symmetries. Diagrammatic representations are…
The symmetries described by Pin groups are the result of combining a finite number of discrete reflections in (hyper)planes. The current work shows how an analysis using geometric algebra provides a picture complementary to that of the…
Each Gr\"obner stratum of a tropical variety is a connected set of points, all of which induce the same initial subscheme. The Gr\"obner stratification is a coarsening of the decomposition into Gr\"obner polyhedra, and has the advantage…
In this paper we present a new methodology for solving multiobjective integer linear programs using tools from algebraic geometry. We introduce the concept of partial Gr\"obner basis for a family of multiobjective programs where the…
Based on a theorem by Vasconcelos, we give an algorithm for equidimensional decomposition of algebraic sets using syzygy computations via Gr\"obner bases. This algorithm avoids the use of elimination, homological algebra and processing the…
In his seminal Inventiones paper from 1972 Grauert proved the existence of a semiuniversal deformation of an arbitrary complex analytic isolated singularity. For the proof he invented an approximation theorem for solving a system of…
By the geometric Satake isomorphism of Mirkovic and Vilonen, decomposition numbers for reductive groups can be interpreted as decomposition numbers for equivariant perverse sheaves on the complex affine Grassmannian of the Langlands dual…
We present an algebraic method for constructing a highly effective coarse grid correction to accelerate domain decomposition. The coarse problem is constructed from the original matrix and a small set of input vectors that span a low-degree…
In this paper we introduce the notion of evolution rank and give a decomposition of an evolution algebra into its annihilator plus extending evolution subspaces having evolution rank one. This decomposition can be used to prove that in…
Matroid theory provides a unifying framework for studying dependence across combinatorics, geometry, and applications ranging from rigidity to statistics. In this work, we study circuit varieties of matroids, defined by their minimal…
We define a new type of ideal basis called the proper basis that improves both Gr\"obner basis and Buchberger's algorithm. Let $x_1$ be the least variable of a monomial ordering in a polynomial ring $K[x_1,\dotsc,x_n]$ over a field $K$. The…
We show an algorithm that, given an $n$-vertex graph $G$ and a parameter $k$, in time $2^{O(k \log k)} n^{O(1)}$ finds a tree decomposition of $G$ with the following properties: * every adhesion of the tree decomposition is of size at most…
This note constructs the flat toric degeneration of the manifold FL_n of flags in C^n from [Gonciulea-Lakshmibai 96] as an explicit GIT quotient of the Gr"obner degeneration in [Knutson-Miller 03]. This implies that Schubert varieties…
Total degree reverse lexicographic order is currently generally regarded as most often fastest for computing Groebner bases. This article describes an alternate less mysterious algorithm for computing this order using exponent subtotals and…
We study determinantal varieties from conditional independence models with hidden variables, focusing on their irreducible decompositions, dimensions, degrees, and Gr\"obner bases. Each variety encodes a collection of matroids, whose flats…
Matrices can be decomposed via rank-one approximations: the best rank-one approximation is a singular vector pair, and the singular value decomposition writes a matrix as a sum of singular vector pairs. The singular vector tuples of a…