Related papers: Limit linear series and the Amini-Baker constructi…
We study the intersection of an algebraic variety with the maximal compact subgroup of a universal vectorial extension of a product of elliptic curves. For this intersection we show a Manin-Mumford type statement. This answers some…
We prove an analog of the Szemer\'edi-Trotter theorem in the plane for definable curves and points in any o-minimal structure over an arbitrary real closed field $\mathrm{R}$. One new ingredient in the proof is an extension of the well…
We consider real 2-step metric nilpotent Lie algebras associated to graphs with possibly repeated edge labels as constructed by Ray in 2016. We determine how the structure of the egde labeling within the graph contributes to the abelian…
The method of Murty and Cioab\u{a} shows how one can use results about gaps between primes to construct families of almost-Ramanujan graphs. In this paper we give a simpler construction which avoids the search for perfect matchings and thus…
Baker's method, relying on estimates on linear forms in logarithms of algebraic numbers, allows one to prove in several situations the effective finiteness of integral points on varieties. In this article, we give a generalisation of…
Graph separators are a ubiquitous tool in graph theory and computer science. However, in some applications, their usefulness is limited by the fact that the separator can be as large as $\Omega(\sqrt{n})$ in graphs with $n$ vertices. This…
We consider the case in which mixed graphs (with both directed and undirected edges) are Cayley graphs of Abelian groups. In this case, some Moore bounds were derived for the maximum number of vertices that such graphs can attain. We first…
This work investigates the structure of rank-metric codes in connection with concepts from finite geometry, most notably the $q$-analogues of projective systems and blocking sets. We also illustrate how to associate a classical…
Using the theory of moduli of curves, we establish various slope inequalities for general fibered surfaces. More precisely, we introduce the notion of functorial divisors on Artin stacks and prove a theorem concerning their effectiveness.…
We study some properties of graphs (or, rather, graph sequences) defined by demanding that the number of subgraphs of a given type, with vertices in subsets of given sizes, approximatively equals the number expected in a random graph. It…
Kim defined a very general combinatorial abstraction of the diameter of polytopes called subset partition graphs to study how certain combinatorial properties of such graphs may be achieved in lower bound constructions. Using Lov\'asz'…
We prove a smoothness result for spaces of linear series with prescribed ramification on twice-marked elliptic curves. In characteristic 0, we then apply the Eisenbud-Harris theory of limit linear series to deduce a new proof of the…
In this paper we introduce a general framework for the study of limits of relational structures in general and graphs in particular, which is based on a combination of model theory and (functional) analysis. We show how the various…
The Arnold inequalities characterizing the topology of non-singular plane real algebraic curves and the generalization of these inequalities for nodal curves by Viro are extended in this paper for the curves whose singularities have…
We consider two different versions of the double dimer model on a planar domain, where we either fold a single dimer cover on a symmetric domain onto itself across the line of symmetry, or we superimpose two independent dimer covers on two,…
It is known that the Lawrence-Krammer representation of the Artin group of type $A_{n-1}$ based on the two parameters $t$ and $q$ that was used by Krammer and independently by Bigelow to show the linearity of the braid group on $n$ strands…
Both Morse theory and Lusternik-Schnirelmann theory link algebra, topology and analysis in a geometric setting. The two theories can be formulated in finite geometries like graph theory or within finite abstract simplicial complexes. We…
In this paper we compute the gonality and the dimension of the Brill-Noether loci $W^1_d(C)$ for curves in a non primitive linear system of a simple abelian surface, adapting vector bundles techniques \`a la Lazarsfeld originally introduced…
mim-width is a recent graph width measure that has seen applications in graph algorithms and problems related to propositional satisfiability. In this paper, we show linear lower bounds for the mim-width of strongly chordal split graphs,…
We study in this paper nonlinear subdivision schemes in a multivariate setting allowing arbitrary dilation matrix. We investigate the convergence of such iterative process to some limit function. Our analysis is based on some conditions on…