Related papers: Proof mining in ${\mathbb R}$-trees and hyperbolic…

We combine conditions found in [Wh] with results from [MPR] to show that quasi-isometries between uniformly discrete bounded geometry spaces that satisfy linear isoperimetric inequalities are within bounded distance to bilipschitz…

In this paper we investigate the geometric properties of quasi-trees, and prove some equivalent criteria. We give a general construction of a tree that approximates the ends of a geodesic space, and use this to prove that every quasi-tree…

We define metrics in space that are natural counterparts of the hyperbolic metric in plane domains, using the characterization of the hyperbolic metric due to Beardon and Pommerenke. We obtain inequalities for these metrics under…

An asymptotic theory is developed for computing volumes of regions in the parameter space of a directed Gaussian graphical model that are obtained by bounding partial correlations. We study these volumes using the method of real log…

In large-scale recommender systems, the user-item networks are generally scale-free or expand exponentially. The latent features (also known as embeddings) used to describe the user and item are determined by how well the embedding space…

Learning generalizable self-supervised graph representations for downstream tasks is challenging. To this end, Contrastive Learning (CL) has emerged as a leading approach. The embeddings of CL are arranged on a hypersphere where similarity…

The space of unitary local systems of rank one on the complement of an arbitrary divisor in a complex projective algebraic variety can be described in terms of parabolic line bundles. We show that multiplier ideals provide natural…

We provide partial results towards a conjectural generalization of a theorem of Lubotzky-Mozes-Raghunathan for arithmetic groups (over number fields or function fields) that implies, in low dimensions, both polynomial isoperimetric…

Cyclic and non-wellfounded proofs are now increasingly employed to establish metalogical results in a variety of settings, in particular for type systems with forms of (co)induction. Under the Curry-Howard correspondence, a cyclic proof can…

Herbrand's theorem is one of the most fundamental insights in logic. From the syntactic point of view it suggests a compact representation of proofs in classical first- and higher-order logic by recording the information which instances…

Motivated by applications to monotonicity testing, Lehman and Ron (JCTA, 2001) proved the existence of a collection of vertex disjoint paths between comparable sub-level sets in the directed hypercube. The main technical contribution of…

This paper introduces new variational methods centered on the direct application of a profile decomposition theorem for bounded sequences in Sobolev spaces. We employ these methods to prove the existence of ground state solutions for a…

We introduce a randomized iterative fragmentation procedure for finite metric spaces, which is guaranteed to result in a polynomially large subset that is $D$-equivalent to an ultrametric, where $D\in (2,\infty)$ is a prescribed target…

This paper explores the connection between two central results in the proof theory of classical logic: Gentzen's cut-elimination for the sequent calculus and Herbrands "fundamental theorem". Starting from Miller's expansion-tree-proofs, a…

We prove fixed point theorems in a space with a distance function that takes values in a partially ordered monoid. On the one hand, such an approach allows one to generalize some fixed point theorems in a broad class of spaces, including…

We classify all closed, aspherical Riemannian manifolds M whose universal cover has indiscrete isometry group. One sample application is the theorem that any such M with word-hyperbolic fundamental group must be isometric to a negatively…

In this article, we develop the theory of weighted $L^2$ Sobolev spaces on unbounded domains in $\mathbb R^n$. As an application, we establish the elliptic theory for elliptic operators and prove trace and extension results analogous to the…

Model checking and automated theorem proving are two pillars of formal methods. This paper investigates model checking from an automated theorem proving perspective, aiming at combining the expressiveness of automated theorem proving and…

The purpose of this paper is to make a comprehensive connection between the basic results and properties derived from the two kinds of topologies (namely the $(\epsilon,\lambda)-$topology introduced by the author and the stronger locally…

We study the iterated blow-up X of projective space along an arbitrary collection of linear subspaces. By replacing the universal torsor with an $\mathbb{A}^1$-homotopy equivalent model, built from $\mathbb{A}^1$-fiber bundles not just…