Related papers: Linear systems on graphs with a real structure
We define scrollar invariants of tropical curves with a fixed divisor of rank 1. We examine the behavior of scrollar invariants under specialization, and provide an algorithm for computing these invariants for a much-studied family of…
We investigate the arithmetic of algebraic curves on coarse moduli spaces for special linear rank two local systems on surfaces with fixed boundary traces. We prove a structure theorem for morphisms from the affine line into the moduli…
We study the moduli of G-local systems on smooth but not necessarily proper complex algebraic varieties. We show that, when suitably considered as derived algebraic stacks, they carry natural Poisson structures, generalizing the well known…
We show that the counting of rational curves on a complete toric variety that are in general position to the toric prime divisors coincides with the counting of certain tropical curves. The proof is algebraic-geometric and relies on…
Low density graphs are considered to be a realistic graph class for modelling road networks. It has advantages over other popular graph classes for road networks, such as planar graphs, bounded highway dimension graphs, and spanners. We…
This is the paper as published. The topology of a complex plane curve singularity with real branches is deduced from any real deformation having delta crossings. An example of the computation of the global geometric monodromy of a…
This contribution extends linear models for feature vectors to sublinear models for graphs and analyzes their properties. The results are (i) a geometric interpretation of sublinear classifiers, (ii) a generic learning rule based on the…
We develop the theory of linear evolution equations associated with the adjacency matrix of a graph, focusing in particular on infinite graphs of two kinds: uniformly locally finite graphs as well as locally finite line graphs. We discuss…
For a smooth projective curve, the cycles of subordinate or, more generally, secant divisors to a given linear series are among some of the most studied objects in classical enumerative geometry. We consider the intersection of two such…
Resilience is a concept of rising interest in computer science and software engineering. For systems in which correctness w.r.t. a safety condition is unachievable, fast recovery is demanded. We investigate resilience problems of graph…
Numerical computations involving rational matrices often benefit from preserving underlying matrix structures such as symmetry, Hermitian properties, or sparsity that reflect physical, geometric, or algebraic characteristics of the system.…
Many systems comprising entities in interactions can be represented as graphs, whose structure gives significant insights about how these systems work. Network theory has undergone further developments, in particular in relation to…
We investigate, using purely combinatorial methods, structural and algorithmic properties of linear equivalence classes of divisors on tropical curves. In particular, an elementary proof of the Riemann-Roch theorem for tropical curves,…
We introduce and study a mathematical framework for a broad class of regularization functionals for ill-posed inverse problems: Regularization Graphs. Regularization graphs allow to construct functionals using as building blocks linear…
Modern methods of graph theory describe a graph up to isomorphism, which makes it difficult to create mathematical models for visualizing graph drawings on a plane. The topological drawing of the planar part of a graph allows representing…
A general specialization map is constructed for higher Chow groups and used to prove a "going-up" theorem for algebraic cycles and their regulators. The results are applied to study the degeneration of the modified diagonal cycle of Gross…
The tame fundamental group scheme for an algebraic variety is the maximal linearly reductive quotient of Nori's fundamental group scheme. In this paper, we study the tame fundamental group schemes of smooth curves defined over algebraically…
deepstruct connects deep learning models and graph theory such that different graph structures can be imposed on neural networks or graph structures can be extracted from trained neural network models. For this, deepstruct provides deep…
A graph is a data structure composed of dots (i.e. vertices) and lines (i.e. edges). The dots and lines of a graph can be organized into intricate arrangements. The ability for a graph to denote objects and their relationships to one…
Graphs with bounded thinness were defined in 2007 as a generalization of interval graphs. In this paper we introduce the concept of proper thinness, such that graphs with bounded proper thinness generalize proper interval graphs. We study…