Related papers: $\lambda$-fold near-factorizations of groups

The study of near-factorizations of finite groups dates back to the 1950s. Recently, this topic has attracted renewed attention, and the concept has been extended to $\lambda$-fold near-factorizations, in which each non-identity group…

We investigate near-factorizations of nonabelian groups, concentrating on dihedral groups. We show that some known constructions of near-factorizations in dihedral groups yield equivalent near-factorizations. In fact, there are very few…

We show that a "mate'' $B$ of a set $A$ in a near-factorization $(A,B)$ of a finite group $G$ is unique. Further, we describe how to compute the mate $B$ very efficiently using an explicit formula for $B$. We use this approach to give an…

This is the first one in a series of papers classifying the factorizations of almost simple groups with nonsolvable factors. In this paper we deal with almost simple linear groups.

We give an explicit characterization of solvable factors in factorizations of finite classical groups of Lie type. This completes the classification of solvable factors in factorizations of almost simple groups, finishing the program…

Let $G$ be a finite almost simple group with socle $G_0$. A (nontrivial) factorization of $G$ is an expression of the form $G=HK$, where the factors $H$ and $K$ are core-free subgroups. There is an extensive literature on factorizations of…

We propose new structures called almost o-minimal structures and $\mathfrak X$-structures. The former is a first-order expansion of a dense linear order without endpoints such that the intersection of a definable set with a bounded open…

This is the second one in a series of papers classifying the factorizations of almost simple groups with nonsolvable factors. In this paper we deal with almost simple unitary groups.

We establish correspondances between factorisations of finite abelian groups (direct factors, unitary factors, non isomorphic subgroup classes) and factorisations of integer matrices. We then study counting functions associated to these…

Many first-order equational theories, such as the theory of groups or boolean algebras, can be presented by a smaller set of axioms than the original one. Recent studies showed that a homological approach to equational theories gives us…

We classify the factorizations of finite classical groups with nonsolvable factors, completing the classification of factorizations of finite almost simple groups.

We refine the construction of quasi-homomorphisms on mapping class groups. It is useful to know that there are unbounded quasi-homomorphisms which are bounded when restricted to particular subgroups since then one deduces that the mapping…

A function $\mathbb{N} \to \mathbb{N}$ is near exponential if it is bounded above and below by functions of the form $2^{n^c}$ for some $c > 0$. In this article we develop tools to recognize the near exponential residual finiteness growth…

This paper classifies the factorizations of almost simple groups with a factor having at least two nonsolvable composition factors. This together with a previous classification result of the authors reduces the factorization problem of…

In these notes we will survey recent results on various finitary approximation properties of infinite groups. We will discuss various restrictions on groups that are approximated for example by finite solvable groups or finite-dimensional…

We study a summability method called almost convergence for bounded measurable functions defined on a locally compact abelian group. We define almost convergence using topologically invariant means and exhibit two different kinds of…

This work provides an effective algorithm for distinguishing finite quotients between two non-isomorphic finitely generated Fuchsian groups $\Gamma$ and $\Lambda$. It will suffice to take a finite quotient which is abelian, dihedral, a…

Recently, sub-indices and sub-factors of groups with connections to number theory, additive combinatorics, and factorization of groups have been introduced and studied. Since all group subsets are considered in the theory and there are many…

We investigate two notions about descriptions of groups using first-order language: quasi-finite axiomatizability, concerning infinite groups, and polylogarithmic compressibility, concerning classes of finite groups.

We consider the problem of classifying gradings by groups on a finite-dimensional algebra $A$ (with any number of multilinear operations) over an algebraically closed field. We introduce a class of gradings, which we call almost fine, such…