相关论文: On partial groups of small order

In this paper, we study partial actions of groups on $R$-algebras, where $R$ is a commutative ring. We describe the partial actions of groups on the indecomposable algebras with enveloping actions. Then we work on algebras that can be…

We construct the first examples of an algorithmically complex finitely presented residually finite groups and first examples of finitely presented residually finite groups with arbitrarily large (recursive) Dehn function and depth function.…

We study the problem of estimating the number of defective items in adaptive Group testing by using a minimum number of queries. We improve the existing algorithm and prove a lower bound that show that, for constant estimation, the number…

In this paper we consider the enumeration of ordered set partitions avoiding a permutation pattern of length 2 or 3. We provide an exact enumeration for avoiding the permutation 12. We also give exact enumeration for ordered partitions with…

We obtain a combinatorial proof of a surprising weighted partition equality of Berkovich and Uncu. Our proof naturally leads to a formula for the number of partitions with a given parity of the smallest part, in terms of S(i), the number of…

We consider decompositions of the real line into pairwise disjoint Borel pieces so that each piece is closed under addition. How many pieces can there be? We prove among others that the number of pieces is either at most 3 or uncountable,…

For an element $g$ in a group $X$, we say that $g$ has 2-part order $2^{a}$ if $2^{a}$ is the largest power of 2 dividing the order of $g$. We prove lower bounds on the proportion of elements in finite classical groups in odd characteristic…

The commutativity degree of a finite group is the probability that two randomly chosen group elements commute. The main object of this paper is to obtain a characterization for all finite groups of odd order with commutativity degree…

The number of nonisomorphic simplicial complexes with up to $n$ vertices increases super-exponentially with $n$, which makes exhaustive computation of invariants associated with such complexes a daunting task. In this paper we provide a…

The asymptotic form of the number of n-quasigroups of order 4 is $3^{n+1} 2^{2^n +1} (1+o(1))$. Keywords: n-quasigroups, MDS codes, decomposability, reducibility.

MacMahon showed that the generating function for partitions into at most $k$ parts can be decomposed into a partial fractions-type sum indexed by the partitions of $k$. In this present work, a generalization of MacMahon's result is given,…

In this article, we introduce the notion of almost consecutive partitions. A partition is almost consecutive if every term is consecutive, with the possible exception of the smallest one. We find formulas relating to the smallest parts of…

This paper provides a bridge between two active areas of research, the spectrum (set of element orders) and the power graph of a finite group. The order sequence of a finite group $G$ is the list of orders of elements of the group, arranged…

Recently, Andrews introduced separable integer partition classes and studied some well-known theorems. In this atricle, we will investigate six types of partitions from the view of the point of separable integer partition classes.

We prove a general divisibility theorem that implies, e.g., that, in any group, the number of generating pairs (as well as triples, etc.) is a multiple of the order of the commutator subgroup. Another corollary says that, in any associative…

We consider indecomposable representations of the Klein four group over a field of characteristic $2$ and of a cyclic group of order $pm$ with $p,m$ coprime over a field of characteristic $p$. For each representation we explicitly describe…

Suppose $C(G)$ denotes the set of all cyclic subgroups of a finite group $G$, and $\mathcal{O}_{2}(G)$ denotes the number of elements of order $2$ in $G$. In [Marius T., Finite groups with a certain number of cyclic subgroups. The American…

Over each nontrivial finite group $G$, there exists a finite system of equations having no solutions in larger finite groups but having a solution in a periodic group containing $G$. We prove several similar facts about amenable, orderable,…

We study systematically groups whose marked finite quotients form a recursive set. We give several definitions, and prove basic properties of this class of groups, and in particular emphasize the link between the growth of the depth…

In this report we summarize this work, all finite simple groups $G$ can determined uniformly using their orders $|G|$ and the set $\pi_e(G)$ of their element orders.