中文
相关论文

相关论文: The combinatorial calculation of algebraic invaria…

200 篇论文

For a monomial ideal $I$, let $G(I)$ be its minimal set of monomial generators. If there is a total order on $G(I)$ such that the corresponding Lyubeznik resolution of $I$ is a minimal free resolution of $I$, then $I$ is called a Lyubeznik…

交换代数 · 数学 2013-12-03 Jin Guo , Tongsuo Wu , Houyi Yu

We provide a new combinatorial approach to study the minimal free resolutions of edge ideals, that is, quadratic square-free monomial ideals. With this method we can recover most of the known results on resolutions of edge ideals with…

交换代数 · 数学 2007-05-23 Huy Tai Ha , Adam Van Tuyl

Given a local ring containing a field, we define and investigate a family of invariants that includes the Lyubeznik numbers, but that captures finer information. These "generalized Lyubeznik numbers" are defined as lengths of certain…

交换代数 · 数学 2012-10-24 Luis Núñez-Betancourt , Emily E. Witt

In recent years, the combinatorial properties of monomials ideals and binomial ideals have been widely studied. In particular, combinatorial interpretations of free resolution algorithms have been given in both cases. In this present work,…

交换代数 · 数学 2014-10-06 Trevor McGuire

In this work we introduce a new set of invariants associated to the linear strands of a minimal free resolution of a $\mathbb{Z}$-graded ideal $I\subseteq R=\Bbbk[x_1, \ldots, x_n]$. We also prove that these invariants satisfy some…

交换代数 · 数学 2016-06-17 Josep Alvarez Montaner , Kohji Yanagawa

Algebraic and combinatorial properties of a monomial ideal and its radical are compared.

交换代数 · 数学 2007-05-23 Juergen Herzog , Yukihide Takayama , Naoki Terai

A minimal monomial ideal is the combinatorially simplest monomial ideal whose lcm-lattice equals a given finite atomic lattice $\hat{L}$. The minimal ideal inherits many nice properties of any ideal $I$ whose lcm-lattice also equals…

交换代数 · 数学 2007-05-23 Jeffry Phan

We characterize all graphs whose binomial edge ideals have pure resolutions. Moreover, we introduce a new switching of graphs which does not change some algebraic invariants of graphs, and using this, we study the linear strand of the…

组合数学 · 数学 2014-01-22 Dariush Kiani , Sara Saeedi Madani

We define the Buchberger resolution, which is a graded free resolution of a monomial ideal in a polynomial ring. Its construction uses a generalization of the Buchberger graph and encodes much of the combinatorics of the Buchberger…

交换代数 · 数学 2014-09-12 Anda Olteanu , Volkmar Welker

We investigate, using the notion of linear quotients, significative classes of connected graphs whose monomial edge ideals, not necessarily squarefree, have linear resolution, in order to compute standard algebraic invariants of the…

环与代数 · 数学 2012-10-30 Maurizio Imbesi , Monica La Barbiera

An explicit combinatorial minimal free resolution of an arbitrary monomial ideal $I$ in a polynomial ring in $n$ variables over a field of characteristic $0$ is defined canonically, without any choices, using higher-dimensional…

交换代数 · 数学 2020-05-25 John Eagon , Ezra Miller , Erika Ordog

We study the set of monomial ideals in a polynomial ring as an ordered set, with the ordering given by reverse inclusion. We give a short proof of the fact that every antichain of monomial ideals is finite. Then we investigate ordinal…

逻辑 · 数学 2007-05-23 Matthias Aschenbrenner , Wai-Yan Pong

Let R be a commutative ring with unity, M be an unitary R-module and {\Gamma} be a simple graph. This research article is an interplay of combinatorial and algebraic properties of M . We show a combinatorial object completely determines an…

交换代数 · 数学 2017-11-06 Rameez Raja

In dimension two, we study complete monomial ideals combinatorially, their Rees algebras and develop effective means to find their defining equations.

交换代数 · 数学 2016-06-14 Philippe Gimenez , Aron Simis , Wolmer V. Vasconcelos , Rafael H. Villarreal

We define a new combinatorial object, which we call a labeled hypergraph, uniquely associated to any square-free monomial ideal. We prove several upper bounds on the regularity of a square-free monomial ideal in terms of simple…

交换代数 · 数学 2013-04-02 Kuei-Nuan Lin , Jason McCullough

Associated to any hypergraph is a toric ideal encoding the algebraic relations among its edges. We study these ideals and the combinatorics of their minimal generators, and derive general degree bounds for both uniform and non-uniform…

交换代数 · 数学 2012-12-24 Elizabeth Gross , Sonja Petrović

In this paper we extend one direction of Fr\"oberg's theorem on a combinatorial classification of quadratic monomial ideals with linear resolutions. We do this by generalizing the notion of a chordal graph to higher dimensions with the…

交换代数 · 数学 2013-06-13 Emma Connon , Sara Faridi

We produce a criterion for open sets in projective $n$-space over a separably closed field to have \'etale cohomological dimension bounded by $2n-3$. We use the criterion to exhibit a scheme for which \'etale cohomological dimension is…

交换代数 · 数学 2010-12-01 Manoj Kummini , Uli Walther

We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…

环与代数 · 数学 2011-06-02 Roberto Boldini

In this article we give explicit descriptions of the multiplicities of some classes of monomial ideals. For instance, we give a formula for the multiplicities of all codimension 1 monomial ideals, and another formula for the multiplicities…

交换代数 · 数学 2019-01-29 Guillermo Alesandroni
‹ 上一页 1 2 3 10 下一页 ›