Related papers: Perfect Codes for Generalized Deletions from Minus…
We define and study a correspondence between the set of distinguished G^0-conjugacy classes in a fixed connected component of a reductive group G (with G^0 almost simple) and the set of (twisted) elliptic conjugacy classes in the Weyl…
We show that integration over a $G$-manifold $M$ can be reduced to integration over a minimal section $\Sigma$ with respect to an induced weighted measure and integration over a homogeneous space $G/N$. We relate our formula to integration…
We show that to determine all solvable elements in the Weyl algebra is closely related to the Dixmier's open question. Sufficient conditions for an elements being unsolvable are given, and properties of solvable elements are obtained.
In this work, we study linear error-correcting codes against adversarial insertion-deletion (insdel) errors, a topic that has recently gained a lot of attention. We construct linear codes over $\mathbb{F}_q$, for…
We examine various consequences of the existence of exceptional representations of an irreducible Weyl group. (These are notes from a talk in the MIT Lie groups seminar.)
Motivated by a question and some enumerative conjectures of Richard Stanley, we explore the equivalence classes of words in the Weyl algebra, $\mathbf{k} \left< D,U \mid DU - UD = 1 \right>$. We show that each class is generated by the…
Variable-length codes are the bases of the free submonoids of a free monoid. There are some important longstanding open questions about the structure of finite maximal codes. In this paper we discuss this conjectures and their relations…
Let $\mathbb {F}_q$ be a finite field and $G$ a finte group with $(|G|,q)=1$. By a group code in $\mathbb {F}_q[G]$ we mean a two-sided ideal in $\mathbb {F}_q[G]$. We will prove a general criterion for the existence of group codes with…
This work continues the study of linear error correcting codes against adversarial insertion deletion errors (insdel errors). Previously, the work of Cheng, Guruswami, Haeupler, and Li \cite{CGHL21} showed the existence of asymptotically…
We explore the connection between the holographic Weyl anomaly and the superconformal index in six-dimensional $(1,0)$ theories. Using earlier results from holographic computations of the $\mathcal O(1)$ contributions $\delta a$ and…
In recent years codes that are not Uniquely Decipherable (UD) are been studied partitioning them in classes that localize the ambiguities of the code. A natural question is how we can extend the notion of maximality to codes that are not…
The aim of this paper is to give relations between the category of finetely generated graded modules over the homogeneized Weyl algebra $B_{n}$, the finetely generated modules over the Weyl algebra $A_{n}$ and the finetely generated graded…
In this paper, we study the minimum distances of binary linear codes with parity check matrices formed from subset inclusion matrices $W_{t,n,k}$, representing $t$-element subsets versus $k$-element subsets of an $n$-element set. We provide…
In this article we introduce the operations of insertion and deletion working in a random-context and semi-conditional manner. We show that the conditional use of rules strictly increase the computational power. In the case of…
A perfect code in a graph $\Gamma = (V, E)$ is a subset $C$ of $V$ such that no two vertices in $C$ are adjacent and every vertex in $V \setminus C$ is adjacent to exactly one vertex in $C$. A subgroup $H$ of a group $G$ is called a…
We discuss a class of binary cyclic codes and their dual codes. The minimum distance is determined using algebraic geometry, and an application of Weil's theorem. We relate the weights appearing in the dual codes to the number of rational…
We study codes with a single check element derived from group rings, namely, checkable codes. The notion of a code-checkable group ring is introduced. Necessary and sufficient conditions for a group ring to be code-checkable are given in…
In this article, we study the classification of some natural numbers related to the combinatorics of congruence subgroups of the modular group. More precisely, we will focus here on the notion of minimal monomial solutions. These are the…
In this (partly expository) paper we show, using ideas from the theory of total positivity, how a number of properties of a semisimple group over the complex numbers can be presented purely in terms of the Weyl group. We also describe some…
This paper develops a fundamental theory of realizations of linear and group codes on general graphs using elementary group theory, including basic group duality theory. Principal new and extended results include: normal realization…