Related papers: Perfect Codes for Generalized Deletions from Minus…
We describe and present a new construction method for codes using encodings from group rings. They consist primarily of two types: zero-divisor and unit-derived codes. Previous codes from group rings focused on ideals; for example cyclic…
The authors proved that a Weyl module for a simple algebraic group is irreducible over every field if and only if the module is isomorphic to the adjoint representation for $E_{8}$ or its highest weight is minuscule. In this paper, we prove…
The deletion order of a finitely generated Coxeter group W is a total order on the elements which, as is proved, is a refinement of the Bruhat order. This order is applied in [8] to construct Elnitsky tilings for any finite Coxeter group.…
We define global and local Weyl modules for Lie superalgebras of the form $\mathfrak{g} \otimes A$, where $A$ is an associative commutative unital $\mathbb{C}$-algebra and $\mathfrak{g}$ is a basic Lie superalgebra or $\mathfrak{sl}(n,n)$,…
Data storage applications require erasure-correcting codes with prescribed sets of dependencies between data symbols and redundant symbols. The most common arrangement is to have $k$ data symbols and $h$ redundant symbols (that each depends…
We discuss the category $\cal I$ of level zero integrable representations of loop algebras and their generalizations. The category is not semisimple and so one is interested in its homological properties. We begin by looking at some…
This paper studies the cardinality of codes correcting insertions and deletions. We give improved upper and lower bounds on code size. Our upper bound is obtained by utilizing the asymmetric property of list decoding for insertions and…
We define the notion of a separable element in a finite Weyl group, generalizing the well-studied class of separable permutations. We prove that the upper and lower order ideals in weak Bruhat order generated by a separable element are…
Constructing Reed-Solomon (RS) codes that can correct insertion and deletion (ins-del) errors has been the focus of several recent studies. However, efficient decoding algorithms for such codes have received less attention and remain a…
For a graph $\Gamma=(V\Gamma,E\Gamma)$, a subset $D$ of $V\Gamma$ is a perfect code in $\Gamma$ if every vertex of $\Gamma$ is dominated by exactly one vertex in $D$. In this paper, we classify all connected quartic Cayley graphs on…
This paper studies connections between the preprojective modules over the path algebra of a finite connected quiver without oriented cycles, the (+)-admissible sequences of vertices, and the Weyl group. For each preprojective module, there…
The limit weak order on an affine Weyl group was introduced by Lam and Pylyavskyy in their study of total positivity for loop groups. They showed that in the case of the affine symmetric group the minimal elements of this poset coincide…
Let $G$ be a connected reductive group over an algebraically closed field with Weyl group $W$. The analogy between Lusztig varieties and Deligne-Lusztig varieties associated to minimal length elements in elliptic conjugacy classes of $W$…
Weyl points (WP) are robust spectral degeneracies, which can not be split by small perturbations, as they are protected by their non-zero topological charge. For larger perturbations, WPs can disappear via pairwise annihilation, where two…
The paper proves an identity involving Weil indices and epsilon factors for a local field. The starting point is a pair consisting of a reductive group and a maximal torus.
The Springer correspondence makes a link between the characters of a Weyl group and the geometry of the nilpotent cone of the corresponding semisimple Lie algebra. In this article, we consider a modular version of the theory, and show that…
The decomposition of representations of compact classical Lie groups into representations of finite subgroups is discussed. A Mathematica package is presented that can be used to compute these branching rules using the Weyl character…
Group network codes are a generalization of linear codes that have seen several studies over the last decade. When studying network codes, operations performed at internal network nodes called local encoding functions, are of significant…
This paper focuses on Hagiwara codes, which are quantum deletion-correcting codes constructed by the quantum Reed-Solomon codes. Although Hagiwara codes can correct composite errors consisting of deletions and insertions, an efficient…
The performance of Reed--Solomon codes (RS codes, for short) in the presence of insertion and deletion errors has attracted growing attention in recent literature. In this work, we further study this intriguing mathematical problem,…