English
Related papers

Related papers: A Theorem of Roe and Strichartz on homogeneous tre…

200 papers

Let $\sigma$ be the involution of the Roe algebra $\Roe{\RR}$ which is induced from the reflection $\RR\to\RR; x\mapsto -x$. A graded Fredholm module over a separable $C^*$-algebra $A$ gives rise to a homomorphism…

K-Theory and Homology · Mathematics 2010-03-10 Robert Yuncken

We show that each of Thompson's groups F, T, and V have infinitely many ends relative to certain subgroups. We go on to show that T and V both have Serre's property FA, i.e., any action of T or V on a tree will have a fixed point. (The…

Group Theory · Mathematics 2007-08-13 Daniel Farley

We explore a physical model of ordered sums of integers as trains of rods. The trains for a fixed, possibly infinite, set of rod lengths naturally correspond to nodes in a tree; relations among finite linear recursions encoded in the…

Combinatorics · Mathematics 2025-10-16 Ethan D. Bolker , Debra K. Borkovitz , Katelyn Lee

K\"onig's lemma is a fundamental result about trees with countless applications in mathematics and computer science. In contrapositive form, it states that if a tree is finitely branching and well-founded (i.e. has no infinite paths), then…

Logic in Computer Science · Computer Science 2026-02-20 Henning Urbat , Thorsten Wißmann

A classical argument was introduced by Khintchine in 1926 in order to exhibit the existence of totally irrational singular linear forms in two variables. This argument was subsequently revisited and extended by many authors. For instance,…

Number Theory · Mathematics 2026-01-14 Dmitry Kleinbock , Nikolay Moshchevitin , Jacqueline Warren , Barak Weiss

We show that any free product of two countable groups, one of them being infinite, admits a faithful and homogeneous action on the Random Graph. We also show that a large class of HNN extensions or free products, amalgamated over a finite…

Group Theory · Mathematics 2021-05-26 Pierre Fima , Soyoung Moon , Yves Stalder

We give a new proof of Tietze Theorem on the convergence of infinite semi-regular continued fractions.

Number Theory · Mathematics 2022-03-11 Daniel Duverney , Iekata Shiokawa

Among other results, we prove the following theorem about Steiner minimal trees in $d$-dimensional Euclidean space: if two finite sets in $\mathbb{R}^d$ have unique and combinatorially equivalent Steiner minimal trees, then there is a…

Metric Geometry · Mathematics 2019-06-18 Herbert Edelsbrunner , Nataliya Strelkova

Let $G(k)=\int_0^1g(x)e^{kx}dx$, $g\in L^1(0,1)$. The main result of this paper is the following theorem. {\bf Theorem}. {\it If $\limsup_{k\to +\infty}|G(k)|<\infty$, then $g=0$. There exists $g\not\equiv 0$, $g\in L^1(0,1)$, such that…

Complex Variables · Mathematics 2010-01-05 A. G. Ramm

The Kruskal-Friedman theorem asserts: in any infinite sequence of finite trees with ordinal labels, some tree can be embedded into a later one, by an embedding that respects a certain gap condition. This strengthening of the original…

Logic · Mathematics 2025-08-13 Anton Freund

In this paper we study the theories of the infinite-branching tree and the $r$-regular tree, and show that both of them are pseudofinite. Moreover, we show that they can be realized by infinite ultraproducts of polynomial exact classes of…

Logic · Mathematics 2026-01-14 Darío García , Melissa Robles

Determining whether two graphs are isomorphic is an important and difficult problem in graph theory. One way to make progress towards this problem is by finding and studying graph invariants that distinguish large classes of graphs. Stanley…

Combinatorics · Mathematics 2020-10-22 Jeremy Zhou

Let $\phi(x,y)$ be a continuous function, smooth away from the diagonal, such that, for some $\alpha>0$, the associated generalized Radon transforms \begin{equation} \label{Radon} R_t^{\phi}f(x)=\int_{\phi(x,y)=t} f(y) \psi(y)…

Classical Analysis and ODEs · Mathematics 2025-04-22 Allan Greenleaf , Alex Iosevich , Krystal Taylor

Lov\'asz (1967) showed that two finite relational structures A and B are isomorphic if, and only if, the number of homomorphisms from C to A is the same as the number of homomorphisms from C to B for any finite structure C. Soon after,…

Logic in Computer Science · Computer Science 2022-09-05 Anuj Dawar , Tomáš Jakl , Luca Reggio

Extending a result of K. Milliken \cite{Mi2}, in this paper we prove a Ramsey classification result for equivalence relations defined on uniform families of finite strong subtrees of a finite sequence $(U_i)_{i\in d}$ of fixed trees $U_i$,…

Logic · Mathematics 2014-10-21 Dimitris Vlitas

In this article, we investigate homogeneous versions of certain nonlinear Ramsey-theoretic results, with three significant applications. As the first application, we prove that for every finite coloring of $\mathbb{Z}^+$, there exist an…

Combinatorics · Mathematics 2025-04-16 Sukumar Das Adhikari , Sayan Goswami

A central result of Sturm-Liouville theory (also called the Sturm-Hurwitz Theorem) states that if $\phi_k$ is a sequence of eigenfunctions of a second order differential operator on the interval $I \subset \mathbb{R}$, then any linear…

Analysis of PDEs · Mathematics 2019-12-02 Stefan Steinerberger

Let $f^{(r)}(n;s,k)$ denote the maximum number of edges in an $r$-graph on $n$ vertices in which every $k$ edges span more than $s$ vertices. Brown, Erd\H{o}s and S\'{o}s in 1973 conjectured that for every $k\geq 2$, the limit…

Combinatorics · Mathematics 2026-03-23 Yan Wang , Jiasheng Zeng

We prove a functional limit theorem in a space of analytic functions for the random Dirichlet series $D(\alpha;z)=\sum_{n\geq 2}(\log n)^{\alpha}(\eta_n+{\rm i} \theta_n)/n^z$, properly scaled and normalized, where…

Probability · Mathematics 2022-11-02 Dariusz Buraczewski , Congzao Dong , Alexander Iksanov , Alexander Marynych

An order-theoretic forest is a countable partial order such that the set of elements larger than any element is linearly ordered. It is an order-theoretic tree if any two elements have an upper-bound. The order type of a branch can be any…

Logic in Computer Science · Computer Science 2023-06-22 Bruno Courcelle