English
Related papers

Related papers: Linked Grassmannians and crude limit linear series

200 papers

We propose the graph description of Teichm\"uller theory of surfaces with marked points on boundary components (bordered surfaces). Introducing new parameters, we formulate this theory in terms of hyperbolic geometry. We can then describe…

Algebraic Geometry · Mathematics 2008-12-19 Leonid Chekhov

Linear and projective boundaries of Cayley graphs were introduced in~\cite{kst} as quasi-isometry invariant boundaries of finitely generated groups. They consist of forward orbits $g^\infty=\{g^i: i\in \mathbb N\}$, or orbits…

Group Theory · Mathematics 2014-08-27 Bernhard Krön , Jörg Lehnert , Maya Stein

The differential equations with piecewise constant argument (DEPCAs, for short) is a class of hybrid dynamical systems (combining continuous and discrete). In this paper, under the assumption that the nonlinear term is partially unbounded,…

Classical Analysis and ODEs · Mathematics 2018-04-10 Changwu Zou , Yong-Hui Xia , Manuel Pinto , Jinlin Shi , Yuzhen Bai

In this paper, we explore the limit structure of a sequence of Riemannian manifolds with Bakry-\'Emery Ricci curvature bounded below in the Gromov-Hausdorff topology. By extending the techniques established by Cheeger-Cloding for Riemannian…

Differential Geometry · Mathematics 2016-01-18 Feng Wang , Xiaohua Zhu

This paper introduces the use of per-class regularization hyperparameters in Gabriel graph-based binary classifiers. We demonstrate how the quality index used for regularization behaves both in the margin region and in the presence of…

Machine Learning · Computer Science 2026-05-05 Vítor M. Hanriot , Turíbio T. Salis , Luiz C. B. Torres , Frederico Coelho , Antonio P. Braga

We construct a compactification of the space of circular planar electrical networks studied by Curtis-Ingerman-Morrow and De Verdiere-Gitler-Vertigan, using cactus networks. We embed this compactification as a linear slice of the totally…

Combinatorics · Mathematics 2018-09-03 Thomas Lam

A rigidity theory is developed for the Euclidean and non-Euclidean placements of countably infinite simple graphs in R^d with respect to the classical l^p norms, for d>1 and 1<p<\infty. Generalisations are obtained for the Laman and…

Metric Geometry · Mathematics 2013-10-08 D. Kitson , S. C. Power

We prove $L^p$ bounds for the extensions of standard multilinear Calder\'on-Zygmund operators to tuples of UMD spaces tied by a natural product structure. This can, for instance, mean the pointwise product in UMD function lattices, or the…

Classical Analysis and ODEs · Mathematics 2020-08-17 Francesco Di Plinio , Kangwei Li , Henri Martikainen , Emil Vuorinen

This paper studies nonlinear deformations of the linear gauge theory of any number of spin-2 and spin-3/2 fields with general formal multiplication rules in place of standard Grassmann rules for manipulating the fields, in four spacetime…

General Relativity and Quantum Cosmology · Physics 2008-11-26 Stephen C. Anco

In previous work arXiv:2407.13556, we proposed an extended phase space structure at null infinity accommodating large gauge symmetries for sub$^n$-leading soft theorems in Yang-Mills, via dressing fields arising in the Stueckelberg…

High Energy Physics - Theory · Physics 2026-03-26 Silvia Nagy , Javier Peraza , Giorgio Pizzolo

The relationship between bulk and boundary properties is one of the founding features of (Rational) Conformal Field Theory. Our goal in this paper is to explore the possibility of having an equivalent relationship in the context of lattice…

High Energy Physics - Theory · Physics 2022-11-29 Jonathan Belletête , Azat M. Gainutdinov , Jesper L. Jacobsen , Hubert Saleur , Romain Vasseur

We prove new explicit inapproximability results for the Vertex Cover Problem on the Power Law Graphs and some functional generalizations of that class of graphs. Our results depend on special bounded degree amplifier constructions for those…

Computational Complexity · Computer Science 2012-10-10 Mikael Gast , Mathias Hauptmann , Marek Karpinski

Any link that is the closure of a positive braid has a natural Legendrian representative. These were introduced in an earlier paper, where their Chekanov--Eliashberg contact homology was also evaluated. In this paper we re-phrase and…

Symplectic Geometry · Mathematics 2007-05-23 Tamás Kálmán

In this article, we study the topological complexity of manifolds with a lower scalar curvature bound. We introduce a small scale index theorem to establish an upper bound for Gromov's simplicial norm of the Poincar\'e dual of the A-hat…

Differential Geometry · Mathematics 2025-11-05 Qiaochu Ma , Guoliang Yu

The Lawrence-Krammer representation was used in $2000$ to show the linearity of the braid group. The problem had remained open for many years. The fact that the Lawrence-Krammer representation of the braid group is reducible for some…

Representation Theory · Mathematics 2010-08-04 Claire I. Levaillant

We develop a unified density-based framework for primality, coprimality, and prime pairs, and introduce an intrinsic normalized model for prime gaps constrained by the Prime Number Theorem. Within this setting, a structural tension between…

Number Theory · Mathematics 2026-01-23 Gregorio Vettori

We consider ind-varieties obtained as direct limits of chains of embeddings $X_1\stackrel{\phi_1}{\hookrightarrow}\dots\stackrel{\phi_{m-1}}{\hookrightarrow}…

Algebraic Geometry · Mathematics 2013-10-31 Ivan Penkov , Alexander S. Tikhomirov

Lott-Sturm-Villani theory of curvature on geodesic spaces has been extended to discrete graph spaces by C. L{\'e}onard by replacing W2-Wasserstein geodesics by Schr{\"o}odinger bridges in the definition of entropic curvature [23, 25, 24].…

Probability · Mathematics 2022-10-06 Paul-Marie Samson

In last passage percolation models lying in the KPZ universality class, the energy of long energy-maximizing paths may be studied as a function of the paths' pair of endpoint locations. Scaled coordinates may be introduced, so that these…

Probability · Mathematics 2019-07-12 Alan Hammond

Minimal linear codes are in one-to-one correspondence with special types of blocking sets of projective spaces over a finite field, which are called strong or cutting blocking sets. In this paper we prove an upper bound on the minimal…

Combinatorics · Mathematics 2021-05-18 Tamás Héger , Zoltán Lóránt Nagy