Related papers: Construction of groups with triality and their cor…

We describe an algorithm for deciding whether or not a given finitely generated torsion-free nilpotent group is decomposable as the direct product of nontrivial subgroups.

If G is a group with a presentation of the form < x,y|x^3=y^5=W(x,y)^2=1 >, then either G is virtually soluble or G contains a free subgroup of rank 2. This provides additional evidence in favour of a conjecture of Rosenberger.

Our main result is that many triangles of Baumslag-Solitar groups collapse to finite groups, generalizing a famous example of Hirsch. A triangle of Baumslag-Solitar groups means a group with three generators, cyclically ordered, with each…

The web of dual gauge theories engineered from a class of toric Calabi-Yau threefolds is explored. In previous work, we have argued for a triality structure by compiling evidence for the fact that every such manifold $X_{N,M}$ (for given…

We give a polynomial gluing construction of two groups $G_X\subseteq GL(\ell,\mathbb F)$ and $G_Y\subseteq GL(m,\mathbb F)$ which results in a group $G\subseteq GL(\ell+m,\mathbb F)$ whose ring of invariants is isomorphic to the tensor…

We investigate the problem of defining group or loop structures on spheres, where by ''sphere'' we mean the level set q(x) = c of a general K-valued quadratic form q, for an invertible scalar c. When K is a field and q non-degenerate, then…

A subset $\left\{x_{1},x_{2},\hdots,x_{d}\right\}$ of a group $G$ \emph{invariably generates} $G$ if $\left\{x_{1}^{g_{1}},x_{2}^{g_{2}},\hdots,x_{d}^{g_{d}}\right\}$ generates $G$ for every $d$-tuple $(g_{1},g_{2}\hdots,g_{d})\in G^{d}$.…

Uninorms play a prominent role both in the theory and the applications of Aggregations and Fuzzy Logic. In this paper the class of group-like uninorms is introduced and characterized. First, two variants of a general construction -- called…

In this work, we define composite matrices which are derived from group rings. We extend the idea of G-codes to composite G-codes. We show that these codes are ideals in a group ring, where the ring is a finite commutative Frobenius ring…

Relying on the techniques and ideas from our recent paper [13], we prove several anti-classification results for various rigidity conditions in countable abelian and nilpotent groups. We prove three main theorems: (1) the rigid abelian…

In this paper, we investigate connections between structures present in every generic extension of the universe $V$ and computability theory. We introduce the notion of {\em generic Muchnik reducibility} that can be used to to compare the…

We establish several new results about both the (n)-solvable filtration, F_n^m, of the set of link concordance classes and the (n)-solvable filtration of the string link concordance group. We first establish a relationship between Milnor's…

It is well known that constructing codes with good parameters is one of the most important and fundamental problems in coding theory. Though a great many of good codes have been produced, most of them are defined over alphabets of sizes…

We show that for every $n\ge 2$ there exists a torsion-free one-ended word-hyperbolic group $G$ of rank $n$ admitting generating $n$-tuples $(a_1,\ldots ,a_n)$ and $(b_1,\ldots ,b_n)$ such that the $(2n-1)$-tuples $$(a_1,\ldots ,a_n,…

In this paper we obtain the Wedderburn-Artin decomposition of a semisimple group algebra associated to a direct product of finite groups. We also provide formulae for the number of all possible group codes, and their dimensions, that can be…

Building on the previous extensive study of Yang, Gould and the present author, we provide a more precise insight into the group-theoretical ramifications of the word problem for free idempotent generated semigroups over finite biordered…

In [1] we have constructed a [n+1/2]+1 parameters family of irreducible representations of the Braid group B_3 in arbitrary dimension using a $q-$deformation of the Pascal triangle. This construction extends in particular results by S.P.…

We construct a family of linear maximally recoverable codes with locality $r$ and dimension $r+1.$ For codes of length $n$ with $r\approx n^\alpha, 0\le\alpha\le 1$ the code alphabet is of the order $n^{1+3\alpha},$ which improves upon the…

This is the first paper in a series of three where we take on the unified theory of non-Archimedean group actions, length functions and infinite words. Our main goal is to show that group actions on Z^n-trees give one a powerful tool to…

This work establishes a new probabilistic bound on the number of elements to generate finite nilpotent groups. Let $\varphi_k(G)$ denote the probability that $k$ random elements generate a finite nilpotent group $G$. For any $0 < \epsilon <…