Related papers: Closest multiplication tables of groups

Let $G$ be a non-abelian $p$-group of order $p^n$ and $M(G)$ be its Schur multiplier. It is well known result by Green that $|M(G)| \leq p^{\frac{1}{2}n(n-1)}$. So $|M(G)|= p^{\frac{1}{2}n(n-1)-t(G)}$ for some $t(G) \geq 0$. The groups has…

We define and study a family of partitions of the wonderful compactification \bar{G} of a semi-simple algebraic group G of adjoint type. The partitions are obtained from subgroups of G \times G associated to triples (A_1, A_2, a), where A_1…

A generalization of recent group-theoretic matrix multiplication algorithms to an analogue of the theory of partial matrix multiplication is presented. We demonstrate that the added flexibility of this approach can in some cases improve…

We say that a loop is unbreakable when it does not have nontrivial subloops. While the cyclic groups of prime order are the only unbreakable finite groups, we show that nonassociative unbreakable loops exist for every order n >= 5. We…

We define a notion of roundness for finite groups. Roughly speaking, a group is round if one can order its elements in a cycle in such a way that some natural summation operators map this cycle into new cycles containing all the elements of…

A set of vertices $S$ \emph{resolves} a connected graph $G$ if every vertex is uniquely determined by its vector of distances to the vertices in $S$. The \emph{metric dimension} of $G$ is the minimum cardinality of a resolving set of $G$.…

Let $G$ be a group and let $A\subseteq G$ be non-empty. We call $A$ an asymptotic $(r,l)$-approximate group if, for a fixed dilation factor $r$, the larger product sets $A^{hr}$ can, for all sufficiently large $h$, be covered by a bounded…

Consider a metric space $(P,dist)$ with $N$ points whose doubling dimension is a constant. We present a simple, randomized, and recursive algorithm that computes, in $O(N \log N)$ expected time, the closest-pair distance in $P$. To generate…

In this paper we prove that any finite group of order $n$ can be viewed as the group of the solutions of a certain matrix equation $XB=BY$, where the unknowns $X,Y$ are two permutation matrices of order $n$ and $(1+k)n+2 $ respectively and…

We consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G and H are isomorphic. The n^(log n) barrier for group isomorphism has withstood all attacks --- even for the…

For a countable ultrahomogeneous graph G let P(G) denote the collection of domains of subgraphs of G isomorphic to G. The order types of maximal chains in the set P(G) U {\o} ordered by the inclusion are characterized as: (I) the order…

The goal of clustering is to group similar objects into meaningful partitions. This process is well understood when an explicit similarity measure between the objects is given. However, far less is known when this information is not readily…

Let $G$ be any group and $A$ be an arbitrary subset of $G$ (not necessarily symmetric and not necessarily containing the identity). The $h$-fold product set of $A$ is defined as $$A^{h} :=\lbrace a_{1}.a_{2}...a_{h} : a_{1},\ldots,a_n \in A…

Maximal chord diagrams up to all isomorphisms are enumerated. The enumerating formula is based on a bijection between rooted one-vertex one-face maps on locally orientable surfaces and a certain class of symmetric chord diagrams. This…

Let $G$ be a finite group and $N$ a normal subgroup of $G$. We determine the structure of $N$ when the diameter of the graph associated to the $G$-conjugacy classes contained in $N$ is as large as possible, that is, is equal to three.

Let $G$ be a group and $L(G)$ be the set of all subgroups of $G$. We introduce a bipartite graph $\mathcal{B}(G)$ on $G$ whose vertex set is the union of two sets $G \times G$ and $L(G)$, and two vertices $(a, b) \in G \times G$ and $H \in…

Lattice rounding in Euclidean space can be viewed as finding the nearest point in the orbit of an action by a discrete group, relative to the norm inherited from the ambient space. Using this point of view, we initiate the study of…

Approximate algebraic structures play a defining role in arithmetic combinatorics and have found remarkable applications to basic questions in number theory and pseudorandomness. Here we study approximate representations of finite groups:…

For a given abelian group G, we classify the isomorphism classes of G-gradings on the simple Lie algebras of types A_n (n >= 1), B_n (n >= 2), C_n (n >= 3) and D_n (n > 4), in terms of numerical and group-theoretical invariants. The ground…

We consider the {\em clustering with diversity} problem: given a set of colored points in a metric space, partition them into clusters such that each cluster has at least $\ell$ points, all of which have distinct colors. We give a…