Related papers: Perfect Codes for Generalized Deletions from Minus…
Separable elements in Weyl groups are generalizations of the well-known class of separable permutations in symmetric groups. Gaetz and Gao showed that for any pair $(X,Y)$ of subsets of the symmetric group $\mathfrak{S}_n$, the…
We compute all sections of the finite Weyl group, that satisfy the braid relations, in the case that G is an almost-simple connected reductive group defined over an algebraically closed field. We then demonstrate that this set of sections…
We introduce the notion of a strong minuscule element, and prove that the dominant integral weight associated to a strong minuscule element is the fundamental weight corresponding to a short simple root. In addition, we enumerate the strong…
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…
In this paper, we define a mixed-base number system over a Weyl group of type $D$, the group even-signed permutations. We introduce one-to-one correspondence between positive integers and elements of Weyl groups of type $D$ after…
In this article we consider linear codes coming from skew-symmetric determinantal varieties, which are defined by the vanishing of minors of a certain fixed size in the space of skew-symmetric matrices. In odd characteristic, the minimum…
Considerable interest has been paid in recent literature to codes combining local and global properties for erasure correction. Applications are in cloud type of implementations, in which fast recovery of a failed storage device is…
Generalized Concatenated (GC), also known as Integrated Interleaved (II) Codes, are studied from an erasure correction point of view making them useful for Redundant Arrays of Independent Disks (RAID) types of architectures combining global…
In this work, we generalize the integer enumeration basis. We also construct bijections between the elements of special sets and the elements of some groups, and treat the special case of the hyperoctohedral groups. Then, we find a code…
We consider Cayley sum graphs over the cyclic group $\mathbb{Z}_n$ and aim to explore several necessary and sufficient conditions for the existence of total perfect codes in these graphs. Specifically, we examine various cases for the…
Let G be a connected reductive group. To any irreducible G-variety one associates a certain linear group generated by reflections called the Weyl group. Weyl groups play an important role in the study of embeddings of homogeneous spaces. We…
In this paper, we review the properties and representations of the Weyl groups relevant in the study of discrete integrable systems. Previously in \cite{jns4, Shi:19}, properties of Weyl groups of type $ADE$ (known as simply-laced) were…
We consider the problem of constructing binary codes for correcting deletions that are localized within certain parts of the codeword that are unknown a priori. The model that we study is when $\delta \leq w$ deletions are localized in a…
We study Weyl elements in isotropic reductive groups over commutative rings. Our main result in an explicit formula for squares of such elements. We also classify these elements in rank one groups and prove basic properties of their loci.
A covering code is a set of codewords with the property that the union of balls, suitably defined, around these codewords covers an entire space. Generally, the goal is to find the covering code with the minimum size codebook. While most…
We study three fundamental topics in the representation theory of disconnected algebraic groups whose identity component is reductive: (i) the classification of irreducible representations; (ii) the existence and properties of Weyl and dual…
We consider the problem of correcting insertion and deletion errors in the $d$-dimensional space. This problem is well understood for vectors (one-dimensional space) and was recently studied for arrays (two-dimensional space). For vectors…
We introduce the definition of the typical irreducible modules of the generalized quantum groups, and prove the Weyl-Kac-type formulas of their characters. As a by-product, we obtain the Weyl-Kac-type character formulas of the typical…
Finite semisimple group algebras for which all the minimal ideals are easily computable dimension (ECD) are characterized and some lower bounds for the minimum Hamming distance of group codes in these algebras are offered. Examples…
Insdel errors occur in communication systems caused by the loss of positional information of the message. Since the work by Guruswami and Wang, there have been some further investigations on the list decoding of insertion codes, deletion…