arXiv subjects

Darren Glass

Publications and source records attributed to Darren Glass.

At least 19 recordsLinked to original sources

arXiv2025

Generalized chip firing and critical groups of arithmetical structures on trees

Chip firing provides a way to study the sandpile group (also known as the Jacobian) of a graph. We use a generalized version of chip firing to bound the number of invariant factors of the critical group of an arithmetical structure on a graph. We also show that, under suitable hypotheses, critical groups are additive under wedge sums of graphs with arithmetical structures. These results allow us to relate the number of invariant factors of critical groups associated to any given tree to decompositions of the tree into simpler trees. We use this to classify those trees for which every arithmetical structure has cyclic critical group. Finally, we show how to construct arithmetical structures on trees with prescribed critical groups. In particular, every finite abelian group is realized as the critical group of some arithmetical structure on a tree.

math.CO↗

arXiv2023

Critical groups of arithmetical structures on star graphs and complete graphs

An arithmetical structure on a finite, connected graph without loops is an assignment of positive integers to the vertices that satisfies certain conditions. Associated to each of these is a finite abelian group known as its critical group. We show how to determine the critical group of an arithmetical structure on a star graph or complete graph in terms of the entries of the arithmetical structure. We use this to investigate which finite abelian groups can occur as critical groups of arithmetical structures on these graphs.

math.CO↗

arXiv2020

Arithmetical structures on bidents

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.

math.CO↗

arXiv2020

Counting Finite Index Subrings of $\mathbb{Z}^n$

We count subrings of small index of $\mathbb{Z}^n$, where the addition and multiplication are defined componentwise. Let $f_n(k)$ denote the number of subrings of index $k$. For any $n$, we give a formula for this quantity for all integers $k$ that are not divisible by a 9th power of a prime, extending a result of Liu.

math.CO↗

arXiv2019

Arithmetical Structures on Paths With a Doubled Edge

An arithmetical structure on a graph is given by a labeling of the vertices which satisfies certain divisibility properties. In this note, we look at several families of graphs and attempt to give counts on the number of arithmetical structures for graphs in these families.

math.CO↗

arXiv2018

Multiparty Non-Interactive Key Exchange and More From Isogenies on Elliptic Curves

We describe a framework for constructing an efficient non-interactive key exchange (NIKE) protocol for n parties for any n >= 2. Our approach is based on the problem of computing isogenies between isogenous elliptic curves, which is believed to be difficult. We do not obtain a working protocol because of a missing step that is currently an open mathematical problem. What we need to complete our protocol is an efficient algorithm that takes as input an abelian variety presented as a product of isogenous elliptic curves, and outputs an isomorphism invariant of the abelian variety. Our framework builds a cryptographic invariant map, which is a new primitive closely related to a cryptographic multilinear map, but whose range does not necessarily have a group structure. Nevertheless, we show that a cryptographic invariant map can be used to build several cryptographic primitives, including NIKE, that were previously constructed from multilinear maps and indistinguishability obfuscation.

cs.CR↗

arXiv2017

Counting Arithmetical Structures on Paths and Cycles

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.

math.CO↗

arXiv2016

Critical Groups of Graphs with Dihedral Actions II

In this paper we consider the critical group of finite connected graphs which admit harmonic actions by the dihedral group $D_n$, extending earlier work by the author and Criel Merino. In particular, we show that the critical group of such a graph can be decomposed in terms of the critical groups of the quotients of the graph by certain subgroups of the automorphism group. This is analogous to a theorem of Kani and Rosen which decomposes the Jacobians of algebraic curves with a $D_n$-action.

math.CO↗

arXiv2015

Cyclic Critical Groups of Graphs

In this note, we describe a construction that leads to families of graphs whose critical groups are cyclic. For some of these families we are able to give a formula for the number of spanning trees of the graph, which then determines the group exactly. We also pose several open questions related to this work.

math.CO↗

arXiv2014

Sandpiles, spanning trees, and plane duality

