English
Related papers

Related papers: Algebraic Geometric codes on minimal Hirzebruch su…

200 papers

Let $M$ be an uniformizable Anderson $t$-motive of rank $r$, $L$ its lattice and $l_*:=\{l_1,\dots, l_r\}$ its basis. We define a map $\delta$ from the set of these bases to a flag variety (the present text gives the definition of $\delta$…

Number Theory · Mathematics 2025-04-29 A. Grishkov , D. Logachev

For an (imaginary) hyperelliptic curve $\mathcal{H}$ of genus $g$, we determine a basis of the Riemann-Roch space $\mathcal{L}(D)$, where $D$ is a divisor with positive degree $n$, linearly equivalent to $P_1+\cdots+ P_j+(n-j)\Omega$, with…

Algebraic Geometry · Mathematics 2020-12-17 Giovanni Falcone , Ágota Figula , Carolin Hannusch

We examine the noncommutative minimal model program for orders on arithmetic surfaces, or equivalently, arithmetic surfaces enriched by a Brauer class $\beta$. When $\beta$ has prime index $p>5$, we show the classical theory extends with…

Algebraic Geometry · Mathematics 2021-08-09 Daniel Chan , Colin Ingalls

This paper introduces new constructions of sum-rank metric codes derived from algebraic function fields, as existing results on such codes remain limited. A major challenge lies in the determination of their parameters. We address this…

Information Theory · Computer Science 2025-12-16 Zhu Yunlong , Zhao Chang-An

We study algebraic integrability of complex planar polynomial vector fields $X=A (x,y)(\partial/\partial x) + B(x,y) (\partial/\partial y) $ through extensions to Hirzebruch surfaces. Using these extensions, each vector field $X$ determines…

Algebraic Geometry · Mathematics 2024-05-01 Carlos Galindo , Francisco Monserrat , Elvira Pérez-Callejo

In this paper, algebraic-geometric (AG) codes associated with the GGS maximal curve are investigated. The Weierstrass semigroup at all $\mathbb F_{q^2}$-rational points of the curve is determined; the Feng-Rao designed minimum distance is…

Combinatorics · Mathematics 2017-07-18 Daniele Bartoli , Maria Montanucci , Giovanni Zini

We introduce a notion of approximate orthogonality preserving mappings between Hilbert $C^*$-modules. We define the concept of $(\delta, \varepsilon)$-orthogonality preserving mapping and give some sufficient conditions for a linear mapping…

Operator Algebras · Mathematics 2016-11-28 Mohammad Sal Moslehian , Ali Zamani

In this paper, we give an effective and efficient algorithm which on input takes non-zero integers $A$ and $B$ and on output produces the generators of the Mordell-Weil group of the elliptic curve over $\mathbb{Q}(t)$ given by an equation…

Number Theory · Mathematics 2023-05-19 Julie Desjardins , Bartosz Naskręcki

In the frameworks of algebraic topology {\alpha}-helix and different DNA-conformations are determined as the local latticed packing, confined by peculiar minimal surfaces which are similar to helicoids. These structures are defined by…

Materials Science · Physics 2013-03-19 M. I. Samoylovich , A. L. Talis

In this paper we study the partial Brauer $\mathbb{C}$-algebras $\mathfrak{R}_n(\delta,\delta')$, where $n \in \mathbb{N}$ and $\delta,\delta'\in\mathbb{C}$. We show that these algebras are generically semisimple, construct the Specht…

Representation Theory · Mathematics 2017-05-10 Paul Martin , Volodymyr Mazorchuk

Consider the set of all error--correcting block codes over a fixed alphabet with $q$ letters. It determines a recursively enumerable set of points in the unit square with coordinates $(R,\delta)$:= {\it (relative transmission rate, relative…

Information Theory · Computer Science 2011-07-22 Yuri I. Manin

We introduce the notion of level-$\delta$ limit linear series, which describe limits of linear series along families of smooth curves degenerating to a singular curve $X$. We treat here only the simplest case where $X$ is the union of two…

Algebraic Geometry · Mathematics 2016-06-15 Eduardo Esteves , Antonio Nigro , Pedro Rizzo

Recent work by Divsalar et al. has shown that properly designed protograph-based low-density parity-check (LDPC) codes typically have minimum (Hamming) distance linearly increasing with block length. This fact rests on ensemble arguments…

Information Theory · Computer Science 2013-02-22 Brian K. Butler , Paul H. Siegel

We study the birational properties of geometrically rational surfaces from a derived categorical point of view. In particular, we give a criterion for the rationality of a del Pezzo surface over an arbitrary field, namely, that its derived…

Algebraic Geometry · Mathematics 2020-08-03 Asher Auel , Marcello Bernardara

We show how the theory of affine geometries over the ring ${\mathbb Z}/\langle q - 1\rangle$ can be used to understand the properties of toric and generalized toric codes over ${\mathbb F}_q$. The minimum distance of these codes is strongly…

Information Theory · Computer Science 2017-03-08 John B. Little

We use reduction maps to study the minimal model program. Our main result is that the existence of a good minimal model for a klt pair $(X,\Delta)$ can be detected on the base of the $(K_{X}+\Delta)$-trivial reduction map. Thus we show that…

Algebraic Geometry · Mathematics 2019-02-20 Yoshinori Gongyo , Brian Lehmann

We introduce a family of spaces, parametrized by positive real numbers, that includes all of the Hirzebruch surfaces. Each space is viewed from two distinct perspectives. First, as a leaf space of a compact, complex, foliated manifold,…

Symplectic Geometry · Mathematics 2020-01-08 Fiammetta Battaglia , Elisa Prato , Dan Zaffran

In this paper we prove new lower bounds for the minimum distance of a toric surface code defined by a convex lattice polygon P. The bounds involve a geometric invariant L(P), called the full Minkowski length of P which can be easily…

Algebraic Geometry · Mathematics 2015-06-26 Ivan Soprunov , Evgenia Soprunova

We examine the ranks of operators in semi-finite C*-algebras as measured by their densely defined lower semicontinuous traces. We first prove that a unital simple C*-algebra whose extreme tracial boundary is nonempty and finite contains…

Operator Algebras · Mathematics 2015-06-01 Aaron Tikuisis , Andrew Toms

In this paper, we consider Griesmer codes, namely those linear codes meeting the Griesmer bound. Let $C$ be an $[n,k,d]_q$ Griesmer code with $q=p^f$, where $p$ is a prime and $f\ge1$ is an integer. In 1998, Ward proved that for $q=p$, if…

Combinatorics · Mathematics 2025-06-10 Haihua Deng , Hexiang Huang , Qing Xiang