Related papers: An arithmetic variant of Raynaud's theorem

Without recourse to the sophisticated machinery of twisted group algebras, projective character tables and explicit values of 2-cocycles, we here present a simple algorithm to study the gauge theory data of D-brane probes on a generic…

Roe's partitioned manifold index theorem applies when a complete Riemannian manifold $M$ is cut into two pieces along a compact hypersurface $N$. It states that a version of the index of a Dirac operator on $M$ localized to $N$ equals the…

We provide proofs certifying that the structure theorem for vertex sets of bounded bidimensionality holds with polynomial bounds. The bidimensionality of vertex sets is a common generalisation of both treewidth and the face-cover-number of…

We introduce a general model of dimer coverings of certain plane bipartite graphs, which we call rail yard graphs (RYG). The transfer matrices used to compute the partition function are shown to be isomorphic to certain operators arising in…

We introduce an additional structure on ribbon graphs, arrow structure. We extend the Bollob\'as-Riordan polynomial to ribbon graph with this structure. The extended polynomial satisfies the contraction-deletion relations and naturally…

We give a constructive proof of the fact that the treewidth of a graph $G$ is bounded by a linear function of the separation number of $G$.

As an extension of a classical tree-partition problem, we consider decompositions of graphs into edge-disjoint (rooted-)trees with an additional matroid constraint. Specifically, suppose we are given a graph $G=(V,E)$, a multiset…

We prove a general theorem that gives a non trivial relation in the group of derived autoequivalences of a variety (or stack) X, under the assumption that there exists a suitable functor from the derived category of another variety Y…

For a proper, flat, generically smooth scheme $X$ over a complete DVR with finite residue field of characteristic $p$, we define a specialization morphism from the rigid cohomology of the geometric special fibre to $D_{crys}$ of the…

We show that for every infinite collection $\mathcal{R}$ of disjoint equivalent rays in a graph $G$ there is a subdivision of the hexagonal half-grid in $G$ such that all its vertical rays belong to $\mathcal{R}$. This result strengthens…

In this paper, we give a constructive proof of the fact that the treewidth of a graph is at most its divisorial gonality. The proof gives a polynomial time algorithm to construct a tree decomposition of width at most $k$, when an effective…

Let $\mathbf G$ be a graphing, that is a Borel graph defined by $d$ measure preserving involutions. We prove that if $\mathbf G$ is {\em treeable} then it arises as the local limit of some sequence $(G_n)_{n\in\mathbb{N}}$ of graphs with…

It has been previously shown by the authors that a directed graph on a linearly ordered set of edges (ordered graph) with adjacent unique source and sink (bipolar digraph) has a unique fully optimal spanning tree, that satisfies a simple…

In this paper we study a construction of algebraic curves from combinatorial data. In the study of algebraic curves through degeneration, graphs usually appear as the dual intersection graph of the central fiber. Properties of such graphs…

Given a Q-Cartier divisor $S \subset X$ admitting a fibration $S \rightarrow B$ onto a curve we give sufficient conditions for the existence of a bimeromorphic contraction contracting S onto B. As a corollary we recover a contraction result…

Let R be a Henselian discrete valuation ring with field of fractions K. If X is a smooth variety over K and G a torus over K, then we consider X-torsors under G. If XX/R is a model of X then, using a result of Brahm, we show that X-torsors…

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…

Let $X$ be an infinite graph of bounded degree; e.g., the Cayley graph of a free product of finite groups. If $G$ is a finite graph covered by $X$, it is said to be $X$-Ramanujan if its second-largest eigenvalue $\lambda_2(G)$ is at most…

Treewidth is a graph parameter that plays a fundamental role in several structural and algorithmic results. We study the problem of decomposing a given graph $G$ into node-disjoint subgraphs, where each subgraph has sufficiently large…

We study the ramification divisors of projections of a smooth projective variety onto a linear subspace of the same dimension. We prove that the ramification divisors vary in a maximal dimensional family for a large class of varieties.…