相关论文: Thirty-six Officers and their Code
We apply an improvement of the Delsarte LP-bound to give a new proof of the non-existence of finite projective planes of order 6, and uniqueness of finite projective planes of order 7. The proof is computer aided, and it is also feasible to…
The existence of an extremal code of length 72 is a long-standing open problem. Let C be a putative extremal code of length 72 and suppose that C has an automorphism g of order 6. We show that C, as an F_2<g>-module, is the direct sum of…
With the help of a computer, we prove the assertion made in the title.
This report gives an overview of the history of finite projective planes and their properties before going on to outline the proof that no projective plane of order 10 exists. The report also investigates the search carried out by…
We present a proof, which is conditional on the Birch and Swinnerton-Dyer Conjecture for a specific abelian variety, that there do not exist rational numbers x and c such that x has exact period N = 6 under the iteration x |-> x^2 + c. This…
In this paper we prove that there cannot exist a perfect Euler box with a semiprime side. We first display the proof, which uses nothing more than elementary number theory. Due to the elementary nature of this proof, it is possible that…
In this paper, we prove that the largest pure partial plane of order 6 has size 25. At the same time, we classify all pure partial planes of order 6 and size 25 up to isomorphism. Our major approach is computer search. The search space is…
This is the TeX version of the {\it Mathematica} file used to prove there is no Type II binary code with parameters [72, 36, 16] or [96, 48, 20].
Given a family of complex affine planes, we show that it is trivial over a Zariski open subset of the base. The proof relies upon a relative version of the contraction theorem.
We prove that a putative $[72,36,16]$ code is not the image of linear code over $\ZZ_4$, $\FF_2 + u \FF_2$ or $\FF_2+v\FF_2$, thus proving that the extremal doubly even $[72,36,16]$-binary code cannot have an automorphism group containing a…
We prove that every simple graph of order 12 which has minimum degree 6 contains a K_6 minor.
The problem of finding perfect Euler cuboids or proving their non-existence is an old unsolved problem in mathematics. The second cuboid conjecture is one of the three propositions suggested as intermediate stages in proving the…
Recently, the authors of the present work (together with M. N. Kolountzakis) introduced a new version of the non-commutative Delsarte scheme and applied it to the problem of mutually unbiased bases. Here we use this method to investigate…
In this note we show that there are no real configurations of $d\geq 4$ lines in the projective plane such that the associated Kummer covers of order $3^{d-1}$ are ball-quotients and there are no configurations of $d\geq 4$ lines such that…
The problem of finding perfect Euler cuboids or proving their non-existence is an old unsolved problem in mathematics. The third cuboid conjecture is the last of the three propositions suggested as intermediate stages in proving the…
We give a proof of Ollinger's conjecture that the problem of tiling the plane with translated copies of a set of $8$ polyominoes is undecidable. The techniques employed in our proof include a different orientation for simulating the Wang…
Let G be a compact real Lie group, and let f be an irreducible complex character of G, of degree > 1. We show that there exists an element g of G, of finite order, such that f(g)=0. We also give an unpublished result of Deligne, about…
We provide proofs for the fact that certain orders have no descending chains and no antichains.
For all finite fields of order up to $2^{30}$, we computationally prove that there are no planar monomials besides the ones already known.
We describe a method to show a plane quartic over a number field has no rational points. The method can be adapted to show that a curve does not have divisors of degree 1 or 2 and can be generalized to arbitrary smooth projective curves.…