Related papers: A note on Brill-Noether thoery and rank determinin…
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,…
Higher rank Brill-Noether theory is completely known for curves of genus $\leq 3$. In this paper, we investigate the theory for curves of genus 4. Some of our results apply to curves of arbitrary genus.
We prove a Lefschetz hyperplane theorem for the determinantal loci of a morphism between two holomorphic vector bundles $E$ and $F$ over a complex manifold under the condition that $E^*\ox F$ is Griffiths $k$-positive. We apply this result…
We show that Brill--Noether loci in Hilbert scheme of points on a smooth connected surface $S$ are non-empty whenever their expected dimension is positive, and that they are irreducible and have expected dimensions. More precisely, we…
Given a connected graph $G$, the metric (resp. edge metric) dimension of $G$ is the cardinality of the smallest ordered set of vertices that uniquely identifies every pair of distinct vertices (resp. edges) of $G$ by means of distance…
The study of very large graphs is a prominent theme in modern-day mathematics. In this paper we develop a rigorous foundation for studying the space of finite labelled graphs and their limits. These limiting objects are naturally countable…
Let C be a smooth projective complex curve of genus $g\geq2$. We investigate the Brill-Noether locus consisting of stable bundles of rank 2 and canonical determinant having at least $k$ independent sections. Using the Hecke correpondence we…
Recently, Daligault, Rao and Thomass\'e asked in [3] if every hereditary class which is well-quasi-ordered by the induced subgraph relation is of bounded clique-width. There are two reasons why this questions is interesting. First, it…
The entities in directed networks arising from real-world interactions are often naturally organized under some hierarchical structure. Given a directed, weighted, graph with edges and node labels, we introduce ranking problem where the…
We present a refinement of Ramsey numbers by considering graphs with a partial ordering on their vertices. This is a natural extension of the ordered Ramsey numbers. We formalize situations in which we can use arbitrary families of…
We use Young tableaux to compute the dimension of $V^r$, the Prym-Brill-Noether locus of a folded chain of loops of any gonality. This tropical result yields a new upper bound on the dimensions of algebraic Prym-Brill-Noether loci.…
A set $D$ of vertices of a graph $G$ is locating if every two distinct vertices outside $D$ have distinct neighbors in $D$; that is, for distinct vertices $u$ and $v$ outside $D$, $N(u) \cap D \neq N(v) \cap D$, where $N(u)$ denotes the…
Node role explainability in complex networks is very difficult, yet is crucial in different application domains such as social science, neurosciences or computer science. Many efforts have been made on the quantification of hubs revealing…
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…
Given a curve $C$ that is a degree $k$ cover $C \to \mathbb{P}^1$ totally ramified at two points $p$ and $q$, we can seek to understand the space of degree $d$ line bundles on $C$ with prescribed ramification at $p$ and $q$. The…
In this paper, some subclasses of block graphs are considered in order to analyze Fiedler vector of its members. Two families of block graphs with cliques of fixed size, the block-path and block-starlike graphs, are introduced. Cases A and…
We consider families of symmetric linear programs (LPs) that decide a property of graphs (or other relational structures) in the sense that, for each size of graph, there is an LP defining a polyhedral lift that separates the integer points…
Let $G$ be a connected nonregular graphs of order $n$ with maximum degree $\Delta$ that attains the maximum spectral radius. Liu and Li (2008) proposed a conjecture stating that $G$ has a degree sequence $(\Delta,\ldots,\Delta,\delta)$ with…
Let $f\colon C \rightarrow \mathbb{P}^1$ be a degree $k$ genus $g$ cover. The stratification of line bundles $L \in \mathrm{Pic}^d(C)$ by the splitting type of $f_*L$ is a refinement of the stratification by Brill-Noether loci $W^r_d(C)$.…
We study the VC-dimension of the set system on the vertex set of some graph which is induced by the family of its $k$-connected subgraphs. In particular, we give tight upper and lower bounds for the VC-dimension. Moreover, we show that…