LPLuis David García Puente

Luis David García Puente

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Luis David García Puente has a total of 57 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Arithmetical structures on bidents

    by Kassie Archer, Abigail Bishop, Alexander Diaz-Lopez, Luis David Garcia Puente, Darren Glass, Joel Louwsma

    An arithmetical structure on a finite, connected graph $G$ is a pair of vectors $(\mathbf{d}, \mathbf{r})$ with positive integer entries for which $(\operatorname{diag}(\mathbf{d}) - A)\mathbf{r} = \mathbf{0}$, where $A$ is the adjacency matrix of $G$ and where the entries of $\mathbf{r}$ have no common factor. The critical group of an arithmetical structure is the torsion part of the cokernel of $(\operatorname{diag}(\mathbf{d}) - A)$. In this paper, we study arithmetical structures and their critical groups on bidents, which are graphs consisting of a path with two "prongs" at one end. We give a process for determining the number of arithmetical structures on the bident with $n$ vertices and show that this number grows at the same rate as the Catalan numbers as $n$ increases. We also completely characterize the groups that occur as critical groups of arithmetical structures on bidents.

  • Open Access

    Counting Arithmetical Structures on Paths and Cycles

    by Benjamin Braun, Hugo Corrales, Scott Corry, Luis David García Puente, Darren Glass, Nathan Kaplan, Jeremy L. Martin, Gregg Musiker, Carlos E. Valencia

    Let $G$ be a finite, simple, connected graph. An arithmetical structure on $G$ is a pair of positive integer vectors $\mathbf{d},\mathbf{r}$ such that $(\mathrm{diag}(\mathbf{d})-A)\mathbf{r}=0$, where $A$ is the adjacency matrix of $G$. We investigate the combinatorics of arithmetical structures on path and cycle graphs, as well as the associated critical groups (the cokernels of the matrices $(\mathrm{diag}(\mathbf{d})-A)$). For paths, we prove that arithmetical structures are enumerated by the Catalan numbers, and we obtain refined enumeration results related to ballot sequences. For cycles, we prove that arithmetical structures are enumerated by the binomial coefficients $\binom{2n-1}{n-1}$, and we obtain refined enumeration results related to multisets. In addition, we determine the critical groups for all arithmetical structures on paths and cycles.

  • Neural Ideals in SageMath

    by Ethan Petersen, Nora Youngs, Ryan Kruse, Dane Miyata, Rebecca Garcia, Luis David García Puente


  • Open Access

    Gröbner Bases of Neural Ideals

    by Rebecca Garcia, Luis David García Puente, Ryan Kruse, Jessica Liu, Dane Miyata, Ethan Petersen, Kaitlyn Phillipson, Anne Shiu

    The brain processes information about the environment via neural codes. The neural ideal was introduced recently as an algebraic object that can be used to better understand the combinatorial structure of neural codes. Every neural ideal has a particular generating set, called the canonical form, that directly encodes a minimal description of the receptive field structure intrinsic to the neural code. On the other hand, for a given monomial order, any polynomial ideal is also generated by its unique (reduced) Gr\"obner basis with respect to that monomial order. How are these two types of generating sets -- canonical forms and Gr\"obner bases -- related? Our main result states that if the canonical form of a neural ideal is a Gr\"obner basis, then it is the universal Gr\"obner basis (that is, the union of all reduced Gr\"obner bases). Furthermore, we prove that this situation -- when the canonical form is a Gr\"obner basis -- occurs precisely when the universal Gr\"obner basis contains only pseudo-monomials (certain generalizations of monomials). Our results motivate two questions: (1)~When is the canonical form a Gr\"obner basis? (2)~When the universal Gr\"obner basis of a neural ideal is {\em not} a canonical form, what can the non-pseudo-monomial elements in the basis tell us about the receptive fields of the code? We give partial answers to both questions. Along the way, we develop a representation of pseudo-monomials as hypercubes in a Boolean lattice.

  • Open Access

    The Sandpile Group of a Thick Cycle Graph

    by Diane Christine Alar, Jonathan Celaya, Luis David García Puente, Micah Henson, Ashley K. Wheeler

    The majority of graphs whose sandpile groups are known are either regular or simple. We give an explicit formula for a family of non-regular multi-graphs called thick cycles. A thick cycle graph is a cycle where multi-edges are permitted. Its sandpile group is the direct sum of cyclic groups of orders given by quotients of greatest common divisors of minors of its Laplacian matrix. We show these greatest common divisors can be expressed in terms of monomials in the graph's edge multiplicities.

  • Open Access

    The Avalanche Polynomial of a Graph

    by Demara Austin, Megan Chambers, Rebecca Funke, Luis David García Puente, Lauren Keough

    The (univariate) avalanche polynomial of a graph, introduced by Cori, Dartois and Rossin in 2006, captures the distribution of the length of (principal) avalanches in the abelian sandpile model. This polynomial has been used to show that the avalanche distribution in the sandpile model on a multiple wheel graph does not follow the expected power law function. In this article, we introduce the (multivariate) avalanche polynomial that enumerates the toppling sequences of all principal avalanches. This polynomial generalizes the univariate avalanche polynomial and encodes more information. In particular, the avalanche polynomial of a tree uniquely identifies the underlying tree. In this paper, the avalanche polynomial is characterized for trees, cycles, wheels, and complete graphs.

  • Open Access

    An algebra-based method for inferring gene regulatory networks

    by Paola Vera-Licona, Abdul Jarrah, Luis D Garcia-Puente, John McGee, Reinhard Laubenbacher

    The inference of gene regulatory networks (GRNs) from experimental observations is at the heart of systems biology. This includes the inference of both the network topology and its dynamics. While there are many algorithms available to infer the network topology from experimental data, less emphasis has been placed on methods that infer network dynamics. Furthermore, since the network inference problem is typically underdetermined, it is essential to have the option of incorporating into the inference process, prior knowledge about the network, along with an effective description of the search space of dynamic models. Finally, it is also important to have an understanding of how a given inference method is affected by experimental and other noise in the data used.


  • Open Access

    Graphical models in Macaulay2

    by Luis David García-Puente, Sonja Petrović, Seth Sullivant

    The Macaulay2 package GraphicalModels contains algorithms for the algebraic study of graphical models associated to undirected, directed and mixed graphs, and associated collections of conditional independence statements. Among the algorithms implemented are procedures for computing the vanishing ideal of graphical models, for generating conditional independence ideals of families of independence statements associated to graphs, and for checking for identifiable parameters in Gaussian mixed graph models. These procedures can be used to study fundamental problems about graphical models.

  • Open Access

    Algebraic and combinatorial aspects of sandpile monoids on directed graphs

    by Scott Chapman, Rebecca Garcia, Luis David García-Puente, Martin E. Malandro, Ken W. Smith

    The sandpile group of a graph is a well-studied object that combines ideas from algebraic graph theory, group theory, dynamical systems, and statistical physics. A graph's sandpile group is part of a larger algebraic structure on the graph, known as its sandpile monoid. Most of the work on sandpiles so far has focused on the sandpile group rather than the sandpile monoid of a graph, and has also assumed the underlying graph to be undirected. A notable exception is the recent work of Babai and Toumpakari, which builds up the theory of sandpile monoids on directed graphs from scratch and provides many connections between the combinatorics of a graph and the algebraic aspects of its sandpile monoid. In this paper we primarily consider sandpile monoids on directed graphs, and we extend the existing theory in four main ways. First, we give a combinatorial classification of the maximal subgroups of a sandpile monoid on a directed graph in terms of the sandpile groups of certain easily-identifiable subgraphs. Second, we point out certain sandpile results for undirected graphs that are really results for sandpile monoids on directed graphs that contain exactly two idempotents. Third, we give a new algebraic constraint that sandpile monoids must satisfy and exhibit two infinite families of monoids that cannot be realized as sandpile monoids on any graph. Finally, we give an explicit combinatorial description of the sandpile group identity for every graph in a family of directed graphs which generalizes the family of (undirected) distance-regular graphs. This family includes many other graphs of interest, including iterated wheels, regular trees, and regular tournaments.

  • Open Access

    The Secant Conjecture in the real Schubert calculus

    by Luis Garcia-Puente, Nickolas Hein, Christopher J. Hillar, Abraham Martin del Campo, James Ruffo, Frank Sottile, Zach Teitler

    We formulate the Secant Conjecture, which is a generalization of the Shapiro Conjecture for Grassmannians. It asserts that an intersection of Schubert varieties in a Grassmannian is transverse with all points real, if the flags defining the Schubert varieties are secant along disjoint intervals of a rational normal curve. We present theoretical evidence for it as well as computational evidence obtained in over one terahertz-year of computing, and we discuss some phenomena we observed in our data.