Related papers: A Note on the Lipschitz Selection

We prove the equivalence of two seemingly very different ways of generalising Rademacher's theorem to metric measure spaces. One such generalisation is based upon the notion of forming partial derivatives along a very rich structure of…

In the context of $\mathsf{ZF}$, we analyze a version of Hindman's finite unions theorem on infinite sets, which normally requires the Axiom of Choice to be proved. We establish the implication relations between this statement and various…

Lipschitz continuity of algorithms, introduced by Kumabe and Yoshida (FOCS'23), measures the stability of an algorithm against small input perturbations. Algorithms with small Lipschitz continuity are desirable, as they ensure reliable…

Consider a complex line bundle over a compact complex manifold equipped with an infinitely differentiable metric with strictly positive curvature form. Assign to positive tensor powers of this bundle the associated product metrics and…

Linear tree constraints were introduced by Hofmann and Rodriguez in the context of amortized resource analysis for object oriented programs. More precisely, they gave a reduction from inference of resource types to constraint solving. Thus,…

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…

The problem of minimizing an entropy functional subject to linear constraints is a useful example of partially finite convex programming. In the 1990s, Borwein and Lewis provided broad and easy-to-verify conditions that guarantee strong…

We tackle the problem of a combinatorial classification of finite metric spaces via their fundamental polytopes, as suggested by Vershik in 2010. In this paper we consider a hyperplane arrangement associated to every split pseudometric and,…

We provide two new proofs of the infinitude of prime numbers, using the additive Ramsey-theoretic result known as Folkman's theorem (alternatively, one can think of these proofs as using Hindman's theorem). This adds to the existing…

We establish the existence of conservative solutions of the initial value problem of the two-component Hunter--Saxton system on the line. Furthermore we investigate the stability of these solutions by constructing a Lipschitz metric.

In this article, we study an inverse problem consisting in the identification of a space-time dependent source term in the Ginzburg-Landau equation from final-time observations. We adopt a weak-solution framework and analyze Tikhonov's…

We extend the recent result of G. Godefroy which concerns the existence of non-norm attaining Lipschitz maps in order to characterize the norm attainment toward vectors for Lipschitz maps in the general setting of underlying space. The main…

We show that an algorithmic construction of sequences of recursive trees leads to a direct proof of the convergence of random recursive trees in an associated Doob-Martin compactification; it also gives a representation of the limit in…

Bonato and Tardif conjectured that the number of isomorphism classes of trees mutually embeddable with a given tree T is either 1 or infinite. We prove the analogue of their conjecture for rooted trees. We also discuss the original…

In the paper Compositionality of Component Fault Trees, we present a discussion of the compositionality of correctness of component fault trees. In this technical report, we present the formal proof of the central theorem of the…

We determine the maximum distance between any two of the center, centroid, and subtree core among trees with a given order. Corresponding results are obtained for trees with given maximum degree and also for trees with given diameter. The…

The classical McShane-Whitney extension theorem for Lipschitz functions is refined by showing that for a closed subset of the domain, it remains valid for any interval of the real line. This result is also extended to the setting of locally…

The MULTICUT IN TREES problem consists in deciding, given a tree, a set of requests (i.e. paths in the tree) and an integer k, whether there exists a set of k edges cutting all the requests. This problem was shown to be FPT by Guo and…

Given a class of objects, a pattern theorem is a powerful result describing their structure. We show that alternating knots exhibit a pattern theorem, and use this result to prove a long-standing conjecture that alternating knots grow rare.…

Via a functor from certain Lorentzian to Riemannian manifolds, we obtain a finiteness result.