English
Related papers

Related papers: A Note on the Lipschitz Selection

200 papers

We prove a conjecture of F. Chapoton relating certain enumerative invariants of (a) the cluster complex associated by S. Fomin and A. Zelevinsky to a finite root system and (b) the lattice of noncrossing partitions associated to the…

Combinatorics · Mathematics 2007-05-23 Christos A. Athanasiadis

We consider a unique continuation problem where the Dirichlet trace of the solution is known to have finite dimension. We prove Lipschitz stability of the unique continuation problem and design a finite element method that exploits the…

Numerical Analysis · Mathematics 2023-05-12 Erik Burman , Lauri Oksanen

Richard P. Stanley conjectured that finite trees can be distinguished by their chromatic symmetric functions. In this paper, we prove an analogous statement for posets: Finite rooted trees can be distinguished by their order quasisymmetric…

Combinatorics · Mathematics 2018-09-17 Takahiro Hasebe , Shuhei Tsujie

A theorem, usually attributed to Barr, yields that (A) geometric implications deduced in classical L_{\infty\omega} logic from geometric theories also have intuitionistic proofs. Barr's theorem is of a topos-theoretic nature and its proof…

Logic · Mathematics 2016-03-11 Michael Rathjen

A quasiconformal tree is a doubling metric tree in which the diameter of each arc is bounded above by a fixed multiple of the distance between its endpoints. We study the geometry of these trees in two directions. First, we construct a…

Metric Geometry · Mathematics 2022-03-10 Guy C. David , Vyron Vellis

Trees are partial orderings where every element has a linearly ordered set of smaller elements. We define and study several natural notions of completeness of trees, extending Dedekind completeness of linear orders and Dedekind-MacNeille…

Combinatorics · Mathematics 2023-01-18 Valentin Goranko , Ruaan Kellerman , Alberto Zanardo

Let $Y\subseteq \mathbb{R}^n$ be a closed definable subset and $X\subseteq \mathbb{R}^n$ be a smooth manifold. We construct a version of Morse theory for the restriction to $X$ of the Euclidean distance function from $Y$. This is done using…

Algebraic Geometry · Mathematics 2026-05-12 Andrea Guidolin , Antonio Lerario , Isaac Ren , Martina Scolamiero

We present a new structure theorem for finite fields of odd order that relates multiplicative and additive structure in an interesting way. This theorem has several applications, including an improved understanding of Dickson and Chebyshev…

Number Theory · Mathematics 2021-05-04 Antonia W. Bluher

Kreisel has observed that the termination proof for Hilbert's epsilon-substitution method bears a resemblance to the priority arguments used in recursion theory. We make this precise by proving the termination using a framework for priority…

Logic · Mathematics 2008-12-19 Henry Towsner

In this paper we develop a bubble tree structure for a degenerating class of Riemannian metrics satisfying some global conformal bounds on compact manifolds of dimension 4. Applying the bubble tree structure, we establish a gap theorem, a…

Differential Geometry · Mathematics 2007-05-23 Alice Chang , Jie Qing , Paul Yang

We consider a natural variant of the well-known Feedback Vertex Set problem, namely the problem of deleting a small subset of vertices or edges to a full binary tree. This version of the problem is motivated by real-world scenarios that are…

Data Structures and Algorithms · Computer Science 2020-01-01 Pratyush Dayal , Neeldhara Misra

In this note, we establish the hardness of approximation of the problem of computing the minimal size of a $\delta$-sufficient reason for decision trees.

Computational Complexity · Computer Science 2023-04-07 Alexander Kozachinskiy

In this paper we present a constructive proof of cut elimination for a system of full second order logic with the structural rules absorbed and using sets instead of sequences. The standard problem of the cutrank growth is avoided by using…

Logic · Mathematics 2016-06-22 Sandro Skansi

The first-order theory of finite and infinite trees has been studied since the eighties, especially by the logic programming community. Following Djelloul, Dao and Fr\"uhwirth, we consider an extension of this theory with an additional…

Logic in Computer Science · Computer Science 2020-08-10 Fabian Zaiser , C. -H. Luke Ong

Whitney's extension problem asks the following: Given a compact set $E\subset\mathbb{R}^n$ and a function $f:E\to \mathbb{R}$, how can we tell whether there exists $F\in C^m(\mathbb{R}^n)$ such that $F=f$ on $E$? A 2006 theorem of Charles…

Functional Analysis · Mathematics 2022-01-04 Fushuai Jiang , Garving K. Luli , Kevin O'Neill

The aim of this fisrt part is to introduce, for a rather large class of hypersurface singularities with 1 dimensionnal locus, the analog of the Brieskorn lattice at the origin (the singular point of the singular locus). The main results are…

Algebraic Geometry · Mathematics 2007-05-23 Daniel Barlet

In this note we consider a question related to the high-dimensional generalization of the classical Severi's finiteness theorem for curves. We will introduce some background and then state the main result. The proof of the main result is…

Algebraic Geometry · Mathematics 2023-08-01 Guoquan Gao

In this paper, we consider a problem of Lang about finiteness of torsion points on plane rational curves over $\mathbb C$, and prove some results towards a matrix analogue of this problem.

Number Theory · Mathematics 2023-02-22 Alina Ostafe

We study the conditions under which the isometry of spaces with metrics generated by weights given on the edges of finite trees is equivalent to the isomorphism of these trees. Similar questions are studied for ultrametric spaces generated…

Metric Geometry · Mathematics 2020-02-18 Oleksiy Dovgoshey

We present in this paper a first-order axiomatization of an extended theory $T$ of finite or infinite trees, built on a signature containing an infinite set of function symbols and a relation $\fini(t)$ which enables to distinguish between…

Logic in Computer Science · Computer Science 2007-07-02 Khalil Djelloul , Thi-bich-hanh Dao , Thom Fruehwirth