Related papers: Jacobian graphs
In this note we give explicit constructions of decomposable hyperelliptic Jacobian varieties over fields of characteristic $0$. These include hyperelliptic Jacobian varieties that are isogenous to a product of two absolutely simple…
A new family of $n$-dimensional solutions of the Jacobi identities is characterized. Such a family is very general, thus unifying in a common framework many different well-known Poisson systems seemingly unrelated. This unification is not…
We report new examples of Sidon sets in abelian groups arising from algebraic geometry.
We study operators on rooted graphs with a certain spherical homogeneity. These graphs are called path commuting and allow for a decomposition of the adjacency matrix and the Laplacian into a direct sum of Jacobi matrices which reflect the…
It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…
Graphs that are squares under the gluing algebra arise in the study of homomorphism density inequalities such as Sidorenko's conjecture. Recent work has focused on these homomorphism density applications. This paper takes a new perspective…
These lecture notes are a personal introduction to signed graphs, concentrating on the aspects that have been most persistently interesting to me. They are just a few corners of signed graph theory; I am leaving out a great deal. The…
Similarity notions between vertices in a graph, such as structural and regular equivalence, are one of the main ingredients in clustering tools in complex network science. We generalise structural and regular equivalences for undirected…
We study the structure of Jacobians of geometrically reduced curves over arbitrary (i. e., not necessarily perfect) fields. We show that, while such a group scheme cannot in general be decomposed into an affine and an Abelian part as over…
We give a construction of a family of (weighted) graphs that are pairwise cospectral with respect to the normalized Laplacian matrix, or equivalently probability transition matrix. This construction can be used to form pairs of cospectral…
We use orientations on stable graphs to express the combinatorial structure of the compactified universal Jacobians in degrees g-1 and g over the moduli space of stable curves, \Mgb, and construct for them graded stratifications compatible…
Computing the embedding distribution of a given graph is a fundamental question in topological graph theory. In this article, we extend our viewpoint to a sequence of graphs and consider their asymptotic embedding distributions, which are…
The optimal calculation order of a computational graph can be represented by a set of algebraic expressions. Computational graph and algebraic expression both have close relations and significant differences, this paper looks into these…
In this paper, we introduce some particular families of graphicable algebras obtained by following a relatively new line of research, initiated previously by some of the authors. It consists of the use of certain objects of Discrete…
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…
We give two characterizations of Jacobians of curves with involution having fixed points in the framework of two particular cases of Welter's trisecant conjecture. The geometric form of each of these characterizations is the statement that…
We investigate character degree graphs of solvable groups. In particular, we provide general results that can be used to eliminate which degree graphs can occur as solvable groups. Finally, we show a specific family of graphs cannot occur…
In contrast to the usual quantum systems which have at most a finite number of open spectral gaps if they are periodic in more than one direction, periodic quantum graphs may have gaps arbitrarily high in the spectrum. This property of…
Directed acyclic graphs are a fundamental class of networks that includes citation networks, food webs, and family trees, among others. Here we define a random graph model for directed acyclic graphs and give solutions for a number of the…
Traditional random graph models of networks generate networks that are locally tree-like, meaning that all local neighborhoods take the form of trees. In this respect such models are highly unrealistic, most real networks having strongly…