Related papers: Decoding binary Reed-Muller codes via Groebner bas…
We give a generalization of subspace codes by means of codes of modules over finite commutative chain rings. We define a new class of Sperner codes and use results from extremal combinatorics to prove the optimality of such codes in…
We define a method which produces explicit cellular bases for algebras obtained via a Jones basic construction. For the class of algebras in question, our method gives formulas for generic Murphy--type cellular bases indexed by paths on…
Let $\mathbb{F}_q$ be a finite field of characteristic not equal to $2$ or $3$. We compute the weight enumerators of some projective and affine Reed-Muller codes of order $3$ over $\mathbb{F}_q$. These weight enumerators answer enumerative…
We suggest a mathematical definition of the notion of master integrals and present a brief review of algorithmic methods to solve reduction problems for Feynman integrals based on integration by parts relations. In particular, we discuss a…
We describe (braided-)commutative algebras with non-degenerate multiplicative form in certain braided monoidal categories, corresponding to abelian metric Lie algebras (so-called Drinfeld categories). We also describe local modules over…
We propose a framework for bilinear multiplier operators defined via the (bivariate) spectral theorem. Under this framework we prove Coifman-Meyer type multiplier theorems and fractional Leibniz rules. Our theory applies to bilinear…
The second weight of the Generalized Reed-Muller code of order $d$ over the finite field with $q$ elements is now known for $d <q$ and $d>(n-1)(q-1)$. In this paper, we determine the second weight for the other values of $d$ which are not…
Motivated by algorithmic problems from combinatorial group theory we study computational properties of integers equipped with binary operations +, -, z = x 2^y, z = x 2^{-y} (the former two are partial) and predicates < and =. Notice that…
Lifted Reed-Solomon codes are a natural affine-invariant family of error-correcting codes which generalize Reed-Muller codes. They were known to have efficient local-testing and local-decoding algorithms (comparable to the known algorithms…
Based upon properties of ordinal length, we introduce a new class of modules, the binary modules, and study their endomorphism ring. The nilpotent endomorphisms form a two-sided ideal, and after factoring this out, we get a commutative…
This paper introduces a new approach to proving that a sequence of deterministic linear codes achieves capacity on an erasure channel under maximum a posteriori decoding. Rather than relying on the precise structure of the codes, this…
In this article we associate a combinatorial differential graded algebra to a cubic planar graph G. This algebra is defined combinatorially by counting binary sequences, which we introduce, and several explicit computations are provided. In…
We give a moduli interpretation to the quotient of (nondegenerate) binary cubic forms with respect to the natural $\text{GL}_2$-action on the variables. In particular, we show that these $\text{GL}_2$ orbits are in bijection with pairs of…
We present an algorithm that transforms, if possible, a given ODE or PDE with radical function coefficients into one with rational coefficients by means of a rational change of variables. It also applies to systems of linear ODEs. It is…
We propose an easy-to-implement hard-decision majority-logic decoding algorithm for Reed-Muller codes RM(r,m) with m >= 3, m/2 >= r >= 1. The presented algorithm outperforms the best known majority-logic decoding algorithms and offers…
Inspired by code vertex operator algebras (VOAs) and their representation theory, we define code algebras, a new class of commutative non-associative algebras constructed from binary linear codes. Let $C$ be a binary linear code of length…
The modular properties of characters of representations of a family of W-superalgebras extending the affine Lie superalgebra of gl(1|1) are considered. Modules fall into two classes, the generic type and the non-generic one. Characters of…
We give algorithms for computing multiplier ideals using Gr\"obner bases in Weyl algebras. The algorithms are based on a newly introduced notion which is a variant of Budur--Musta\c{t}\v{a}--Saito's (generalized) Bernstein--Sato polynomial.…
We give a classification of the simple modules for the cyclotomic Hecke algebras over $\mathbb{C}$ in the modular case. We use the unitriangular shape of the decomposition matrices of Ariki-Koike algebras and Clifford theory.
A Hilbert $C^*$-quad module of finite type has a multi structure of Hilbert $C^*$-bimodules with two finite bases. We will construct a $C^*$-algebra from a Hilbert $C^*$-quad module of finite type and prove its universality subject to…