Related papers: Toric geometry of cuts and splits
We address the problem of studying the toric ideals of phylogenetic invariants for a general group-based model on an arbitrary claw tree. We focus on the group $\mathbb Z_2$ and choose a natural recursive approach that extends to other…
We show that the counting of rational curves on a complete toric variety that are in general position to the toric prime divisors coincides with the counting of certain tropical curves. The proof is algebraic-geometric and relies on…
The universal Gr\"{o}bner basis of $I$, is a Gr\"{o}bner basis for $I$ with respect to all term orders simultaneously. Let $I_G$ be the toric ideal of a graph $G$. We characterize in graph theoretical terms the elements of the universal…
Computational topology is an area that revisits topological problems from an algorithmic point of view, and develops topological tools for improved algorithms. We survey results in computational topology that are concerned with graphs drawn…
A graph is a data structure composed of dots (i.e. vertices) and lines (i.e. edges). The dots and lines of a graph can be organized into intricate arrangements. The ability for a graph to denote objects and their relationships to one…
The parametric geometry of numbers has allowed to visualize the simultaneous approximation properties of a collection of real numbers through the combined graph of the related successive minima functions. Several inequalities among…
The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…
Let G be a finite simple graph. In this paper we will show that the binomial edge ideal of G, JG is toric if and only if each connected component of G is complete and in this case it is the sum of toric ideal associated to bipartite…
We explore the positive geometry of statistical models in the setting of toric varieties. Our focus lies on models for discrete data that are parameterized in terms of Cox coordinates. We develop a geometric theory for computations in…
We study topological group theoretic properties of algebraic groups over local fields. In particular, we find conditions under which such groups have closed images under arbitrary continuous homomorphisms into arbitrary topological groups.
The interaction between combinatorics and algebraic and differential geometry is very strong. While researching a problem of Hessian topology, we came across a series of identities of binomial coefficients, which are useful for proving a…
We characterize all graphs whose binomial edge ideals have pure resolutions. Moreover, we introduce a new switching of graphs which does not change some algebraic invariants of graphs, and using this, we study the linear strand of the…
In this paper we examine some natural ideal conditions and show how graphs can be defined that give a visualization of these conditions. We examine the interplay between the multiplicative ideal theory and the graph theoretic structure of…
Tropical mathematics is used to establish a correspondence between certain microscopic and macroscopic objects in statistical models. Tropical algebra gives a common framework for macrosystems (subsets) and their elementary constituents…
We define and study analogs of curve graphs for infinite type surfaces. Our definitions use the geometry of a fixed surface and vertices of our graphs are infinite multicurves which are bounded in both a geometric and a topological sense.…
We consider the set of forms of a toric variety over an arbitrary field: those varieties which become isomorphic to a toric variety after base field extension. In contrast to most previous work, we also consider arbitrary isomorphisms…
There is a natural infinite graph whose vertices are the monomial ideals in a polynomial ring. The definition involves Gr\"obner bases or the action of an algebraic torus. We present algorithms for computing the (affine schemes…
The cut polytope of a graph is an important object in several fields, such as functional analysis, combinatorial optimization, and probability. For example, Sturmfels and Sullivant showed that the toric ideals of cut polytopes are useful in…
The structures of the ideals of Clifford algebras which can be both infinite dimensional and degenerate over the real numbers are investigated.
Let I be a toric ideal. We say I is robust if its universal Groebner basis is a minimal generating set. We show that any robust toric ideal arising from a graph G is also minimally generated by its Graver basis. We then completely…