Related papers: Equiangular lines in low dimensional Euclidean spa…
This paper deals with the problem of increasing the minimum distance of a linear code by adding one or more columns to the generator matrix. Several methods to compute extensions of linear codes are presented. Many codes improving the…
All finite sets of equiangular lines spanning finite-dimensional unitary spaces are determined for which the action on the lines of the set-stabilizer in the unitary group is 2-transitive with a regular normal subgroup.
We show, in this second part, that the maximal number of singular points of a quartic surface $X \subset \mathbb{P}^3_K$ defined over an algebraically closed field $K$ of characteristic 2 is at most 14, and that, if we have 14…
Linear codes with small hulls over finite fields have been extensively studied due to their practical applications in computational complexity and information protection. In this paper, we develop a general method to determine the exact…
The construction of optimal line packings in real or complex Euclidean spaces has shown to be a tantalizingly difficult task, because it includes the problem of finding maximal sets of equiangular lines. In the regime where equiangular…
The V_4-lines for each linearly normal space elliptic curve form the edges of a tetrahedron, however in case the elliptic curve has j=12^3, there exist Z_4-lines in addition. We show the arrangement of V_4 and Z_4-lines explicitly for the…
Bollob\'as-type theorem determines the maximum cardinality of a Bollob\'as system of sets. The original result has been extended to various mathematical structures beyond sets, including vector spaces and affine spaces. This paper…
The resolutions and maximal sets of compatible resolutions of all 2-(120,8,1) designs arising frommaximal (120,8)-arcs in the known projective planes of order 16 are computed. It is shown that each of these designs is embeddable in a unique…
We classify all cubic systems possessing the maximum number of invariant straight lines (real or complex) taking into account their multiplicities. We prove that there are exactly 23 topological different classes of such systems. For every…
A basic problem for constant dimension codes is to determine the maximum possible size $A_q(n,d;k)$ of a set of $k$-dimensional subspaces in $\mathbb{F}_q^n$, called codewords, such that the subspace distance satisfies…
In this paper, we propose a general construction of linear perfect codes over infinite skew fields and quasi skew fields with right (left) unity. A complete classification of such codes over associative skew fields is given. Since the…
We present a mini-review of present constraints of the large extra dimension scenario. We show many experiments and considerations that can constrain the fundamental scale of the large extra dimension. We observe that constraints come from…
The kissing number problem asks for the maximal number k(n) of equal size nonoverlapping spheres in n-dimensional space that can touch another sphere of the same size. This problem in dimension three was the subject of a famous discussion…
In this paper, we mainly study quaternary linear codes and their binary subfield codes. First we obtain a general explicit relationship between quaternary linear codes and their binary subfield codes in terms of generator matrices and…
This paper addresses to the problem of finding the (minimum) Euclidean distance between two linear varieties. This problem is, usually, solved minimising a target function. We propose a novel approach: to use the Moore-Penrose generalised…
We describe the singularities and related properties of the arrangement of 21 reducible polars of Klein's quartic, containing Klein's well-known arrangement of $21$ lines.
New bounds on the number of similar or directly similar copies of a pattern within a finite subset of the line or the plane are proved. The number of equilateral triangles whose vertices all lie within an $n$-point subset of the plane is…
A code $C \subseteq \{0, 1, 2\}^n$ of length $n$ is called trifferent if for any three distinct elements of $C$ there exists a coordinate in which they all differ. By $T(n)$ we denote the maximum cardinality of trifferent codes with length.…
We adapt linear programming methods from sphere packings to closed hyperbolic surfaces and obtain new upper bounds on their systole, their kissing number, the first positive eigenvalue of their Laplacian, the multiplicity of their first…
We develop a new approach to address some classical questions concerning the size and structure of integer distance sets. Our main result is that any integer distance set in the Euclidean plane is either very sparse or has all but an…