中文
相关论文

相关论文: A combinatorial proof of Gotzmann's persistence th…

200 篇论文

Powers of (monomial) ideals is a subject that still calls attraction in various ways. Let $I\subset \mathbb K[x_1,\ldots,x_n]$ be a monomial ideal and let $G(I)$ denote the (unique) minimal monomial generating set of $I$. How small can…

交换代数 · 数学 2019-09-02 Oleksandra Gasanova

We prove an index theorem for the quotient module of a monomial ideal. We obtain this result by resolving the monomial ideal by a sequence of Bergman space like essentially normal Hilbert modules.

算子代数 · 数学 2017-08-22 Ronald G. Douglas , Mohammad Jabbari , Xiang Tang , Guoliang Yu

It is shown that any set of nonzero monomial prime ideals can be realized as the stable set of associated prime ideals of a monomial ideal. Moreover, an algorithm is given to compute the stable set of associated prime ideals of a monomial…

交换代数 · 数学 2011-10-12 Shamila Bayati , Jürgen Herzog , Giancarlo Rinaldo

We present an elementary combinatorial proof of the celebrated Friendship theorem. The proof involves looking at independent sets and constructing a bound on their size which forces a contradiction.

组合数学 · 数学 2024-02-13 Vineeth Chintala

In this paper we investigate the monomial ideals which satisfy the copersistence property or nearly copersistence property.

交换代数 · 数学 2024-12-11 Mehrdad Nasernejad , Jonathan Toledo

Gaussian polynomial, which is also known as $q$-binomial coefficient, is one of the fundamental concepts in the theory of partitions. Zeilberger provided a combinatorial proof of Gaussian polynomial, which is called Algorithm Z by Andrews…

组合数学 · 数学 2025-10-10 Wenxia Qu , Wenston J. T. Zang

In this paper we give a necessary and sufficient combinatorial condition for a monomial ideal to have a linear resolution over fields of characteristic 2. We also give a new proof of Fr\"oberg's theorem over fields of characteristic 2.

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

We give a new, elementary proof of the celebrated Herzog-Hibi-Zheng theorem on powers of quadratic monomial ideals.

交换代数 · 数学 2025-01-15 Antonino Ficarra

In this paper we develop a Grobner bases theory for ideals of partial difference polynomials with constant or non-constant coefficients. In particular, we introduce a criterion providing the finiteness of such bases when a difference ideal…

交换代数 · 数学 2014-10-28 Vladimir P. Gerdt , Roberto La Scala

We give a combinatorial characterization of generic minimal rigidity for planar periodic frameworks. The characterization is a true analogue of the Maxwell-Laman Theorem from rigidity theory: it is stated in terms of a finite combinatorial…

组合数学 · 数学 2012-10-24 Justin Malestein , Louis Theran

Let $S$ be a polynomial algebra over a field. We study classes of monomial ideals (as for example lexsegment ideals) of $S$ having minimal depth. In particular, Stanley's conjecture holds for these ideals. Also we show that if Stanley's…

交换代数 · 数学 2012-03-16 Muhammad Ishaq

Let $I$ be an ideal in a commutative Noetherian ring $R$. We say that a positive integer $\ell_0$ is the strong persistence index of $I$ if $\ell_0$ is the smallest integer such that $(I^{\ell+1} :_R I) = I^{\ell}$ for all $\ell \geq…

交换代数 · 数学 2026-05-25 Mehrdad Nasernejad , Jonathan Toledo

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

The aim of this paper is to make a systematical study on the stability of polynomials in combinatorics. Applying the characterizations of Borcea and Br\"and\'en concerning linear operators preserving stability, we present criteria for real…

组合数学 · 数学 2021-06-25 Ming-Jian Ding , Bao-Xuan Zhu

Let P = k[x_1, ..., x_n] be the polynomial ring in n variables. A homogeneous ideal I of P generated in degree d is called Gotzmann if it has the smallest possible Hilbert function out of all homogeneous ideals with the same dimension in…

交换代数 · 数学 2009-08-14 Andrew H. Hoefel

We present an algorithm to decide whether a given ideal in the polynomial ring contains a monomial without using Gr\"obner bases, factorization or sub-resultant computations.

交换代数 · 数学 2017-04-18 Simon Keicher , Thomas Kremer

We prove that a monomial ideal $I$ generated in a single degree, is polymatroidal if and only if it has linear quotients with respect to the lexicographical ordering of the minimal generators induced by every ordering of variables. We also…

交换代数 · 数学 2018-08-21 Somayeh Bandari , Rahim Rahmati-Asghar

We give a new proof of Fitzgerald's criterion for primitive polynomials over a finite field. Existing proofs essentially use the theory of linear recurrences over finite fields. Here, we give a much shorter and self-contained proof which…

数论 · 数学 2015-10-06 Samrith Ram

A paper of the first author and Zilke proposed seven combinatorial problems around formulas for the characteristic polynomial and the exponents of an isolated quasihomogeneous singularity. The most important of them was a conjecture on the…

组合数学 · 数学 2021-08-06 Claus Hertling , Makiko Mase

In this paper, we study combinatorics of congruence subgroups of the modular group. More precisely, we consider the matrix equation that naturally arises in the theory of Coxeter friezes and investigate its irreducible solutions. We give…

组合数学 · 数学 2022-06-29 Flavien Mabilat