Related papers: Graphs and obstruction theory for algebraic curves
Determining which bipartite graphs can be principal graphs of subfactors is an important and difficult question in subfactor theory. Using only planar algebra techniques, we prove a triple point obstruction which generalizes all known…
For causal discovery in the presence of latent confounders, constraints beyond conditional independences exist that can enable causal discovery algorithms to distinguish more pairs of graphs. Such constraints are not well-understood yet. In…
How to obtain a graph from data samples is an important problem in graph signal processing. One way to formulate this graph learning problem is based on Gaussian maximum likelihood estimation, possibly under particular topology constraints.…
This article discusses a combinatorial extension of tropical intersection theory to spaces given by glueing quotients of partially open convex polyhedral cones by finitely many automorphisms. This extension is done in terms of linear…
The partial representation extension problem is a recently introduced generalization of the recognition problem. A circle graph is an intersection graph of chords of a circle. We study the partial representation extension problem for circle…
We consider a variant of metrised graphs where the edge lengths take values in a commutative monoid, as a higher-rank generalisation of the notion of a tropical curve. Divisorial gonality, which Baker and Norine defined on combinatorial…
The aim of this survey is to explore complete intersection monomial curves from a contemporary perspective. The main goal is to help readers understand the intricate connections within the field and its potential applications. The…
We construct immersions of trivalent abstract tropical curves in the Euclidean plane and embeddings of all abstract tropical curves in higher dimensional Euclidean space. Since not all curves have an embedding in the plane, we define the…
A tropical curve \Gamma is a metric graph with possibly unbounded edges, and tropical rational functions are continuous piecewise linear functions with integer slopes. We define the complete linear system |D| of a divisor D on a tropical…
We introduce a tropical version of the Fukaya algebra of a Lagrangian submanifold. Tropical graphs arise as large-scale behavior of pseudoholomorphic disks under a multiple cut operation on a symplectic manifold that produces a collection…
This paper is about the combinatorics of finite point configurations in the tropical projective space or, dually, of arrangements of finitely many tropical hyperplanes. Moreover, arrangements of finitely many tropical halfspaces can be…
Efficiency of routing on a regular digraph often involves finding opitmal properties of the graph. For example, the diameter of a digraph is the maximum distance between any two vertices. We show how we can study these problems…
We introduce a new formalism and a number of new results in the context of geometric computational vision. The classical scope of the research in geometric computer vision is essentially limited to static configurations of points and lines…
A tropical complete intersection curve C in R^(n+1) is a transversal intersection of n smooth tropical hypersurfaces. We give a formula for the number of vertices of C given by the degrees of the tropical hypersurfaces. We also compute the…
This thesis delves into the geometry of abstract tropical curves, exploring their complete linear system and associated tropical submodules. We establish a lower bound on the dimension of tropical submodules in terms of the Baker-Norine…
We study the interplay between the classical theory of linear series on curves, and the recent theory of linear series on graphs. We prove that every d-gonal (weighted) graph of Hurwitz type is the dual graph of a d-gonal curve. Conversely…
We consider multidimensional optimization problems, which are formulated and solved in terms of tropical mathematics. The problems are to minimize (maximize) a linear or nonlinear function defined on vectors over an idempotent semifield,…
In this dissertation, we explore the structure of inversion graphs of permutations--a class of graphs that naturally arises by representing each permutation as a graph, where vertices correspond to entries and edges encode inversions.…
Many problems in computational geometry are not stated in graph-theoretic terms, but can be solved efficiently by constructing an auxiliary graph and performing a graph-theoretic algorithm on it. Often, the efficiency of the algorithm…
In this paper we discuss reconstruction problems for graphs. We develop some new ideas like isomorphic extension of isomorphic graphs, partitioning of vertex sets into sets of equivalent points, subdeck property, etc. and develop an…