Search engine for discovering works of Art, research articles, and books related to Art and Culture
Javascript must be enabled to continue!
Tropical graph curves
View through CrossRef
We study tropical line arrangements associated to a three-regular graph
$G$
that we refer to as
tropical graph curves
. Roughly speaking, the tropical graph curve associated to
$G$
, whose genus is
$g$
, is an arrangement of
$2g-2$
lines in tropical projective space that contains
$G$
(more precisely, the topological space associated to
$G$
) as a deformation retract. We show the existence of tropical graph curves when the underlying graph is a three-regular, three-vertex-connected planar graph. Our method involves explicitly constructing an arrangement of lines in projective space, i.e. a graph curve whose tropicalization yields the corresponding tropical graph curve and in this case, solves a topological version of the tropical lifting problem associated to canonically embedded graph curves. We also show that the set of tropical graph curves that we construct are connected via certain local operations. These local operations are inspired by Steinitz’ theorem in polytope theory.
Cambridge University Press (CUP)
Title: Tropical graph curves
Description:
We study tropical line arrangements associated to a three-regular graph
$G$
that we refer to as
tropical graph curves
.
Roughly speaking, the tropical graph curve associated to
$G$
, whose genus is
$g$
, is an arrangement of
$2g-2$
lines in tropical projective space that contains
$G$
(more precisely, the topological space associated to
$G$
) as a deformation retract.
We show the existence of tropical graph curves when the underlying graph is a three-regular, three-vertex-connected planar graph.
Our method involves explicitly constructing an arrangement of lines in projective space, i.
e.
a graph curve whose tropicalization yields the corresponding tropical graph curve and in this case, solves a topological version of the tropical lifting problem associated to canonically embedded graph curves.
We also show that the set of tropical graph curves that we construct are connected via certain local operations.
These local operations are inspired by Steinitz’ theorem in polytope theory.
Related Results
Graph convolutional neural networks for 3D data analysis
Graph convolutional neural networks for 3D data analysis
(English) Deep Learning allows the extraction of complex features directly from raw input data, eliminating the need for hand-crafted features from the classical Machine Learning p...
Inverse Jacobian and related topics for certain superelliptic curves
Inverse Jacobian and related topics for certain superelliptic curves
Given an elliptic curve E over the complex numbers (CC) given by y^2 = x^3 + ax + b, there exists a lattice L in CC such that the group E(CC) of complex points on E is isomorphic ...
Graph data warehousing
Graph data warehousing
Over the last decade, we have witnessed the emergence of networks in a wide spectrum of application domains, ranging from social and information networks to biological and transpor...
Bilangan Terhubung Titik Pelangi pada Graf Garis dan Graf Tengah dari Hasil Operasi Comb Graf Bintang C<sub>3</sub> dan Graf Bintang S<sub>n</sub>
Bilangan Terhubung Titik Pelangi pada Graf Garis dan Graf Tengah dari Hasil Operasi Comb Graf Bintang C<sub>3</sub> dan Graf Bintang S<sub>n</sub>
Penelitian ini bertujuan menentukan bilangan terhubung titik pelangi (rainbow vertex connection number) pada graf garis dan graf tengah yang diperoleh dari hasil operasi comb antar...
Bootstrapping a Biodiversity Knowledge Graph
Bootstrapping a Biodiversity Knowledge Graph
The "biodiversity knowledge graph" is a nice metaphor for connecting biodiversity data sources, but can we actually build it? Do we have sufficient linked data available? Given tha...
Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery
Abstract 902: Explainable AI: Graph machine learning for response prediction and biomarker discovery
Abstract
Accurately predicting drug sensitivity and understanding what is driving it are major challenges in drug discovery. Graphs are a natural framework for captu...
Domination of Polynomial with Application
Domination of Polynomial with Application
In this paper, .We .initiate the study of domination. polynomial , consider G=(V,E) be a simple, finite, and directed graph without. isolated. vertex .We present a study of the Ira...
E-Cordial Labeling of Some Families of Graphs
E-Cordial Labeling of Some Families of Graphs
An E-cordial labeling σ: E →{0,1} induces σ∗: V →{0,1} on graph G=(V,E), where (σ(v)=(∑_(u∈V)▒〖σ(uv)〗) mod 2 is taken over all edges uv∈E, and the labelling satisfies the condition...