Related papers: Construction of Rational Surfaces Yielding Good Co…
We give uniform upper bounds for the number of rational points of height at most $B$ on non-singular complete intersections of two quadrics in $\mathbb{P}^3$ defined over $\mathbb{Q}$. To do this, we combine determinant methods with descent…
In the field of algebraic geometric codes (AG codes), the characterization of dual codes has long been a challenging problem which relies on differentials. In this paper, we provide some descriptions for certain differentials utilizing…
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…
We prove that any smooth cubic surface defined over any number field satisfies the lower bound predicted by Manin's conjecture possibly after an extension of small degree.
The blown up complex projective plane in the twelve triple points of the dual Hesse arrangement has an infinite number of irreducible rational curves of self-intersection $-1$, for short, $(-1)$-curves. In the preprint version of [Dumnicki,…
A fundamental problem in quantum coding theory is to determine the maximum size of quantum codes of given block length and distance. A recent work introduced bounds based on semidefinite programming, strengthening the well-known quantum…
We discuss the problem of existence of rational curves on a certain del Pezzo surface from a computational point of view and suggest a computer algorithm implementing search. In particular, our computations reveal that the surface contains…
Caro and Pasten gave an explicit upper bound on the number of rational points on a hyperbolic surface that is embedded in an abelian variety of rank at most one. We show how to use their method to produce a refined bound on the number of…
In this paper, we consider the hull of an algebraic geometry code, meaning the intersection of the code and its dual. We demonstrate how codes whose hulls are algebraic geometry codes may be defined using only rational places of Kummer…
We consider the problem of counting the number of rational points on the family of Kummer surfaces associated with two non-isogenous elliptic curves. For this two-parameter family we prove Manin's unity, using the presentation of the Kummer…
All binary plane curves of degree less than 7 are examined for curves with a large number of Fq rational points on their smooth model, for q = 2^m ; m = 3, 4,...,11. Previous results are improved, and many new curves are found meeting or…
We give a novel and effective criterion for algebraicity of rational normal analytic surfaces constructed from resolving the singularity of an irreducible curve-germ on $CP^2$ and contracting the strict transform of a given line and all but…
We introduce tile codes, a simple yet powerful way of constructing quantum codes that are local on a planar 2D-lattice. Tile codes generalize the usual surface code by allowing for a bit more flexibility in terms of locality and stabilizer…
We show under the assumption that the Tate-Shafarevich group of any elliptic curve over the rational numbers is finite that the cubic surface $x_1^3 + p_1p_2x_2^3 + p_2p_3x_3^3 + p_3p_1x_4^3 = 0$ has a rational point, where $p_1, p_2$ and…
We develop explicit techniques to investigate algebraic quasi-hyperbolicity of singular surfaces through the constraints imposed by symmetric differentials. We apply these methods to prove that rational curves on Barth's sextic surface,…
A rational elliptic surface with section is a smooth, rational, complex, projective surface $\mathcal{X}$ that admits a relatively minimal fibration $f: \mathcal{X}\longrightarrow \bbP^1$ such that its general fibre is a smooth irreducible…
Minimal linear codes are in one-to-one correspondence with special types of blocking sets of projective spaces over a finite field, which are called strong or cutting blocking sets. In this paper we prove an upper bound on the minimal…
The set of all error-correcting codes C over a fixed finite alphabet F of cardinality q determines the set of code points in the unit square with coordinates (R(C), delta (C)):= (relative transmission rate, relative minimal distance). The…
In this article we present a characterization of elliptic curves defined over a finite field Fq which possess a rational subgroup of order three. There are two posible cases depending on the rationality of the points in these groups. We…
We estimate optimal thresholds for surface code in the presence of loss via an analytical method developed in statistical physics. The optimal threshold for the surface code is closely related to a special critical point in a…