Let G be a connected, loopless multigraph. The sandpile group of G is a finite abelian group associated to G whose order is equal to the number of spanning trees in G. Holroyd et al. used a dynamical process on graphs called rotor-routing to define a simply transitive action of the sandpile group of G on its set of spanning trees. Their definition depends on two pieces of auxiliary data: a choice of a ribbon graph structure on G, and a choice of a root vertex. Chan, Church, and Grochow showed that if G is a planar ribbon graph, it has a canonical rotor-routing action associated to it, i.e., the rotor-routing action is actually independent of the choice of root vertex. It is well-known that the spanning trees of a planar graph G are in canonical bijection with those of its planar dual G*, and furthermore that the sandpile groups of G and G* are isomorphic. Thus, one can ask: are the two rotor-routing actions, of the sandpile group of G on its spanning trees, and of the sandpile group of G* on its spanning trees, compatible under plane duality? In this paper, we give an affirmative answer to this question, which had been conjectured by Baker.

math.CO↗

arXiv2013

Compositions of Integers With Bounded Parts

In this note, we consider ordered partitions of integers such that each entry is no more than a fixed portion of the sum. We give a method for constructing all such compositions as well as both an explicit formula and a generating function describing the number of $k$-tuples whose entries are bounded in this way and sum to a fixed value $g$.

math.NT↗

arXiv2013

Critical Groups of Graphs with Dihedral Actions

In this paper we consider the critical group of finite connected graphs which admit harmonic actions by the dihedral group $D_n$. In particular, we show that if the orbits of the $D_n$-action all have either $n$ or $2n$ points then the critical group of such a graph can be decomposed in terms of the critical groups of the quotients of the graph by certain subgroups of the automorphism group. This is analogous to a theorem of Kani and Rosen which decomposes the Jacobians of algebraic curves with a $D_n$-action.

math.CO↗

arXiv2012

Pointless Hyperelliptic Curves

In this paper we consider the question of whether there exists a hyperelliptic curve of genus $g$ which is defined over $\FF_q$ but has no rational points over $\FF_q$ for various pairs $(g,q)$.

math.NT↗

arXiv2007

Curves of given $p$-rank with trivial automorphism group

Let $k$ be an algebraically closed field of characteristic $p >0$. Suppose $g \geq 3$ and $0 \leq f \leq g$. We prove there is a smooth projective $k$-curve of genus $g$ and $p$-rank $f$ with no non-trivial automorphisms. In addition, we prove there is a smooth projective hyperelliptic $k$-curve of genus $g$ and $p$-rank $f$ whose only non-trivial automorphism is the hyperelliptic involution. The proof involves computations about the dimension of the moduli space of (hyperelliptic) $k$-curves of genus $g$ and $p$-rank $f$ with extra automorphisms.

math.NT↗

arXiv2006

The 2-ranks of Hyperelliptic Curves with Extra Automorphisms

This paper examines the relationship between the automorphism group of a hyperelliptic curve defined over an algebraically closed field of characteristic two and the 2-rank of the curve. In particular, we exploit the wild ramification to use the Deuring-Shafarevich formula in order to analyze the ramification of hyperelliptic curves that admit extra automorphisms and use this data to impose restrictions on the genera and 2-ranks of such curves. We also show how some of the techniques and results carry over to the case where our base field is of characteristic $p>2$.

math.NT↗

arXiv2006

Klein-Four covers of the projective line in characteristic two

In this paper we examine curves defined over a field of characteristic 2 which are $(\ZZ/2\ZZ)^2$-covers of the projective line. In particular, we prove which 2-ranks occur for such curves of a given genus and where possible we give explicit equations for such curves.

math.NT↗

arXiv2005

Hyperelliptic Curves with Prescribed $p$-Torsion

In this paper, we show that there exist families of curves (defined over an algebraically closed field $k$ of characteristic $p >2$) whose Jacobians have interesting $p$-torsion. For example, for every $0 \leq f \leq g$, we find the dimension of the locus of hyperelliptic curves of genus $g$ with $p$-rank at most $f$. We also produce families of curves so that the $p$-torsion of the Jacobian of each fibre contains multiple copies of the group scheme $α_p$. The method is to study curves which admit an action by $(\ZZ/2)^n$ so that the quotient is a projective line. As a result, some of these families intersect the hyperelliptic locus $\CH_g$.

math.NT↗

arXiv2002

Invariants Associated to Orthogonal $ε$-constants

In this paper we use the theory of $ε$-constants associated to tame finite group actions on arithmetic surfaces to define a Brauer group invariant $μ(\X,G,V)$ associated to certain symplectic motives of weight one. We then discuss the relationship between this invariant and $w_2(π)$, the Galois theoretic invariant associated to tame covers of surfaces.

math.NT↗