Related papers: Counting maps from curves to projective space via …

We provide a structural generalization of a theorem by Kleiman--Piene, concerning the enumerative geometry of nodal curves in a complete linear system |L| on a smooth projective surface S. Provided that r, the number of nodes, is…

1-planar graphs are graphs that can be drawn in the plane such that any edge intersects with at most one other edge. Ackerman showed that the edges of a 1-planar graph can be partitioned into a planar graph and a forest, and claims that the…

Graph-level representations are crucial tools for characterising structural differences between graphs. However, comparing graphs with different cardinalities, even when sampled from the same underlying distribution, remains challenging.…

The Burling sequence is a sequence of triangle-free graphs of increasing chromatic number. Any graph which is an induced subgraph of a graph in this sequence is called a Burling graph. These graphs have attracted some attention because they…

Many systems generate data as a set of triplets (a, b, c): they may represent that user a called b at time c or that customer a purchased product b in store c. These datasets are traditionally studied as networks with an extra dimension…

Graph theoretical ideas are highly utilized by computer science fields especially data mining. In this field, a data structure can be designed in the form of tree. Covering is a widely used form of data representation in data mining and…

Graphs are used in almost every scientific discipline to express relations among a set of objects. Algorithms that compare graphs, and output a closeness score, or a correspondence among their nodes, are thus extremely important. Despite…

We classify elliptic curves over the rationals whose N\'eron model over the integers is semi-abelian, with good reduction at p=2, and whose Mordell--Weil group contains an element of order two that stays non-trivial at p=2. Furthermore, we…

We examine a number of results of infinite combinatorics using the techniques of reverse mathematics. Our results are inspired by similar results in recursive combinatorics. Theorems included concern colorings of graphs and bounded graphs,…

We present algorithms to compute the topology of 2D and 3D hyperelliptic curves. The algorithms are based on the fact that 2D and 3D hyperelliptic curves can be seen as the image of a planar curve (the Weierstrass form of the curve), whose…

After a short review of the classical Lie theorem, a finite dimensional Lie algebra of vector fields is considered and the most general conditions under which the integral curves of one of the fields can be obtained by quadratures in a…

Numerous important problems can be framed as learning from graph data. We propose a framework for learning convolutional neural networks for arbitrary graphs. These graphs may be undirected, directed, and with both discrete and continuous…

We investigate limit linear series on chains of elliptic curves, giving a simple proof of a conjecture of Farkas stating the existence of curves with a theta-characteristic with a given number of sections for the expected range of genera.…

By considering graphs as discrete analogues of Riemann surfaces, Baker and Norine (Adv. Math. 2007) developed a concept of linear systems of divisors for graphs. Building on this idea, a concept of gonality for graphs has been defined and…

Sturm's oscillation theorem states that the n-th eigenfunction of a Sturm-Liouville operator on the interval has n-1 zeros (nodes). This result was generalized for all metric tree graphs and an analogous theorem was proven for discrete tree…

We study tropical line arrangements associated to a three-regular graph $G$ that we refer to as \emph{tropical graph curves}. Roughly speaking, the tropical graph curve associated to $G$, whose genus is $g$, is an arrangement of $2g-2$…

In this article, we propose the approach to structural optimization of neural networks, based on the braid theory. The paper describes the basics of braid theory as applied to the description of graph structures of neural networks. It is…

We prove relations among the classes of certain divisors on the moduli spaces of curves with marked points, generalizing the Brill-Noether Ray Theorem of Eisenbud and Harris.

We consider coverings of real algebraic curves to real rational algebraic curves. We show the existence of such coverings having prescribed topological degree on the real locus. From those existence results we prove some results on…

We give an analog of the Myhill-Nerode methods from formal language theory for hypergraphs and use it to derive the following results for two NP-hard hypergraph problems: * We provide an algorithm for testing whether a hypergraph has…