English
Related papers

Related papers: Gorenstein cut polytopes

200 papers

Relations between Gorenstein derived categories, Gorenstein defect categories and Gorenstein stable categories are established. Using these, the Gorensteinness of an algebra $A$ and invariants with respect to recollements of the bounded…

Representation Theory · Mathematics 2014-02-14 Nan Gao

Peano partial cubes are the bipartite graphs whose geodesic interval spaces are (closed) join spaces. They are the partial cubes all of whose finite convex subgraphs have a pre-hull number which is at most 1. Special Peano partial cubes are…

Combinatorics · Mathematics 2020-09-02 Norbert Polat

The boxicity of a graph G is defined as the minimum integer k such that G is an intersection graph of axis-parallel k-dimensional boxes. Chordal bipartite graphs are bipartite graphs that do not contain an induced cycle of length greater…

Combinatorics · Mathematics 2009-06-04 L. Sunil Chandran , Mathew C. Francis , Rogers Mathew

A tensor network is a product of tensors associated with vertices of some graph $G$ such that every edge of $G$ represents a summation (contraction) over a matching pair of indexes. It was shown recently by Valiant, Cai, and Choudhary that…

Quantum Physics · Physics 2009-04-16 Sergey Bravyi

We consider a natural combinatorial optimization problem on chordal graphs, the class of graphs with no induced cycle of length four or more. A subset of vertices of a chordal graph is (monophonically) convex if it contains the vertices of…

Data Structures and Algorithms · Computer Science 2018-06-27 Jean Cardinal , Jean-Paul Doignon , Keno Merckx

We study polytopes defined by inequalities of the form $\sum_{i\in I} z_{i}\leq 1$ for $I\subseteq [d]$ and nonnegative $z_i$ where the inequalities can be reordered into a matrix inequality involving a column-convex $\{0,1\}$-matrix. These…

A major open question in the theory of Gorenstein liaison is whether or not every arithmetically Cohen--Macaulay subscheme of $\mathbb{P}^n$ can be G-linked to a complete intersection. Migliore and Nagel showed that, if such a scheme is…

Commutative Algebra · Mathematics 2025-12-22 Sara Faridi , Patricia Klein , Jenna Rajchgot , Alexandra Seceleanu

We prove that any arithmetically Gorenstein curve on a smooth, general hypersurface $X\subset \bbP^{4}$ of degree at least 6, is a complete intersection. This gives a characterisation of complete intersection curves on general type…

Algebraic Geometry · Mathematics 2010-05-24 G. V. Ravindra

In this paper we investigate locally compact semitopological graph inverse semigroups. Our main result is the following: if a directed graph $E$ is strongly connected and contains a finite amount of vertices then a locally compact…

General Topology · Mathematics 2018-06-18 Serhii Bardyla

We determine which bipartite graphs embedded in a torus are move-reduced. In addition, we classify equivalence classes of such move-reduced graphs under square/spider moves. This extends the class of minimal graphs on a torus studied by…

Combinatorics · Mathematics 2022-12-27 Pavel Galashin , Terrence George

Several polytopes arise from finite graphs. For edge and symmetric edge polytopes, in particular, exhaustive computation of the Ehrhart polynomials not merely supports the conjecture of Beck {\it et al.}\ that all roots $\alpha$ of Ehrhart…

Combinatorics · Mathematics 2015-03-13 Tetsushi Matsui , Akihiro Higashitani , Yuuki Nagazawa , Hidefumi Ohsugi , Takayuki Hibi

The characterization of lattice polytopes based upon information about their Ehrhart $h^*$-polynomials is a difficult open problem. In this paper, we finish the classification of lattice polytopes whose $h^*$-polynomials satisfy two…

Combinatorics · Mathematics 2015-03-20 Akihiro Higashitani , Benjamin Nill , Akiyoshi Tsuchiya

In this paper we extend recent results of Fiorini et al. on the extension complexity of the cut polytope and related polyhedra. We first describe a lifting argument to show exponential extension complexity for a number of NP-complete…

Combinatorics · Mathematics 2013-04-30 David Avis , Hans Raj Tiwary

Median graphs are connected graphs in which for all three vertices there is a unique vertex that belongs to shortest paths between each pair of these three vertices. In this paper we provide several novel characterizations of planar median…

Combinatorics · Mathematics 2021-10-19 Carsten R. Seemann , Vincent Moulton , Peter F. Stadler , Marc Hellmuth

An algebra $A$ is left weakly Gorenstein if any semi-Gorenstein-projective left $A$-modules is Gorenstein-projective. The weakly Gorensteinness of two kinds of algebras are answered. Using the method of the monomorphism category, it is…

Representation Theory · Mathematics 2025-12-19 Nan Gao , Pu Zhang , Shijie Zhu

These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…

Group Theory · Mathematics 2021-03-29 Peter J. Cameron

We investigate arithmetic, geometric and combinatorial properties of symmetric edge polytopes. We give a complete combinatorial description of their facets. By combining Gr\"obner basis techniques, half-open decompositions and methods for…

Combinatorics · Mathematics 2019-05-15 Akihiro Higashitani , Katharina Jochemko , Mateusz Michałek

Let $(A,\mathfrak m)$ be a two-dimensional excellent normal Gorenstein local domain containing an algebraically closed filed. Let $I =H^0(X,\mathcal{O}_X(-Z)) \subset A$ be an $\mathfrak m$-primary integrally closed ideal represented by an…

Commutative Algebra · Mathematics 2025-08-26 Tomohiro Okuma , Kei-ichi Watanabe , Ken-ichi Yoshida

The homology of Kontsevich's commutative graph complex parameterizes finite type invariants of odd dimensional manifolds. This {\it graph homology} is also the twisted homology of Outer Space modulo its boundary, so gives a nice point of…

Quantum Algebra · Mathematics 2010-08-25 James Conant , Ferenc Gerlits , Karen Vogtmann

A hole in a graph is an induced subgraph which is a cycle of length at least four. A graph is chordal if it contains no holes. Following McKee and Scheinerman (1993), we define the chordality of a graph $G$ to be the minimum number of…

Combinatorics · Mathematics 2024-04-10 Aristotelis Chaniotis , Babak Miraftab , Sophie Spirkl