arXiv subjects

Will Traves

Publications and source records attributed to Will Traves.

9 recordsLinked to original sources

arXiv2024

When do Ten Points Lie on a Quadric Surface?

A solution is provided to the Bruxelles Problem, a geometric decision problem originally posed in 1825, that asks for a synthetic construction to determine when ten points in 3-space lie on a quadric surface, a surface given by the vanishing of a degree-2 polynomial. The solution constructs four new points that are coplanar precisely when the ten original points lie on a quadric surface. The solution uses only lines constructed through two known points, planes constructed through three known points, and intersections of these objects. The tools involved include an extension of the Area Principle to three-dimensional space, bracket polynomials and the Grassmann-Cayley algebra, and von Staudt's results on geometric arithmetic. Many special cases are treated directly, leading to the generic case, where three pairs of the points generate skew lines and the remaining four points are in general position. A key step in the generic case involves finding a nice basis for the quadrics that pass through six of the ten points, which uses insights derived from Macaulay2, a computational algebra package not available in the nineteenth century.

math.AG↗

arXiv2023

What Grassmann Knew: Incidence Theorems on Cubics

Traves and Wehlau recently gave a straightedge construction that checks whether 10 points lie on a plane cubic curve. They also highlighted several open problems in the synthetic geometry of cubics. Hermann Grassmann investigated incidence relations among points on cubic curves in three papers appearing in Crelle's Journal from 1846 to 1856. Grassmann's methods give an alternative way to check whether 10 points lie on a cubic. Using Grassmann's techniques, we solve the synthetic geometry problems introduced by Traves and Wehlau. In particular, we give straightedge constructions that find the intersection of a line with a cubic, find the tangent line to a cubic at a given point, and find the third point of intersection of this tangent line with the cubic. As well, given 5 points on a conic and a cubic and 4 additional points on the cubic, a straightedge construction is given that finds the sixth intersection point of the conic and the cubic. The paper ends with two open problems.

math.AG↗

arXiv2022

Geometric aspects of the Jacobian of a hyperplane arrangement

An embedding of the complete bipartite graph $K_{3,3}$ in $\mathbb{P}^2$ gives rise to both a line arrangement and a bar-and-joint framework. For a generic placement of the six vertices, the graded Betti numbers of the logarithmic module of derivations of the line arrangement are constant, but an example due to Ziegler shows that the graded Betti numbers are different when the points lie on a conic. Similarly, in rigidity theory a generic embedding of $K_{3,3}$ in the plane is an infinitesimally rigid bar-and-joint framework, but the framework is infinitesimally flexible when the points lie on a conic. In this paper we develop the theory of weak perspective representations of hyperplane arrangements to formalize and generalize the striking connection between hyperplane arrangements and rigidity theory that this example suggests. In particular, we seek to understand how the interplay of combinatorics and geometry influence algebraic structures associated to an arrangement, such as the saturation of the Jacobian ideal of the arrangement. We make connections between examples and constructions from rigidity theory and interesting phenomena in the study of hyperplane arrangements.

math.AC↗

arXiv2021

Ten Points on a Cubic

The 16-year old Blaise Pascal found a way to determine if 6 points lie on a conic using a straightedge. Nearly 400 years later, we develop a method that uses a straightedge to check whether 10 points lie on a plane cubic curve.

math.AG↗

arXiv2020

Geometric Equations for Matroid Varieties

Each point $x$ in Gr$(r,n)$ corresponds to an $r \times n$ matrix $A_x$ which gives rise to a matroid $M_x$ on its columns. Gel'fand, Goresky, MacPherson, and Serganova showed that the sets $\{y \in \mathrm{Gr}(r,n) | M_y = M_x\}$ form a stratification of Gr$(r,n)$ with many beautiful properties. However, results of Mnëv and Sturmfels show that these strata can be quite complicated, and in particular may have arbitrary singularities. We study the ideals $I_x$ of matroid varieties, the Zariski closures of these strata. We construct several classes of examples based on theorems from projective geometry and describe how the Grassmann-Cayley algebra may be used to derive non-trivial elements of $I_x$ geometrically when the combinatorics of the matroid is sufficiently rich.

math.AG↗

arXiv2014

The Enumerative Geometry of Hyperplane Arrangements

We study enumerative questions on the moduli space $\mathcal{M}(L)$ of hyperplane arrangements with a given intersection lattice $L$. Mnëv's universality theorem suggests that these moduli spaces can be arbitrarily complicated; indeed it is even difficult to compute the dimension $D =\dim \mathcal{M}(L)$. Embedding $\mathcal{M}(L)$ in a product of projective spaces, we study the degree $N=\mathrm{deg} \mathcal{M}(L)$, which can be interpreted as the number of arrangements in $\mathcal{M}(L)$ that pass through $D$ points in general position. For generic arrangements $N$ can be computed combinatorially and this number also appears in the study of the Chow variety of zero dimensional cycles. We compute $D$ and $N$ using Schubert calculus in the case where $L$ is the intersection lattice of the arrangement obtained by taking multiple cones over a generic arrangement. We also calculate the characteristic numbers for families of generic arrangements in $\mathbb{P}^2$ with 3 and 4 lines.

math.AG↗

arXiv2011

Generalizing the Converse to Pascal's Theorem via Hyperplane Arrangements and the Cayley-Bacharach Theorem

Using a new point of view inspired by hyperplane arrangements, we generalize the converse to Pascal's Theorem, sometimes called the Braikenridge-Maclaurin Theorem. In particular, we show that if 2k lines meet a given line, colored green, in k triple points and if we color the remaining lines so that each triple point lies on a red and blue line then the points of intersection of the red and blue lines lying off the green line lie on a unique curve of degree k-1. We also use these ideas to extend a second generalization of the Braikenridge-Maclaurin Theorem, due to Möbius. Finally we use Terracini's Lemma and secant varieties to show that this process constructs a dense set of curves in the space of plane curves of degree d, for degrees d <= 5. The process cannot produce a dense set of curves in higher degrees. The exposition is embellished with several exercises designed to amuse the reader.

math.AG↗

arXiv2008

Automorphism groups of generalized Reed-Solomon codes

We look at AG codes associated to the projective line, re-examining the problem of determining their automorphism groups (originally investigated by Duer in 1987 using combinatorial techniques) using recent methods from algebraic geometry. We (re)classify those finite groups that can arise as the automorphism group of an AG code for the projective line and give an explicit description of how these groups appear. We also give examples of generalized Reed-Solomon codes with large automorphism groups G, such as G=PSL(2,q), and explicitly describe their G-module structure.

math.AG↗

arXiv2004

Representations of finite groups on Riemann-Roch spaces

We study the action of a finite group on the Riemann-Roch space of certain divisors on a curve. If $G$ is a finite subgroup of the automorphism group of a projective curve $X$ over an algebraically closed field and $D$ is a divisor on $X$ left stable by $G$ then we show the irreducible constituents of the natural representation of $G$ on the Riemann-Roch space $L(D)=L_X(D)$ are of dimension $\leq d$, where $d$ is the size of the smallest $G$-orbit acting on $X$. We give an example to show that this is, in general, sharp (i.e., that dimension $d$ irreducible constituents can occur). Connections with coding theory, in particular to permutation decoding of AG codes, are discussed in the last section. Many examples are included.

math.AG↗