Related papers: Nodal surfaces in $\mathbb{P}^3$ and coding theory
We show the existence of 112 non-singular rational curves on the supersingular K3 surface with Artin invariant 1 in characteristic 3 by several ways. Using these rational curves, we have a $(16)_{10}$-configuration and a $(280_{4},…
We describe smooth rational projective algebraic surfaces over an algebraically closed field of characteristic different from 2 which contain $n \ge \b_2-2$ disjoint smooth rational curves with self-intersection -2, where $\b_2$ is the…
We classify all the possible configurations of singular fibers and the torsion parts of Mordell-Weil groups of complex elliptic K3 surfaces. The complete list of 3279 configurations is attached.
We introduce the notion of p-adic spherical codes (in particular, p-adic kissing number problem). We show that the one-line proof for a variant of the Delsarte-Goethals-Seidel-Kabatianskii-Levenshtein upper bound for spherical codes,…
We prove the sharp bound of at most 64 lines on complex projective quartic surfaces (resp. affine quartics) that are not ruled by lines. We study configurations of lines on certain non-K3 surfaces of degree four and give various examples of…
Given an elliptic surface $\mathcal{E}\to\mathcal{C}$ over a field $k$ of characteristic zero equipped with zero section $O$ and another section $P$ of infinite order, we give a simple and explicit upper bound on the number of points where…
We prove that a component of the closure of the set of star points on a hypersurface X of degree d>2 in N-dimensional projective space is linear. Afterwards, we focus on the case where the component is of maximal dimension N-2 and the case…
We consider a class of discontinuous piecewise linear differential systems in $\mathbb{R}^3$ with two pieces separated by a plane. In this class we show that there exist differential systems having: a unique limit cycle, a unique…
The Upper Bound Theorem for convex polytopes implies that the $p$-th Betti number of the \v{C}ech complex of any set of $N$ points in $\mathbb R^d$ and any radius satisfies $\beta_{p} = O(N^{m})$, with $m = \min \{ p+1, \lceil d/2 \rceil…
The linear saturation number $sat^{lin}_k(n,\mathcal{F})$ (linear extremal number $ex^{lin}_k(n,\mathcal{F})$) of $\mathcal{F}$ is the minimum (maximum) number of hyperedges of an $n$-vertex linear $k$-uniform hypergraph containing no…
We study the biregular and birational geometry of degree 6 del Pezzo surfaces with Picard number 1, defined over an arbitrary perfect field. Using Galois cohomology techniques, we obtain an explicit description of cocycles for such surfaces…
We show that a knot in $S^3$ with an infinite number of distinct incompressible Seifert surfaces contains a closed incompressible surface in its complement.
For the past decades, linear codes with few weights have been widely studied, since they have applications in space communications, data storage and cryptography. In this paper, a class of binary linear codes is constructed and their weight…
Determining the maximum number of edges in an intersecting hypergraph on a fixed ground set under additional constraints is one of the central topics in extremal combinatorics. In contrast, there are few results on analogous problems…
We prove the factoriality of a nodal hypersurface in $\mathbb{P}^{4}$ of degree $d$ that has at most $2(d-1)^{2}/3$ singular points, and factoriality of a double cover of $\mathbb{P}^{3}$ branched over a nodal surface of degree $2r$ having…
It is proved that the rectilinear crossing number of every graph with bounded tree-width and bounded degree is linear in the number of vertices. **** This paper has been withdrawn by the author. **** The results have been superseeded by the…
The Hodge numbers of generic elliptically fibered Calabi-Yau threefolds over toric base surfaces fill out the "shield" structure previously identified by Kreuzer and Skarke. The connectivity structure of these spaces and bounds on the Hodge…
Linear codes with few weights have applications in secrete sharing, authentication codes, association schemes, and strongly regular graphs. In this paper, several classes of $p$-ary linear codes with two or three weights are constructed…
We study the construction of quasi-cyclic self-dual codes, especially of binary cubic ones. We consider the binary quasi-cyclic codes of length 3\ell with the algebraic approach of [9]. In particular, we improve the previous results by…
We give new proofs of asymptotic upper bounds of coding theory obtained within the frame of Delsarte's linear programming method. The proofs rely on the analysis of eigenvectors of some finite-dimensional operators related to orthogonal…