arXiv subjects
Publications and source records attributed to Taylor Brysiewicz.
We establish how the coefficients of a sparse polynomial system influence the sum (or the trace) of its zeros. As an application, we develop numerical tests for verifying whether a set of solutions to a sparse system is complete. These algorithms extend the classical trace test in numerical algebraic geometry. Our results rely on both the analysis of the structure of sparse resultants as well as an extension of Esterov's results on monodromy groups of sparse systems.
We examine quadratic surfaces in 3-space that are tangent to nine given figures. These figures can be points, lines, planes or quadrics. The numbers of tangent quadrics were determined by Hermann Schubert in 1879. We study the associated systems of polynomial equations, also in the space of complete quadrics, and we solve them using certified numerical methods. Our aim is to show that Schubert's problems are fully real.
We compute the degree of Stiefel manifolds, that is, the variety of orthonormal frames in a finite dimensional vector space. Our approach employs techniques from classical algebraic geometry, algebraic combinatorics, and classical invariant theory.
Amendola et al. proposed a method for solving systems of polynomial equations lying in a family which exploits a recursive decomposition into smaller systems. A family of systems admits such a decomposition if and only if the corresponding Galois group is imprimitive. When the Galois group is imprimitive we consider the problem of computing an explicit decomposition. A consequence of Esterov's classification of sparse polynomial systems with imprimitive Galois groups is that this decomposition is obtained by inspection. This leads to a recursive algorithm to solve decomposable sparse systems, which we present and give evidence for its efficiency.
We classify transversal quintic spectrahedra by the location of 20 nodes on the respective real determinantal surface of degree 5. We identify 65 classes of such surfaces and find an explicit representative in each of them.
The Macaulay2 package DecomposableSparseSystems implements methods for studying and numerically solving decomposable sparse polynomial systems. We describe the structure of decomposable sparse systems and explain how the methods in this package may be used to exploit this structure, with examples.
We develop a collection of numerical algorithms which connect ideas from polyhedral geometry and algebraic geometry. The first algorithm we develop functions as a numerical oracle for the Newton polytope of a hypersurface and is based on ideas of Hauenstein and Sottile. Additionally, we construct a numerical tropical membership algorithm which uses the former algorithm as a subroutine. Based on recent results of Esterov, we give an algorithm which recursively solves a sparse polynomial system when the support of that system is either lacunary or triangular. Prior to explaining these results, we give necessary background on polytopes, algebraic geometry, monodromy groups of branched covers, and numerical algebraic geometry.
We present our implementation of an algorithm which functions as a numerical oracle for the Newton polytope of a hypersurface in the Macaulay2 package NumericalNP.m2. We propose a tropical membership test, relying on this algorithm, for higher codimension varieties based on ideas from Hept and Theobald. To showcase this software, we investigate the Newton polytope of both a hypersurface coming from algebraic vision and the Luroth invariant.
We consider the problem of geometrically approximating a complex analytic curve in the plane by the image of a polynomial parametrization $t \mapsto (x_1(t),x_2(t))$ of bidegree $(d_1,d_2)$. We show the number of such curves is the number of primitive necklaces on $d_1$ white beads and $d_2$ black beads. We show that this number is odd when $d_1=d_2$ is squarefree and use this to give a partial solution to a conjecture by Rababah. Our results naturally extend to a generalization regarding hypersurfaces in higher dimensions. There, the number of parametrized curves of multidegree $(d_1,\ldots,d_n)$ which optimally osculate a given hypersurface are counted by the number of primitive necklaces with $d_i$ beads of color $i$.
We provide a closed formula for the degree of $\text{SO}(n)$ over an algebraically closed field of characteristic zero. In addition, we describe symbolic and numerical techniques which can also be used to compute the degree of $\text{SO}(n)$ for small values of $n$. As an application of our results, we give a formula for the number of critical points of a low-rank semidefinite programming optimization problem. Finally, we provide some evidence for a conjecture regarding the real locus of $\text{SO}(n)$.