Related papers: Harder-Narasimhan theory for linear codes
The Harder-Narasimhan theory provides a canonical filtration of a vector bundle on a projective curve whose successive quotients are semistable with strictly decreasing slopes. In this article, we present the formalization of…
We build on the recent techniques of Codogni and Patakfalvi, from \cite{Codogni:Patakfalvi:2021}, which were used to establish theorems about semi-positivity of the Chow Mumford line bundles for families of $\K$-semistable Fano varieties.…
We attach buildings to modular lattices and use them to develop a metric approach to Harder-Narasimhan filtrations. Switching back to a categorical framework, we establish an abstract numerical criterion for the compatibility of these…
In $1991$, Wei proved a duality theorem that established an interesting connection between the generalized Hamming weights of a linear code and those of its dual code. Wei's duality theorem has since been extensively studied from different…
Linear codes play a central role in coding theory and have applications in several branches of mathematics. For error correction purposes the minimum Hamming distance should be as large as possible. Linear codes related to applications in…
The notion of Harder-Narasimhan filtration was firstly introduced by Harder and Narasimhan in the setting of vector bundles on a non-singular projective curve. Curiously, analogous constructions have been discovered in other branches of…
We develop a Harder-Narasimhan theory for Kisin modules generalizing a similar theory for finite flat group schemes due to Fargues. We prove the tensor product theorem, i.e., that the tensor product of semi-stable objects is again…
We establish a connection between problems studied in rigidity theory and matroids arising from linear algebraic constructions like tensor products and symmetric products. A special case of this correspondence identifies the problem of…
Currently known secondary construction techniques for linear codes mainly include puncturing, shortening, and extending. In this paper, we propose a novel method for the secondary construction of linear codes based on their weight…
Studying the generalized Hamming weights of linear codes is a significant research area within coding theory, as it provides valuable structural information about the codes and plays a crucial role in determining their performance in…
We define canonical refinements of Harder-Narasimhan filtrations and stratifications in moduli theory, generalising and relating work of Haiden-Katzarkov-Kontsevich-Pandit and Kirwan. More precisely, we define a canonical stratification on…
We propose a unified theory of generalized weights for linear codes endowed with an arbitrary distance. Instead of relying on supports or anticodes, the weights of a code are defined via the intersections of the code with a chosen family of…
This Ph.D. thesis studies the relation between the Harder-Narasimhan filtration and a notion of GIT maximal unstability. When constructing a moduli space by using Geometric Invariant Theory (GIT), a notion of GIT stability appears, which is…
We give a new proof of the Mordell-Lang conjecture in positive characteristic, in the situation where the variety under scrutiny is a smooth subvariety of an abelian variety. Our proof is based on the theory of semistable sheaves in…
For a reductive group $G$, Harder-Narasimhan theory gives a structure theorem for principal $G$ bundles on a smooth projective curve $C$. A bundle is either semistable, or it admits a canonical parabolic reduction whose associated Levi…
In this text we develop the formalism of products and powers of linear codes under componentwise multiplication. As an expanded version of the author's talk at AGCT-14, focus is put mostly on basic properties and descriptive statements that…
We construct a Harder-Narasimhan filtration for rank $2$ tensors, where there does not exist any such notion a priori, as coming from a GIT notion of maximal unstability. The filtration associated to the 1-parameter subgroup of Kempf giving…
The sum-rank metric naturally extends both the Hamming and rank metrics in coding theory over fields. It measures the error-correcting capability of codes in multishot matrix-multiplicative channels (e.g. linear network coding or the…
Let $G$ be a split reductive group over a field $k$ of arbitrary characteristic, chosen suitably. Let $X\to S$ be a smooth projective morphism of locally noetherian $k$-schemes, with geometrically connected fibers. We show that for each…
We develop a valuation-theoretic framework for studying tangent cones of torsion-free sheaves on algebraic varieties. To analyze these objects, we introduce a slope stability theory, including the Harder-Narasimhan filtrations, for finitely…