Search arXiv⌕ Search

arXiv subjects

Rekha R. Thomas

Publications and source records attributed to Rekha R. Thomas.

50 records · Page 3Linked to original sources
arXiv2009

Small Chvatal rank

We propose a variant of the Chvatal-Gomory procedure that will produce a sufficient set of facet normals for the integer hulls of all polyhedra {xx : Ax <= b} as b varies. The number of steps needed is called the small Chvatal rank (SCR) of A. We characterize matrices for which SCR is zero via the notion of supernormality which generalizes unimodularity. SCR is studied in the context of the stable set problem in a graph, and we show that many of the well-known facet normals of the stable set polytope appear in at most two rounds of our procedure. Our results reveal a uniform hypercyclic structure behind the normals of many complicated facet inequalities in the literature for the stable set polytope. Lower bounds for SCR are derived both in general and for polytopes in the unit cube.

math.OC↗
arXiv2009

Theta Bodies for Polynomial Ideals

Inspired by a question of Lovász, we introduce a hierarchy of nested semidefinite relaxations of the convex hull of real solutions to an arbitrary polynomial ideal, called theta bodies of the ideal. For the stable set problem in a graph, the first theta body in this hierarchy is exactly Lovász's theta body of the graph. We prove that theta bodies are, up to closure, a version of Lasserre's relaxations for real solutions to ideals, and that they can be computed explicitly using combinatorial moment matrices. Theta bodies provide a new canonical set of semidefinite relaxations for the max cut problem. For vanishing ideals of finite point sets, we give several equivalent characterizations of when the first theta body equals the convex hull of the points. We also determine the structure of the first theta body for all ideals.

math.OC↗
arXiv2007

Moduli of McKay quiver representations II: Groebner basis techniques

In this paper we introduce several computational techniques for the study of moduli spaces of McKay quiver representations, making use of Groebner bases and toric geometry. For a finite abelian group G in GL(n,k), let Y_θbe the coherent component of the moduli space of θ-stable representations of the McKay quiver. Our two main results are as follows: we provide a simple description of the quiver representations corresponding to the torus orbits of Y_θ, and, in the case where Y_θequals Nakamura's G-Hilbert scheme, we present explicit equations for a cover by local coordinate charts. The latter theorem corrects the first result from [Nakamura]. The techniques introduced here allow experimentation in this subject and give concrete algorithmic tools to tackle further open questions. To illustrate this point, we present an example of a nonnormal G-Hilbert scheme, thereby answering a question raised by Nakamura.

math.AG↗
arXiv2006

Moduli of McKay quiver representations I: the coherent component

For a finite abelian group G in GL(n,k), we describe the coherent component Y_theta of the moduli space M_theta of theta-stable McKay quiver representations. This is a not-necessarily-normal toric variety that admits a projective birational morphism to A^n/G obtained by variation of GIT quotient. As a special case, this gives a new construction of Nakamura's G-Hilbert scheme that avoids the (typically highly singular) Hilbert scheme of |G|-points in A^n. To conclude, we describe the toric fan of Y_theta and hence calculate the quiver representation corresponding to any point of Y_theta.

math.AG↗
arXiv2005

Nice Initial Complexes of Some Classical Ideals

This is a survey article on Gorenstein initial complexes of extensively studied ideals in commutative algebra and algebraic geometry. These include defining ideals of Segre and Veronese varieties, toric deformations of flag varieties known as Hibi ideals, determinantal ideals of generic matrices of indeterminates, and ideals generated by Pfaffians of generic skew symmetric matrices. We give a summary of recent work on the construction of squarefree Gorenstein initial ideals of these ideals when the ideals are themselves Gorenstein. We also present our own independent results for the Segre, Veronese, and some determinantal cases.

math.AC↗
arXiv2005

Computing Groebner Fans

This paper presents algorithms for computing the Groebner fan of an arbitrary polynomial ideal. The computation involves enumeration of all reduced Groebner bases of the ideal. Our algorithms are based on a uniform definition of the Groebner fan that applies to both homogeneous and non-homogeneous ideals and a proof that this object is a polyhedral complex. We show that the cells of a Groebner fan can easily be oriented acyclically and with a unique sink, allowing their enumeration by the memory-less reverse search procedure. The significance of this follows from the fact that Groebner fans are not always normal fans of polyhedra in which case reverse search applies automatically. Computational results using our implementation of these algorithms in the software package Gfan are included.

math.AC↗
arXiv2005

The Circuit Ideal of a Vector Configuration

The circuit ideal, $\ica$, of a configuration $\A = \{\a_1, ..., \a_n\} \subset \Z^d$ is the ideal generated by the binomials ${\x}^{\cc^+} - {\x}^{\cc^-} \in \k[x_1, ..., x_n]$ as $\cc = \cc^+ - \cc^- \in \Z^n$ varies over the circuits of $\A$. This ideal is contained in the toric ideal, $\ia$, of $\A$ which has numerous applications and is nontrivial to compute. Since circuits can be computed using linear algebra and the two ideals often coincide, it is worthwhile to understand when equality occurs. In this paper we study $\ica$ in relation to $\ia$ from various algebraic and combinatorial perspectives. We prove that the obstruction to equality of the ideals is the existence of certain polytopes. This result is based on a complete characterization of the standard pairs/associated primes of a monomial initial ideal of $\ica$ and their differences from those for the corresponding toric initial ideal. Eisenbud and Sturmfels proved that $\ia$ is the unique minimal prime of $\ica$ and that the embedded primes of $\ica$ are indexed by certain faces of the cone spanned by $\A$. We provide a necessary condition for a particular face to index an embedded prime and a partial converse. Finally, we compare various polyhedral fans associated to $\ia$ and $\ica$. The Gröbner fan of $\ica$ is shown to refine that of $\ia$ when the codimension of the ideals is at most two.

