Related papers: The Jacobian of a Sixth-Root-of-Unity Matroid

Let $M$ be a regular matroid. The Jacobian group ${\rm Jac}(M)$ of $M$ is a finite abelian group whose cardinality is equal to the number of bases of $M$. This group generalizes the definition of the Jacobian group (also known as the…

Let $G$ be a finite undirected multigraph with no self-loops. The Jacobian $\operatorname{Jac}(G)$ is a finite abelian group associated with $G$ whose cardinality is equal to the number of spanning trees of $G$. There are only a finite…

We define a generalized Jacobian $\mathrm{J}_\mathfrak{m}(\mathit{Gr})$ and a generalized Picard group $\mathrm{P}_\mathfrak{m}(\mathit{Gr})$ of a graph $\mathit{Gr}$ with respect to a modulus $ \mathfrak{m}=\sum_{i=1}^s m_iw_i$ with $w_i$…

The Picard group of an undirected graph is a finitely generated abelian group, and the Jacobian is the torsion subgroup of the Picard group. These groups can be computed by using the Smith normal form of the Laplacian matrix of the graph or…

The Jacobian group (also known as the critical group or sandpile group) is an important invariant of a finite, connected graph $X$; it is a finite abelian group whose cardinality is equal to the number of spanning trees of $X$ (Kirchhoff's…

A matroid is a combinatorial structure that captures and generalizes the algebraic concept of linear independence under a broader and more abstract framework. Matroids are closely related with many other topics in discrete mathematics, such…

We determine explicitly the Picard groups of the universal Jacobian stack and of its compactification over the stack of stable curves. Along the way, we prove some results concerning the gerbe structure of the universal Jacobian stack over…

Let $G$ be a connected graph. The Jacobian group (also known as the Picard group or sandpile group) of $G$ is a finite abelian group whose cardinality equals the number of spanning trees of $G$. The Jacobian group admits a canonical simply…

Motivated by the appearance of embeddings in the theory of chip firing and the critical group of a graph, we introduce a version of the critical group (or sandpile group) for combinatorial maps, that is, for graphs embedded in orientable…

Subject to announced results by Geelen, Gerards, and Whittle, we completely characterize the highly connected members of the classes of dyadic, near-regular, and sixth-root-of-unity matroids.

Given a subgroup $\mathcal{H}$ of a product of finite groups $\mathcal{G} = \displaystyle\prod^n_{i=1} \Gamma_i$ and $b>1,$ we define a polymatroid $P(\mathcal{H},b).$ If all of the $\Gamma_i$ are isomorphic to $\mathbb{Z}/p\mathbb{Z},$ $p$…

This is an introductory paper about the category of regular oriented matroids (ROMs). We compare the homotopy types of the categories of regular and binary matroids. For example, in the unoriented case, they have the same fundamental group…

Previous work of Chan--Church--Grochow and Baker--Wang shows that the set of spanning trees in a plane graph $G$ is naturally a torsor for the Jacobian group of $G$. Informally, this means that the set of spanning trees of $G$ naturally…

We define the Laplacian matrix and the Jacobian group of a finite graph of groups. We prove analogues of the matrix tree theorem and the class number formula for the order of the Jacobian of a graph of groups. Given a group $G$ acting on a…

The Jacobian group of a graph is a finite abelian group through which we can study the graph in an algebraic way. When the graph is a finite abelian covering of another graph, the Jacobian group is equipped with the action of the Galois…

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…

Graphings serve as limit objects for bounded-degree graphs. We define the ``cycle matroid'' of a graphing as a submodular setfunction, with values in [0,1], which generalizes (up to normalization) the cycle matroid of finite graphs. We…

In this paper we construct a new, previously unknown four-parameter family of complex Hadamard matrices of order 6, the entries of which are described by algebraic functions of roots of various sextic polynomials. We conjecture that the…

We introduce jacobian graphs, which are explicit families of regular graphs that are spectrally indistinguishable from random graphs, but whose local structure is very different from that of random graphs. The construction relies on the…

For any smooth connected linear algebraic group G over an algebraically closed field k, we describe the Picard group of the universal moduli stack of principal G-bundles over pointed smooth k-projective curves.