Related papers: Correspondences without a Core
We give a combinatorial description of closed curves on oriented surfaces in terms of certain permutations, called charts. We describe automorphisms of curves in terms of charts and compute the total number of curves counted with…
We use fine curve graph tools to prove that there exist parabolic isometries of graphs of curves associated to surfaces of infinite type.
We introduce the notion of graphical discreteness to group theory. A finitely generated group is graphically discrete if whenever it acts geometrically on a locally finite graph, the automorphism group of the graph is compact-by-discrete.…
In recent years, discrete spaces such as graphs attract much attention as models for physical spacetime or as models for testing the spirit of non-commutative geometry. In this work, we construct the differential algebras for graphs by…
In the spirit of the generalized holographic conjecture, we explore a relationship between the bulk and boundary properties of non-interacting massive Dirac fermions living on a flexible surface, such as a sheet of graphene. We demonstrate…
We describe a construction that maps any connected graph G on three or more vertices into a larger graph, H(G), whose independence number is strictly smaller than its Lov\'asz number which is equal to its fractional packing number. The…
Let $X$ be a smooth projective curve over an algebraically closed field $k$. Let $\mathcal{G}$ be a parahoric group scheme on $X$ as in \cite{pr}. Via the principle of Hecke correspondences, we set-up relationships between the cohomology of…
We consider the infinite-dimensional hypercube graph. This graph is not connected and has isomorphic connected components. We describe the restrictions of its automorphisms to the connected components and the automorphism group of connected…
The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…
A graph is $\textit{cubelike}$ if it is a Cayley graph for some elementary abelian $2$-group $\mathbb{Z}_2^n$. The core of a graph is its smallest subgraph to which it admits a homomorphism. More than ten years ago, Ne\v{s}et\v{r}il and…
The Tur\'an problem asks for the largest number of edges in an $n$-vertex graph not containing a fixed forbidden subgraph $F$. We construct a new family of graphs not containing $K_{s,t}$, for $t= C^s$, with $\Omega(n^{2-1/s})$ edges…
Given any directed graph E one can construct a graph inverse semigroup G(E), where, roughly speaking, elements correspond to paths in the graph. In this paper we study the semigroup-theoretic structure of G(E). Specifically, we describe the…
We study linear series on a general curve of genus $g$, whose images are exceptional with regard to their secant planes. Working in the framework of an extension of Brill-Noether theory to pairs of linear series, we prove that a general…
In this paper, we extend the local Shimura correspondence building upon the groundwork laid by Gordan Savin. As preparations, we review part of the type theory of Bushnell and Kutzko which equally applies to covering groups. By adapting the…
Let $G$ be a finite connected simple graph and $I_{G}$ the toric ideal of the edge ring $K[G]$ of $G$. In the present paper, we study finite graphs $G$ with the property that $I_{G}$ is generated by quadratic binomials and $I_{G}$ possesses…
For a finite graph, we establish natural isomorphisms between eigenspaces of a Laplace operator acting on functions on the edges and eigenspaces of a transfer operator acting on functions on one-sided infinite non-backtracking paths.…
We investigate the structure of isometric subgraphs of hypercubes (i.e., partial cubes) which do not contain finite convex subgraphs contractible to the 3-cube minus one vertex $Q^-_3$ (here contraction means contracting the edges…
Infinite analogues of the Paley graphs are constructed, based on uncountably many infinite but locally finite fields. Weil's estimate for character sums shows that they are all isomorphic to the random or universal graph of Erd\H os,…
These notes collect results about algebraic correspondences and adapt them to the setting of correspondences on projective lines. The focus lies on finite orbits of algebraic correspondences. The main result is a field theoretic…
We introduce and study asymptotically rigid mapping class groups of certain infinite graphs. We determine their finiteness properties and show that these depend on the number of ends of the underlying graph. In a special case where the…