Related papers: Construction of minimal non-abelian left group cod…
The class of elementary totally disconnected groups is the smallest class of totally disconnected, locally compact, second countable groups which contains all discrete countable groups, all metrizable pro-finite groups, and is closed under…
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…
We present several results on quantum codes over general alphabets (that is, in which the fundamental units may have more than 2 states). In particular, we consider codes derived from finite symplectic geometry assumed to have additional…
Several relations and bounds for the dimension of principal ideals in group algebras are determined by analyzing minimal polynomials of regular representations. These results are used in the two last sections. First, in the context of…
Hedlund constructed Riemannian metrics on n-tori, $n \geq 3$ for which minimal geodesics are very rare. In this paper we construct similar examples for every nilpotent fundamental group. These examples show that Bangert's existence results…
Linear codes with a few weights have many nice applications including combinatorial design, distributed storage system, secret sharing schemes and so on. In this paper, we construct two families of linear codes with a few weights based on…
For each n >1, we construct a left quantum group, i.e., a left Hopf algebra H generated by comatrix units X_{ij} and modeled after SL_q(n), which has a left antipode but no right antipode. The quantum special linear group SL_q(n) is a…
The structure of multivariate semisimple codes over a finite chain ring $R$ is established using the structure of the residue field $\bar R$. Multivariate codes extend in a natural way the univariate cyclic and negacyclic codes and include…
Let $G$ be a finite abelian group $G$ with $N$ elements. In this paper we give a O(N) time algorithm for computing a basis of $G$. Furthermore, we obtain an algorithm for computing a basis from a generating system of $G$ with $M$ elements…
Let g be a semisimple Lie algebra over the real numbers. We describe an explicit combinatorial construction of the real Weyl group of g with respect to a given Cartan subalgebra. An efficient computation of this Weyl group is important for…
Recently, much progress has been made to construct minimal linear codes due to their preference in secret sharing schemes and secure two-party computation. In this paper, we put forward a new method to construct minimal linear codes by…
We derive the lower bound for Frobenius number of symmetric (not complete intersection) semigroups generated by four elements.
The classification of the finite subgroups of $\mathrm{GL}_n(\mathbb{C})$ and $\mathrm{PGL}_n(\mathbb{C})$ is a classical problem in the field of finite group theory, dating back to the late 19th century with authors like Klein, Jordan,…
We explore an elementary construction that produces finitely presented groups with diverse homological finiteness properties -- the {\em binary subgroups}, $B(\Sigma,\mu)<G_1\times\dots\times G_m$. These full subdirect products require…
We prove that all maximal subgroups of the free idempotent generated semigroup over a band B are free for all B belonging to a band variety V if and only if V consists either of left seminormal bands, or of right seminormal bands.
In an earlier paper by three of the present authors and Csaba Schneider, it was shown that, for $m\ge2$, a set of $m+1$ partitions of a set $\Omega$, any $m$ of which are the minimal non-trivial elements of a Cartesian lattice, either form…
For odd primes we prove some structure theorems for finite $p$-groups $G$, such that $G''\neq 1$ and $|G'/G''|=p^3$. Building on results of Blackburn and Hall, it is shown that $\lcs G3$ is a maximal subgroup of $G'$, the group $G$ has a…
Two constructions are given that describe respectively all shortest primary decompositions and all shortest uniform decompositions for left Noetherian rings. They show that these decompositions are, in general, highly non-unique.
In this paper, we introduce the concept of Arf special gaps of an Arf numerical semigroup, and an algorithm for computing all Arf special gaps of a given Arf numerical semigroup. We introduce the concept of Arf-irreducible numerical…
We show that the rank r component of the free idempotent generated semigroup of the biordered set of the full linear monoid of n x n matrices over a division ring Q has maximal subgroup isomorphic to the general linear group GL_r(Q), where…