Related papers: Rigid curves on $\bar M_{0,n}$ and arithmetic brea…
We construct a semi-stable formal model of a wide open rigid curve with a semi-stable covering, and study the l-adic cohomology of the rigid curve. We describe the l-adic cohomology of the rigid curve using the l-adic cohomology of the…
We prove results that imply, under various hypotheses, that every elliptic curve over a number field $k$ corresponding to a point on a modular curve has bad reduction at a certain prime $p$ of $\mathcal{O}_k$. For example, every elliptic…
In this paper we give several methods to construct curves over finite fields with many points and illustrate this with examples of the results.
A \emph{locally irregular graph} is a graph whose adjacent vertices have distinct degrees. We say that a graph $G$ can be decomposed into $k$ locally irregular subgraphs if its edge set may be partitioned into $k$ subsets each of which…
We study geometric rigidity of a class of fractals, which is slightly larger than the collection of self-conformal sets. Namely, using a new method, we shall prove that a set of this class is contained in a smooth submanifold or is totally…
We introduce arrangements of rational sections over curves. They generalize line arrangements on P^2. Each arrangement of d sections defines a single curve in P^{d-2} through the Kapranov's construction of \bar{M}_{0,d+1}. We show a…
We deal with a problem of the explicit reconstruction of any holomorphic function $f$ on $\mathbb{C}^2$ from its restricions on a union of complex lines. The validity of such a reconstruction essentially depends on the mutual repartition of…
A rigidity theory is developed for bar-joint frameworks in $\mathbb{R}^{d+1}$ whose vertices are constrained to lie on concentric $d$-spheres with independently variable radii. In particular, combinatorial characterisations are established…
A graph is reconstructible if it is determined up to isomorphism by the multiset of its proper induced subgraphs. The reconstruction conjecture postulates that every graph of order at least 3 is reconstructible. We show that interval graphs…
We provide a deterministic construction of hard instances for the maximum independent set problem (MIS). The constructed hard instances form an infinite graph sequence with increasing size, which possesses similar characteristics to sparse…
We obtain explicit formulas for the number of non-isomorphic elliptic curves with a given group structure (considered as an abstract abelian group). Moreover, we give explicit formulas for the number of distinct group structures of all…
Guth and Katz proved that, as conjectured by Elekes and Sharir, $m$ lines in 3-space have at most constant times $ m^{3/2}$ intersection points, aside from some obvious counter examples. We give an explicit bound for the constant, using the…
Combinatorial rigidity theory seeks to describe the rigidity or flexibility of bar-joint frameworks in R^d in terms of the structure of the underlying graph G. The goal of this article is to broaden the foundations of combinatorial rigidity…
Various methods have been used to construct rational points and rational curves on rationally connected algebraic varieties. We survey recent advances in two of them, the descent and the fibration method, in a number-theoretical context…
We give a myriad of examples of extremal divisors, rigid curves, and birational morphisms with unexpected properties for the Grothendieck--Knudsen moduli space $\bar M_{0,n}$ of stable rational curves. The basic tool is an isomorphism…
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 reproducing kernel methods to study various rigidity problems. The methods and setting allow us to also consider the non-positive case.
In the $m$-dimensional affine space $AG(m,q)$ over the finite field $\mathbb{F}_q$ of odd order $q$, the analogous of the Euclidean distance gives rise to a graph $\mathfrak{G}_{m,q}$ where vertices are the points of $AG(m,q)$ and two…
A classical inequality which is due to Lickorish and Hempel says that the distance between two curves in the curve complex can be measured by their intersection number. In this paper, we show a converse version; the intersection number of…
Given a smooth affine curve X over a field k of positive characteristic, and an overconvergent F-isocrystal on X, we prove after replacing k by a finite purely inseparable extension, there exists a finite separable cover of X, the pullback…