Related papers: Finding cycle types in permutation groups with few…
We consider the class of finitely generated groups which have a normal form computable in logspace. We prove that the class of such groups is closed under finite extensions, finite index subgroups, direct products, wreath products, and also…
This note uses some recent calculations of Conder and Bujalance (on classifying finite index group extensions of Fuchsian groups with abelian quotient and torsion free kernel) in order to determine the full automorphism groups of some cylic…
Let $G$ be a finite group acting on $\mathbb{C}^N$. We study the problem of identifyng the class in $\mathbb{C}^N / G$ of a given signal: this encompasses several types of problems in signal processing. Some instances include certain…
We consider 9 infinite families of finite $p$-groups, for $p$ a prime, and we settle the isomorphism problem that arises when the parameters that define these groups are modified.
N=2 supersymmetric field theories in two dimensions have been extensively studied in the last few years. Many of their properties can be determined along the whole renormalization group flow, like their coupling dependence and soliton…
A universal cycle (u-cycle) for permutations of length $n$ is a cyclic word, any size $n$ window of which is order-isomorphic to exactly one permutation of length $n$, and all permutations of length $n$ are covered. It is known that…
A quasi-semiregular element in a permutation group is an element that has a unique fixed point and acts semiregularly on the remaining points. Such elements were first studied in the context of automorphisms of graphs and occur naturally in…
An element of a Coxeter group $W$ is called fully commutative if any two of its reduced decompositions can be related by a series of transpositions of adjacent commuting generators. In the preprint "Fully commutative elements in finite and…
A group is small if it has countably many complete $n$-types over the empty set for each natural number n. More generally, a group $G$ is weakly small if it has countably many complete 1-types over every finite subset of G. We show here…
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}.
We give a comprehensive description of the sets $A$ in finite cyclic groups such that $|2A|<\frac94|A|$; namely, we show that any set with this property is densely contained in a (one-dimensional) coset progression. This improves earlier…
We find the number of compositions over finite abelian groups under two types of restrictions: (i) each part belongs to a given subset and (ii) small runs of consecutive parts must have given properties. Waring's problem over finite fields…
It is shown that the knapsack problem, which was introduced by Myasnikov et al. for arbitrary finitely generated groups, can be solved in NP for graph groups. This result even holds if the group elements are represented in a compressed form…
It is a well-known fact that hamiltonicity in planar cubic graphs is an NP-complete problem. This implies that the existence of an A-trail in plane eulerian graphs is also an NP-complete problem even if restricted to planar 3-connected…
We investigate the computational complexity for determining various properties of a finite transformation semigroup given by generators. We introduce a simple framework to describe transformation semigroup properties that are decidable in…
In this paper we apply the previously derived formalism of permutation orbifold conformal field theories to N=2 supersymmetric minimal models. By interchanging extensions and permutations of the factors we find a very interesting structure…
We study groups generated by sets of pattern avoiding permutations. In the first part of the paper we prove some general results concerning the structure of such groups. In the second part we carry out a case-by-case analysis of groups…
We determine the structure of automorphism group or each nonsplit metacyclic 2-group. This completes the work on automorphism groups of metacyclic $p$-groups.
Two groups are said to have the same nilpotent genus if they have the same nilpotent quotients. We answer four questions of Baumslag concerning nilpotent completions. (i) There exists a pair of finitely generated, residually…
The problem of N-digit sets all permutations of which give primes is discussed. Such sets may include only digits 1, 3, 7 and 9, and none of 0, 2, 5, 4, 6, 8. Direct calculations show that such full-permutation digit sets occur at N = 1, 2,…