Related papers: Perfect Codes for Generalized Deletions from Minus…
We classify finite-dimensional irreducible highest weight modules of generalized quantum groups whose positive part is infinite dimensional and has a Kharchenko's PBW basis with an irreducible finite positive root system.
Given an algebraically closed field $\Bbbk$ of characteristic zero, a Lie superalgebra $\mathfrak{g}$ over $\Bbbk$ and an associative, commutative $\Bbbk$-algebra $A$ with unit, a Lie superalgebra of the form $\mathfrak{g} \otimes_\Bbbk A$…
In this work we find Hochschild cohomology groups of the Weyl associative conformal algebra with coefficients in all finite modules. The Weyl conformal algebra is the universal associative conformal envelope of the Virasoro Lie conformal…
Insertion and deletion (insdel for short) errors are synchronization errors in communication systems caused by the loss of positional information in the message. Reed-Solomon codes have gained a lot of interest due to its encoding…
The existence and construction of self-dual codes in a permutation module of a finite group for the semisimple case are described from two aspects, one is from the point of view of the composition factors which are self-dual modules, the…
For a simple complex Lie algebra of finite rank and classical type, we fix a triangular decomposition and consider the simple Levi subalgebras associated to closed subsets of roots. We study the restriction of global and local Weyl modules…
For any finitely generated abelian group $Q$, we reduce the problem of classification of $Q$-graded simple Lie algebras over an algebraically closed field of "good" characteristic to the problem of classification of gradings on simple Lie…
We study the category of modules of minimal dimension over completed Weyl algebras in equal characteristic zero. In particular we prove finiteness of de Rham cohomology of such modules.
An embedding of a code is a mapping that preserves distances between codewords. We prove that any code with code distance $\rho$ and length $d$ can be embedded into an MDS code with the same code distance and length but under a larger…
A perfect code $C$ in a graph $\Gamma$ is an independent set of vertices of $\Gamma$ such that every vertex outside of $C$ is adjacent to a unique vertex in $C$, and a total perfect code $C$ in $\Gamma$ is a set of vertices of $\Gamma$ such…
In a recent paper, Kim and Kopparty (Theory of Computing, 2017) gave a deterministic algorithm for the unique decoding problem for polynomials of bounded total degree over a general grid. We show that their algorithm can be adapted to solve…
Constructing Reed--Solomon (RS) codes that can correct insertions and deletions (insdel errors) has been considered in numerous recent works. For the special case of two-dimensional RS-codes, it is known [CST23] that an $[n,2]_q$ RS-code…
We complete the construction of the modular generalized Springer correspondence for an arbitrary connected reductive group, with a uniform proof of the disjointness of induction series that avoids the case-by-case arguments for classical…
This article focuses on the study of cut groups, i.e., the groups which have only trivial central units in their integral group ring. We provide state of art for cut groups. The results are compiled in a systematic manner and have also been…
We consider the problem of constructing deletion correcting codes over a binary alphabet and take a graph theoretic view. An $n$-bit $s$-deletion correcting code is an independent set in a particular graph. We propose constructing such a…
We show that every Weyl module for a current algebra has a filtration whose successive quotients are isomorphic to Demazure modules, and that the path model for a tensor product of level zero fundamental representations is isomorphic to a…
Linear codes with few weights have applications in secret sharing, authentication codes, association schemes and strongly regular graphs. In this paper, several classes of $t$-weight linear codes over ${\mathbb F}_{q}$ are presented with…
According to the Ringel-Green Theorem([G],[R1]), the generic composition algebra of the Hall algebra provides a realization of the positive part of the quantum group. Furthermore, its Drinfeld double can be identified with the whole quantum…
In this paper, we give a new method for constructing LCD codes. We employ group rings and a well known map that sends group ring elements to a subring of the $n \times n$ matrices to obtain LCD codes. Our construction method guarantees that…
We give a complete answer to the following basic question: "What is the maximal fraction of deletions or insertions tolerable by $q$-ary list-decodable codes with non-vanishing information rate?" This question has been open even for binary…