Related papers: Documentation for the GAP code file OrbOrd.txt

In the paper "An Abelian Loop for Non-Composites" (arXiv:110.14716), we introduced a group-like structure consisting of odd prime numbers and 1, with properties that allowed us to prove analogous results to well known theorems in Number…

Let $G$ be a finite group acting linearly on $\mathbb{R}^n$. A celebrated Theorem of Procesi and Schwarz gives an explicit description of the orbit space $\mathbb{R}^n /\!/G$ as a basic closed semi-algebraic set. We give a new proof of this…

We study the computational problem of rigorously describing the asymptotic behaviour of topological dynamical systems up to a finite but arbitrarily small pre-specified error. More precisely, we consider the limit set of a typical orbit,…

Given a reduced abelian $p$-group, we give an upper bound on the Scott complexity of the group in terms of its Ulm invariants. For limit ordinals, we show that this upper bound is tight. This gives an explicit sequence of such groups with…

Call a reduced word $w$ multiplicity-bounding if and only if a finite group on which the word map of $w$ has a fiber of positive proportion $\rho$ can only contain each nonabelian finite simple group $S$ as a composition factor with…

We implement GAP functions about groups with action on itself and investigate some basic properties of small groups with action on itself of order $<32$.

We present a new algorithm for computing upper bounds on the number of executions of each program instruction during any single program run. The upper bounds are expressed as functions of program input values. The algorithm is primarily…

Let $RG$ be the gruop ring of the group $G$ over ring $R$ and $\mathscr{U}(RG)$ be its unit group. Finding the structure of the unit group of a finite group ring is an old topic in ring theory. In, G. Tang et al: Unit Groups of Group…

For an operator generating a group on $L^p$ spaces transference results give bounds on the Phillips functional calculus also known as spectral multiplier estimates. In this paper we consider specific group generators which are abstraction…

Let $p$ be a prime and $G$ a subgroup of $GL_d(p)$. We define $G$ to be $p$-exceptional if it has order divisible by $p$, but all its orbits on vectors have size coprime to $p$. We obtain a classification of $p$-exceptional linear groups.…

We settle some open problems in the special case of groups in o-minimal structures, such as the equality of G^00 and G^000 and the equivalence of definable amenability and existence of a type with bounded orbit. We prove almost exactness of…

Given a finite group $G$, the {\it genus spetrum} ${\rm sp}(G)$ of $G$ is the set of integers $g\geq 0$ such that $G$ can act faithfully on an orientable closed surface of genus $g$ by orientation-preserving homeomorphisms. The…

We develop an approach to finding upper bounds for the number of arithmetic operations necessary for doing harmonic analysis on permutation modules of finite groups. The approach takes advantage of the intrinsic orbital structure of…

We develop an algorithm for computing the closure of a given nilpotent $G_0$-orbit in $\g_1$, where $\g_1$ and $G_0$ are coming from a $\Z$ or a $\Z/m\Z$-grading $\g= \bigoplus \g_i$ of a simple complex Lie algebra $\g$.

The groups whose orders factorise into at most four primes have been described (up to isomorphism) in various papers. Given such an order n, this paper exhibits a new explicit and compact determination of the isomorphism types of the groups…

This document is an informal bibliography of the papers dealing with distributed approximation algorithms. A classic setting for such algorithms is bounded degree graphs, but there is a whole set of techniques that have been developed for…

The Seiberg-Witten map links noncommutative gauge theories to ordinary gauge theories, and allows to express the noncommutative variables in terms of the commutative ones. Its explicit form can be found order by order in the noncommutative…

We derive a spectral interpretation of the pivot operation on a graph and generalise this operation to hypergraphs. We establish lower bounds on the number of flat spectra of a Boolean function, depending on internal structures, with…

Online Analytical Processing (OLAP) comprises tools and algorithms that allow querying multidimensional databases. It is based on the multidimensional model, where data can be seen as a cube, where each cell contains one or more measures…

In this article, we study the behaviour of discrete one-dimensional dynamical systems associated to functions on finite sets. We formalise the global orbit pattern formed by all the periodic orbits (gop) as the ordered set of periods when…