中文
相关论文

相关论文: Monomial Bases for Broken Circuit Complexes

200 篇论文

We investigate Sharifan and Moradi's closed neighborhood ideal of a finite simple graph, which is a square-free monomial ideal in a polynomial ring over a field. We explicitly describe the minimal irreducible decompositions of these ideals.…

交换代数 · 数学 2021-06-17 Jacob Honeycutt , Keri Sather-Wagstaff

A circuit double cover of a bridgeless graph is a collection of even subgraphs such that every edge is contained in exactly two subgraphs of the given collection. Such a circuit double cover describes an embedding of the corresponding graph…

组合数学 · 数学 2026-01-16 Meike Weiß , Reymond Akpanya , Alice C. Niemeyer

The goal of this paper is to establish fundamental properties of the Hochschild, topological Hochschild, and topological cyclic homologies of commutative, Noetherian rings, which are assumed only to be F-finite in the majority of our…

K理论与同调 · 数学 2014-03-04 Bjørn Ian Dundas , Matthew Morrow

As an instance of the B-polynomial, the circuit, or cycle, polynomial P(G(Gamma); w) of the generalized rooted product G(Gamma) of graphs was studied by Farrell and Rosenfeld ({\em Jour. Math. Sci. (India)}, 2000, \textbf{11}(1), 35--47)…

组合数学 · 数学 2007-05-23 Vladimir Rosenfeld

Let $G$ be a Cameron--Walker graph on $n$ vertices and $J_G$ the binomial edge ideal of $G$. Let $S$ denote the polynomial ring in $2n$ variables over a field. It is shown that the following conditions are equivalent: (i) $S/J_G$ is…

交换代数 · 数学 2025-09-03 Takayuki Hibi , Sara Saeedi Madani

The main results of this paper are accessible with only basic linear algebra. Given an increasing sequence of dimensions, a flag in a vector space is an increasing sequence of subspaces with those dimensions. The set of all such flags (the…

组合数学 · 数学 2015-08-13 David C. Lax

Let $G$ be a finite simple connected graph on $[n]$ and $R = K[x_1, \ldots, x_n]$ the polynomial ring in $n$ variables over a field $K$. The edge ideal of $G$ is the ideal $I(G)$ of $R$ which is generated by those monomials $x_ix_j$ for…

交换代数 · 数学 2020-08-13 Takayuki Hibi , Hiroju Kanno , Kyouko Kimura , Kazunori Matsuda , Adam Van Tuyl

We present a combinatorial monomial basis (or, more precisely, a family of monomial bases) in every finite-dimensional irreducible $\mathfrak{so}_{2n+1}$-module. These bases are in many ways similar to the FFLV bases for types $A$ and $C$.…

表示论 · 数学 2018-08-31 Igor Makhlin

Let $A = \mathbb{F}_p$ or $\mathbb{Z}_p$, and let $R = A[[x_1]][[x_2; \sigma_2, \delta_2]]\dots[[x_n;\sigma_n,\delta_n]]$, an iterated local skew power series ring over $A$. Under mild conditions, we show that (multiplicative) monomial…

环与代数 · 数学 2023-09-22 Billy Woods

The study of the edge ideal $I(D_{G})$ of a weighted oriented graph $D_{G}$ with underlying graph $G$ started in the context of Reed-Muller type codes. We generalize a Cohen-Macaulay construction for $I(D_{G})$, which Villarreal gave for…

交换代数 · 数学 2022-03-04 Kamalesh Saha , Indranath Sengupta

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…

交换代数 · 数学 2025-12-22 Sara Faridi , Patricia Klein , Jenna Rajchgot , Alexandra Seceleanu

Let $R$ be a strongly $\mathbb{Z}^2$-graded ring, and let $C$ be a bounded chain complex of finitely generated free $R$-modules. The complex $C$ is $R_{(0,0)}$-finitely dominated, or of type FP over $R_{(0,0)}$, if it is chain homotopy…

K理论与同调 · 数学 2026-05-21 Thomas Huettemann , Luke Steers

Let $A$ be an ordered alphabet, $A^{\ast}$ be the free monoid over $A$ ordered by the Higman ordering, and let $F(A^{\ast})$ be the set of final segments of $A^{\ast}$. With the operation of concatenation, this set is a monoid. We show that…

组合数学 · 数学 2017-05-30 Mustapha Kabil , Maurice Pouzet , Ivo Rosenberg

We obtain a geometric construction of a ``standard monomial basis'' for the homogeneous coordinate ring associated with any ample line bundle on any flag variety. This basis is compatible with Schubert varieties, opposite Schubert…

代数几何 · 数学 2007-05-23 M. Brion , V. Lakshmibai

In this article, we investigate the cardinality of Groebner bases under various monomial orderings. We identify a family of polynomials F and a criterion such that the reduced Groebner basis of F is double exponential in cardinality with…

组合数学 · 数学 2026-01-22 Archana S Morye , Sreenanda S B , Prakash Saivasan

We prove that if $G$ is the graph of a connected triangulated $(d-1)$-manifold, for $d\geq 3$, then $G$ is generically globally rigid in $\mathbb R^d$ if and only if it is $(d+1)$-connected and, if $d=3$, $G$ is not planar. The special case…

组合数学 · 数学 2024-09-26 James Cruickshank , Bill Jackson , Shin-ichi Tanigawa

Motivated by ideas from stable homotopy theory we study the space of strongly homotopy associative multiplications on a two-cell chain complex. In the simplest case this moduli space is isomorphic to the set of orbits of a group of…

量子代数 · 数学 2007-05-23 Andrey Lazarev

A long-standing conjecture of Stanley states that every Cohen-Macaulay simplicial complex is partitionable. We disprove the conjecture by constructing an explicit counterexample. Due to a result of Herzog, Jahan and Yassemi, our…

组合数学 · 数学 2016-06-08 Art M. Duval , Bennet Goeckner , Caroline J. Klivans , Jeremy L. Martin

We give an upper bound for the Stanley depth of the edge ideal of a complete $k$-partite hypergraph and as an application we give an upper bound for the Stanley depth of a monomial ideal in a polynomial ring $S$. We also give a lower and an…

交换代数 · 数学 2012-02-29 Muhammad Ishaq , Muhammad Imran Qureshi

A graph is well-covered if all its maximal independent sets are of the same cardinality (Plummer, 1970). If G is a well-covered graph, has at least two vertices, and G-v is well-covered for every vertex v, then G is a 1-well-covered graph…

组合数学 · 数学 2016-12-13 Vadim E. Levit , Eugen Mandrescu