相关论文: On the complexity group of stable curves

Homology of braid groups and Artin groups can be related to the study of spaces of curves. We completely calculate the integral homology of the family of smooth curves of genus $g$ with one boundary component, that are double coverings of…

Nowhere dense classes of graphs are classes of sparse graphs with rich structural and algorithmic properties, however, they fail to capture even simple classes of dense graphs. Monadically stable classes, originating from model theory,…

We prove that N\'eron models of jacobians of generically-smooth nodal curves over bases of arbitrary dimension are quasi-compact (hence of finite type) whenever they exist. We give a simple application to the orders of torsion subgroups of…

Working over imperfect fields, we give a comprehensive classification of genus-one curves that are regular but not geometrically regular, extending the known case of geometrically reduced curves. The description is given intrinsically, in…

We use the theory of p-curvature of connections to analyze stable vector bundles of rank 2 on curves of genus 2 which pull back to unstable bundles under the Frobenius morphism. We take two approaches, first using explicit formulas for…

Grothendieck proved that any finite epimorphism of noetherian schemes factors into a finite sequence of effective epimorphisms. We define the complexity of a flat groupoid $R\rightrightarrows X$ with finite stabilizer to be the length of…

We give a proof of the Gromov compactness theorem using the language of stable curves (i.e. cusp-curve of Gromov, or stable maps of Kontsevich and Manin) in general setting: An almost complex structure on a target manifold is only…

Consider a face F in an arrangement of n Jordan curves in the plane, no two of which intersect more than s times. We prove that the combinatorial complexity of F is O(\lambda_s(n)), O(\lambda_{s+1}(n)), and O(\lambda_{s+2}(n)), when the…

Let $N$ be a compact, connected, nonorientable surface of genus $g$ with $n$ boundary components. Let $\mathcal{C}(N)$ be the curve complex of $N$. We prove that if $(g,n) = (3,0)$ or $g + n \geq 5$, then there is an exhaustion of…

Clustering algorithms for large networks typically use modularity values to test which partitions of the vertex set better represent structure in the data. The modularity of a graph is the maximum modularity of a partition. We consider the…

The Torelli theorem establishes that the Jacobian of a smooth projective curve, together with the polarization provided by the theta divisor, fully characterizes the curve. In the case of nodal curves, there exists a concept known as fine…

We survey the theory of the compactified Jacobian associated to a singular curve. We focus on describing low genus examples using the Abel map.

Suppose $Y$ is a smooth variety equipped with a top form. We prove a simple theorem giving a sharp lower bound on the geometric genus of a family of subvarieties of $Y$, in terms of the dimension of this family. Two elementary applications…

We study the real components of modular curves. Our main result is an abstract group-theoretic description of the real components of a modular curve defined by a congruence subgroup of level N in terms of the corresponding subgroup of…

The (torsion) complexity of a finite signed graph is defined to be the order of the torsion subgroup of the abelian group presented by its Laplacian matrix. When $G$ is $d$-periodic (i.e., $G$ has a free ${\mathbb Z}^d$-action by graph…

We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…

In this work, we present an efficient method for computing in the generalized Jacobian of special singular curves, nodal curves. The efficiency of the operation is due to the representation of an element in the Jacobian group by a single…

The sparsity order of a (simple undirected) graph is the highest possible rank (over ${\mathbb R}$ or ${\mathbb C}$) of the extremal elements in the matrix cone that consists of positive semidefinite matrices with prescribed zeros on the…

There are several notions of gonality for graphs. The divisorial gonality dgon(G) of a graph G is the smallest degree of a divisor of positive rank in the sense of Baker-Norine. The stable gonality sgon(G) of a graph G is the minimum degree…

In this article we study rational curves with a unique unibranch genus-$g$ singularity, which is of {\it $\ka$-hyperelliptic} type in the sense of \cite{To}; we focus on the cases $\ka=0$ and $\ka=1$, in which the semigroup associated to…