Related papers: Constructing new ample divisors out of old ones
Computational materials design often profits from the fact that some complicated contributions are not calculated for the real material, but replaced by results of models. We turn this approximation into a very general and in principle…
In the context of complex algebraic varieties, the decomposition theorem for semi-small maps provides a decomposition of the direct image of the constant sheaf. In this work, we develop a decomposition theorem for branched coverings of…
We prove that Alexandrov's conjecture relating the area and diameter of a convex surface holds for the surface of a general ellipsoid. This is a direct consequence of a more general result which estimates the deviation from the optimal…
Given a diagram of schemes, we can ask if a geometric object over one of them can be built from descent data (usually objects of the same type over the various other schemes in the diagram, together with compatibility isomorphisms). Using…
Originally, tangles were invented as an abstract tool in mathematical graph theory to prove the famous graph minor theorem. In this paper, we showcase the practical potential of tangles in machine learning applications. Given a collection…
Graphs that are squares under the gluing algebra arise in the study of homomorphism density inequalities such as Sidorenko's conjecture. Recent work has focused on these homomorphism density applications. This paper takes a new perspective…
Starting with a collection of $n$ oriented polygonal discs, with an even number $N$ of sides in total, we generate a random oriented surface by randomly matching the sides of discs and properly gluing them together. Encoding the surface in…
We give a self-contained treatment of the theory of persistence modules indexed over the real line. We give new proofs of the standard results. Persistence diagrams are constructed using measure theory. Linear algebra lemmas are simplified…
We provide algorithms to reconstruct rational ruled surfaces in three-dimensional projective space from the `apparent contour' of a single projection to the projective plane. We deal with the case of tangent developables and of general…
We prove an effective restriction theorem for stable vector bundles $E$ on a smooth projective variety: $E|_D$ is (semi)stable for all irreducible divisors $D \in |kH|$ for all $k$ greater than an explicit constant. As an application, we…
We present two constructions, both inspired by ideas from graph theory, of sequences random surfaces of growing area, whose systoles grow logarithmically as a function of their area. This also allows us to prove a new lower bound on the…
We investigate the notion of the $p$-divisor for foliations on a smooth algebraic surface defined over a field of positive characteristic $p$ and we study some of their properties. We present a structure theorem for the $p$-divisor of…
The theory of partition congruences has been a fascinating and difficult subject for over a century now. In attempting to prove a given congruence family, multiple possible complications include the genus of the underlying modular curve,…
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…
The titular, foundational work of Beilinson not only gives a technique for gluing perverse sheaves but also implicitly contains constructions of the nearby and vanishing cycles functors of perverse sheaves. These constructions are…
In this thesis, a new approach for constructing subdivision algorithms for generalized quadratic and cubic B-spline subdivision for subdivision surfaces and volumes is presented. First, a catalog of quality criteria for these subdivision…
We construct a four-parameter family of affine Yangian algebras by gluing two copies of the affine Yangian of $\mathfrak{gl}_1$. Our construction allows for gluing operators with arbitrary (integer or half integer) conformal dimension and…
We show that if a divisor centered over a point on a smooth surface computes a minimal log discrepancy, then the divisor also computes a log canonical threshold. To prove the result, we study the asymptotic log canonical threshold of the…
Algorithms can be used to prove and to discover new theorems. This paper shows how algorithmic skills in general, and the notion of invariance in particular, can be used to derive many results from Euclid's algorithm. We illustrate how to…
We show that a proof in multiplicative linear logic can be represented as a decorated surface, such that two proofs are logically equivalent just when their surfaces are geometrically equivalent. This is an extended abstract for…