Related papers: Smallest posets with given cyclic automorphism gro…
We extend the concepts of antimorphism and antiautomorphism of the additive group of integers modulo $n$, given by Gaitanas Konstantinos, to abelian groups. We give a lower bound for the number of antiautomorphisms of cyclic groups of odd…
Let $G$ be a finite cyclic group. Every sequence $S$ over $G$ can be written in the form $S=(n_1g)\cdot...\cdot(n_kg)$ where $g\in G$ and $n_1,\cdots,n_k\in[1,{\hbox{\rm ord}}(g)]$, and the index $\ind S$ of $S$ is defined to be the minimum…
In this paper we introduce and study the poset of equivalence classes of subgroups of a finite group $G$, induced by the isomorphism relation. This contains the well-known lattice of solitary subgroups of $G$. We prove that in several…
Given an initial family of sets, we may take unions, intersections and complements of the sets contained in this family in order to form a new collection of sets; our construction process is done recursively until we obtain the last family.…
A cyclic $n$-gonal surface is a compact Riemann surface $X$ of genus $g\geq 2$ admitting a cyclic group of conformal automorphisms $C$ of order $n$ such that the quotient space $X/C$ has genus 0. In this paper, we provide an overview of…
We propose a simple algorithm generating labelled posets of given size according to the almost uniform distribution. By "almost uniform" we understand that the distribution of generated posets converges in total variation to the uniform…
The expected number of pairwise comparisons needed to learn a partial order on n elements is shown to be at least n*n/4-o(n*n), and an algorithm is given that needs only n*n/4+o(n*n) comparisons on average. In addition, the optimal strategy…
The description of the automorphism group of group $<a, b; [a^m,b^n]=1>$ ($m,n>1$) in terms of generators and defining relations is given. This result is applied to prove that any normal automorphism of every such group is inner.
We construct automorphisms of $\C^n$ which map certain discrete sequences one onto another with prescribed finite jet at each point, thus solving a general Mittag-Leffler interpolation problem for automorphisms. Under certain circumstances,…
For any pair of three-dimensional real unit vectors $\hat{m}$ and $\hat{n}$ with $|\hat{m}^{\rm T} \hat{n}| < 1$ and any rotation $U$, let $N_{\hat{m},\hat{n}}(U)$ denote the least value of a positive integer $k$ such that $U$ can be…
By using the structure and some properties of extraspecial and generalized/almost extraspecial $p$-groups, we explicitly determine the number of elements of specific orders in such groups. As a consequence, one may find the number of cyclic…
In this short note, we describe the finite groups $G$ having $|G|-1$ cyclic subgroups. This leads to a nice characterization of the symmetric group $S_3$.
We provide lower estimates on the minimal number of generators of the profinite completion of free products of finite groups. In particular, we show that if C_1,...,C_n are finite cyclic groups then there exists a finite group G which is…
We prove a conjecture of Dukes and Herke concerning the possible orders of a basis for the cyclic group Z_n, namely : For each k \in N there exists a constant c_k > 0 such that, for all n \in N, if A \subseteq Z_n is a basis of order…
Denote by $G$ a finite group and by $\psi(G)$ the sum of element orders in $G$. If $t$ is a positive integer, denote by $C_t$ the cyclic group of order $t$ and write $\psi(t)=\psi(C_t)$. In this paper we proved the following Theorem A: Let…
In this paper we analyze possible actions of an automorphism of order six on a $2$-$(70, 24, 8)$ design, and give a complete classification for the action of the cyclic automorphism group of order six $G= \langle \rho \rangle \cong Z_6…
We study the automorphism group of an infinite minimal shift $(X,\sigma)$ such that the complexity difference function, $p(n+1)-p(n)$, is bounded. We give some new bounds on $\mbox{Aut}(X,\sigma)/\langle \sigma \rangle$ and also study the…
A loop is (right) automorphic if all its (right) inner mappings are automorphisms. Using the classification of primitive groups of small degrees, we show that there is no nonassociative simple commutative automorphic loop of order less than…
The number of essentially different square polyominoes of order n and minimum perimeter p(n) is enumerated.
We classify minimal sets of (closed and oriented) hyperbolic surface homeomorphisms by studying the connected components of their complement. This extends the classification given by F. Kwakkel, T.J\"ager and A. Passeggi in the torus. The…