Related papers: On defining generalized rank weights

In this paper, we study and characterise certain blocking sets in generalised polygons. This will allow us to derive new results about the minimum weight and minimum weight code words in the code generated by the rows of the incidence…

We define a notion of pseudo-unitarizability for weight modules over a generalized Weyl algebra (of rank one, with commutative coeffiecient ring $R$), which is assumed to carry an involution of the form $X^*=Y$, $R^*\subseteq R$. We prove…

In this paper, we consider infinite Galois extensions of number fields and study the relation between their local degrees and the structure of their Galois groups. It is known that, if $K$ is a number field and $L/K$ is an infinite Galois…

We present the theory of linear rank-metric codes from the point of view of their fundamental parameters. These are: the minimum rank distance, the rank distribution, the maximum rank, the covering radius, and the field size. The focus of…

We present a proof of a recent conjecture due to M. Kazarian, E. Krasilnikov, S. Lando, and M. Shapiro, which describes the average value of the universal $\mathfrak{gl}$-weight system on permutations. The proof uses a quantum analogue of…

The notion of generalized rank invariant in the context of multiparameter persistence has become an important ingredient for defining interesting homological structures such as generalized persistence diagrams. Naturally, computing these…

We develop an algorithm for computing the weight distribution of a linear $[n,k]$ code over a finite field $\mathbb{F}_q$. We represent the codes by their characteristic vector with respect to a given generator matrix and a special type of…

This work investigates the structure of rank-metric codes in connection with concepts from finite geometry, most notably the $q$-analogues of projective systems and blocking sets. We also illustrate how to associate a classical…

In the theory of finite order knot invariants, the universal $\text{sl}_2$ weight system maps the chord diagrams to polynomials in a single variable with integer coefficients. In this paper, we define a family of polynomials that generalize…

Suppose $K/\mathbb{Q}_p$ is finite and $\overline{r}\colon G_K\to \mathrm{GL}_2(\overline{\mathbb{F}}_p)$ is a reducible Galois representation. In this paper we prove that we can use the results by the author in [Ste22] to obtain a…

Let $\mathbb{Z}_4$ denote the ring of integers modulo $4$. The Galois ring GR$(4,m)$, which consists of $4^m$ elements, represents the Galois extension of degree $m$ over $\mathbb{Z}_4$. The constructions of codes over $\mathbb{Z}_4$ have…

We study affine cartesian codes, which are a Reed-Muller type of evaluation codes, where polynomials are evaluated at the cartesian product of n subsets of a finite field F_q. These codes appeared recently in a work by H. Lopez, C.…

Given a number field $F$, a finite group $G$ and an indeterminate $T$, {\it{a $G$-parametric extension over $F$}} is a finite Galois extension $E/F(T)$ with Galois group $G$ and $E/F$ regular that has all the Galois extensions of $F$ with…

A codeword is associated to a linearized polynomial. The weight distribution of the codewords is determined as the linearized polynomial varies in a family of fixed degree. There is a corresponding result on Wenger graphs from linearized…

In this paper, we present a new generalization of the Lucas numbers by matrix representation using Genaralized Lucas Polynomials. We give some properties of this new generalization and some relations between the generalized order-k Lucas…

Let $L$ be a degree $2$ Galois extension of the field $K$ and $M$ an $n\times n$ matrix with coefficients in $L$. Let $\langle \ ,\ \rangle : L^n\times L^n\to L$ be the sesquilinear form associated to the involution $L\to L$ fixing $K$. We…

Some sorts of generalized morphisms are defined from very basic mathematical objects such as sets, functions, and partial functions. A wide range of mathematical notions such as continuous functions between topological spaces, ring…

A systematic way of constructing Grassmannian codes endowed with the subspace distance as lifts of matrix codes over the prime field $GF(p)$ is introduced. The matrix codes are $GF(p)$-subspaces of the ring $M_2(GF(p))$ of $2 \times 2$…

We derive simplified sphere-packing and Gilbert--Varshamov bounds for codes in the sum-rank metric, which can be computed more efficiently than previous ones. They give rise to asymptotic bounds that cover the asymptotic setting that has…

In this article, we are going to introduce the weighted numerical range which is a further generalization both the c-numerical range and the rank k numerical range. If the boundaries of weighted numerical ranges of two matrices (possibly of…