English
Related papers

Related papers: A Dual Ramsey theorem for trees

200 papers

We prove a Morse index theorem for action functionals on paths that are allowed to reflect at a hypersurface (either in the interior or at the boundary of a manifold). Both fixed and periodic boundary conditions are treated.

Differential Geometry · Mathematics 2024-06-26 Jared Wunsch , Mengxuan Yang , Yuzhou Zou

We develop a Van der Waerden type theorem in an axiomatic setting of graded lattices and show that this axiomatic formulation can be applied to various lattices, for instance the set partition and the Boolean lattices. We derive the…

Combinatorics · Mathematics 2021-03-05 Abhishek Khetan , Amitava Bhattacharya

The vector space spanned by rooted forests admits two graded bialgebra structures. The first is defined by A. Connes and D. Kreimer using admissible cuts, and the second is defined by D. Calaque, K. Ebrahimi-Fard and the second author using…

Combinatorics · Mathematics 2016-05-12 Mohamed Belhaj Mohamed , Dominique Manchon

This is the second part of a series of three articles which introduce laminations for free groups (see math.GR/0609416 for the first part). Several definition of the dual lamination of a very small action of a free group on an $\R$-tree are…

Group Theory · Mathematics 2014-02-26 Thierry Coulbois , Arnaud Hilion , Martin Lustig

Let $T$ be a locally finite tree all of whose vertices have valency at least $6$. We classify, up to isomorphism, the closed subgroups of $\mathrm{Aut}(T)$ acting $2$-transitively on the set of ends of $T$ and whose local action at each…

Group Theory · Mathematics 2020-07-23 Nicolas Radu

Starting with a combinatorial partition theorem for words over an infinite alphabet dominated by a fixed sequence, established recently by the authors, we prove recurrence results for topological dynamical systems indexed by such words. In…

General Topology · Mathematics 2011-01-18 Vassiliki Farmaki , Andreas Koutsogiannis

We prove that if an $\omega$-categorical structure has an $\omega$-categorical homogeneous Ramsey expansion, then so does its model-complete core.

Logic · Mathematics 2023-06-22 Antoine Mottet , Michael Pinsker

Let \Gamma be a geometrically finite tree lattice. We prove a Khintchine-Sullivan type theorem for the Hausdorff measure of the points at infinity of the tree that are well approximated by the parabolic fixed points of G. Using Bruhat-Tits…

Group Theory · Mathematics 2007-05-23 Sa'ar Hersonsky , Frederic Paulin

In this article, we study a degenerate version of Ramsey's theorem for pairs and two colors ($\mathsf{RT}^2_2$), in which the homogeneous sets for color 1 are of bounded size. By $\mathsf{RT}^2_2$, it follows that every such coloring admits…

Logic · Mathematics 2025-09-05 Quentin Le Houérou , Ludovic Patey

We define a bivariate polynomial for unlabeled rooted trees and show that the polynomial of an unlabeled rooted tree $T$ is the generating function of a class of subtrees of $T$. We prove that the polynomial is a complete isomorphism…

Combinatorics · Mathematics 2020-02-13 Pengyu Liu

We prove a new characterization of the Ramsey property of categories in terms of a generalized form of K\H{o}nig's tree lemma. Afterwards, we discuss its applications to structural Ramsey theory. In particular, we provide a new proof of the…

Combinatorics · Mathematics 2025-08-18 Maximilian Hadek

The purpose is to study the strength of Ramsey's Theorem for pairs restricted to recursive assignments of $k$-many colors, with respect to Intuitionistic Heyting Arithmetic. We prove that for every natural number $k \geq 2$, Ramsey's…

Logic · Mathematics 2016-01-11 Stefano Berardi , Silvia Steila

For a graph $G = (V, E)$, the $\gamma$-graph of $G$, denoted $G(\gamma) = (V(\gamma), E(\gamma))$, is the graph whose vertex set is the collection of minimum dominating sets, or $\gamma$-sets of $G$, and two $\gamma$-sets are adjacent in…

Combinatorics · Mathematics 2019-07-31 Stephen Finbow , Christopher M. van Bommel

Robertson and Seymour proved two fundamental theorems about tangles in graphs: the tree-of-tangles theorem, which says that every graph has a tree-decomposition such that distinguishable tangles live in different nodes of the tree, and the…

Combinatorics · Mathematics 2025-01-08 Sandra Albrechtsen

We define and prove isomorphisms between three combinatorial classes involving labeled trees. We also give an alternative proof by means of generating functions.

Combinatorics · Mathematics 2020-04-14 Ali Chouria , Vlad-Florin Drǎgoi , Jean-Gabriel Luque

We prove a theorem ensuring that the compositions of certain Ramsey families are still Ramsey. As an application, we show that in any finite coloring of $\mathbb{N}$ there is an infinite set $A$ and an as large as desired finite set $B$…

Combinatorics · Mathematics 2022-11-22 Matt Bowen

We give a proof for sharp estimate for the number of spanning trees using linear algebra and generalize this bound to multigraphs. In addition, we show that this bound is tight for complete graphs. In addition, we give estimates for number…

Combinatorics · Mathematics 2022-12-01 K. V. Chelpanov

In this paper, we prove a Morse index theorem for the index form of even order linear Hamiltonian systems on the closed interval with reasonable self-adjoint boundary conditions. The highest order term is assumed to be nondegenerate.

Differential Geometry · Mathematics 2007-05-23 Chaofeng Zhu

We introduce the notion of reflections for selfinjective algebras from the point of view of torsion theories induced by two-term tilting complexes. As an application, we determine the transformations of Brauer trees associated with…

Representation Theory · Mathematics 2015-11-06 Hiroki Abe

Leivant's ramified recurrence is one of the earliest examples of an implicit characterization of the polytime functions as a subalgebra of the primitive recursive functions. Leivant's result, however, is originally stated and proved only…

Logic in Computer Science · Computer Science 2010-05-05 Ugo Dal Lago , Simone Martini , Margherita Zorzi
‹ Prev 1 3 4 5 6 7 10 Next ›