Related papers: Harder-Narasimhan theory for linear codes
We completely classify the possible extensions between semistable vector bundles on the Fargues-Fontaine curve (over an algebraically closed perfectoid field), in terms of a simple condition on Harder-Narasimhan polygons. Our arguments rely…
In this paper, we consider a finiteness problem of saturated subsheaves of a hermitian locally free sheaf on an arithmetic variety. As an application, we could prove the unique existence of an arithmetic Harder-Narasimham filtration.
This work is the first step towards a description of the Gromov boundary of the free factor graph of a free product, with applications to subgroup classification for outer automorphisms. We extend the theory of algebraic laminations dual to…
The Generalized Hamming weights and their relative version, which generalize the minimum distance of a linear code, are relevant to numerous applications, including coding on the wire-tap channel of type II, $t$-resilient functions,…
We introduce greedy weights of matroids, inspired by those for linear codes. We show that a Wei duality holds for two of these types of greedy weights for matroids. Moreover we show that in the cases where the matroids involved are…
We formulate a theory of instability and Harder-Narasimhan filtrations for an arbitrary moduli problem in algebraic geometry. We introduce the notion of a $\Theta$-stratification of a moduli problem, which generalizes the Kempf-Ness…
We investigate linear and additive codes in partially ordered Hamming-like spaces that satisfy the extension property, meaning that automorphisms of ideals extend to automorphisms of the poset. The codes are naturally described in terms of…
We derive a general lower bound for the generalized Hamming weights of nested matrix-product codes, with a particular emphasis on the cases with two and three constituent codes. We also provide an upper bound which is reminiscent of the…
We investigate the structure of intersecting error-correcting codes, with a particular focus on their connection to matroid theory. We establish properties and bounds for intersecting codes with the Hamming metric and illustrate how these…
We develop a framework that systematically casts the solvability and uniqueness conditions of linearized geometric boundary-value problems into cohomological terms. The theory is designed to be applicable without assumptions on the…
We consider a class of non-linear PDE systems, whose equations possess Noether identities (the equations are redundant), including non-variational systems (not coming from Lagrangian field theories), where Noether identities and…
We define and study Harder-Narasimhan filtrations on Breuil-Kisin-Fargues modules and related objects relevant to p-adic Hodge theory.
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…
This is the first paper in a series on intrinsic Donaldson-Thomas theory, where we develop a new framework for enumerative geometry that allows the generalization of constructions and results from linear moduli stacks to general non-linear…
We present two results concerning the relation between poles and cuts by using the example of N=1 U(N_c) gauge theories with matter fields in the adjoint, fundamental and anti-fundamental representations. The first result is the on-shell…
Motivated by an application to database linear querying, such as private information-retrieval protocols, we suggest a fundamental property of linear codes -- the generalized covering radius. The generalized covering-radius hierarchy of a…
In this article, we study the notion of semi-stability and the Harder-Narasimhan filtration from a game-theoretic point of view. This allows us to provide a unified proof for the existence and uniqueness of the Harder-Narasimhan filtration…
Ben-Sasson and Sudan (RSA 2006) showed that repeated tensor products of linear codes with a very large distance are locally testable. Due to the requirement of a very large distance the associated tensor products could be applied only over…
Hermitian hulls of linear codes are interesting for theoretical and practical reasons alike. In terms of recent application, linear codes whose hulls meet certain conditions have been utilized as ingredients to construct…
Fix a smooth projective family of curves $C \to S$ and a split reductive group scheme $G$ over a Noetherian base scheme $S$. For any (possibly nonreduced) fixed relative Cartier divisor $D$, we provide a treatment of the moduli of…