English
Related papers

Related papers: Substreetutions and more on trees

200 papers

We construct combinatorial Hubbard trees for all unicritical polynomials, and for all exponential maps, for which the critical (singular) value does not escape. More precisely, out of an external angle, or more generally a kneading…

Dynamical Systems · Mathematics 2024-01-22 Malte Hassler , Dierk Schleicher

We discuss a notion of shuffle for trees which extends the usual notion of a shuffle for two natural numbers. We give several equivalent descriptions, and prove some algebraic and combinatorial properties. In addition, we characterize…

Combinatorics · Mathematics 2017-05-11 Eric Hoffbeck , Ieke Moerdijk

Topological quantum matter exhibits a range of exotic phenomena when enriched by subdimensional symmetries. This includes new features beyond those that appear in the conventional setting of global symmetry enrichment. A recently discovered…

Strongly Correlated Electrons · Physics 2025-05-07 Po-Shen Hsin , David T. Stephen , Arpit Dua , Dominic J. Williamson

We study questions inspired by Erd\H os' celebrated distance problems with dot products in lieu of distances, and for more than a single pair of points. In particular, we study point configurations present in large finite point sets in the…

Combinatorics · Mathematics 2024-09-17 Aaron Autry , Slade Gunter , Christopher Housholder , Steven Senger

We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…

Combinatorics · Mathematics 2026-04-22 Victoria Ironmonger , Nik Ruškuc

Let $\T_{n}$ be the set of rooted labeled trees on $\set{0,...,n}$. A maximal decreasing subtree of a rooted labeled tree is defined by the maximal subtree from the root with all edges being decreasing. In this paper, we study a new…

Combinatorics · Mathematics 2022-03-22 Seunghyun Seo , Heesung Shin

Submodularity is a fundamental phenomenon in combinatorial optimization. Submodular functions occur in a variety of combinatorial settings such as coverage problems, cut problems, welfare maximization, and many more. Therefore, a lot of…

Data Structures and Algorithms · Computer Science 2011-11-08 Shaddin Dughmi

We give an alternative proof of the Bestvina--Feighn combination theorem for trees hyperbolic spaces and describe uniform quasigeodesics in such spaces. As one of the applications, we prove the existence of Cannon-Thurston maps for…

Group Theory · Mathematics 2022-02-22 Michael Kapovich , Pranab Sardar

Let $f$ be an $R$-closed homeomorphism on a connected orientable closed surface $M$. In this paper, we show that If $M$ has genus more than one, then each minimal set is either a periodic orbit or an extension of a Cantor set. If $M =…

Dynamical Systems · Mathematics 2017-07-19 Tomoo Yokoyama

A permutation graph is a graph whose edges are given by inversions of a permutation. We study the Abelian sandpile model (ASM) on such graphs. We exhibit a bijection between recurrent configurations of the ASM on permutation graphs and the…

Combinatorics · Mathematics 2018-10-08 Mark Dukes , Thomas Selig , Jason P. Smith , Einar Steingrimsson

We explore some issues in slow roll inflation in situations where field excursions are small compared to $M_p$. We argue that for small field inflation, minimizing fine tuning requires low energy supersymmetry and a tightly constrained…

High Energy Physics - Phenomenology · Physics 2015-05-30 Michael Dine , Lawrence Pack

We study the topology and dynamics of subshifts and tiling spaces associated to non-primitive substitutions in one dimension. We identify a property of a substitution, which we call tameness, in the presence of which most of the possible…

Dynamical Systems · Mathematics 2017-07-18 Gregory R. Maloney , Dan Rust

We study a tree coloring model introduced by Guidon (2018), initially based on an analogy with a remote control system of a rail yard, seen as switches on a binary tree. For a given binary tree, we formalize the constraints on the coloring,…

Discrete Mathematics · Computer Science 2024-05-28 Olivier Golinelli

We define and study a model of winding for non-colliding particles in finite trees. We prove that the asymptotic behavior of this statistic satisfies a central limiting theorem, analogous to similar results on winding of bounded particles…

Combinatorics · Mathematics 2020-04-03 David A. Levin , Eric Ramos , Benjamin Young

This paper is the first of a sequence of three papers, where the concept of an $\mathbb R$-tree dual to a measured geodesic lamination in a hyperbolic surface is generalized to arbitrary $\mathbb R$-trees provided with a (very small) action…

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

A partial order is called semilinear iff the upper bounds of each element are linearly ordered and any two elements have a common upper bound. There exists, up to isomorphism, a unique countable existentially closed semilinear order, which…

Let $T$ be a rooted tree, and $V(T)$ its set of vertices. A subset $X$ of $V(T)$ is called an infima closed set of $T$ if for any two vertices $u,v\in X$, the first common ancestor of $u$ and $v$ is also in $X$. This paper determines the…

Combinatorics · Mathematics 2021-12-16 Eric Ould Dadah Andriantiana , Stephan Wagner

In dimension $D\leq 2$ the low temperature behavior of systems enjoying a continuous symmetry is dominated by super-instantons: classical configurations of arbitrarily low energy. Perturbation theory in the background of a super-instanton…

High Energy Physics - Lattice · Physics 2009-10-22 A. Patrascioiu , E. Seiler

We show that the strategy of point counting in o-minimal structures can be applied to various problems on unlikely intersections that go beyond the conjectures of Manin-Mumford and Andr\'e-Oort. We verify the so-called Zilber-Pink…

Number Theory · Mathematics 2014-09-03 Philipp Habegger , Jonathan Pila

Relative notions of combinatorial asphericity have been used to prove that injective labeled oriented trees (which encode spines of ribbon 2-knots) are aspherical. This article presents an overview and comparison of the different notions of…

Geometric Topology · Mathematics 2021-01-19 Stephan Rosebrock , Jens Harlander
‹ Prev 1 8 9 10 Next ›