Related papers: Any network codes comes from an algebraic curve ta…
The Newton polygon of the implicit equation of a rational plane curve is explicitly determined by the multiplicities of any of its parametrizations. We give an intersection-theoretical proof of this fact based on a refinement of the…
PhD thesis investigating homological quantum codes derived from curved and higher dimensional geometries. In the first part we will consider closed surfaces with constant negative curvature. We show how such surfaces can be constructed and…
Quantum error-correction is a prerequisite for reliable quantum computation. Towards this goal, we present a recurrent, transformer-based neural network which learns to decode the surface code, the leading quantum error-correction code. Our…
We show that the curvature of a positive relative line module over quantum projective space is given by $q$-integer deformation of its classical curvature. This generalises a result of Majid for the Podle\'s sphere.
The graph of a Hecke operator encodes all information about the action of this operator on automorphic forms. Let $X$ be a curve over $\mathbb{F}_q$, $F$ its function field and $\mathbb{A}$ the adele ring of $F$. In this paper we will…
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…
Visual-frame prediction is a pixel-dense prediction task that infers future frames from past frames. Lacking of appearance details, low prediction accuracy and high computational overhead are still major problems with current models or…
We prove that, when all elliptic curves over $\mathbb{Q}$ are ordered by naive height, a positive proportion have both algebraic and analytic rank one. It follows that the average rank and the average analytic rank of elliptic curves are…
I prove that for any complex projective variety $X$ and a sufficiently large integer $N$ all the fibers of Albanese map of the $N$-th configuration space of $X$ are dominated by smooth connected projective varieties with vanishing ${\rm…
We provide a construction for quantum codes (hermitian-self-orthogonal codes over GF(4)) starting from cyclic codes over GF(4^m). We also provide examples of these codes some of which meet the known bounds for quantum codes.
We explore the concept of projections of syzygies and prove two new technical results; we firstly give a precise characterization of syzygy schemes in terms of their projections, secondly, we prove a converse to Aprodu's Projection Theorem.…
We present a database of rational elliptic curves, up to Q-isomorphism, with good reduction outside {2,3,5,7,11,13}. We provide a heuristic involving the abc and BSD conjectures that the database is likely to be the complete set of such…
We study plane algebraic curves defined over a field k of arbitrary characteristic as coverings of the the projective line and the problem of enumerating branched coverings of $\mathbb{P}^{1}$ by using combinatorial methods.
This is a chapter in a forthcoming book on completely regular codes in distance regular graphs. The chapter provides an overview, and some original results, on codes in distance regular graphs which admit symmetries via a permutation group…
We establish a type of the Picard's theorem for entire curves in $P^n(\mathbb C)$ whose spherical derivative vanishes on the inverse images of hypersurface targets. Then, as a corollary, we prove that there is an union $D$ of finite number…
Basic algebraic and combinatorial properties of finite vector spaces in which individual vectors are allowed to have multiplicities larger than $ 1 $ are derived. An application in coding theory is illustrated by showing that multispace…
Let $A_q(n,d)$ be the maximum order (maximum number of codewords) of a $q$-ary code of length $n$ and Hamming distance at least $d$. And let $A(n,d,w)$ that of a binary code of constant weight $w$. Building on results from algebraic graph…
We develop a network coding technique based on flags of subspaces and a corresponding network channel model. To define error correcting codes we introduce a new distance on the flag variety, the Grassmann distance on flags and compare it to…
We continue work of Gekeler and others on elliptic curves over ${\mathbb F}_q(T)$ with conductor $\infty\cdot{\mathfrak n}$ where ${\mathfrak n}\in{\mathbb F}_q[T]$ has degree 3. Because of the Frobenius isogeny there are infinitely many…
In this paper, we prove that the world of near-vector spaces allows us to work with non-linear problems and yet, gives access to most of the tools linear algebra has to offer. We establish some fundamental results for near-vector spaces…