相关论文: Rowmotion on rooted trees

This series explores a new notion of T-homotopy equivalence of flows. The new definition involves embeddings of finite bounded posets preserving the bottom and the top elements and the associated cofibrations of flows. In this third part,…

We study non-nesting actions on R-trees. We prove that some natural conditions describing how the group is generated, imply that such an action involves an isometric action on an R-tree. This can be applied to permutation groups, linear…

The generalized Ramsey number $R(H, K)$ is the smallest positive integer $n$ such that for any graph $G$ with $n$ vertices either $G$ contains $H$ as a subgraph or its complement $\overline{G}$ contains $K$ as a subgraph. Let $T_n$ be a…

A matching complex of a simple graph $G$ is a simplicial complex with faces given by the matchings of $G$. The topology of matching complexes is mysterious; there are few graphs for which the homotopy type is known. Marietti and Testa…

We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…

We study the rotational behaviour on minimal sets of torus homeomorphisms and show that the associated rotation sets can be any type of line segments as well as non-convex and even plane-separating continua. This shows that restrictions…

We analyze a class of spatial random spanning trees built on a realization of a homogeneous Poisson point process of the plane. This tree has a simple radial structure with the origin as its root. We first use stochastic geometry arguments…

We show that for any fixed dense graph G and bounded-degree tree T on the same number of vertices, a modest random perturbation of G will typically contain a copy of T . This combines the viewpoints of the well-studied problems of embedding…

Understanding and predicting thermal transport in disordered materials remains a significant challenge due to the absence of periodicity and the complex nature of medium-range structural motifs. In this work, we investigate amorphous…

An ordered hypergraph is a hypergraph $H$ with a specified linear ordering of the vertices, and the appearance of an ordered hypergraph $G$ in $H$ must respect the specified order on $V(G)$. In on-line Ramsey theory, Builder iteratively…

We extend the periodicity of birational rowmotion for rectangular posets to the case when the base field is replaced by a noncommutative ring (under appropriate conditions). This resolves a conjecture from 2014. The proof uses a novel…

A dominating set $S$ in a graph is a subset of vertices such that every vertex is either in $S$ or adjacent to a vertex in $S$. A minimal dominating set $M$ is a dominating set such that $M-v$ is not a dominating set for all $v \in M$. In…

We analyze stable homology over associative rings and obtain results over Artin algebras and commutative noetherian rings. Our study develops similarly for these classes; for simplicity we only discuss the latter here. Stable homology is a…

Rotation distance between trees measures the number of simple operations it takes to transform one tree into another. There are no known polynomial-time algorithms for computing rotation distance. In the case of ordered rooted trees, we…

A tree T is invertible if and only if T has a perfect matching. Godsil considers an invertible tree T and finds that the inverse of the adjacency matrix of T has entries in {0, 1, -1} and is the signed adjacency matrix of a graph which…

The modular decomposition of a graph $G$ is a natural construction to capture key features of $G$ in terms of a labeled tree $(T,t)$ whose vertices are labeled as "series" ($1$), "parallel" ($0$) or "prime". However, full information of $G$…

A rigidity property for the homotopy invariant stable linear framed presheaves is established. As a consequence a variant of Gabber rigidity theorem is obtained for a cohomology theory representable in the motivic stable homotopy category…

Rooted plane trees are reduced by four different operations on the fringe. The number of surviving nodes after reducing the tree repeatedly for a fixed number of times is asymptotically analyzed. The four different operations include…

This elementary note proposes candidates for interesting continuous piecewise-smooth `Riemannian' metrics on the moduli spaces of rooted geodesic trees embedded in the Poincar\'e disk. A related digression observes the existence of an…

A random walk on a regular tree (or any non-amenable graph) has positive speed. We ask whether such a walk can be slowed down by applying carefully chosen time-dependent permutations of the vertices. We prove that on trees the random walk…