Searcharxiv⌕ Search

arXiv subjects

Douglas A. Torrance

Publications and source records attributed to Douglas A. Torrance.

11 recordsLinked to original sources
arXiv2026

Implementing p-adic numbers in Macaulay2 using its foreign function interface and FLINT

Macaulay2 is a computer algebra platform widely used by researchers in algebraic geometry and commutative algebra. Using the ForeignFunctions package, it is possible to make calls from Macaulay2 to dynamic libraries such as FLINT. We demonstrate this by introducing a new Macaulay2 package implementing p-adic numbers using FLINT via this interface. We discuss implementation details such as memory allocation, interaction with Macaulay2's garbage collector, and object-oriented design decisions that mirror the existing implementations of the real and complex number fields in Macaulay2.

math.AG↗
arXiv2024

ForeignFunctions package for Macaulay2

We introduce the ForeignFunctions package for Macaulay2, which uses libffi to provide the ability to call functions from external libraries without needing to link against them at compile time. As examples, we use the library FFTW to multiply polynomials using fast Fourier transforms, call a LAPACK function to solve a general Gauss-Markov linear model problem, and use JIT compilation to compute Fibonacci numbers.

math.AG↗
arXiv2024

Properties of regular Tangles

A Tangle is a smooth simple closed curve formed from arcs (or ``links'') of circles with fixed radius. Most previous study of Tangles has dealt with the case where these arcs are quarter-circles, but Tangles comprised of thirds and sixths of circles are introduced. Together, these three families of Tangles are related to the three regular tilings of the plane by squares, regular hexagons, and equilateral triangles. This relationship is harnessed to prove results about the number of links comprising a Tangle and the area that it encloses.

math.CO↗
arXiv2024

Probability package for Macaulay2

We introduce the Probability package for Macaulay2, which provides an interface for users to compute probabilities and generate random variates from a wide variety of univariate probability distributions.

math.AG↗
arXiv2023

Geometry of first nonempty Terracini loci

After a few results on curves, we characterize the smallest nonempty Terracini loci of Veronese and Segre-Veronese varieties. For del Pezzo surfaces, we give a full description of the Terracini loci. Moreover, we present an algorithm to explicitly compute the Terracini loci of a given variety.

math.AG↗
arXiv2021

Almost all subgeneric third-order Chow decompositions are identifiable

For real and complex homogeneous cubic polyomials in $n+1$ variables, we prove that the Chow variety of products of linear forms is generically complex identifiable for all ranks up to the generic rank minus two. By integrating fundamental results of [Oeding, Hyperdeterminants of polynomials, Adv. Math., 2012], [Casarotti and Mella, From non defectivity to identifiability, J. Eur. Math. Soc., 2021], and [Torrance and Vannieuwenhoven, All secant varieties of the Chow variety are nondefective for cubics and quaternary forms, Trans. Amer. Math. Soc., 2021] the proof is reduced to only those cases in up to $103$ variables. These remaining cases are proved using the Hessian criterion for tangential weak defectivity from [Chiantini, Ottaviani, and Vannieuwenhoven, An algorithm for generic and low-rank specific identifiability of complex tensors, SIAM J. Matrix Anal. Appl., 2014]. We also establish that the smooth loci of the real and complex Chow varieties are immersed minimal submanifolds in their usual ambient spaces.

math.AG↗
arXiv2020

All secant varieties of the Chow variety are nondefective for cubics and quaternary forms

The Chow rank of a form is the length of its smallest decomposition into a sum of products of linear forms. For a generic form, this corresponds to finding the smallest secant variety of the Chow variety which fills the ambient space. We determine the Chow rank of generic cubics and quaternary forms by proving nondefectivity of all involved secant varieties. The main new ingredient in our proof is the generalization of a technique by [Brambilla and Ottaviani, On the Alexander--Hirschowitz theorem, J. Pure Appl. Algebra, 2008] that consists of employing Terracini's lemma and Newton's backward difference formula to compute the dimensions of secant varieties of arbitrary projective varieties. Via this inductive construction, the proof of nondefectivity ultimately reduces to proving a number of base cases. These are settled via a computer-assisted proof because of the large dimensions of the spaces involved. The largest base case required in our proof consisted of computing the dimension of a vector space constructed from the $400$th secant variety of a degree-$82$ Chow variety embedded in $\mathbb{P}^{98769}$.

math.AG↗
arXiv2020

Enumeration of planar Tangles

A planar Tangle is a smooth simple closed curve piecewise defined by quadrants of circles with constant curvature. We can enumerate Tangles by counting their dual graphs, which consist of a certain family of polysticks. The number of Tangles with a given length or area grows exponentially, and we show the existence of their growth constants by comparing Tangles to two families of polyominoes.

math.CO↗
arXiv2016

Generic forms of low Chow rank

The least number of products of linear forms that may be added together to obtain a given form is the Chow rank of this form. The Chow rank of a generic form corresponds to the smallest s for which the sth secant variety of the Chow variety fills the ambient space. We show that, except for certain known exceptions, this secant variety has the expected dimension for low values of s.

math.AG↗
arXiv2013

Nondefective secant varieties of varieties of completely decomposable forms

A variation of Waring's problem from classical number theory is the question, ``What is the smallest number $s$ such that any generic homogeneous polynomial of degree $d$ in $n+1$ variables may be written as the sum of at most $s$ products of linear forms?'' This question may be answered geometrically by determining the smallest $s$ such that the $s$\nth secant variety of the variety of completely decomposable forms fills the ambient space. If this secant variety has the expected dimension, it is called nondefective, and $s=\left\lceil\binom{n+d}{d}/(dn+1)\right\rceil$. It is conjectured that the secant variety is always nondefective unless $d=2$ and $2\leq s\leq\frac{n}{2}$. We prove several special cases of this conjecture. In particular, we define functions $s_1$ and $s_2$ such that the secant variety is nondefective when $n\geq 3$ and $s\leq s_1(d)$ or when $n=3$ and $s\geq s_2(d)$ and a function $c$ such that the secant variety is nondefective when $d\geq n\geq 4$ and $s\leq 2^{n-3}c(n,d)$. We further show that the secant variety is nondefective when $s\leq 30$ unless $d=2$ and $2\leq s\leq\frac{n}{2}$.

math.AG↗