اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAn efficient implementation of the algorithm computing the Borel-fixed points of a Hilbert scheme
120
0
0.0
(
0
)
تأليف
Paolo Lella
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Borel-fixed ideals play a key role in the study of Hilbert schemes. Indeed each component and each intersection of components of a Hilbert scheme contains at least one Borel-fixed point, i.e. a point corresponding to a subscheme defined by a Borel-fixed ideal. Moreover Borel-fixed ideals have good combinatorial properties, which make them very interesting in an algorithmic perspective. In this paper, we propose an implementation of the algorithm computing all the saturated Borel-fixed ideals with number of variables and Hilbert polynomial assigned, introduced from a theoretical point of view in the paper Segment ideals and Hilbert schemes of points, Discrete Mathematics 311 (2011).
قيم البحث
اقرأ أيضاً
Ritt-Wus algorithm of characteristic sets is the most representative for triangularizing sets of multivariate polynomials. Pseudo-division is the main operation used in this algorithm. In this paper we present a new algorithmic scheme for computing g
eneralized characteristic sets by introducing other admissible reductions than pseudo-division. A concrete subalgorithm is designed to triangularize polynomial sets using selected admissible reductions and several effective elimination strategies and to replace the algorithm of basic sets (used in Ritt-Wus algorithm). The proposed algorithm has been implemented and experimental results show that it performs better than Ritt-Wus algorithm in terms of computing time and simplicity of output for a number of non-trivial test examples.
In this paper, we give new explicit representations of the Hilbert scheme of $mu$ points in $PP^{r}$ as a projective subvariety of a Grassmanniann variety. This new explicit description of the Hilbert scheme is simpler than the previous ones and glob
al. It involves equations of degree $2$. We show how these equations are deduced from the commutation relations characterizing border bases. Next, we consider infinitesimal perturbations of an input system of equations on this Hilbert scheme and describe its tangent space. We propose an effective criterion to test if it is a flat deformation, that is if the perturbed system remains on the Hilbert scheme of the initial equations. This criterion involves in particular formal reduction with respect to border bases.
We give a notion of combinatorial proximity among strongly stable ideals in a given polynomial ring with a fixed Hilbert polynomial. We show that this notion guarantees geometric proximity of the corresponding points in the Hilbert scheme. We define
a graph whose vertices correspond to strongly stable ideals and whose edges correspond to pairs of adjacent ideals. Every term order induces an orientation of the edges of the graph. This directed graph describes the behavior of the points of the Hilbert scheme under Grobner degenerations with respect to the given term order. Then, we introduce a polyhedral fan that we call Grobner fan of the Hilbert scheme. Each cone of maximal dimension corresponds to a different directed graph induced by a term order. This fan encodes several properties of the Hilbert scheme. We use these tools to present a new proof of the connectedness of the Hilbert scheme. Finally, we improve the technique introduced in the paper Double-generic initial ideal and Hilbert scheme by Bertone, Cioffi and Roggero to give a lower bound on the number of irreducible components of the Hilbert scheme.
The Hilbert scheme $mathbf{Hilb}_{p(t)}^{n}$ parametrizes closed subschemes and families of closed subschemes in the projective space $mathbb{P}^n$ with a fixed Hilbert polynomial $p(t)$. It is classically realized as a closed subscheme of a Grassman
nian or a product of Grassmannians. In this paper we consider schemes over a field $k$ of characteristic zero and we present a new proof of the existence of the Hilbert scheme as a subscheme of the Grassmannian $mathbf{Gr}_{p(r)}^{N(r)}$, where $N(r)= h^0 (mathcal{O}_{mathbb{P}^n}(r))$. Moreover, we exhibit explicit equations defining it in the Plucker coordinates of the Plucker embedding of $mathbf{Gr}_{p(r)}^{N(r)}$. Our proof of existence does not need some of the classical tools used in previous proofs, as flattening stratifications and Gotzmanns Persistence Theorem. The degree of our equations is $text{deg} p(t)+2$, lower than the degree of the equations given by Iarrobino and Kleiman in 1999 and also lower (except for the case of hypersurfaces) than the degree of those proved by Haiman and Sturmfels in 2004 after Bayers conjecture in 1982. The novelty of our approach mainly relies on the deeper attention to the intrinsic symmetries of the Hilbert scheme and on some results about Grassmannian based on the notion of extensors.
Manachers algorithm has been shown to be optimal to the longest palindromic substring problem. Many of the existing implementations of this algorithm, however, unanimously required in-memory construction of an augmented string that is twice as long a
s the original string. Although it has found widespread use, we found that this preprocessing is neither economic nor necessary. We present a more efficient implementation of Manachers algorithm based on index mapping that makes the string augmentation process obsolete.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
