Related papers: Hierarchical Complexity of Finite Groups

Nature, technology and society are full of complexity arising from the intricate web of the interactions among the units of the related systems (e.g., proteins, computers, people). Consequently, one of the most successful recent approaches…

A B-group is a group such that all its minimal generating sets (with respect to inclusion) have the same size. We prove that the class of finite B-groups is closed under taking quotients and that every finite B-group is solvable. Via a…

In this paper, we introduce a new function related to the sum of element orders of finite groups. It is used to give some criteria for a finite group to be cyclic, abelian, nilpotent, supersolvable and solvable, respectively.

This work concerns finite free complexes over commutative noetherian rings, in particular over group algebras of elementary abelian groups. The main contribution is the construction of complexes such that the total rank of their underlying…

Groups definable in simple theories retain the chain conditions and decomposition properties known from stable groups, up to commensurability. In the small case, if a generic type of G is not foreign to some type q, there is a q-internal…

We propose a nearest neighbor based clustering algorithm that results in a naturally defined hierarchy of clusters. In contrast to the agglomerative and divisive hierarchical clustering algorithms, our approach is not dependent on the…

We present a family of high-order finite element approximation spaces on a pyramid, and associated unisolvent degrees of freedom. These spaces consist of rational basis functions. We establish conforming, exactness and polynomial…

This paper develops a complete foundational treatment of simplicial complexes from Euclidean spaces through geometric realizations, emphasizing concrete computations, examples, and practical verification methods. Beginning with finite point…

We study a characteristic subgroup of finitely generated groups, consisting of elements with uniform upper bound for word-lengths. For a group $G$, we denote this subgroup by $G_{bound}$. We give sufficient criteria for triviality and…

A group $G$ is called residually finite if for every non-trivial element $g \in G$, there exists a finite quotient $Q$ of $G$ such that the element $g$ is non-trivial in the quotient as well. Instead of just investigating whether a group…

We investigate the possible structures imposed on a finite group by its possession of an automorphism sending a large fraction of the group elements to their cubes, the philosophy being that this should force the group to be, in some sense,…

We give a criterion for bounding the homological finiteness length of certain HF-groups. This is used in two distinct contexts. Firstly, the homological finiteness length of a non-uniform lattice on a locally finite n-dimensional…

We give a new proof of the fact that finite bipartite graphs cannot be axiomatized by finitely many first-order sentences among FINITE graphs. (This fact is a consequence of a general theorem proved by L. Ham and M. Jackson, and the…

We produce a class of $\omega$-categorical structures with finite signature by applying a model-theoretic construction -- a refinement of the Hrushosvki-encoding -- to $\omega$-categorical structures in a possibly infinite signature. We…

For a finite group $G$, let $\text{rdim}(G)$ denote the smallest dimension of a faithful, complex linear representation of $G$. It is clear that $\text{rdim}(H)\leq \text{rdim}(G)$ for any subgroup $H$ of $G$. We consider $G$ with the…

Necessary and sufficient conditions for finite semihypergroups to be built from groups of the same order are established

We investigate the possible origin of hierarchical structures in complex systems describable in terms of a finite and small number of parameters which control the behavioral pattern at each level of organization. We argue that the…

We propose an interpretation for the meets and joins in the lattice of experimental propositions of a physical theory, answering a question of Birkhoff and von Neumann in [1]. When the lattice is atomistic, it is isomorphic to the lattice…

We derive a lower and an upper bound for the rank of the finite part of operator $K$-theory groups of maximal and reduced $C^*$-algebras of finitely generated groups. The lower bound is based on the amount of polynomially growing conjugacy…

By finite quantum groups we mean Lusztig's finite-dimensional pointed Hopf algebras called quantum Frobenius Kernels [9, 10], and their natural generalizations due to Andruskiewitsch and Schneider [2, 3]. For a Hopf algebra $H$ in a special…