相关论文: Prym varieties associated to graphs

The classical Rees construction (of common use in commutative algebra and Hodge theory) interpolates between filtrations, viewed as ${\mathbb G}_m$-equivariant vector bundles on the affine line, and their associated gradings. Various…

We investigate the structure of connected graphs, not necessarily locally finite, with infinitely many ends. On the one hand we study end-transitive such graphs and on the other hand we study such graphs with the property that the…

We correct the proof of the main result in an earlier paper, showing how to parametrize orbital varieties in a complex simple Lie algebra of type $D$ in terms of domino tableaux and showing how to compute variety attached to any element of…

I show how to associate a Clifford algebra to a graph. I describe the structure of these Clifford graph algebras and provide many examples and pictures. I describe which graphs correspond to isomorphic Clifford algebras and also discuss…

Given a pair of number fields with isomorphic rings of adeles, we construct bijections between objects associated to the pair. For instance we construct an isomorphism of Brauer groups that commutes with restriction. We additionally…

Consider a finite covering $\beta : C \to X$ of a smooth projective curve $X$ by a reduced, projective, planar curve $C$. Associated to two general polarizations on $C$, $q$ and $q'$, one can construct the corresponding compactified Prym…

In this paper we study Eulerian extensions with edge constraints and use the probabilistic method to establish sufficient conditions for a given connected graph to be a subgraph of a Eulerian graph containing $m$ edges, for a given number…

We study tropical line arrangements associated to a three-regular graph $G$ that we refer to as \emph{tropical graph curves}. Roughly speaking, the tropical graph curve associated to $G$, whose genus is $g$, is an arrangement of $2g-2$…

We construct infinitely many connected, circulant digraphs of outdegree three that have no hamiltonian circuit. All of our examples have an even number of vertices, and our examples are of two types: either every vertex in the digraph is…

We consider higher-dimensional analogues of the classical Brauer-Siegel theorem focusing on the case of abelian varieties over global function fields. We prove such an analogue in the case of constant families of elliptic curves and abelian…

We prove that, under certain conditions, the existence of a curve of $(m+2)$-secants to the Kummer variety of an indecomposable principally polarized abelian variety $X$, represents $m$-times the minimal cohomological class in $X$. In the…

Properties of the `$k$-equivalent' graph families constructed in Cai, F\"{u}rer and Immerman, and Evdokimov and Ponomarenko are analysed relative the the recursive $k$-dim WL method. An extension to the recursive $k$-dim WL method is…

We refine and advance the study of the local structure of idempotent finite algebras started in [A.Bulatov, The Graph of a Relational Structure and Constraint Satisfaction Problems, LICS, 2004]. We introduce a graph-like structure on an…

We study abelian varieties and K3 surfaces with complex multiplication defined over number fields of fixed degree. We show that these varieties fall into finitely many isomorphism classes over an algebraic closure of the field of rational…

We show that every trivial 3-strand braid diagram contains a disk, defined as a ribbon ending in opposed crossings. Under a convenient algebraic form, the result extends to every Artin--Tits group of dihedral type, but it fails to extend to…

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 define the braid groups of a two-dimensional orbifold and introduce conventions for drawing braid pictures. We use these to realize the Artin groups associated to the spherical Coxeter diagrams A_n, B_n=C_n and D_n and the affine…

A graph on at least ${{k+1}}$ vertices is uniformly $k$-connected if each pair of its vertices is connected by $k$ and not more than $k$ independent paths. We reinvestigate a recent constructive characterization of uniformly $3$-connected…

We define partially ample subvarieties of projective varieties, generalizing Ottem's work on ample subvarieties, and show their ubiquity. As an application, we obtain a connectedness result for pre-images of subvarieties by morphisms,…

This paper is the first part in a series of three papers devoted to the study of enumerative invariants of abelian surfaces through the tropical approach. In this paper, we consider the enumeration of genus $g$ curves of fixed degree…