956 research outputs found
Bounding symbolic powers via asymptotic multiplier ideals
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.Comment: 10 pages. Primarily exposition. Originally written as appendix to
lecture notes by Brian Harbourne. v2: Minor changes. v3: Final version,
appeared in Ann. Univ. Pedagog. Crac. Stud. Mat
Geometric lower bounds for generalized ranks
We revisit a geometric lower bound for Waring rank of polynomials (symmetric
rank of symmetric tensors) of Landsberg and Teitler and generalize it to a
lower bound for rank with respect to arbitrary varieties, improving the bound
given by the "non-Abelian" catalecticants recently introduced by Landsberg and
Ottaviani. This is applied to give lower bounds for ranks of multihomogeneous
polynomials (partially symmetric tensors); a special case is the simultaneous
Waring decomposition problem for a linear system of polynomials. We generalize
the classical Apolarity Lemma to multihomogeneous polynomials and give some
more general statements. Finally we revisit the lower bound of Ranestad and
Schreyer, and again generalize it to multihomogeneous polynomials and some more
general settings.Comment: 43 pages. v2: minor change
Decompositions of ideals of minors meeting a submatrix
We compute the primary decomposition of certain ideals generated by subsets
of minors in a generic matrix or in a generic symmetric matrix, or subsets of
Pfaffians in a generic skew-symmetric matrix. Specifically, the ideals we
consider are generated by minors that have at least some given number of rows
and columns in certain submatrices.Comment: 10 pages. v2: minor corrections. v3: minor changes, final version to
appear in Comm. Al
Castelnuovo-Mumford regularity and arithmetic Cohen-Macaulayness of complete bipartite subspace arrangements
We give the Castelnuovo-Mumford regularity of arrangements of (n-2)-planes in
P^n whose incidence graph is a sufficiently large complete bipartite graph, and
determine when such arrangements are arithmetically Cohen-Macaulay.Comment: v3: Minor changes, 5p
GYRE: A New Open-Source Stellar Oscillation Code
We introduce GYRE, a new open-source stellar oscillation code which solves
the adiabatic/non-adiabatic pulsation equations using a novel Magnus Multiple
Shooting (MMS) numerical scheme. The code has a global error scaling of up to
6th order in the grid spacing, and can therefore achieve high accuracy with few
grid points. It is moreover robust and efficiently makes use of multiple
processor cores and/or nodes. We present an example calculation using GYRE, and
discuss recent work to integrate GYRE into the asteroseismic optimization
module of the MESA stellar evolution code.Comment: 2 pages; to appear in Proc. IAU Symposium 301: Precision
Asteroseismolog
- …
