Related papers: Prym varieties associated to graphs

We develop a new framework for analysing finite connected, oriented graphs of valency 4, which admit a vertex-transitive and edge-transitive group of automorphisms preserving the edge orientation. We identify a sub-family of "basic" graphs…

The evaluation of graphs on 2-spheres is a central ingredient of the Turaev-Viro construction of three-dimensional topological field theories. In this article, we introduce a class of graphs, called extruded graphs, that is relevant for the…

We prove that the Fermi surface of a connected doubly periodic self-adjoint discrete graph operator is irreducible at all but finitely many energies provided that the graph (1) can be drawn in the plane without crossing edges (2) has…

We give two "lifting" constructions of strongly regular Cayley graphs. In the first construction we "lift" a cyclotomic strongly regular graph by using a subdifference set of the Singer difference set. The second construction uses quadratic…

We investigate the geometry of smooth hyperelliptic curves that possess additional involutions, especially from the point of view of the Prym theory. Our main result is the injectivity of the Prym map for hyperelliptic…

Inspired by a theorem of Gruson-Lazarsfeld-Peskine bounding the Castelnuovo-Mumford regularity of curves in projective spaces, we bound the Theta-regularity of curves in polarized abelian varieties.

We study triangle decompositions of graphs. We consider constructions of classes of graphs where every edge lies on a triangle and the addition of the minimum number of multiple edges between already adjacent vertices results in a strongly…

We reduce a strong version of the twist conjecture for Artin groups to Artin groups whose defining graphs have no separating vertices. This produces new examples of Artin groups satisfying the conjecture, and sheds more light on the…

Schmidt characterised the class of rayless graphs by an ordinal rank function, which makes it possible to prove statements about rayless graphs by transfinite induction. Halin asked whether Schmidt's rank function can be generalised to…

Let $\Gamma$ be a finite, undirected, connected, simple graph. We say that a matching $\mathcal{M}$ is a \textit{permutable $m$-matching} if $\mathcal{M}$ contains $m$ edges and the subgroup of $\text{Aut}(\Gamma)$ that fixes the matching…

Dotted graphs are certain finite graphs with vertices of degree 2 called dots in the $xy$-plane $\mathbb{R}^2$, and a dotted graph is said to be admissible if it is associated with a lattice polytope in $\mathbb{R}^2$ each of whose edge is…

In arXiv:0910.1727 we find certain finite homomorphic images of Artin braid group into appropriate symmetric groups, which a posteriori are extensions of the symmetric group on n letters by an abelian group. The main theorem of this paper…

Let $\phi:\,X\rightarrow Y$ be a (possibly ramified) cover between two algebraic curves of positive genus. We develop tools that may identify the Prym variety of $\phi$, up to isogeny, as the Jacobian of a quotient curve $C$ in the Galois…

We study the homogeneous irreducible Severi-Brauer varieties over an Abelian variety $A$. Such objects were classified by Brion, \cite{Bri}. Here we interpret that result within the context of cubical structures and biextensions for certain…

We study the interaction between the group law on an abelian variety and the additive structure induced on its image under a morphism to projective space. Let $A/F$ be a simple abelian variety, $f:A \rightarrow \mathbb{P}^n$ be a morphism…

The complexity of a graph is the number of its labeled spanning trees. It is demonstrated that the seven known triangle-free strongly regular graphs, such as the Higman-Sims graph, are graphs of maximal complexity among all graphs of the…

We prove a quantitative, finitary version of Trofimov's result that a connected, locally finite vertex-transitive graph G of polynomial growth admits a quotient with finite fibres on which the action of Aut(G) is virtually nilpotent with…

We establish several new relations between the discrete transition operator, the continuous Laplacian and the averaging operator associated with combinatorial and metric graphs. It is shown that these operators can be expressed through each…

This paper surveys some recent results and progress on the extremal prob- lems in a given set consisting of all simple connected graphs with the same graphic degree sequence. In particular, we study and characterize the extremal graphs…

We describe structural properties of strongly connected finite directed graphs, that are invariants of the topological conjugacy of their Markov-Dyck shifts. For strongly connected finite directed graphs with these properties topological…