Related papers: Solution of the [72, 36,16] Problem

We present a new duality theory for non-convex variational problems, under possibly mixed Dirichlet and Neumann boundary conditions. The dual problem reads nicely as a linear programming problem, and our main result states that there is no…

A set of quantum error correcting codes based on classical Reed-Muller codes is described. The codes have parameters [[n,k,d]] = [[2^r, 2^r - C(r,t) - 2 sum_{i=0}^{t-1} C(r,i), 2^t + 2^{t-1} ]].

It is sufficient to prove that there is an excess of prime factors in the product of repunits with odd prime bases defined by the sum of divisors of the integer $N=(4k+1)^{4m+1}\prod_{i=1}^\ell ~ q_i^{2\alpha_i}$ to establish that there do…

Free binary systems are shown to not admit idempotent means. This refutes a conjecture of the author. It is also shown that the extension of Hindman's theorem to nonassociative binary systems formulated and conjectured by the author is…

A difference set with parameters $(v, k, \lambda)$ is a subset $D$ of cardinality $k$ in a finite group $G$ of order $v$, such that the number $\lambda$ of occurrences of $g \in G$ as the ratio $d^{-1}d'$ in distinct pairs $(d, d')\in…

Let $\eta$ be a quadratic irrationality. The variant of a ternary problem of Goldbach involving primes such that $a<\{\eta p\}<b$, where $a$ and $b$ are arbitrary numbers of the interval $(0,1)$, solved in this paper.

We show that it is possible to algorithmically verify if a given pattern sequence is noncorrelated. As an application, we compute that there are exactly $2272$ noncorrelated binary pattern sequences of length $\leq 4$. If we restrict our…

We show that, in general, there is no degree corresponding to the composition of two problems in the computable reducibility lattice.

We classify 8-divisible binary linear codes with minimum distance 24 and small length. As an application we consider the codes associated to nodal sextics with 65 ordinary double points.

Much work has been done to identify which binary codes can be represented by collections of open convex or closed convex sets. While not all binary codes can be realized by such sets, here we prove that every binary code can be realized by…

We prove that suitable asymptotic formulae in short intervals hold for the problems of representing an integer as a sum of a prime and a square, or a prime square. Such results are obtained both assuming the Riemann Hypothesis and in the…

We introduce {\bf complementary information set codes} of higher-order. A binary linear code of length $tk$ and dimension $k$ is called a complementary information set code of order $t$ ($t$-CIS code for short) if it has $t$ pairwise…

The (bitwise) complement $\overline{x}$ of a binary word $x$ is obtained by changing each $0$ in $x$ to $1$ and vice versa. An $\textit{antisquare}$ is a nonempty word of the form $x\, \overline{x}$. In this paper, we study infinite binary…

In this paper, we study the residue codes of extremal Type II Z_4-codes of length 24 and their relations to the famous moonshine vertex operator algebra. The main result is a complete classification of all residue codes of extremal Type II…

In 2002, F. Luca and G. Walsh solved the Diophantine equation in the title for all pairs (a,b) such that 1<a<b<101 with some exceptions. There are sixty nine exceptions. In this paper, we give some new results concerning the equation in the…

We study the properties of the constructive linear programing problems. The parameters of linear functions in such problems are constructive real numbers. To solve such a problem is to find the optimal plan with the constructive real number…

Selection of 25 examples from extensive nontrivial families for different types of nonlinear PDEs and their formal general solutions are given. The main goal here is to show on examples the types of solvable PDEs and what their general…

We consider the algebra of invariants of binary forms of degree 9 with complex coefficients, find the 92 basic invariants, give an explicit system of parameters and show the existence of four more systems of parameters with different sets…

Using the computational algebra system GAP (http://www.gap-system.org) and the GAP package LAGUNA (http://www.cs.st-andrews.ac.uk/~alexk/laguna.htm), we checked that all 2-groups of order not greater than 32 are determined by normalized…

We focus on the second part of Hilbert's 16th problem and provide an upper bound on the number of limit cycles that a polynomial, differential, planar system may have, depending exclusively on the degree $n$ of the system. Such a bound…