Related papers: Chemical Examples in Hypergroups
We examine the relationship between finitely and infinitely generated relatively hyperbolic groups, in two different contexts. First, we elaborate on a remark from math.GR/0601311, which states that the version of Dehn filling in relatively…
We describe general methods for enumerating subsemigroups of finite semigroups and techniques to improve the algorithmic efficiency of the calculations. As a particular application we use our algorithms to enumerate all transformation…
There has been a great deal of attention recently to graphs whose vertex set is a group, defined using the group structure. (The commuting graph, where two elements are joined if they commute, is the oldest and most famous example.) The…
Complex hyperbolic triangle groups were first considered by Mostow in building the first nonarithmetic lattices in PU(2, 1). They are a natural generalization of the classical triangle groups acting on the hyperbolic plane. A well-known…
We study groups generated by sets of pattern avoiding permutations. In the first part of the paper we prove some general results concerning the structure of such groups. In the second part we carry out a case-by-case analysis of groups…
Let $\mathcal G$ denote the space of finitely generated marked groups. For any finitely generated group $G$, we construct a continuous, injective map $f$ from the space of subgroups $Sub(G)$ to $\mathcal G$ that sends conjugate subgroups to…
This is a translation. I have added translations for (possibly) outdated definitions in an appendix at the end. In this paper, we define distributive groups and show some properties of them. We then concern ourselves with the homogeinity of…
Many real-world complex systems are characterized by interactions in groups that change in time. Current temporal network approaches, however, are unable to describe group dynamics, as they are based on pairwise interactions only. Here, we…
Contramodules are module-like algebraic structures endowed with infinite summation (or, occasionally, integration) operations satisfying natural axioms. Introduced originally by Eilenberg and Moore in 1965 in the case of coalgebras over…
In this paper we will relate hyperstructures and the general $\mathscr{H}$-principle to known mathematical structures, and also discuss how they may give rise to new mathematical structures. The main purpose is to point out new ideas and…
Graphs and hypergraphs provide powerful abstractions for modeling interactions among a set of entities of interest and have been attracting a growing interest in the literature thanks to many successful applications in several fields. In…
Group theory is a particularly fertile field for the design of practical algorithms. Algorithms have been developed across the various branches of the subject and they find wide application. Because of its relative maturity, computational…
This article is a survey of algebra in the $\infty$-categorical context, as developed by Lurie in "Higher Algebra", and is a chapter in the "Handbook of Homotopy Theory". We begin by introducing symmetric monoidal stable…
Let $G$ be a group hyperbolic relative to a collection of subgroups $\{H_\lambda ,\lambda \in \Lambda \} $. We say that a subgroup $Q\le G$ is hyperbolically embedded into $G$, if $G$ is hyperbolic relative to $\{H_\lambda ,\lambda \in…
I review four decades of numerical simulations of galaxy clusters focussing on the attempts to resolve their internal structure. Overmerging describes the numerical or physical disruption of dark matter halos within dense environments. This…
A characterization of the maximal abelian sub-algebras of matrix algebras that are normalized by the canonical representation of a finite Heisenberg group is given. Examples are constructed using a classification result for finite…
We describe various path homology theories constructed for a directed hypergraph. We introduce the category of directed hypergraphs and the notion of a homotopy in this category. Also, we investigate the functoriality and the homotopy…
Hypergraphs, a generalization of graphs, naturally represent groupwise relationships among multiple individuals or objects, which are common in many application areas, including web, bioinformatics, and social networks. The flexibility in…
We formulate and prove relative versions of several classical decompositions known in the theory of Chevalley groups over commutative rings. As an application we obtain upper estimates for the width of principal congruence subgroups in…
Going back to Kreisel in the Sixties, hyperarithmetical analysis is a cluster of logical systems just beyond arithmetical comprehension. Only recently natural examples of theorems from the mathematical mainstream were identified that fit…