Related papers: Counting maps from curves to projective space via …
The Bell numbers count the number of different ways to partition a set of $n$ elements while the graphical Bell numbers count the number of non-equivalent partitions of the vertex set of a graph into stable sets. This relation between graph…
The presented material is devoted to the equivalent conversion from the vertex graphs to the edge graphs. We suggest that the proved theorems solve the problem of the isomorphism of graphs, the problem of the graph's enumeration with the…
The degree sequence of a graph is a numerical method to characterize the properties of graphs. Generalized forms of degree sequences exist for complete graphs and complete graphs. Nikolopolus et al. characterized the number of spanning…
We investigate the analogy between squarefree Cohen-Macaulay modules supported on a graph and line bundles on a curve. We prove a Riemann-Roch theorem, we study the Jacobian and gonality of a graph, and we prove Clifford's theorem.
We study geometric presentations of braid groups for particles that are constrained to move on a graph, i.e. a network consisting of nodes and edges. Our proposed set of generators consists of exchanges of pairs of particles on junctions of…
In this paper, we study the Brill-Noether theory of the normalizations of singular, irreducible curves on a $K3$ surface. We introduce a {\em singular} Brill-Noether number $\rho_{sing}$ and show that if the Picard group of the K3 surface…
We construct a space classifying divisor classes of a fixed degree on all tropical curves of a fixed combinatorial type and show that the function taking a divisor class to its rank is upper semicontinuous. We extend the definition of the…
This paper presents and explores a theory of \emph{multiholomorphic maps}. This group of ideas generalizes the theory of pseudoholomorphic curves in a direction suggested by consideration of the kinds of compatible geometric structures that…
We present an approach to a large class of enumerative problems concerning rational curves in projective spaces. This approach uses analysis to obtain topological information about moduli spaces of stable maps. We demonstrate it by…
The aim of this paper is two--fold. We first strongly improve our previous main result Theorem 3.1 in Arxiv 1702.00918v3 12Feb2018 ("Brill-Noether loci of rank two vector bundles on a general $\nu$-gonal curve"), concerning classification…
In this paper, we provide a general framework for counting geometric structures in pseudo-random graphs. As applications, our theorems recover and improve several results on the finite field analog of questions originally raised in the…
The concept of viewing graph solvability has gained significant interest in the context of structure-from-motion. A viewing graph is a mathematical structure where nodes are associated to cameras and edges represent the epipolar geometry…
We develop a theory of confluence of graphs. We describe an algorithm for proving that a given system of reduction rules for abstract graphs and graphs in surfaces is locally confluent. We apply this algorithm to show that each simple Lie…
Urban mobility forecast and analysis can be addressed through grid-based and graph-based models. However, graph-based representations have the advantage of more realistically depicting the mobility networks and being more robust since they…
We develop the Lie theory of Lie-admissible algebras whose product is enriched with higher operations modeled on directed graphs with a view to apply it to the deformation theories controlled by this kind of Lie algebras. We produce…
A speculative overview of a future topic of research. The paper is a collection of ideas concerning two related areas: 1) Graph computation machines ("computing with graphs"). This is the class of models of computation in which the state of…
In this paper, we study maps from reducible curves $f : C \cup_\Gamma D \to \mathbb{P}^r$. We restrict our attention to two cases: first, when $f|_D$ factors through a hyperplane $H$ and $f|_C$ is transverse to $H$; and second, when $r =…
Graphs are a central object of study in various scientific fields, such as discrete mathematics, theoretical computer science and network science. These graphs are typically studied using combinatorial, algebraic or probabilistic methods,…
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…
Reconstructing 3D scenes from multiple views has made impressive strides in recent years, chiefly by correlating isolated feature points, intensity patterns, or curvilinear structures. In the general setting - without controlled…