Related papers: There is no [21, 5, 14] code over F5
We give new arguments that improve the known upper bounds on the maximal number N_q(g) of rational points of a curve of genus g over a finite field F_q for a number of pairs (q,g). Given a pair (q,g) and an integer N, we determine the…
A graph $G=(V,E)$ is called a unit-distance graph in the plane if there is an injective embedding of $V$ in the plane such that every pair of adjacent vertices are at unit distance apart. If additionally the corresponding edges are…
We present improved algorithms for computing the left factorial residues $!p=0!+1!+...+(p-1)! \!\mod p$. We use these algorithms for the calculation of the residues $!p\!\mod p$, for all primes $p$ up to $2^{40}$. Our results confirm that…
We show that topological mixing, weak mixing and total transitivity are equivalent for coded systems. We provide an example of a mixing coded system which cannot be approximated by any increasing sequence of mixing shifts of finite type,…
Ternary constant weight codes of length $n=2^m$, weight $n-1$, cardinality $2^n$ and distance $5$ are known to exist for every $m$ for which there exists an APN permutation of order $2^m$, that is, at least for all odd $m \geq 3$ and for…
Let $G$, $H$ and $K$ represent three graphs without loops or parallel edges and $n$ represent an integer. Given any red blue coloring of the edges of $G$, we say that $K \rightarrow (G,H)$, if there exists red copy of $G$ in $K$ or a blue…
In this paper, a family of cyclic codes over $\mathbb{F}_{p}$ whose duals have five zeros is presented, where $p$ is an odd prime. Furthermore, the weight distributions of these cyclic codes are determined.
The famous F5 algorithm for computing Gr\"obner basis was presented by Faug\`ere in 2002 without complete proofs for its correctness. The current authors have simplified the original F5 algorithm into an F5 algorithm in Buchberger's style…
For various quadruple systems F, we give asymptotically sharp lower bounds on the number of copies of F in a quadruple system with a prescribed number of vertices and edges. Our results extend those of Furedi, Keevash, Pikhurko, Simonovits…
It is shown that there are no non-trivial fifth-, seventh-, eleventh-, thirteenth- or seventeenth powers in the Fibonacci sequence. For eleventh, thirteenth- and seventeenth powers an alternative (to the usual exhaustive check of products…
We provide a simple proof for a complementary pair of group codes over a finite non-commutative Frobenius ring of the fact that one of them is equivalent to the other one. We also explore this fact for checkeable codes over the same type of…
An identifying code $C$ of a graph $G$ is a dominating set of $G$ such that any two distinct vertices of $G$ have distinct closed neighbourhoods within $C$. These codes have been widely studied for over two decades. We give an improvement…
We prove that on $\mathbb{P}^{3}$ there is no exceptional bundle with rank $r=2d^{2}+1$ and degree $d$ for every $|d|\geq 4$. In particular, we find a new obstruction for the existence of exceptional bundles other than $r|(2d^{2}+1)$. We…
In a research seminar in $2006$, M. Filaseta, O. Trifonov, and G. Yu showed for each integer $n\geq3$ there is no distinct covering with all moduli in the interval $[n, 6n]$. In $2022$, this interval was subsequently improved to $[n, 8n]$…
Non-malleable code is a relaxed version of error-correction codes and the decoding of modified codewords results in the original message or a completely unrelated value. Thus, if an adversary corrupts a codeword then he cannot get any…
For a graph $G$ the expression $G \overset{v}{\rightarrow} (a_1, ..., a_s)$ means that for every $s$-coloring of the vertices of $G$ there exists $i \in \{1, ..., s\}$ such that there is a monochromatic $a_i$-clique of color $i$. The vertex…
We show that for two afii varieties over an arbitrary field of characteristic zero, there is no general form of an algorithm for checking the presence of an embedding of one algebraic variety in another. Moreover, we establish this for…
Using modularity, level lowering, and explicit computations with Hilbert modular forms, Galois representations and ray class groups, we show that for $3 \le d \le 23$ squarefree, $d \ne 5$, $17$, the Fermat equation $x^n+y^n=z^n$ has no…
J. L. Andersen proved that there is 5-torsion in the bottom nonvanishing homology group of the simplicial complex of graphs of degree at most two on seven vertices. We use this result to demonstrate that there is 5-torsion also in the…
We present a construction of 1-perfect binary codes, which gives a new lower bound on the number of such codes. We conjecture that this lower bound is asymptotically tight.