arXiv subjects

Jordy Lopez Garcia

Publications and source records attributed to Jordy Lopez Garcia.

9 recordsLinked to original sources

arXiv2026

Numerical Elimination: Computing Complements of Real Hypersurfaces Using Pseudo-Witness Sets

Many hypersurfaces in algebraic geometry, such as discriminants, arise as the projection of another variety. The real complement of such a hypersurface decomposes into connected components. In this paper, we propose a new method for computing these components. Existing methods require the explicit equation of the hypersurface as input. However, computing this equation by elimination can be computationally demanding or even infeasible. Our approach instead derives from univariate interpolation by computing the intersection of the hypersurface with a line. Such an intersection may be computed using so-called pseudo-witness sets without computing a defining equation for the hypersurface. We implement our approach in a forthcoming Julia package and demonstrate, on several examples, that the resulting algorithm accurately recovers all components of the real complement of the hypersurface.

math.AG↗

arXiv2026

Common Real Secants to Pairs of Real Twisted Cubic Curves

It is well established that a general pair of twisted cubic curves in complex projective space has ten common secant lines. As an initial investigation, we show that the monodromy group of the ten common secant lines over the complex numbers is the full symmetric group demonstrating that the common secant lines have no special structure over the complex numbers. We then investigate a novel question in real algebraic geometry: describe the possible collections of ten common secant lines to a pair of real projective twisted cubic curves. In addition to distinguishing between real and nonreal secant lines, we introduce a refinement of this classification which takes intersection points into account yielding totally real, partially real, and minimally real secant lines. Using computational algebraic geometry as well as combinatorics, we show that for each $k$ between 0 and 10, there exist pairs of real twisted cubic curves with exactly $k$ common totally real secant lines. We also obtain examples of real twisted cubics whose sets of common real secants cover a wide range of possibilities within our admissible classification of common real secant lines.

math.AG↗

arXiv2025

Transfers and Unstable Degrees in the $\mathbb{A}^{1}$-Brouwer Degrees Package for Macaulay2

We describe a significant update to the Macaulay2 package A1BrouwerDegrees. We extend several methods in the previous version of the package to the setting of finite étale algebras, allowing the computation of transfers along finite étale extensions. Additionally, we implement a number of new features for the computation of unstable $\mathbb{A}^{1}$-Brouwer degrees and manipulation of classes in the unstable Grothendieck--Witt group.

math.AG↗

arXiv2025

Identifiability of directed-cycle and catenary linear compartment models

A parameter of a mathematical model is structurally identifiable if it can be determined from noiseless experimental data. Here, we examine the identifiability properties of two important classes of linear compartmental models: directed-cycle models and catenary models (models for which the underlying graph is a directed cycle or a bidirected path, respectively). Our main result is a complete characterization of the directed-cycle models for which every parameter is (generically locally) identifiable. Additionally, for catenary models, we give a formula for their input-output equations. Such equations are used to analyze identifiability, so we expect our formula to support future analyses into the identifiability of catenary models. Our proofs rely on prior results on input-output equations, and we also use techniques from linear algebra and graph theory.

math.CO↗

arXiv2025

Additive Invariants of Open Petri Nets

We classify all additive invariants of open Petri nets: these are $\mathbb{N}$-valued invariants which are additive with respect to sequential and parallel composition of open Petri nets. In particular, we prove two classification theorems: one for open Petri nets and one for monically open Petri nets (i.e. open Petri nets whose interfaces are specified by monic maps). Our results can be summarized as follows. The additive invariants of open Petri nets are completely determined by their values on a particular class of single-transition Petri nets. However, for monically open Petri nets, the additive invariants are determined by their values on transitionless Petri nets and all single-transition Petri nets. Our results confirm a conjecture of John Baez (stated during the AMS' 2022 Mathematical Research Communities workshop).

math.CT↗

arXiv2024

Deficiency of chemical reaction networks: The effect of operations that preserve multistationarity and periodic orbits

We investigate six operations on chemical reaction networks, all of which have been proven to preserve important dynamical properties, namely, the capacity for nondegenerate multistationarity (multiple steady states) and periodic orbits. Both multistationarity and periodic orbits are properties that are known to be precluded when the deficiency (a nonnegative integer associated to a network) is zero. It is therefore natural to conjecture that the deficiency never decreases when any of the six aforementioned network operations are performed. We prove that this is indeed the case, and moreover, we characterize the numerical difference in deficiency after performing each network operation.

math.DS↗

arXiv2024

Irreducibility of the Dispersion Polynomial for Periodic Graphs

We use methods from algebra and discrete geometry to study the irreducibility of the dispersion polynomial of a discrete periodic operator associated to a periodic graph after changing the period lattice. We provide numerous applications of these results to discrete periodic operators associated to families of graphs which include dense periodic graphs, and a family containing the hexagonal and diamond lattices.

math.AG↗

arXiv2024

$\mathbb{A}^1$-Brouwer degrees in Macaulay2

We describe the Macaulay2 package "A1BrouwerDegrees" for computing local and global $\mathbb{A}^1$-Brouwer degrees and studying symmetric bilinear forms over the complex numbers, the real numbers, the rational numbers, and finite fields of characteristic not equal to 2.

math.AG↗

arXiv2022

Real solutions to systems of polynomial equations in Macaulay2

The Macaulay2 package RealRoots provides symbolic methods to study real solutions to systems of polynomial equations. It updates and expands an earlier package developed by Grayson and Sottile in 1999. We provide mathematical background and descriptions of the RealRoots package, giving examples which illustrate some of its implemented methods. We also prove a general version of Sylvester's Theorem whose statement and proof we could not find in the literature.

math.AG↗