let $g$ be a group and $x in g$‎. ‎the cyclicizer of $x$ is defined to be the subset $cyc(x)=lbrace y in g mid langle x‎, ‎yrangle ; {rm is ; cyclic} rbrace$‎. ‎$g$ is said to be a tidy group if $cyc(x)$ is a subgroup for all $x in g$‎. ‎we call $g$ to be a c-tidy group if $cyc(x)$ is a cyclic subgroup for all $x in g setminus k(g)$‎, ‎where $k(g)$ is the intersection of all the cyclicizers in ...

a group $g$ is said to be a c-tidy group if for every element $x in g setminus k(g)$‎, ‎the set $cyc(x)=lbrace y in g mid langle x‎, ‎y rangle ; {rm is ; cyclic} rbrace$ is a cyclic subgroup of $g$‎, ‎where $k(g)=underset{x in g}bigcap cyc(x)$‎. ‎in this short note we determine the structure of finite c-tidy groups‎.

We consider closed, Weyl-transitive groups of automorphisms of thick buildings. For each element of such a group, we derive a combinatorial formula for its scale and establish the existence of a tidy subgroup for it that equals the stabilizer of a simplex. Simplices whose stabilizers are tidy for some element of the group are characterized in terms of the minimal set of the isometry induced by ...

We introduce the tidy set, a minimal simplicial set that captures the topology of a simplicial complex. The tidy set is particularly effective for computing the homology of clique complexes. This family of complexes include the Vietoris-Rips complex and the weak witness complex, methods that are popular in topological data analysis. The key feature of our approach is that it skips constructing ...