اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDetecting Binomiality
24
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Binomial ideals are special polynomial ideals with many algorithmically and theoretically nice properties. We discuss the problem of deciding if a given polynomial ideal is binomial. While the methods are general, our main motivation and source of examples is the simplification of steady state equations of chemical reaction networks. For homogeneous ideals we give an efficient, Grobner-free algorithm for binomiality detection, based on linear algebra only. On inhomogeneous input the algorithm can only give a sufficient condition for binomiality. As a remedy we construct a heuristic toolbox that can lead to simplifications even if the given ideal is not binomial.
قيم البحث
اقرأ أيضاً
Let $n$ be a positive integer, and let $k$ be a field (of arbitrary characteristic) accessible to symbolic computation. We describe an algorithmic test for determining whether or not a finitely presented $k$-algebra $R$ has infinitely many equivalenc
e classes of semisimple representations $R to M_n(k)$, where $k$ is the algebraic closure of $k$. The test reduces the problem to computational commutative algebra over $k$, via famous results of Artin, Procesi, and Shirshov. The test is illustrated by explicit examples, with $n = 3$.
The Springer variety is the set of flags stabilized by a nilpotent operator. In 1976, T.A. Springer observed that this varietys cohomology ring carries a symmetric group action, and he offered a deep geometric construction of this action. Sixteen yea
rs later, Garsia and Procesi made Springers work more transparent and accessible by presenting the cohomology ring as a graded quotient of a polynomial ring. They combinatorially describe an explicit basis for this quotient. The goal of this paper is to generalize their work. Our main result deepens their analysis of Springer varieties and extends it to a family of varieties called Hessenberg varieties, a two-parameter generalization of Springer varieties. Little is known about their cohomology. For the class of regular nilpotent Hessenberg varieties, we conjecture a quotient presentation for the cohomology ring and exhibit an explicit basis. Tantalizing new evidence supports our conjecture for a subclass of regular nilpotent varieties called Peterson varieties.
Many hard combinatorial problems can be modeled by a system of polynomial equations. N. Alon coined the term polynomial method to describe the use of nonlinear polynomials when solving combinatorial problems. We continue the exploration of the polyno
mial method and show how the algorithmic theory of polynomial ideals can be used to detect k-colorability, unique Hamiltonicity, and automorphism rigidity of graphs. Our techniques are diverse and involve Nullstellensatz certificates, linear algebra over finite fields, Groebner bases, toric algebra, convex programming, and real algebraic geometry.
Associated to the cohomology ring A of the complement X(A) of a hyperplane arrangement A in complex m-space are the resonance varieties R^k(A). The most studied of these is R^1(A), which is the union of the tangent cones at the origin to the characte
ristic varieties of the fundamental group of X. R^1(A) may be described in terms of Fitting ideals, or as the locus where a certain Ext module is supported. Both these descriptions give obvious algorithms for computation. In this note, we show that interpreting R^1(A) as the locus of decomposable two-tensors in the Orlik-Solomon ideal leads to a description of R^1(A) as the intersection of a Grassmannian with a linear space, determined by the quadratic generators of the Orlik-Solomon ideal. This method is much faster than previous alternatives.
The profile of a relational structure $R$ is the function $varphi_R$ which counts for every integer $n$ the number, possibly infinite, $varphi_R(n)$ of substructures of $R$ induced on the $n$-element subsets, isomorphic substructures being identified
. If $varphi_R$ takes only finite values, this is the Hilbert function of a graded algebra associated with $R$, the age algebra $A(R)$, introduced by P.~J.~Cameron. In a previous paper, we studied the relationship between the properties of a relational structure and those of their algebra, particularly when the relational structure $R$ admits a finite monomorphic decomposition. This setting still encompasses well-studied graded commutative algebras like invariant rings of finite permutation groups, or the rings of quasi-symmetric polynomials. In this paper, we investigate how far the well know algebraic properties of those rings extend to age algebras. The main result is a combinatorial characterization of when the age algebra is finitely generated. In the special case of tournaments, we show that the age algebra is finitely generated if and only if the profile is bounded. We explore the Cohen-Macaulay property in the special case of invariants of permutation groupoids. Finally, we exhibit sufficient conditions on the relational structure that make naturally the age algebra into a Hopf algebra.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
