Related papers: Limit linear series and the Amini-Baker constructi…
In trying to generalize the classic Sylvester-Gallai theorem and De Bruijn-Erd\H{o}s theorem in plane geometry, lines and closure lines were previously defined for metric spaces and hypergraphs. Both definitions do not obey the geometric…
This note draws conclusions that arise by combining two recent papers, by Anuj Dawar, Erich Gr\"adel, and Wied Pakusa, published at ICALP 2019 and by Moritz Lichter, published at LICS 2021. In both papers, the main technical results rely on…
We introduce the matching measure of a finite graph as the uniform distribution on the roots of the matching polynomial of the graph. We analyze the asymptotic behavior of the matching measure for graph sequences with bounded degree. A…
Brill-Noether loci ${\mathcal M}^r_{g,d}$ are those subsets of the moduli space ${\mathcal M}_g$ determined by the existence of a linear series of degree $d$ and dimension $r$. By looking at non-singular curves in a neighborhood of a…
We prove a splitting theorem for Riemannian n-manifolds with scalar curvature bounded below by a negative constant and containing certain area-minimising hypersurfaces (Theorem 3). Thus we generalise [25,Theorem 3] by Nunes. This splitting…
In the present paper, as a continuation of our preceding paper [10], we study another kind of central limit theorems (CLTs) for non-symmetric random walks on nilpotent covering graphs from a viewpoint of discrete geometric analysis…
We prove the following result: Let B be a smooth, irreducible, quasi-projective variety over the complex numbers and assume that B has a projective compactification \bar{B} such that \bar{B} - B is of codimension at least two in \bar{B}.…
Recently, minimal linear codes have been extensively studied due to their applications in secret sharing schemes, secure two-party computations, and so on. Constructing minimal linear codes violating the Ashikhmin-Barg condition and then…
The purpose of this article is to give a characterization of families of expander graphs via right-angled Artin groups. We prove that a sequence of simplicial graphs $\{\Gamma_i\}_{i\in\mathbb{N}}$ forms a family of expander graphs if and…
This paper presents graph theoretic conditions for the controllability and accessibility of bilinear systems over the special orthogonal group, the special linear group and the general linear group, respectively, in the presence of drift…
We establish a sharp edge-connectivity estimate for graphs with non-negative Bakry-\'Emery curvature. This leads to a geometric criterion for the existence of a perfect matching. Precisely, we show that any regular graph with non-negative…
We construct Salem sets on the real line with endpoint Fourier decay and near-endpoint regularity properties. This complements a result of \L aba and Pramanik, who obtained near-endpoint Fourier decay and endpoint regularity properties. We…
Motivated by the Dani-Mainkar construction, we extend the notion of independence polynomial of graphs to arbitrary 2-step nilpotent Lie algebras. After establishing efficiently computable upper and lower bounds for the independence number,…
We survey some properties of a class of curves lying on certain elliptic ruled surfaces, studied by A. Treibich and J.L. Verdier in connection with elliptic solitons and KP equations. In particular we discuss their Brill-Noether generality,…
Most, if not all, unconditional results towards the abc-conjecture rely ultimately on classical Baker's method. In this article, we turn our attention to its elliptic analogue. Using the elliptic Baker's method, we have recently obtained a…
Understanding when an abstract complex curve of given genus comes equipped with a map of fixed degree to a projective space of fixed dimension is a foundational question; and Brill--Noether theory addresses this question via linear series,…
Elek and Lippner (2010) showed that the convergence of a sequence of bounded-degree graphs implies the existence of a limit for the proportion of vertices covered by a maximum matching. We provide a characterization of the limiting…
We investigate variations of Brieskorn lattices over non-compact parameter spaces, and discuss the corresponding limit objects on the boundary divisor. We study the associated variation of twistors and the corresponding limit mixed twistor…
We give explicit bounds on the intersection number between any curve on a tight multigeodesic and the two ending curves. We use this to construct all tight multigeodesics and so conclude that distances in the curve graph are computable. The…
In this paper, several nonlinear elliptic systems are investigated on graphs. One type of the sobolev embedding theorem and a new version of the strong maximum principle are established. Then, by using the variational method, the existence…