English
Related papers

Related papers: Distributive Lattices, Bipartite Graphs and Alexan…

200 papers

Using the recent results on square-free Gr\"obner degenerations by Conca and Varbaro, we proved that if a homogeneous ideal $I$ of a polynomial ring is such that its initial ideal $\mathrm{in}_<(I)$ is square-free and $\beta_0(I) =…

Commutative Algebra · Mathematics 2023-03-31 Hongmiao Yu

For a graph $G$ of order $n$ and with eigenvalues $\lambda_1\geqslant\cdots\geqslant\lambda_n$, the HL-index $R(G)$ is defined as $R(G) ={\max}\left\{|\lambda_{\lfloor(n+1)/2\rfloor}|, |\lambda_{\lceil(n+1)/2\rceil}|\right\}.$ We show that…

Combinatorics · Mathematics 2013-12-11 Bojan Mohar , Behruz Tayfeh-Rezaie

Let $\mathbf D$ be the set of isomorphism types of finite double partially ordered sets, that is sets endowed with two partial orders. On $\BZ\mathbf D$ we define a product and a coproduct, together with an internal product, that is,…

Representation Theory · Mathematics 2011-02-19 Claudia Malvenuto , Christophe Reutenauer

Partial vertex cover and partial dominating set are two well-investigated optimization problems. While they are $\rm W[1]$-hard on general graphs, they have been shown to be fixed-parameter tractable on many sparse graph classes, including…

Data Structures and Algorithms · Computer Science 2025-07-01 Jakub Balabán , Daniel Mock , Peter Rossmanith

Let $R$ be a commutative ring with identity and ${\rm Nil}(R)$ be the set of nilpotent elements of $R$. The nil-graph of ideals of $R$ is defined as the graph $\mathbb{AG}_N(R)$ whose vertex set is $\{I:\ (0)\neq I\lhd R$ and there exists a…

Commutative Algebra · Mathematics 2016-11-14 R. Nikandish , F. Shaveisi

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…

Commutative Algebra · Mathematics 2007-05-23 Klaus Altmann , Bernd Sturmfels

In this article we study higher homological properties of $n$-levelled algebras and connect them to properties of the underlying graphs. Notably, to each $2$-representation-finite quadratic monomial algebra $\Lambda$ we associate a…

Representation Theory · Mathematics 2024-11-04 Karin M. Jacobsen , Mads Hustad Sandøy , Laertis Vaso

Let X be a simplicial complex with the ground set V. Define its Alexander dual as a simplicial complex X* = {A \subset V: V \setminus A \notin X}. The combinatorial Alexander duality states that the i-th reduced homology group of X is…

Combinatorics · Mathematics 2011-10-25 Anders Björner , Martin Tancer

We study the licci property for several classes of squarefree monomial ideals arising from graphs and related combinatorial structures. We characterize licci bi-Cohen-Macaulay squarefree monomial ideals, complementary edge ideals, $t$-path…

Commutative Algebra · Mathematics 2026-03-17 Om Prakash Bhardwaj , Trung Chau , Omkar Javadekar

We study the ideals of the partition, Brauer, and Jones monoid, establishing various combinatorial results on generating sets and idempotent generating sets via an analysis of their Graham--Houghton graphs. We show that each proper ideal of…

Group Theory · Mathematics 2016-08-16 James East , Robert Gray

We study the Hadamard product of the linear forms defining a hyperplane arrangement with those of its dual, which we view as generating an ideal in a certain polynomial ring. We use this ideal, which we call the ideal of pairs, to study…

Combinatorics · Mathematics 2022-02-08 Avi Steiner , Graham Denham

We prove that second and higher powers of the edge ideals of anticycles admit linear quotient orderings, although the edge ideals themselves do not, thus resolving an open question of Hoefel and Whieldon in the affirmative and providing the…

Commutative Algebra · Mathematics 2025-06-19 Etan Basser , Rachel Diethorn , Robert Miranda , Mario Stinson-Maas

We classify all complete uniform multipartite hypergraphs with respect to some algebraic properties, such as being (almost) complete intersection, Gorenstein, level, $l$-Cohen-Macaulay, $l$-Buchsbaum, unmixed, and satisfying Serre's…

Combinatorics · Mathematics 2014-02-14 Dariush Kiani , Sara Saeedi Madani

We consider the line graph of a pure simplicial complex. We prove that, as in the case of line graphs of simple graphs, one can compute the second graded Betti number of the facet ideal of a pure simplicial complex in terms of the…

Commutative Algebra · Mathematics 2025-09-16 Anda Olteanu

A very well-covered graph is an unmixed graph without isolated vertices such that the height of its edge ideal is half of the number of vertices. We study these graphs by means of Betti splittings and mapping cone constructions. We show…

Commutative Algebra · Mathematics 2023-03-28 Marilena Crupi , Antonino Ficarra

We study algebraic and homological properties of the ideal of submaximal minors of a sparse generic symmetric matrix. This ideal is generated by all $(n-1)$-minors of a symmetric $n \times n$ matrix whose entries in the upper triangle are…

Commutative Algebra · Mathematics 2022-11-15 Jiahe Deng , Andreas Kretschmer

We obtain a description of the Bipartite Perfect Matching decision problem as a multilinear polynomial over the Reals. We show that it has full degree and $(1-o_n(1))\cdot 2^{n^2}$ monomials with non-zero coefficients. In contrast, we show…

Discrete Mathematics · Computer Science 2020-02-25 Gal Beniamini , Noam Nisan

Let $I$ be a perfect ideal of height two in $R=k[x_1, \ldots, x_d]$ and let $\varphi$ denote its Hilbert-Burch matrix. When $\varphi$ has linear entries, the algebraic structure of the Rees algebra $\mathcal{R}(I)$ is well-understood under…

Commutative Algebra · Mathematics 2023-08-31 Alessandra Costantini , Edward F. Price , Matthew Weaver

This paper investgates Stanley-Reisner ideals with pure resolutions. We first describe two infinite families of such ideals associated to highly symmetric complexes. We then prove a partial analogue to the first Boij-S\"oderberg Conjecture…

Commutative Algebra · Mathematics 2024-09-13 David Carey , Mordechai Katzman

Consider a random bipartite multigraph $G$ with $n$ left nodes and $m \geq n \geq 2$ right nodes. Each left node $x$ has $d_x \geq 1$ random right neighbors. The average left degree $\Delta$ is fixed, $\Delta \geq 2$. We ask whether for the…

Discrete Mathematics · Computer Science 2012-04-30 Martin Dietzfelbinger , Michael Rink