Related papers: Lower bounds on mapping content and quantitative f…

We prove a mixed version of a conjecture of Griffiths: that the closure of the image of any admissible mixed period map is quasiprojective, with a natural ample bundle. Specifically, we consider the map from the image of the mixed period…

We consider Lipschitz maps with values in quasi-metric spaces and extend such maps to finitely many points. We prove that in this context every 1-Lipschitz map admits an extension such that its Lipschitz constant is bounded from above by…

We have recently introduced the trimming property for a complete Riemannian manifold $N^{n}$ as a necessary and sufficient condition for bounded maps to be strongly dense in $W^{1, p}(B^m; N^{n})$ when $p \in \{1, \dotsc, m\}$. We prove in…

We consider a port-Hamiltonian system on a spatial domain $\Omega \subseteq \mathbb{R}^n$ that is bounded with Lipschitz boundary. We show that there is a boundary triple associated to this system. Hence, we can characterize all boundary…

We study the long-term behavior of the iteration of a random map consisting of Lipschitz transformations on a compact metric space, independently and randomly selected according to a fixed probability measure. Such a random map is said to…

We introduce a notion of intrinsically H\"older graphs in metric spaces. Following a recent paper of Le Donne and the author, we prove some relevant results as the Ascoli-Arzel\`a compactness Theorem, Ahlfors-David regularity and the…

We study the Wasserstein (or earthmover) metric on the space $P(X)$ of probability measures on a metric space $X$. We show that, if a finite metric space $X$ embeds stochastically with distortion $D$ in a family of finite metric trees, then…

We show that a map with H\"older exponent bigger than $1/2$ from a quasi-convex metric space with vanishing first Lipschitz homology into the Sub-Riemannian Heisenberg group factors through a tree. In particular, if the domain contains a…

We present a new technique for proving logarithmic upper bounds for diameters of evolving random graph models, which is based on defining a coupling between random graphs and variants of random recursive trees. The advantage of the…

We give a sufficient condition for a projective metric on a subset of a Euclidean space to admit a bi-Lipschitz embedding into Euclidean space of the same dimension.

In this paper, we show that one can naturally associate a limiting dynamical system $F: T\longrightarrow T$ on an $\R$-tree to any degenerating sequence of rational maps $f_n: \hat\C \longrightarrow \hat\C$ of fixed degree. The construction…

We show that the computational complexity of Riemann mappings can be bounded by the complexity needed to compute conformal mappings locally at boundary points. As a consequence we get first formally proven upper bounds for…

We consider the satisfiability problem for the two-variable fragment of the first-order logic extended with modulo counting quantifiers and interpreted over finite words or trees. We prove a small-model property of this logic, which gives a…

In Euclidean space of dimension 2 or 3, we study a minimum time problem associated with a system of real-analytic vector fields satisfying H\"ormander's bracket generating condition, where the target is a nonempty closed set. We show that,…

We present a model-theoretic property of finite structures, that can be seen to be a finitary analogue of the well-studied downward L\"owenheim-Skolem property from classical model theory. We call this property as the…

The notions of $p$-convexity and $q$-concavity are mostly known because of their importance as a tool in the study of isomorphic properties of Banach lattices, but they also play a role in several results involving linear maps between…

The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as splay trees, can achieve this property in the amortized sense,…

If $A$ is an n-by-n matrix over a field $F$ ($A\in M_{n}(F)$), then $A$ is said to ``have an LU factorization'' if there exists a lower triangular matrix $L\in M_{n}(F)$ and an upper triangular matrix $U\in M_{n}(F)$ such that $$A=LU.$$ We…

Given a rooted tree and a ranking of its leaves, what is the minimum number of inversions of the leaves that can be attained by ordering the tree? This variation of the problem of counting inversions in arrays originated in mathematical…

While empirical scaling laws for LLM reasoning are well-documented, the theoretical mechanisms governing out-of-distribution (OOD) generalization remain elusive. We formalize reasoning via optimal transport, projecting discrete trajectories…