Related papers: Hyperelliptic graphs and metrized complexes

We show that there exists a surjection from the set of effective divisors of degree $g$ on a tropical curve of genus $g$ to its Jacobian by using a tropical version of the Riemann-Roch theorem. We then show that the restriction of the…

The divisor theory of the complete graph $K_n$ is in many ways similar to that of a plane curve of degree $n$. We compute the splitting types of all divisors on the complete graph $K_n$. We see that the possible splitting types of divisors…

The linear system $|D|$ of a divisor $D$ on a metric graph has the structure of a cell complex. We introduce the anchor divisors and anchor cells in it - they serve as the landmarks for us to compute the f-vector of the complex and find all…

The problem of efficiently characterizing degree sequences of simple hypergraphs is a fundamental long-standing open problem in Graph Theory. Several results are known for restricted versions of this problem. This paper adds to the list of…

We classify topological insulators and superconductors in the presence of additional symmetries such as reflection or mirror symmetries. For each member of the 10 Altland-Zirnbauer symmetry classes, we have a Clifford algebra defined by…

The vertices of any graph with $m$ edges can be partitioned into two parts so that each part meets at least $\frac{2m}{3}$ edges. Bollob\'as and Thomason conjectured that the vertices of any $r$-uniform graph may be likewise partitioned…

In this paper, we prove a crucial theorem called Mirroring Theorem which affirms that given a collection of samples with enough information in it such that it can be classified into classes and subclasses then (i) There exists a mapping…

We study, in three parts, degree sequences of k-families (or k-uniform hypergraphs) and shifted k-families. The first part collects for the first time in one place, various implications such as: Threshold implies Uniquely Realizable implies…

A graph $G$ of order $2n$ is called degree-equipartite if for every $n$-element set $A\subseteq V(G)$, the degree sequences of the induced subgraphs $G[A]$ and $G[V(G)\setminus A]$ are the same. In this paper, we characterize all…

The rank of a graph is defined to be the rank of its adjacency matrix. A graph is called reduced if it has no isolated vertices and no two vertices with the same set of neighbors. Akbari, Cameron, and Khosrovshahi conjectured that the…

We give a graphical calculus for a categorification of a Clifford algebra and its Fock space representation via differential graded categories. The categorical action is motivated by the gluing action between the contact categories of…

We extend the notion of Clifford index to reduced curves with planar singularities by considering rank 1 torsion free sheaves. We investigate the behaviour of the Clifford index with respect to the combinatorial properties of the curve and…

Graphs, and sequences of growing graphs, can be used to specify the architecture of mathematical models in many fields including machine learning and computational science. Here we define structured graph "lineages" (ordered by level…

We prove that every oriented tree on $n$ vertices with bounded maximum degree appears as a spanning subdigraph of every directed graph on $n$ vertices with minimum semidegree at least $n/2+o(n)$. This can be seen as a directed graph…

In this article, we mainly obtain the Riemann-Hurwitz theorems for harmonic morphisms on (vertex-weighted) metric graphs or metrized complexes of algebraic curves, inspired of the recent work on harmonic morphisms of graphs or metrized…

In this paper, we introduce the uniform algebraic rank of a divisor class on a finite graph. We show that it lies between Caporaso's algebraic rank and the combinatorial rank of Baker and Norine. We prove the Riemann-Roch theorem for the…

We describe several graphs with arbitrarily large rankwidth (or equivalently with arbitrarily large cliquewidth). Korpelainen, Lozin, and Mayhill [Split permutation graphs, Graphs and Combinatorics, 30(3):633-646, 2014] proved that there…

Digraphs are generalizations of graphs in which each edge is assigned with a direction or two directions. In this paper, we define discrete Morse functions on digraphs, and prove that the homology of the Morse complex and the path homology…

Let $G$ be a finite group. We consider the set of the irreducible complex characters of $G$, namely $Irr(G)$, and the related degree set $cd(G)=\{\chi(1) : \chi\in Irr(G)\}$. Let $\rho(G)$ be the set of all primes which divide some…

An important result of Koml\'os [Tiling Tur\'an theorems, Combinatorica, 2000] yields the asymptotically exact minimum degree threshold that ensures a graph $G$ contains an $H$-tiling covering an $x$th proportion of the vertices of $G$ (for…