math.AC↗
arXiv2005

Reverse Lexicographic and Lexicographic Shifting

A short new proof of the fact that all shifted complexes are fixed by reverse lexicographic shifting is given. A notion of lexicographic shifting, $Δ_{\lex}$ -- an operation that transforms a monomial ideal of $S=\field[x_i: i\in\N]$ that is finitely generated in each degree into a squarefree strongly stable ideal -- is defined and studied. It is proved that (in contrast to the reverse lexicographic case) a squarefree strongly stable ideal $I\subset S$ is fixed by lexicographic shifting if and only if $I$ is a universal squarefree lexsegment ideal (abbreviated USLI) of $S$. Moreover, in the case when $I$ is finitely generated and is not a USLI, it is verified that all the ideals in the sequence $\{Δ_{\lex}^i(I)\}_{i=0}^{\infty}$ are distinct. The limit ideal $\barΔ(I)=\lim_{i\to\infty}Δ_{\lex}^i(I)$ is well defined and is a USLI that depends only on a certain analog of the Hilbert function of $I$.

math.CO↗
arXiv2003

Toric Initial Ideals of $Δ$-Normal Configurations: Cohen-Macaulayness and Degree Bounds

A normal (respectively, graded normal) vector configuration $A$ defines the toric ideal $I_A$ of a normal (respectively, projectively normal) toric variety. These ideals are Cohen-Macaulay, and when $A$ is normal and graded, $I_A$ is generated in degree at most the dimension of $I_A$. Based on this, Sturmfels asked if these properties extend to initial ideals -- when $A$ is normal, is there an initial ideal of $I_A$ that is Cohen-Macaulay, and when $A$ is normal and graded, does $I_A$ have a Gröbner basis generated in degree at most $dim(I_A)$ ? In this paper, we answer both questions positively for $Δ$-normal configurations. These are normal configurations that admit a regular triangulation $Δ$ with the property that the subconfiguration in each cell of the triangulation is again normal. Such configurations properly contain among them all vector configurations that admit a regular unimodular triangulation. We construct non-trivial families of both $Δ$-normal and non-$Δ$-normal configurations.

math.AC↗
arXiv2002

The toric Hilbert scheme of a rank two lattice is smooth and irreducible

The toric Hilbert scheme of a lattice L in Z^n is the multigraded Hilbert scheme parameterizing all ideals in k[x_1,...,x_n] with Hilbert function value one for every degree in the grading monoid N^n/L. In this paper we show that if L is two-dimensional, then the toric Hilbert scheme of L is smooth and irreducible. This result is false for lattices of dimension three and higher as the toric Hilbert scheme of a rank three lattice can be reducible.

math.AG↗
arXiv2001

Gomory Integer Programs

The set of all group relaxations of an integer program contains certain special members called Gomory relaxations. A family of integer programs with a fixed coefficient matrix and cost vector but varying right hand sides is a Gomory family if every program in the family can be solved by one of its Gomory relaxations. In this paper, we characterize Gomory families. Every TDI system gives a Gomory family, and we construct Gomory families from matrices whose columns form a Hilbert basis for the cone they generate. The existence of Gomory families is related to the Hilbert covering problems that arose from the conjectures of Sebo. Connections to commutative algebra are outlined at the end.

math.OC↗
arXiv2000

Algorithms for the Toric Hilbert Scheme

The toric Hilbert scheme parametrizes all algebras isomorphic to a given semigroup algebra as a multigraded vectorspace. All components of the scheme are toric varieties, and among them, there is a fairly well understood coherent component. However, it is unknown whether toric Hilbert schemes are always connected. In this chapter we illustrate the use of Macaulay 2 for exploring the structure of toric Hilbert schemes. In the process we will encounter algorithms from commutative algebra, algebraic geometry, polyhedral theory and geometric combinatorics.

math.AG↗
arXiv1999

Combinatorics of the toric Hilbert scheme

The toric Hilbert scheme is a parameter space for all ideals with the same multi-graded Hilbert function as a given toric ideal. Unlike the classical Hilbert scheme, it is unknown whether toric Hilbert schemes are connected. We construct a graph on all the monomial ideals on the scheme, called the flip graph, and prove that the toric Hilbert scheme is connected if and only if the flip graph is connected. These graphs are used to exhibit curves in P^4 whose associated toric Hilbert schemes have arbitrary dimension. We show that the flip graph maps into the Baues graph of all triangulations of the point configuration defining the toric ideal. Inspired by the recent discovery of a disconnected Baues graph, we close with results that suggest the existence of a disconnected flip graph and hence a disconnected toric Hilbert scheme.

math.AG↗