中文
相关论文

相关论文: On the arithmetical rank of the edge ideals of for…

200 篇论文

In this article, we show that the depths of the associated graded ring and fiber cone of a lex-segment ideal in $K[x,y]$ are equal.

交换代数 · 数学 2009-07-22 A. V. Jayanthan

We show that for several notions of rank including tensor rank, Waring rank, and generalized rank with respect to a projective variety, the maximum value of rank is at most twice the generic rank. We show that over the real numbers, the…

代数几何 · 数学 2014-07-28 Grigoriy Blekherman , Zach Teitler

We prove that, when all elliptic curves over $\mathbb{Q}$ are ordered by naive height, a positive proportion have both algebraic and analytic rank one. It follows that the average rank and the average analytic rank of elliptic curves are…

数论 · 数学 2014-01-03 Manjul Bhargava , Christopher Skinner

We find a class of block graphs whose binomial edge ideals have minimal regularity. As a consequence, we characterize the trees whose binomial edge ideals have minimal regularity. Also, we show that the binomial edge ideal of a block graph…

交换代数 · 数学 2014-02-11 Faryal Chaudhry , Ahmet Dokuyucu , Rida Irfan

In this article, we explore the class of graphs for which the projective dimension of the quotient of the binomial edge ideals matches the big height of that ideal. Additionally, we investigate the Vasconcelos number of binomial edge ideals…

交换代数 · 数学 2025-08-19 Arvind Kumar , Joshua Pomeroy , Le Tran

We obtain an improved lower bound for the regularity of the binomial edge ideals of trees. We prove an upper bound for the regularity of the binomial edge ideals of certain subclass of block-graphs. As a consequence we obtain sharp upper…

交换代数 · 数学 2018-04-30 A. V. Jayanthan , N. Narayanan , B. V. Raghavendra Rao

We study the conditions under which the isometry of spaces with metrics generated by weights given on the edges of finite trees is equivalent to the isomorphism of these trees. Similar questions are studied for ultrametric spaces generated…

度量几何 · 数学 2020-02-18 Oleksiy Dovgoshey

An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…

计算机科学中的逻辑 · 计算机科学 2023-06-22 Bruno Courcelle

We determine, in a polynomial ring over a field, the arithmetical rank of certain ideals generated by a set of monomials and one binomial.

交换代数 · 数学 2007-10-15 Margherita Barile

The degree of a projective subscheme has an upper bound in term of the codimension and the reduction number. If a projective variety has an almost maximal degree, that is, the degree equals to the upper bound minus one, then its Betti table…

交换代数 · 数学 2021-01-19 Doan Trung Cuong , Sijong Kwak

We give a short and direct proof of a remarkable identity that arises in the enumeration of labeled trees with respect to their indegree sequence, where all edges are oriented from the vertex with lower label towards the vertex with higher…

组合数学 · 数学 2016-01-20 Stephan Wagner

We introduce equivariant tree models in algebraic statistics, which unify and generalise existing tree models such as the general Markov model, the strand symmetric model, and group based models. We focus on the ideals of such models. We…

代数几何 · 数学 2017-10-10 Jan Draisma , Jochen Kuttler

Padberg introduced a geometric notion of ranks for (mixed) integer rational polyhedrons and conjectured that the geometric rank of the matching polytope is one. In this work, we prove that this conjecture is true.

组合数学 · 数学 2013-09-06 Ashwin Arulselvan , Daniel Karch

Lower bounds are given for the depths of R/I^t for t at least one when I is the edge ideal of a tree or forest. The bounds are given in terms of the diameter of the tree, or in case of a forest, the largest diameter of a connected component…

交换代数 · 数学 2009-08-06 Susan Morey

In this paper we give new upper bounds on the regularity of edge ideals whose resolutions are k-steps linear; surprisingly, the bounds are logarithmic in the number of variables. We also give various bounds for the projective dimension of…

交换代数 · 数学 2011-10-13 Hailong Dao , Craig Huneke , Jay Schweig

In weighted trees, all edges are endowed with positive integral weight. We enumerate weighted bicolored plane trees according to their weight and number of edges.

组合数学 · 数学 2014-04-21 Alexander K. Zvonkin

In this paper we provide some precise formulas for regularity of powers of edge ideal of the disjoint union of some weighted oriented gap-free bipartite graphs. For the projective dimension of such an edge ideal, we give its exact formula.…

交换代数 · 数学 2019-06-12 Guangjun Zhu , Li Xu , Hong Wang , Jiaqi Zhang

We associate to every graph a linear program for packings of vertex disjoint paths. We show that the optimal primal and dual values of the corresponding integer program are the binomial grade and height of the binomial edge ideal of the…

交换代数 · 数学 2023-06-21 Adam LaClair

We prove a sharp upper bound for the projective dimension of ideals of height two generated by quadrics in a polynomial ring with arbitrary large number of variables.

交换代数 · 数学 2013-04-03 Craig Huneke , Paolo Mantero , Jason McCullough , Alexandra Seceleanu

Ideal class pairings map the rational points of rank $r\geq 1$ elliptic curves $E/\Q$ to the ideal class groups $\CL(-D)$ of certain imaginary quadratic fields. These pairings imply that $$h(-D) \geq \frac{1}{2}(c(E)-\varepsilon)(\log…

数论 · 数学 2020-05-01 Michael Griffin , Ken Ono