中文
相关论文

相关论文: Distributive Lattices, Bipartite Graphs and Alexan…

200 篇论文

In this thesis we investigate certain types of monomial ideals of polynomial rings over fields. We are interested in minimal free resolutions of these ideals (or equivalently the quotients of the polynomial ring by the ideals) considered as…

交换代数 · 数学 2007-05-23 Sean Jacques

Consider the rational map $\phi: \mathbb{P}^{n-1}_{\mathbf k} \stackrel{[f_0:\cdots: f_n]}{\longrightarrow} \mathbb{P}^{n}_{\mathbf k}$ defined by homogeneous polynomials $f_0,\dots,f_n$ of the same degree $d$ in a polynomial ring…

交换代数 · 数学 2019-10-31 Youngsu Kim , Vivek Mukundan

We investigate Rees algebras and special fiber rings obtained by blowing up specialized Ferrers ideals. This class of monomial ideals includes strongly stable monomial ideals generated in degree two and edge ideals of prominent classes of…

交换代数 · 数学 2016-08-10 Alberto Corso , Uwe Nagel , Sonja Petrović , Cornelia Yuen

Let $G$ be a simple graph on the vertex set $\{1,\ldots,n\}$ with $m$ edges. An algebraic object attached to $G$ is the ideal $P_{G}$ generated by diagonal 2-minors of an $n \times n$ matrix of variables. In this paper we prove that if $G$…

交换代数 · 数学 2016-07-26 Anargyros Katsabekis

It is shown that every Leavitt path algebra L of an arbitrary directed graph E over a field K is an arithmetical ring, that is, the two-sided ideals of L form a distributive lattice. It is also shown that L is a multiplication ring, that…

环与代数 · 数学 2016-06-07 Kulumani M. Rangaswamy

Given a square-free monomial ideal $I$ in a polynomial ring $R$ over a field $\mathbb{K}$, one can associate it with its LCM-lattice and its hypergraph. In this short note, we establish the connection between the LCM-lattice and the…

交换代数 · 数学 2019-09-24 Kuei-Nuan Lin , Sonja Mapes

Let I=I(D) be the edge ideal of a weighted oriented graph D. We determine the irredundant irreducible decomposition of I. Also, we characterize the associated primes and the unmixed property of I. Furthermore, we give a combinatorial…

交换代数 · 数学 2020-12-08 Yuriko Pitones , Enrique Reyes , Jonathan Toledo

We introduce binomial edge ideals attached to a simple graph $G$ and study their algebraic properties. We characterize those graphs for which the quadratic generators form a Gr\"obner basis in a lexicographic order induced by a vertex…

交换代数 · 数学 2009-10-16 Juergen Herzog , Takayuki Hibi , Freyja Hreinsdottir , Thomas Kahle , Johannes Rauh

Let $K$ be a infinite field, $S=K[x_1,\ldots,x_n]$ and $0\subset I\subsetneq J\subset S$ two squarefree monomial ideals. In a previous paper we proved a new formula for the Hilbert depth of $J/I$. In this paper, we illustrate how one can…

交换代数 · 数学 2024-04-29 Silviu Balanescu , Mircea Cimpoeas

Each partition $\lambda = (\lambda_1, \lambda_2, ..., \lambda_n)$ determines a so-called Ferrers tableau or, equivalently, a Ferrers bipartite graph. Its edge ideal, dubbed Ferrers ideal, is a squarefree monomial ideal that is generated by…

交换代数 · 数学 2007-05-23 Alberto Corso , Uwe Nagel

When $I$ is the edge ideal of a graph $G$, we use combinatorial properities, particularly Property $P$ on connectivity of neighbors of an edge, to classify when a binomial sum of vertices is a regular element on $R/I(G)$. Under a mild…

交换代数 · 数学 2024-12-16 Joseph Brennan , Susan Morey

Let $I\subset K[x_1,\ldots,x_n]$ be a zero-dimensional monomial ideal, and $\Delta(I)$ be the simplicial complex whose Stanley--Reisner ideal is the polarization of $I$. It follows from a result of Soleyman Jahan that $\Delta(I)$ is…

交换代数 · 数学 2014-12-05 Mina Bigdeli , Jürgen Herzog , Takayuki Hibi , Antonio Macchia

We strengthen a result by Laskar and Lyle (Discrete Appl. Math. (2009), 330-338) by proving that it is NP-complete to decide whether a bipartite planar graph can be partitioned into three independent dominating sets. In contrast, we show…

计算复杂性 · 计算机科学 2019-05-14 Juho Lauri , Christodoulos Mitillos

We define the uniform face ideal of a simplicial complex with respect to an ordered proper vertex colouring of the complex. This ideal is a monomial ideal which is generally not squarefree. We show that such a monomial ideal has a linear…

组合数学 · 数学 2013-08-07 David Cook

Let $I$ be a monomial squarefree ideal of a polynomial ring $S$ over a field $K$ such that the sum of every three different of its minimal prime ideals is the maximal ideal of $S$, or more general a constant ideal. We associate to $I$ a…

交换代数 · 数学 2011-05-06 Dorin Popescu

In this paper, we obtain a combinatorial formula for computing the Betti numbers in the linear strand of edge ideals of bipartite Kneser graphs. We deduce lower and upper bounds for regularity of powers of edge ideals of these graphs in…

交换代数 · 数学 2021-05-14 Ajay Kumar , Pavinder Singh , Rohit Verma

It is shown that a flat subgroup, $H$, of the totally disconnected, locally compact group $G$ decomposes into a finite number of subsemigroups on which the scale function is multiplicative. The image, $P$, of a multiplicative semigroup in…

群论 · 数学 2017-10-03 Cheryl E. Praeger , Jacqui Ramagge , George Willis

Let B_{2t} be a bipartite planar graph with an even number of regions. We are able to find bounds for the graded Betti numbers and the projective dimension of the quotient ring associated to the graph. We also will investigate the minimal…

交换代数 · 数学 2024-04-01 Maurizio Imbesi , Monica La Barbiera

Let $I$ be a monomial ideal in two variables generated by three monomials and let $\mathcal{R}(I)$ be its Rees ideal. We describe an algorithm to compute the minimal generating set of $\mathcal{R}(I)$. Based on the data obtained by this…

We study the symbolic powers of square-free monomial ideals via symbolic Rees algebras and methods in prime characteristic. In particular, we prove that the symbolic Rees algebra and the symbolic associated graded algebra are split with…

交换代数 · 数学 2019-07-29 Jonathan Montaño , Luis Núñez-Betancourt