Related papers: There is no [21, 5, 14] code over F5
The number $N_9(5)$, the maximal number of $\mathbb{F}_9$-rational points on curves over $\mathbb{F}_9$ of genus $5$ is unknown, but it is known that $32 \le N_9(5)\le 35$. In this paper, we enumerate hyperelliptic curves and trigonal…
Does $14$ have a friend? Until now, this has been an open question. In this note, we prove that a potential friend $F$ of $14$ is an odd, non-square positive integer. $7$ appears in the prime factorization of $F$ with an even exponent while…
In this paper, we study the maximum number of edges in an $N$-vertex $r$-uniform hypergraph with girth $g$ where $g \in \{5,6 \}$. Writing $\textrm{ex}_r ( N, \mathcal{C}_{<g} )$ for this maximum, it is shown that $\textrm{ex}_r ( N ,…
In this paper we prove a conjecture that $D(4)$-quintuple does not exist using both classical and new methods. Also, we give a new version of the Rickert's theorem that can be applied on some $D(4)$-quadruples.
We prove that the conditions $\lambda<5/19$ and $L\le T^{1/2}$ in Theorems 3 and 4 of our recent paper "On the $p^{\lambda}$ problem" can be omitted.
We show that the maximum number of triples on $n$~points, if no three triples span at most five points, is $(1\pm o(1))n^2/5$. More generally, let $f^{(r)}(n;k,s)$ be the maximum number of edges of an $r$-uniform hypergraph on $n$~vertices…
Given a finite field F_q and a positive integer n, a flag is a sequence of nested F_q-subspaces of a vector space F_q^n and a flag code is a nonempty collection of flags. The projected codes of a flag code are the constant dimension codes…
In this note, we show that a part of [5, Remark 2.2] is not correct. Some conditions are given under which the same holds.
Recently, Pavese and Smaldore constructed graphs cospectral to $NU(5, q^2)$ for $q>2$. We show that their construction works for $NU(n, q^2)$, $n \geq 5$. Hence, none of the graphs $NU(n, q^2)$, $n \geq 5$, are determined by their spectrum.
This paper disproves a conjecture of Wang, Wu, Yan and Xie, and answers in negative a question in Dvorak, Pekarek and Sereni. In return, we pose five open problems.
In this work, we modify the decoding algorithm for subspace codes by Koetter and Kschischang to get a decoding algorithm for (generalized) twisted Gabidulin codes. The decoding algorithm we present applies to cases where the code is linear…
The problem of finding quantum error-correcting codes is transformed into the problem of finding additive codes over the field GF(4) which are self-orthogonal with respect to a certain trace inner product. Many new codes and new bounds are…
We describe computer programs accompanying our paper and show that running them suffices to verify Fuglede's conjecture in $\mathbb{Z}_2^5$ and $\mathbb{Z}_2^6$.
We show that any planar graph $G=(V,E)$ has a 5-coloring such that one color class contains at most $|V|/6$ vertices. In other words, there exists a partition of $V$ into five independent sets $\{V_1, \cdots, V_5\}$ such that $|V_5| \leq…
Using an explicit resolution of the diagonal for the variety V_5, we provide cohomological characterizations of the universal and quotient bundles. A splitting criterion for bundles over V_5 is also proved. The presentation of semistable…
Let $\mathcal{F}$ be a set of graphs. The planar Tur\'an number, $ex_{\mathcal{P}}(n,\mathcal{F})$, is the maximum number of edges in an $n$-vertex planar graph which does not contain any member of $\mathcal{F}$ as a subgraph. In this…
It is the purpose of this note to classify connected quandles up to order 14, and in particular to show that there is no connected quandle of order 14.
We prove that the equation ${ (x - y)^4 + x^4 + (x + y)^4 = z^n }$ has no integer solutions ${ x, y, z}$ with ${ \gcd(x, y) = 1 }$ for all integers ${ n > 1 }$. We mainly use a modular approach with two Frey ${ \mathbb{Q} }$-curves defined…
In this paper, we show that an extremal Type II $\ZZ_{2k}$-code of length $n$ dose not exist for all sufficiently large $n$ when $k=2,3,4,5,6$.
In recent years, many connections have been made between minimal codes, a classical object in coding theory, and other remarkable structures in finite geometry and combinatorics. One of the main problems related to minimal codes is to give…