arXiv subjects
Publications and source records attributed to Zach Teitler.
A Waring decomposition of a polynomial is an expression of the polynomial as a sum of powers of linear forms, where the number of summands is minimal possible. We prove that any Waring decomposition of a monomial is obtained from a complete intersection ideal, determine the dimension of the set of Waring decompositions, and give the conditions under which the Waring decomposition is unique up to scaling the variables.
We formulate the Secant Conjecture, which is a generalization of the Shapiro Conjecture for Grassmannians. It asserts that an intersection of Schubert varieties in a Grassmannian is transverse with all points real, if the flags defining the Schubert varieties are secant along disjoint intervals of a rational normal curve. We present theoretical evidence for it as well as computational evidence obtained in over one terahertz-year of computing, and we discuss some phenomena we observed in our data.
In the week 3--9, October 2010, the Mathematisches Forschungsinstitut at Oberwolfach hosted a mini workshop Linear Series on Algebraic Varieties. These notes contain a variety of interesting problems which motivated the participants prior to the event, and examples, results and further problems which grew out of discussions during and shortly after the workshop. A lot of arguments presented here are scattered in the literature or constitute folklore. It was one of our aims to have a usable and easily accessible collection of examples and results.
We study Hilbert functions of certain non-reduced schemes A supported at finite sets of points in projective space, in particular, fat point schemes. We give combinatorially defined upper and lower bounds for the Hilbert function of A using nothing more than the multiplicities of the points and information about which subsets of the points are linearly dependent. When N=2, we give these bounds explicitly and we give a sufficient criterion for the upper and lower bounds to be equal. When this criterion is satisfied, we give both a simple formula for the Hilbert function and combinatorially defined upper and lower bounds on the graded Betti numbers for the ideal defining A, generalizing results of Geramita-Migliore-Sabourin (2006). We obtain the exact Hilbert functions and graded Betti numbers for many families of examples, interesting combinatorially, geometrically, and algebraically. Our method works in any characteristic. AWK scripts implementing our results can be obtained at http://www.math.unl.edu/~bharbourne1/CHT/Example.html .
We give two sufficient criteria for schlichtness of envelopes of holomorphy in terms of topology. These are weakened converses of results of Kerner and Royden. Our first criterion generalizes a result of Hammond in dimension 2. Along the way we also prove a generalization of Royden's theorem.
The Monodromy Conjecture asserts that if c is a pole of the local topological zeta function of a hypersurface, then exp(2πi c) is an eigenvalue of the monodromy on the cohomology of the Milnor fiber. A stronger version of the conjecture asserts that every pole is a root of the Bernstein-Sato polynomial of the hypersurface. In this note we prove the weak version of the conjecture for hyperplane arrangements. Furthermore, we reduce the strong version to the following conjecture: -n/d is always a root of the Bernstein-Sato polynomial of an indecomposable essential central hyperplane arrangement of d hyperplanes in the affine n-space.
We describe a general framework for large-scale computational experiments in mathematics using computer resources that are available in most mathematics departments. This framework was developed for an experiment that is helping to formulate and test conjectures in the real Schubert calculus. Largely using machines in instructional computer labs during off-hours and University breaks, it consumed in excess of 350 GigaHertz-years of computing in its first six months of operation, solving over 1.1 billion polynomial systems.
We revisit a bound on symbolic powers found by Ein-Lazarsfeld-Smith and subsequently improved by Takagi-Yoshida. We show that the original argument of Ein-Lazarsfeld-Smith actually gives the same improvement. On the other hand, we show by examples that any further improvement based on the same technique appears unlikely. This is primarily an exposition; only some examples and remarks might be new.
Motivated by questions arising in signal processing, computational complexity, and other areas, we study the ranks and border ranks of symmetric tensors using geometric methods. We provide improved lower bounds for the rank of a symmetric tensor (i.e., a homogeneous polynomial) obtained by considering the singularities of the hypersurface defined by the polynomial. We obtain normal forms for polynomials of border rank up to five, and compute or bound the ranks of several classes of polynomials, including monomials, the determinant, and the permanent.
We compute a naturally defined measure of the size of the nef cone of a Del Pezzo surface. The resulting number appears in a conjecture of Manin on the asymptotic behavior of the number of rational points of bounded height on the surface. The nef cone volume of a Del Pezzo surface Y with (-2)-curves defined over an algebraically closed field is equal to the nef cone volume of a smooth Del Pezzo surface of the same degree divided by the order of the Weyl group of a simply-laced root system associated to the configuration of (-2)-curves on Y. When Y is defined over a non-closed field of characteristic 0, a similar result holds, except that the associated root system is no longer necessarily simply-laced.
M. Mustata used jet schemes to compute the multiplier ideals of reduced hyperplane arrangements. We give an alternate proof using a log resolution, which is simpler and allows us to consider non-reduced arrangements. By applying the idea of wonderful models introduced by De Concini--Procesi, we also simplify the result.