Related papers: Algebraic and combinatorial Brill-Noether theory

An invariant for cospectral graphs is a property shared by all cospectral graphs. In this paper, we establish three novel arithmetic invariants for cospectral graphs, revealing deep connections between spectral properties and combinatorial…

Monadically stable and monadically NIP classes of structures were initially studied in the context of model theory and defined in logical terms. They have recently attracted attention in the area of structural graph theory, as they…

We survey recent advances in non-abelian Hodge theory in the "mixed" setting of non-proper algebraic varieties. We then describe how these tools are used to construct algebraic Shafarevich morphisms and prove a version of the linear…

We study the algebraic rank of a divisor on a graph, an invariant defined using divisors on algebraic curves dual to the graph. We prove it satisfies the Riemann-Roch formula, a specialization property, and the Clifford inequality. We prove…

A vertex with neighbours of degrees $d_1 \geq ... \geq d_r$ has {\em vertex type} $(d_1, ..., d_r)$. A graph is {\em vertex-oblique} if each vertex has a distinct vertex-type. While no graph can have distinct degrees, Schreyer, Walther and…

We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…

Let $\M_g$ be the course moduli space of complex projective nonsingular curves of genus $g$. We prove that when the Brill-Noether number $\rho(g,1,n)$ is non-negative the Petri locus $P^1_{g,n}\subset \M_g$ has a divisorial component whose…

We introduce the graph theoretical parameter of edge treewidth. This parameter occurs in a natural way as the tree-like analogue of cutwidth or, alternatively, as an edge-analogue of treewidth. We study the combinatorial properties of…

Biserial algebras are a classical class in the representation theory of algebras, generalizing Nakayama algebras. They were further generalized by Green and Schroll to multiserial algebras, which share many structural properties with…

We give an elementary, self-contained, and purely combinatorial proof of the Rayleigh monotonicity property of graphs.

Let X be a smooth algebraic curve of genus g>=2. A stable vector bundle over X of degree d, rank n with at least k sections is called a Brill-Noether bundle of type (n,d,k). By tensoring coherent systems, we prove that most of the known…

A balanced graph is a bipartite graph with no induced circuit of length 2 mod 4. These graphs arise in linear programming. We focus on graph-algebraic properties of balanced graphs to prove a complete classification of balanced Cayley…

Every better quasi-order codifies a Borel graph that does not contain a copy of the shift graph. It is known that there is a better quasi-order that codes a Borel graph with infinite Borel chromatic number, though one has yet to be…

Associated to any graph is a toric ideal whose generators record relations among the cuts of the graph. We study these ideals and the geometry of the corresponding toric varieties. Our theorems and conjectures relate the combinatorial…

For a projective variety X, a line bundle L on X and r a natural number we consider the r-th Brill-Noether locus W^r(L,X):={\eta\in Pic^0(X)|h^0(L+\eta)\geq r+1}: we describe its natural scheme structure and compute the Zariski tangent…

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…

To understand the underlying degrees of freedom, near horizon symmetry analysis of a black has gain significant interest in the recent past. In this paper we generalized those analysis first by taking into account a generic null surface…

A graph is an instrument which is extensively utilized to model various problems in different fields. Up to date, many graphs have been developed to represent algebraic structures, particularly rings in order to study their properties. In…

We prove that the total curvature of a planar graph with nonnegative combinatorial curvature is at least $\frac{1}{12}$ if it is positive. Moreover, we classify the metric structures of ambient polygonal surfaces for planar graphs attaining…

The nullity of a graph is the multiplicity of the eigenvalues zero in its spectrum. A signed graph is a graph with a sign attached to each of its edges. In this paper, we obtain the coefficient theorem of the characteristic polynomial of a…