中文
相关论文

相关论文: A Proof of the Factorization Forest Theorem

200 篇论文

For every finite unital inverse semigroup $S$ and $S$-$C^*$-algebra $A$ we establish an isomorphism between $KK^S(\mathbb{C},A)$ and $K(A \rtimes S)$. This extends the classical Green--Julg isomorphism from finite groups to finite inverse…

算子代数 · 数学 2014-05-08 Bernhard Burgstaller

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…

群论 · 数学 2007-08-13 Daniel Farley

Let $R$ be a semilocal principal ideal domain. Two algebraic objects over $R$ in which scalar extension makes sense (e.g. quadratic spaces) are said to be of the same genus if they become isomorphic after extending scalars to all…

环与代数 · 数学 2016-01-12 Eva Bayer-Fluckiger , Uriya A. First

We give a descriptive construction of trees for multi-ended graphs, which yields yet another proof of Stallings' theorem on ends of groups. Even though our proof is, in principle, not very different from already existing proofs and it draws…

群论 · 数学 2018-06-22 Anush Tserunyan

We prove a finiteness theorem for subgroups of bounded rank in hyperbolic $3$-manifold groups. As a consequence, we show that every bounded rank covering tower of closed hyperbolic $3$-manifolds is a tower of finite covers associated to a…

几何拓扑 · 数学 2024-04-03 Ian Biringer

It is shown that a group defined by forbidding all patterns of size s+1 that do not appear in a given self-similar group of tree automorphisms is the topological closure of a self-similar, countable, regular branch group, branching over its…

群论 · 数学 2010-12-10 Zoran Sunic

Let $\mathbb{N} \mathcal{A}$ be the monoid generated by $\mathcal{A} = {\mathbf{a}_1, ..., \mathbf{a}_n} \subseteq \mathbb{Z}^d.$ We introduce the homogeneous catenary degree of $\mathbb{N} \mathcal{A}$ as the smallest $N \in \mathbb N$…

Let $\Gamma^{(x_0)}$ be a finite rooted tree, for which $\Gamma$ is the underlying tree and $x_0$ the root. Let $T$ be the Terwilliger algebra of $\Gamma$ with respect to $x_0$. We study the structure of the principal $T$-module. As a…

组合数学 · 数学 2019-10-23 Shuang-Dong Li , Yi-Zheng Fan , Tatsuro Ito , Masoud Karimi , Jing Xu

We look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{\kappa \ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding…

逻辑 · 数学 2026-01-06 Saharon Shelah

In this paper we study a new variant of graph arboricity, which requires all the forests to have the same number of edges (up to a difference of 1). We prove that the new variant, which we call equitable arboricity, is equivalent to…

组合数学 · 数学 2017-05-04 Nathan Lhote , Mohammed Senhaji

In [Bl1], it is proved that a subgroup of $PL_{+}(I)$ has a finite height if and only if it is solvable. We prove the "only if" part for any subgroup of Homeo$_{+}(I)$, and present a construction which indicates a plethora of examples of…

群论 · 数学 2014-09-24 Azer Akhmedov

A variant of the Erd\H{o}s-S\'os conjecture, posed by Havet, Reed, Stein and Wood, states that every graph with minimum degree at least $\lfloor 2k/3 \rfloor$ and maximum degree at least $k$ contains a copy of every tree with $k$ edges.…

组合数学 · 数学 2025-12-19 Alexey Pokrovskiy , Leo Versteegen , Ella Williams

We construct a category $\OrdFor$ as an arboreal extension of $\Delta_{\mathrm{epi}}\subseteq\Delta$, whose morphisms are ordered forests composed by grafting. We define a full functor $\pi\colon \OrdFor\to\Delta_{\mathrm{epi}}^{op}$…

代数拓扑 · 数学 2026-04-03 Atabey Kaygun

Stein proved that for each simple plane triangulation H there exists a partitioning of the vertex of H into two subsets each of which induces a forest if and only if the dual H^{*} has a Hamilton cycle. We extend the Stein theorem for…

组合数学 · 数学 2023-09-22 Jan Florek

In this paper we study several problems concerning the number of homomorphisms of trees. We give an algorithm for the number of homomorphisms from a tree to any graph by the Transfer-matrix method. By using this algorithm and some…

组合数学 · 数学 2013-07-26 Péter Csikvári , Zhicong Lin

Let $S$ be a nonnegative semiring of the real line, called here a positive semiring. We study factorizations in both the additive monoid $(S,+)$ and the multiplicative monoid $(S\setminus\{0\}, \cdot)$. In particular, we investigate when,…

交换代数 · 数学 2021-03-25 Nicholas R. Baeth , Scott T. Chapman , Felix Gotti

The paper is devoted to a study of certain fixed point properties, and their relatives, in the context of full automorphism groups of countable rooted trees. Namely, we study Serre's property (FA'), also called unsplittability, property…

群论 · 数学 2011-10-21 Maciej Malicki

We study the properties of groups that have presentations in which the square of each generator gives the identity and all relations are of even length. We consider the parabolic subgroups of such a group and show that every element has a…

群论 · 数学 2021-07-23 Isobel Webster

Let $F(G)$ be the number of forests of a graph $G$. Similarly let $C(G)$ be the number of connected spanning subgraphs of a connected graph $G$. We bound $F(G)$ and $C(G)$ for regular graphs and for graphs with fixed average degree. Among…

组合数学 · 数学 2021-08-03 Márton Borbényi , Péter Csikvári , Haoran Luo

The algebraic extension $\boldsymbol{B}_{\mathbb{Z}}^{\mathscr{F}}$ of the extended bicyclic semigroup for an arbitrary $\omega$-closed family $\mathscr{F}$ subsets of $\omega$ is introduced. It is proven that…

群论 · 数学 2021-11-15 Oleg Gutik , Inna Pozdnyakova