Related papers: An Assmus-Mattson theorem for codes over commutati…
In this text we develop some aspects of Harder-Narasimhan theory, slopes, semistability and canonical filtration, in the setting of combinatorial lattices. Of noticeable importance is the Harder-Narasimhan structure associated to a Galois…
An explicit analytic formula is presented that computes the conformal (super-)block decomposition of any free scalar or half-BPS diagram in 1d, 2d or 4d CFTs, with various supersymmetries, including none. We prove our formula by exploiting…
These lecture notes have been written for a course at the Algebraic Coding Theory (ACT) summer school 2022 that took place in the university of Zurich. The objective of the course propose an in-depth presentation of the proof of one of the…
In this work we explore a family of metrics over finite fields which respect the support of vectors. We show how these metrics can be obtained from the edge-weighted Hamming cube and, based on this representation we give a description of a…
Linear codes with a few weights have been widely investigated in recent years. In this paper, we mainly use Gauss sums to represent the Hamming weights of a class of $q$-ary linear codes under some certain conditions, where $q$ is a power…
We introduce the notion of a conformal design based on a vertex operator algebra. This notation is a natural analog of the notion of block designs or spherical designs when the elements of the design are based on self-orthogonal binary…
The weighted projection of an alternating sign matrix (ASM) was introduced by Brualdi and Dahl (2018) as a step towards characterising a generalisation of Latin squares they introduced using alternating sign hypermatrices. If $z_n =…
The concept of group divisible codes, a generalization of group divisible designs with constant block size, is introduced in this paper. This new class of codes is shown to be useful in recursive constructions for constant-weight and…
In this paper, based on the theory of defining sets, two classes of at most six-weight linear codes over $\mathbb{F}_p$ are constructed. The weight distributions of the linear codes are determined by means of Gaussian period and Weil sums.…
Let $A_q(n,d)$ be the maximum order (maximum number of codewords) of a $q$-ary code of length $n$ and Hamming distance at least $d$. And let $A(n,d,w)$ that of a binary code of constant weight $w$. Building on results from algebraic graph…
We give a new structural development of harmonic polynomials on Hamming space, and harmonic weight enumerators of binary linear codes, that parallels one approach to harmonic polynomials on Euclidean space and weighted theta functions of…
Inspired by Vershik and Okounkov's inductive and Lie-theoretic approach to the representation theory of the symmetric group, we extend their point of view to reducible $S_n$-modules. Using induced representations along Young's lattice, we…
A subset $S$ of $\{0,1,...,2t-1\}^n$ is called a $t$-fold MDS code if every line in each of $n$ base directions contains exactly $t$ elements of $S$. The adjacency graph of a $t$-fold MDS code is not connected if and only if the…
In 1970 Delsarte, Goethals and Mac Williams published a seminal paper on generalized Reed-Muller codes where, among many important results, they proved that the minimal weight codewords of these codes are obtained through the evaluation of…
In the preprint arXiv:2511.07900 we proved that there exists a localizing ring $A_M$ for $A$ an associative ring with unit, and $M=\oplus_{i=1}^rM_i$ a direct sum of $r\geq 1$ simple right $A$-modules. For a homomorphism of associative…
We prove that the categories of weight modules over the simple $\mathfrak{sl}(2)$ and $\mathcal{N}=2$ superconformal vertex operator algebras at fractional admissible levels and central charges are rigid (and hence the categories of weight…
The problem of constructing twisted modules for a vertex operator algebra and an automorphism has been solved in particular in two contexts. One of these two constructions is that initiated by the third author in the case of a lattice…
A combinatorial code $\mathcal{C}$ is a collection of subsets of $[n]$, or equivalently a set of points in $\{0,1\}^n$. A morphism of codes is a map from one combinatorial code to another such that the coordinates of points in the image can…
It is well known that there is a deep relationship between codes and lattices. Concepts from coding theory are related to concepts of lattice theory as, for example, weight enumerators to theta series, MacWilliams identity to Jacobi…
We discuss a recent proof by the author of a general version of the Verlinde conjecture in the framework of vertex operator algebras and the application of this result to the construction of modular tensor tensor category structure on the…