Related papers: Error-Correcting Codes on Projective Bundles over …
We illustrate the Arinkin-Deligne-Katz algorithm for rigid irreducible meromorphic bundles with connection on the projective line by giving motivicity consequences similar to those given by Katz for rigid local systems.
In this paper we introduce a new type of code, called projective nested cartesian code. It is obtained by the evaluation of homogeneous polynomials of a fixed degree on a certain subset of $\mathbb{P}^n(\mathbb{F}_q)$, and they may be seen…
Let $X$ be a ruled surface over a nonsingular curve $C$ of genus $g\geq0$. The main goal of this paper is to construct simple prioritary vector bundles of any rank $r$ on $X$ and to give effective bounds for the dimension of their module of…
In this article, the existence of Ulrich bundles on projective bundles $\mathbb P(E) \to X$ is discussed. In the case, that the base variety $X$ is a curve or surface, a close relationship between Ulrich bundles on $X$ and those on $\mathbb…
The automorphism group of a projective bundle P(E) over a simplicial toric variety is described when the bundle E is a direct sum of line bundles. Applications to study of moduli of complete intersections on toric varieties, including…
We obtain a sharp bound on the degree of a globally generated vector bundle over a reduced irreducible projective variety defined over an algebraically closed field of characteristic zero. As an application, we obtain a Del Pezzo-Bertini…
This paper deals with a general form of variational problems in Banach spaces which encompasses variational inequalities as well as minimization problems. We prove a characterization of local error bounds for the distance to the…
We prove lower bounds for the minimum distance of algebraic geometry codes over surfaces whose canonical divisor is either nef or anti-strictly nef and over surfaces without irreducible curves of small genus. We sharpen these lower bounds…
A Lagrange-dual (Gallager-style) lower bound is derived for the error exponent function of the typical random code (TRC) pertaining to the i.i.d. random coding ensemble and mismatched stochastic likelihood decoding. While the original…
We extend the "bundle constructions" of calibrated submanifolds, due to Harvey--Lawson in the special Lagrangian case, and to Ionel--Karigiannis--Min-Oo in the cases of exceptional calibrations, by "twisting" the bundles by a special…
We provide a theoretical study of Algebraic Geometry codes constructed from abelian surfaces defined over finite fields. We give a general bound on their minimum distance and we investigate how this estimation can be sharpened under the…
We formulate a tropical analogue of Grothendieck's section conjecture: that for every stable graph G of genus g>2, and every field k, the generic curve with reduction type G over k satisfies the section conjecture. We prove many cases of…
The parameters of the AG codes on general linear groups are found. The hyperplane sections having the minimum (or maximum) number of rational points are determined.
This paper examines linear binary codes capable of correcting one or more errors. For the single-error-correcting case, it is shown that the Hamming bound is achieved by a constructive method, and an exact expression for the minimal…
In this paper we will estimate the main parameters of some evaluation codes which are known as projective parameterized codes. We will find the length of these codes and we will give a formula for the dimension in terms of the Hilbert…
Bundle methods have been intensively studied for solving both convex and nonconvex optimization problems. In most of the bundle methods developed thus far, at least one quadratic programming (QP) subproblem needs to be solved in each…
In this paper we propose a distributed version of a randomized block-coordinate descent method for minimizing the sum of a partially separable smooth convex function and a fully separable non-smooth convex function. Under the assumption of…
In this paper, we first study in detail the relationship between minimal linear codes and cutting blocking sets, which were recently introduced by Bonini and Borello, and then completely characterize minimal linear codes as cutting blocking…
We construct Locally Recoverable Codes (LRCs) with availability $2$ from a family of fibered surfaces. To obtain the locality and availability properties, and to estimate the minimum distance of the codes, we combine techniques coming from…
The first aim of this paper is to give four types of examples of surface bundles over surfaces with non-zero signature. The first example is with base genus 2, a prescribed signature, a 0-section and the fiber genus greater than a certain…