English
Related papers

Related papers: A Gr\"obner basis characterization for chordal com…

200 papers

The set of all perfect matchings of a plane (weakly) elementary bipartite graph equipped with a partial order is a poset, moreover the poset is a finite distributive lattice and its Hasse diagram is isomorphic to $Z$-transformation directed…

Combinatorics · Mathematics 2018-10-18 Xu Wang , Xuxu Zhao , Haiyuan Yao

In this article we produce Groebner bases for the defining ideal of a monomial curve that corresponds to an almost arithmetic sequence of positive integers, correcting previous work of Sengupta,(2003).

Commutative Algebra · Mathematics 2007-05-23 Ibrahim Al-Ayyoub

We characterize some graphs with a Gorenstein edge ideal. In particular, we show that if $G$ is a circulant graph with vertex degree at most four or a circulant graph of the form $C_n(1,\ldots, d)$ for some $d\leq n/2$, then $G$ is…

Commutative Algebra · Mathematics 2024-04-11 Ashkan Nikseresht , Mohammad Reza Oboudi

This extended abstract gives a construction for lifting a Gr\"obner basis algorithm for an ideal in a polynomial ring over a commutative ring R under the condition that R also admits a Gr\"obner basis for every ideal in R.

Commutative Algebra · Mathematics 2023-06-19 Deepak Kapur , Paliath Narendran

We propose an effective algorithm that decides if a prime ideal in a polynomial ring over the complex numbers can be transformed into a toric ideal by a linear automorphism of the ambient space. If this is the case, the algorithm computes…

Commutative Algebra · Mathematics 2025-09-18 Thomas Kahle , Julian Vill

We show that for any countable homogeneous ordered graph $G$, the conjugacy problem for automorphisms of $G$ is Borel complete. In fact we establish that each such $G$ satisfies a strong extension property called ABAP, which implies that…

Logic · Mathematics 2019-08-16 Samuel Coskey , Paul Ellis

In this paper, we study a class of toric ideals obtained by using some geometric data of ADE trees which are the minimal resolution graphs of rational surface singularities. We compute explicit Gr\"obner bases for these toric ideals that…

Commutative Algebra · Mathematics 2015-12-09 Gülay Kaya , Pınar Mete , Mesut Şahin

For any finite poset $P$ we have the poset of isotone maps $\text{Hom}(P,\mathbb{N})$, also called $P^{op}$-partitions. To any poset ideal ${\mathcal J}$ in $\text{Hom}(P,\mathbb{N})$, finite or infinite, we associate monomial ideals: the…

Commutative Algebra · Mathematics 2018-04-26 Gunnar Fløystad

Our purpose is to study the family of simple undirected graphs whose toric ideal is a complete intersection from both an algorithmic and a combinatorial point of view. We obtain a polynomial time algorithm that, given a graph $G$, checks…

Commutative Algebra · Mathematics 2015-07-14 Isabel Bermejo , Ignacio García-Marco , Enrique Reyes

This paper investigates the Poisson geometry associated to a cluster algebra over the complex numbers, and its relationship to compatible torus actions. We show, under some assumptions, that each Noetherian cluster algebra has only finitely…

Representation Theory · Mathematics 2012-03-01 Sebastian Zwicknagl

We associate to each synchronous game an algebra whose representations determine if the game has a perfect deterministic strategy, perfect quantum strategy or one of several other perfect strategies. when applied to the graph coloring game,…

Operator Algebras · Mathematics 2017-03-06 William Helton , Kyle P. Meyer , Vern I. Paulsen , Matthew Satriano

We study the problem when an ideal generated by adjacent 2-minors is the toric ideal of a finite graph.

Commutative Algebra · Mathematics 2014-05-15 Hidefumi Ohsugi , Takayuki Hibi

As the binomial edge ideal of a graph is always generated by homogeneous quadratic polynomials corresponding to the edges of the graph, the question of when a binomial edge ideal defines a Koszul algebra has been studied by many authors…

Commutative Algebra · Mathematics 2026-01-22 Adam LaClair , Matthew Mastroeni , Jason McCullough , Irena Peeva

A geometric graph is a simple graph G together with a straight line drawing of G in the plane with the vertices in general position. Two geometric realizations of a simple graph are geo-isomorphic if there is a vertex bijection between them…

Combinatorics · Mathematics 2024-06-13 Sally Cockburn , Yonghyun Song

When $\mathcal{C}$ is a chordal clutter in the sense of Woodroofe or Emtander, we show that the complement clutter is edgewise strongly shellable. When $\mathcal{C}$ is indeed a finite simple graph, we study various characterizations of…

Combinatorics · Mathematics 2016-04-20 Jin Guo , Yi-Huang Shen , Tongsuo Wu

This paper is concerned with structures of general graphs with perfect matchings. We first reveal a partially ordered structure among factor-components of general graphs with perfect matchings. Our second result is a generalization of…

Discrete Mathematics · Computer Science 2013-03-26 Nanao Kita

Comparability graphs are graphs which have transitive orientations. The dimension of a poset is the least number of linear orders whose intersection gives this poset. The dimension ${\rm dim}(X)$ of a comparability graph $X$ is the…

Discrete Mathematics · Computer Science 2015-06-17 Pavel Klavík , Peter Zeman

A classic theorem by Steinitz states that a graph G is realizable by a convex polyhedron if and only if G is 3-connected planar. Zonohedra are an important subclass of convex polyhedra having the property that the faces of a zonohedron are…

Computational Geometry · Computer Science 2008-11-04 Muhammad Abdullah Adnan , Masud Hasan

This paper investigates the rational Betti numbers of real toric manifolds associated with chordal nestohedra. We consider the poset topology of a specific poset induced from a chordal building set, and show its EL-shellability. Based on…

Algebraic Topology · Mathematics 2026-04-17 Suyoung Choi , Younghan Yoon

In this paper, we draw a connection between ideal lattices and Gr\"{o}bner bases in the multivariate polynomial rings over integers. We study extension of ideal lattices in $\mathbb{Z}[x]/\langle f \rangle$ (Lyubashevsky \& Micciancio,…

Symbolic Computation · Computer Science 2017-10-10 Maria Francis , Ambedkar Dukkipati