Related papers: On the affine permutation group of certain decreas…

Algebraic codes that achieve list decoding capacity were recently constructed by a careful ``folding'' of the Reed-Solomon code. The ``low-degree'' nature of this folding operation was crucial to the list decoding algorithm. We show how…

A permutation graph is a graph whose edges are given by inversions of a permutation. We study the Abelian sandpile model (ASM) on such graphs. We exhibit a bijection between recurrent configurations of the ASM on permutation graphs and the…

In this paper, we introduce a new way of constructing and decoding multipermutation codes. Multipermutations are permutations of a multiset that generally consist of duplicate entries. We first introduce a class of binary matrices called…

We give several generalisations of the Deuring reduction criterion for elliptic curves to abelian varieties of higher dimension. In particular the Newton polygon of the reduction of an abelian variety A with complex multiplication by F at a…

We introduce a new family of real simple modules over the quantum affine algebras, called the affine determinantial modules, which contains the Kirillov-Reshetikhin (KR)-modules as a special subfamily, and then prove T-systems among them…

Let A^2 denote the affine plane over an algebraically closed field of arbitrary characteristic. Besides contributing several new results in the general theory of birational endomorphisms of A^2, this article describes certain classes of…

In this manuscript, we introduce a new class of linear codes, called affine symplectic Grassmann codes, and determine their parameters, automorphism group, minimum distance codewords, dual code and other key features. These linear codes are…

In this article we overview those aspects of the theory of affine semigroups and their algebras that have been relevant for our own research, and pose several open problems. Answers to these problems would contribute substantially to the…

A pattern class is a set of permutations closed under the formation of subpermutations. Such classes can be characterised as those permutations not involving a particular set of forbidden permutations. A simple collection of necessary and…

We formulate the classical decoding algorithm of alternant codes afresh based on interpolation as in Sudan's list decoding of Reed-Solomon codes, and thus get rid of the key equation and the linear recurring sequences in the theory. The…

We present a bijective algorithm with which an arbitrary permutation decomposes canonically into elementary blocks which we call families, which are sets with a specified number of ascents and descents. We show that families, arranged in an…

We study a family of primary affine variety codes defined from the Klein quartic. The duals of these codes have previously been treated in [12, Ex. 3.2]. Among the codes that we construct almost all have parameters as good as the best known…

We give a detailed description of the torsors that correspond to multiloop algebras. These algebras are twisted forms of simple Lie algebras extended over Laurent polynomial rings. They play a crucial role in the construction of Extended…

We consider twisted permutation codes, a class of frequency permutation arrays obtained from finite groups with multiple permutation representations of the same degree, introduced by Gillespie, Praeger and Spiga (and later studied by…

This is a survey article on moduli of affine schemes equipped with an action of a reductive group. The emphasis is on examples and applications to the classification of spherical varieties.

Polynomial remainder codes are a large class of codes derived from the Chinese remainder theorem that includes Reed-Solomon codes as a special case. In this paper, we revisit these codes and study them more carefully than in previous work.…

This paper gives an algebraic presentation of an algebra called the fused permutations algebra in the one-boundary case. It is obtained through a detailed study of the degenerate cyclotomic Hecke algebra. In particular, we prove that the…

Binary matrix codes with restricted row and column weights are a desirable method of coded modulation for power line communication. In this work, we construct such matrix codes that are obtained as products of affine codes - cosets of…

We use affine variety codes and their subfield-subcodes for obtaining quantum stabilizer codes via the CSS code construction. With this procedure, we get codes with good parameters and a code whose parameters exceed the CSS quantum…

Many algorithms in numerical analysis are affine equivariant: they are immune to changes of affine coordinates. This is because those algorithms are defined using affine invariant constructions. There is, however, a crucial ingredient…