Related papers: A geometric deletion-restriction formula
Several relations and bounds for the dimension of principal ideals in group algebras are determined by analyzing minimal polynomials of regular representations. These results are used in the two last sections. First, in the context of…
We introduce an efficient way, called Newton algorithm, to study arbitrary ideals in C[[x,y]], using a finite succession of Newton polygons. We codify most of the data of the algorithm in a useful combinatorial object, the Newton tree. For…
Using results obtained from the study of homogeneous ideals sharing the same initial ideal with respect to some term order, we prove the singularity of the point corresponding to a segment ideal with respect to the revlex term order in the…
In this paper we study the index of reducibility of powers of a standard parameter ideal. An explicit formula is proved for the extremely case. We apply the main result to compute Hilbert polynomials of socle ideals of standard parameter…
Given a symbolic power of a homogeneous ideal in a polynomial ring, we study the problem of determining which powers of the ideal contain it. For ideals defining 0-dimensional subschemes of projective space, as an immediate corollary of our…
In these notes we study hyperplane arrangements having at least one logarithmic derivation of degree two that is not a combination of degree one logarithmic derivations. It is well-known that if a hyperplane arrangement has a linear…
Motivated by applications to the theory of error-correcting codes, we give methods for computing a generating set for the ideal generated by $\beta$-graded polynomials vanishing on certain subsets of a simplicial complete toric variety $X$…
We obtain an explicit formula for the characteristic polynomial of the local monodromy of $A$-hypergeometric functions with respect to small loops around a coordinate hyperplane $x_i =0$. This formula is similar to the one obtained by Ando,…
We show that the Bernstein-Sato polynomial (that is, the b-function) of a hyperplane arrangement with a reduced equation is calculable by combining a generalization of Malgrange's formula with the theory of Aomoto complexes due to Esnault,…
A computationally challenging classical elimination theory problem is to compute polynomials which vanish on the set of tensors of a given rank. By moving away from computing polynomials via elimination theory to computing pseudowitness…
We establish a general theory for projective dimensions of the logarithmic derivation modules of hyperplane arrangements. That includes the addition-deletion and restriction theorem, Yoshinaga-type result, and the division theorem for…
It has by now become a standard approach to use the theory of sparse (or toric) elimination, based on the Newton polytope of a polynomial, in order to reveal and exploit the structure of algebraic systems. This talk surveys compact…
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minimal polynomials of these algebraic numbers. Geometrically,…
In the last decade, the approximate basis computation of vanishing ideals has been studied extensively in computational algebra and data-driven applications such as machine learning. However, symbolic computation and the dependency on term…
We study the numerical approximation of a coupled hyperbolic-parabolic system by a family of discontinuous Galerkin space-time finite element methods. The model is rewritten as a first-order evolutionary problem that is treated by the…
Yuzvinsky and Rose-Terao have shown that the homological dimension of the gradient ideal of the defining polynomial of a generic hyperplane arrangement is maximum possible. In this work one provides yet another proof of this result, which…
We prove that star-like limit cycles of any planar polynomial system can also be seen either as solutions defined on a given interval of a new associated planar non-autonomous polynomial system or as heteroclinic solutions of a…
Let X be a finite set of points in R^n. A polynomial p nonnegative on X can be written as a sum of squares of rational functions modulo the vanishing ideal I(X). From the point of view of applications, such as polynomial optimization, we…
We describe the ideals, especially the prime ideals, of semirings of polynomials over layered domains, and in particular over supertropical domains. Since there are so many of them, special attention is paid to the ideals arising from…
Let I be a homogeneous ideal in a polynomial ring P over a field. By Macaulay's Theorem, there exists a lexicographic ideal L=Lex(I) with the same Hilbert function as I. Peeva has proved that the Betti numbers of P/I can be obtained from…