English
Related papers

Related papers: Forest-skein groups III: simplicity

200 papers

We construct examples of finitely presented simple groups whose Dehn functions are at least exponential. To the best of our knowledge, these are the first such examples known. Our examples arise from R\"over-Nekrashevych groups, using…

Group Theory · Mathematics 2024-07-12 Matthew C. B. Zaremsky

Bestvina and Feighn showed that a morphism S --> T between two simplicial trees that commutes with the action of a group G can be written as a product of elementary folding operations. Here a more general morphism between simplicial trees…

Geometric Topology · Mathematics 2016-09-07 M. J. Dunwoody

Group-theoretical fusion categories are defined by data concerning finite groups and their cohomology: A finite group $G$ endowed with a three-cocycle $\omega$, and a subgroup $H\subset G$ endowed with a two-cochain whose coboundary is the…

Quantum Algebra · Mathematics 2015-09-30 Peter Schauenburg

A forest is the clique complex of a strongly chordal graph and a quasi-forest is the clique complex of a chordal graph. Kruskal--Katona type theorems for forests, quasi-forests, pure forests and pure quasi-forests will be presented. In…

Combinatorics · Mathematics 2008-12-01 Juergen Herzog , Takayuki Hibi , Satoshi Murai , Ngo Viet Trung , Xinxian Zheng

Jones introduced unitary representations of Thompson group $F$ starting from a given subfactor planar algebra, and all unoriented links arise as matrix coefficients of these representations. Moreover, all oriented links arise as matrix…

Group Theory · Mathematics 2016-09-30 Yunxiang Ren

To a tree of semi-simple algebras we associate a qurve (or formally smooth algebra) S. We introduce a Zariski- and etale quiver describing the finite dimensional representations of S. In particular, we show that all quotient varieties of…

Rings and Algebras · Mathematics 2007-05-23 Jan Adriaenssens , Lieven Le Bruyn

We study Artin kernels, i.e. kernels of discrete characters of right-angled Artin groups, and we show that they decompose as graphs of groups in a way that can be explicitly computed from the underlying graph. When the underlying graph is…

Group Theory · Mathematics 2024-05-03 Danielle Barquinero , Lorenzo Ruffoni , Kaidi Ye

We show that the classification of simple finite group schemes over an algebraically closed field reduces to the classification of abstract simple finite groups and of simple restricted Lie algebras in positive characteristic. Both these…

Algebraic Geometry · Mathematics 2015-03-13 Filippo Viviani

We say that a finite almost simple $G$ with socle $S$ is admissible (with respect to the spectrum) if $G$ and $S$ have the same sets of orders of elements. Let $L$ be a finite simple linear or unitary group of dimension at least three over…

Group Theory · Mathematics 2021-09-14 Grechkoseeva Mariya

It is well known that every finite simple group can be generated by two elements and this leads to a wide range of problems that have been the focus of intensive research in recent years. In this survey article we discuss some of the…

Group Theory · Mathematics 2017-10-31 Timothy C. Burness

We give an explicit description of the free objects in the quasivariety of adequate semigroups, as sets of labelled directed trees under a natural combinatorial multiplication. The morphisms of the free adequate semigroup onto the free…

Rings and Algebras · Mathematics 2009-05-08 Mark Kambites

A perfect forest is a spanning forest of a connected graph $G$, all of whose components are induced subgraphs of $G$ and such that all vertices have odd degree in the forest. A perfect forest generalised a perfect matching since, in a…

Combinatorics · Mathematics 2016-12-16 Yair Caro , Josef Lauri , Christina Zarb

The paper presents an algorithm for topological classification of nondegenerate saddle-focus singularities of integrable Hamiltonian systems with three degrees of freedom up to semi-local equivalence. In particular, we prove that any…

Differential Geometry · Mathematics 2023-01-26 I. K. Kozlov , A. A. Oshemkov

We study the positive theory of groups acting on trees and show that under the presence of weak small cancellation elements, the positive theory of the group is trivial, i.e. coincides with the positive theory of a non-abelian free group.…

Group Theory · Mathematics 2019-10-22 Montserrat Casals-Ruiz , Albert Garreta , Javier de la Nuez González

We present a new characterization of $k$-trees based on their reduced clique graphs and $(k+1)$-line graphs, which are block graphs. We explore structural properties of these two classes, showing that the number of clique-trees of a…

Combinatorics · Mathematics 2026-02-17 Lilian Markenzon , Allana S. S. Oliveira , Cybele T. M. Vinagre

A new 2-parameter family of central structures in trees, called central forests, is introduced. Minieka's $m$-center problem and McMorris's and Reid's central-$k$-tree can be seen as special cases of central forests in trees. A central…

Combinatorics · Mathematics 2008-09-03 Shrisha Rao , Babita Grover

We have found a list of finite simple groups with cyclic Sylow $p$-subgroup whose principal $p$-blocks have Brauer trees in the shape of a star, that is a tree of diameter at most $2$. Moreover, for an arbitrary finite group $G$ with cyclic…

Group Theory · Mathematics 2021-05-11 Andrei Kukharev

Given a complex simply connected simple algebraic group $G$ of exceptional type and a maximal parabolic subgroup $P \subset G$, we classify all triples $(G,P,H)$ such that $H \subset G$ is a maximal reductive subgroup acting spherically on…

Representation Theory · Mathematics 2011-11-17 Bruno Niemann

We study branch structures in Grigorchuk-Gupta-Sidki groups (GGS-groups) over primary trees, that is, regular rooted trees of degree $p^n$ for a prime $p$. Apart from a small set of exceptions for $p=2$, we prove that all these groups are…

Group Theory · Mathematics 2022-03-30 Elena Di Domenico , Gustavo A. Fernández-Alcober , Norberto Gavioli

The paper attempts to validate the effectiveness of tree classifiers to classify tabla strokes especially the ones which are overlapping in nature. It uses decision tree, ID3 and random forest as classifiers. A custom made data sets of 650…

Sound · Computer Science 2018-01-08 Subodh Deolekar , Siby Abraham