Related papers: A note on a metric associated to certain finite gr…
We discuss the notion of essential dimension of a finite group and explain its relation with birational algebraic geometry. We show how this leads to a (partial) classification of simple finite groups of essential dimension less than or…
The M-relative distance, denoted by \rho_M is a generalization of the p-relative distance, which was introduced by Ren-Cang Li. We establish necessary and sufficient conditions under which \rho_M is a metric. In two special cases we derive…
This note contains additions to the paper 'Clustered cell decomposition in P-minimal structures' (arXiv:1612.02683). We discuss a question which was raised in that paper, on the order of clustered cells. We also consider a notion of cells…
This paper concerns partial groups, objective partial groups, and (finite) localities, with special attention given to the quotient of a locality by a partial normal subgroup.
In this note we describe the finite groups $G$ having $|G|-2$ cyclic subgroups. This partially solves the open problem in the end of \cite{3}.
A finite group G is exceptional if it has a quotient Q whose minimal faithful permutation degree is greater than that of G. We say that Q is a distinguished quotient. The smallest examples of exceptional p-groups have order p^5. For an odd…
In this lecture notes we try to familiarize the audience with the theory of Bernoulli polynomials; we study their properties, and we give, with proofs and references, some of the most relevant results related to them. Several applications…
In this note, we provide with a simple example to show a defect in the definition of the geometric mixing scale, and then introduce an improved scale, called as the strong geometric mixing scale. The main theorem in this note is the…
We call a group $G$ {\it algorithmically finite} if no algorithm can produce an infinite set of pairwise distinct elements of $G$. We construct examples of recursively presented infinite algorithmically finite groups and study their…
This note is devoted to proving the following result: given a compact metrizable group G, there is a compact metric space K such that G is isomorphic (as a topological group) to the isometry group of K.
The goal of this note is to generalize Isoperimetric Inequality for random groups to the class of non-planar diagrams of bounded number of faces.
The structure of groups for which certain sets of commutator subgroups are finite is investigated, with a particular focus on the relationship between these groups and those with finite derived subgroup.
Let $G$ be a finite group and $Ch_i(G)$ some quantitative sets. In this paper we study the influence of $Ch_i(G)$ to the structure of $G$. We present a survey of author and his colleagues' recent works.
We prove that bounded conciseness is a closed property in the space of marked groups. As a consequence, we reformulate a conjecture of Fern\'andez-Alcober and Shumyatsky [7] about conciseness in the class of residually finite groups.
Similarity metric which is not positive definite, and present a general theorem which provides a large family of similarity metrics which are positive definite.
To any finite ordered subset and any finite partition of a group a set of tuples of positive integers, named as configurations, is associated that describes the group's behavior. The present paper provides an exposition of this notion and…
We consider abelain subgroups of small index in finite groups. More generally, we consider subgroups such that the product of their index by the index of their centralizer is small.
This article takes the form of a tutorial on the use of a particular class of mixed finite element methods, which can be thought of as the finite element extension of the C-grid staggered finite difference method. The class is often…
We are now witnessing a rapid growth of a new part of group theory which has become known as "statistical group theory". A typical result in this area would say something like ``a random element (or a tuple of elements) of a group G has a…
The paper makes the observation that all orders of information entropy are equal in signals composed of repeating units of distinct symbols where the units can be classified as a member of a symmetry group. This leads to an improved metric…