Related papers: Gonality of algebraic curves and graphs
An oriented graph is a directed graph without any cycle of length at most 2. To push a vertex of a directed graph is to reverse the orientation of the arcs incident to that vertex. Klostermeyer and MacGillivray defined push graphs which are…
Graph classification plays an important role is data mining, and various methods have been developed recently for classifying graphs. In this paper, we propose a novel method for graph classification that is based on homotopy equivalence of…
A graph is said to be globally rigid if almost all embeddings of the graph's vertices in the Euclidean plane will define a system of edge-length equations with a unique (up to isometry) solution. In 2007, Jackson, Servatius and Servatius…
We construct two families of Dantzig figures, which are $(d,2d)$-polytopes with an antipodal vertex pair, from convex hulls of initial subsets for the graded lexicographic (grlex) and graded reverse lexicographic (grevlex) orders on…
We use Green's canonical syzygy conjecture for generic curves to prove that the Green-Lazarsfeld gonality conjecture holds for generic curves of genus g, and gonality d, if $g/3<d<[g/2]+2$.
In this paper, we introduce the concepts of representation and dual representation for averaging Leibniz algebras. We also develop a cohomology theory for these algebras. Additionally, we explore the infinitesimal and formal deformation…
Given two graphs G and H, we ask under which conditions there is a relation R that generates the edges of H given the structure of graph G. This construction can be seen as a form of multihomomorphism. It generalizes surjective…
We define Leavitt path algebras of hypergraphs generalizing simultaneously Leavitt path algebras of finitely separated graphs and Leavitt path algebras of row-finite vertex-weighted graphs. We find linear bases for those algebras, compute…
To investigate the topological structure of Morse flows on the 2-disk we use the planar graphs as destinguished graph of the flow. We assume, that the flow is transversal to the boundary of the 2-disk. We give a list of all planar graph…
Introduced the quantitative measure of the structural complexity of the graph (complex network, etc.) based on a procedure similar to the renormalization process, considering the difference between actual and averaged graph structures on…
This paper gives a novel and compact proof that a metric graph consisting of a chain of loops of torsion order $0$ is Brill-Noether general (a theorem of Cools-Draisma-Payne-Robeva), and a finite or metric graph consisting of a chain of…
We study the second Gaussian map for a curve X of genus g, in relation with the second fundamental form of the period map. We exhibit a class of infinitely many curves with surjective second Gaussian map. We compute its rank on the…
Graph rigidity, the study of vertex realizations in $\mathbb{R}^d$ and the motions that preserve the induced edge lengths, has been the focus of extensive research for decades. Its equivalency to graph connectivity for $d=1$ is well known;…
In this paper, we present a constructive and proof-relevant development of graph theory, including the notion of maps, their faces, and maps of graphs embedded in the sphere, in homotopy type theory. This allows us to provide an elementary…
A cubical polytope is a polytope with all its facets being combinatorially equivalent to cubes. The paper is concerned with the linkedness of the graphs of cubical polytopes. A graph with at least $2k$ vertices is \textit{$k$-linked} if,…
We characterise when the Leavitt path algebras over $\mathbb{Z}$ of two arbitrary countable directed graphs are $*$-isomorphic by showing that two Leavitt path algebras over $\mathbb{Z}$ are $*$-isomorphic if and only if the corresponding…
A one-degree-of-freedom graph is a graph obtained from a minimally rigid graph in the plane and removing an edge. For such graph, the set of realisations with fixed edge length, modulo rotations and reflections, is an algebraic curve. The…
We exploit three classical characterizations of smooth genus two curves to study their tropical and analytic counterparts. First, we provide a combinatorial rule to determine the dual graph of each algebraic curve and the metric structure…
This paper considers *-graphs in which all vertices have degree 4 or 6, and studies the question of calculating the genus of orientable 2-surfaces into which such graphs may be embedded. A *-graph is a graph endowed with a formal adjacency…
A new global approach in the study of duality transformations is introduced. The geometrical structure of complex line bundles is generalized to higher order U(1) bundles which are classified by quantized charges and duality maps are…