Related papers: Jacobian graphs
We address the problem of identifying families of discrete models naturally flowing in continuum limit to relativistic quantum field theories. We call them Dirac graphs. In this work, we require the graphs to obey spectrality property,…
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 prove that every connected strongly regular graph on sufficiently many vertices is Hamiltonian. We prove this by showing that, apart from three families, connected strongly regular graphs are (highly) pseudo-random. Our results suggest a…
We show a direct calculation of Jacobian matrices in the old problems of rational curves on generic hypersurfaces.
The spectrum of the normalized graph Laplacian yields a very comprehensive set of invariants of a graph. In order to understand the information contained in those invariants better, we systematically investigate the behavior of this…
We define a natural class of graphs by generalizing prior notions of visibility, allowing the representing regions and sightlines to be arbitrary. We consider mainly the case of compact connected representing regions, proving two results…
In this paper we characterize, in two different ways, the Newton polygons which are jacobian Newton polygons of a branch. These characterizations give in particular combinatorial criteria of irreducibility for complex series in two…
A random algebraic graph is defined by a group $G$ with a uniform distribution over it and a connection $\sigma:G\longrightarrow[0,1]$ with expectation $p,$ satisfying $\sigma(g)=\sigma(g^{-1}).$ The random graph…
We investigate in some detail a recently suggested general class of ensembles of sparse undirected random graphs based on a hidden stub-coloring, with or without the restriction to nondegenerate graphs. The calculability of local and global…
We examine the capacity of the complementarity spectrum to distinguish non-isomorphic digraphs. We focus on the seven families with exactly three complementarity eigenvalues. Our findings reveal that in some, but not all families, any two…
This is an introduction to graph theory, from a geometric and analytic viewpoint. A finite graph $X$ is described by its adjacency matrix $d\in M_N(0,1)$, which can be thought of as being a kind of discrete Laplacian, and we first discuss…
We give a general account of family algebras over a finitely presented linear operad, this operad together with its presentation naturally defining an algebraic structure on the set of parameters.
We survey the theory of the compactified Jacobian associated to a singular curve. We focus on describing low genus examples using the Abel map.
An intuitive property of a random graph is that its subgraphs should also appear randomly distributed. We consider graphs whose subgraph densities exactly match their expected values. We call graphs with this property for all subgraphs with…
Consider an ordinary differential equation which has a Lax pair representation A'(x)= [A(x),B(x)], where A(x) is a matrix polynomial with a fixed regular leading coefficient and the matrix B(x) depends only onA(x). Such an equation can be…
In this paper, we make specific conjectures about the distribution of Jacobians of random graphs with their canonical duality pairings. Our conjectures are based on a Cohen-Lenstra type heuristic saying that a finite abelian group with…
Any counterexample to the two-dimensional Jacobian Conjecture gives a rational map from one projective plane to another. We use some ideas of the Minimal Model Program to study the combinatorial structure of a rational surface, that is…
We use the line digraph construction to associate an orthogonal matrix with each graph. From this orthogonal matrix, we derive two further matrices. The spectrum of each of these three matrices is considered as a graph invariant. For the…
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…
For a flexible labeling of a graph, it is possible to construct infinitely many non-equivalent realizations keeping the distances of connected points constant. We give a combinatorial characterization of graphs that have flexible labelings.…