English
Related papers

Related papers: Stanley depth and complete $k$-partite hypergraphs

200 papers

Stanley decompositions of multigraded modules $M$ over polynomials rings have been discussed intensively in recent years. There is a natural notion of depth that goes with a Stanley decomposition, called the Stanley depth. Stanley…

Commutative Algebra · Mathematics 2010-10-19 Winfried Bruns , Christian Krattenthaler , Jan Uliczka

In the present note we study Waldschmidt constants of Stanley-Reisner ideals of a hypergraph and a graph with vertices forming a bipyramid over a planar n-gon. The case of the hypergraph has been studied by Bocci and Franci. We reprove…

Algebraic Geometry · Mathematics 2017-04-21 Tomasz Szemberg , Justyna Szpond

A minimum depth d^I(S --> R) is assigned to a ring homomorphism S --> R and a R-R-bimodule I. The recent notion of depth of a subring d(S,R)in a paper by Boltje-Danz-Kuelshammer is recovered when I = R and S --> R is the inclusion mapping.…

Rings and Algebras · Mathematics 2010-12-09 Lars Kadison

A triangulation of a polygon has an associated Stanley-Reisner ideal. We obtain a full algebraic and combinatorial understanding of these ideals, and describe their separated models. More generally we do this for stacked simplicial…

Commutative Algebra · Mathematics 2022-08-30 Gunnar Fløystad , Milo Orlich

Chen, Faudree, Gould, Jacobson, and Lesniak determined the minimum degree threshold for which a balanced $k$-partite graph has a Hamiltonian cycle. We give an asymptotically tight minimum degree condition for Hamiltonian cycles in arbitrary…

Combinatorics · Mathematics 2019-10-10 Louis DeBiasio , Robert A. Krueger , Dan Pritikin , Eli Thompson

We investigate generalized notions of the nerve complex for the facets of a simplicial complex. We show that the homologies of these higher nerve complexes determine the depth of the Stanley-Reisner ring $k[\Delta]$ as well as the…

Combinatorics · Mathematics 2019-01-30 Hailong Dao , Joseph Doolittle , Ken Duna , Bennet Goeckner , Brent Holmes , Justin Lyle

In this article we associate to every lattice ideal $I_{L,\rho}\subset K[x_1,..., x_m]$ a cone $\sigma $ and a graph $G_{\sigma}$ with vertices the minimal generators of the Stanley-Reisner ideal of $\sigma $. To every polynomial $F$ we…

Commutative Algebra · Mathematics 2007-05-23 Anargyros Katsabekis , Marcel Morales , Apostolos Thoma

We show that the Stanley's Conjecture holds for an intersection of three monomial primary ideals of a polynomial algebra S over a field.

Commutative Algebra · Mathematics 2011-07-19 Andrei Zarojanu

Let $I$ be a squarefree monomial ideal of a polynomial algebra over a field minimally generated by $f_1,...,f_r$ of degree $ d\geq 1$, and a set $E$ of monomials of degree $\geq d+1$. Let $J\subsetneq I$ be a squarefree monomial ideal…

Commutative Algebra · Mathematics 2015-06-01 Dorin Popescu

Interval minors of bipartite graphs were recently introduced by Jacob Fox in the study of Stanley-Wilf limits. We investigate the maximum number of edges in $K_{r,s}$-interval minor free bipartite graphs. We determine exact values when…

Combinatorics · Mathematics 2014-08-07 Bojan Mohar , Arash Rafiey , Behruz Tayfeh-Rezaie , Hehui Wu

In this paper,we introduce the monomial ideals I(H) associated to a special class of non uniform hypergraphs H(X; E; d) namely uniformly increasing hypergraphs. These ideals are named as inclusion ideals. In this paper, we discuss some…

Commutative Algebra · Mathematics 2013-09-17 Sarfraz Ahmad , Imran Anwar , Azeem Haider , Amina Inam

In this short note we study two questions about the existence of subgraphs of the hypercube $Q_n$ with certain properties. The first question, due to Erd\H{o}s--Hamburger--Pippert--Weakley, asks whether there exists a bounded degree…

Combinatorics · Mathematics 2019-10-23 Rajko Nenadov , Mehtaab Sawhney , Benny Sudakov , Adam Zsolt Wagner

Let $G$ be a finite graph on the vertex set $[d] = \{1, ..., d \}$ with the edges $e_1, ..., e_n$ and $K[\tb] = K[t_1, ..., t_d]$ the polynomial ring in $d$ variables over a field $K$. The edge ring of $G$ is the semigroup ring $K[G]$ which…

Commutative Algebra · Mathematics 2011-01-24 Takayuki Hibi , Akihiro Higashitani , Kyouko Kimura , Augustine B. O'Keefe

We give an upper bound on the number of perfect matchings in an undirected simple graph $G$ with an even number of vertices, in terms of the degrees of all the vertices in $G$. This bound is sharp if $G$ is a union of complete bipartite…

Combinatorics · Mathematics 2008-03-07 Shmuel Friedland

We study the duality of moduli of k- and (n-k)-dimensional slices of euclidean n-cubes, and establish the optimal upper bound 1.

Metric Geometry · Mathematics 2020-07-08 Atte Lohvansuu

The depth of squarefree powers of a squarefree monomial ideal is introduced. Let $I$ be a squarefree monomial ideal of the polynomial ring $S=K[x_1,\ldots,x_n]$. The $k$-th squarefree power $I^{[k]}$ of $I$ is the ideal of $S$ generated by…

Commutative Algebra · Mathematics 2022-09-19 Nursel Erey , Jürgen Herzog , Takayuki Hibi , Sara Saeedi Madani

Let $G$ and $H$ be $k$-graphs ($k$-uniform hypergraphs); then a perfect $H$-packing in $G$ is a collection of vertex-disjoint copies of $H$ in $G$ which together cover every vertex of $G$. For any fixed $H$ let $\delta(H, n)$ be the minimum…

Combinatorics · Mathematics 2015-09-16 Richard Mycroft

Let $G$ be a simple graph on the vertex set $[n]$ and $J_G$ be the corresponding binomial edge ideal. Let $G=v*H$ be the cone of $v$ on $H$. In this article, we compute all the Betti numbers of $J_G$ in terms of Betti number of $J_H$ and as…

Commutative Algebra · Mathematics 2019-10-07 Arvind Kumar , Rajib Sarkar

The aim of this paper is to give a formula for the Stanley depth of quotient of powers of the path ideal. As a consequence, we establish that the behaivior of the Stanley depth of quotient of powers of the path ideal is the same as a…

Commutative Algebra · Mathematics 2014-09-23 Alin Ştefan

We give an upper bound on the maximal eigenvalue of the adjacency matrix of a connected graph in terms of its maximum degree, diameter and order. This bound is best possible up to a constant factor and improves prevoius results of…

Combinatorics · Mathematics 2007-05-23 Vladimir Nikiforov