相关论文: A Nonexistence Certificate for Projective Planes o…

In the 1970s and 1980s, searches performed by L. Carter, C. Lam, L. Thiel, and S. Swiercz showed that projective planes of order ten with weight 16 codewords do not exist. These searches required highly specialized and optimized computer…

In 1983, a computer search was performed for ovals in a projective plane of order ten. The search was exhaustive and negative, implying that such ovals do not exist. However, no nonexistence certificates were produced by this search, and to…

In 1989, computer searches by Lam, Thiel, and Swiercz experimentally resolved Lam's problem from projective geometry$\unicode{x2014}$the long-standing problem of determining if a projective plane of order ten exists. Both the original…

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 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…

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 paper we present the results from a program developed by the author that finds the unitals of the known 193 projective planes of order 25.. There are several planes for which we have not found any unital. One or more than one…

The minimum weight of the code generated by the incidence matrix of points versus lines in a projective plane has been known for over 50 years. Surprisingly, finding the minimum weight of the dual code of projective planes of non-prime…

This paper gives a novel approach to analyze SAT problem more deeply. First, I define new elements of Boolean formula such as dominant variable, decision chain, and chain coupler. Through the analysis of the SAT problem using the elements,…

For typical first-order logical theories, satisfying assignments have a straightforward finite representation that can directly serve as a certificate that a given assignment satisfies the given formula. For non-linear real arithmetic…

We study the structure of satisfying assignments of a random 3-SAT formula. In particular, we show that a random formula of density 4.453 or higher almost surely has no non-trivial "core" assignments. Core assignments are certain partial…

We prove the #P-hardness of the counting problems associated with various satisfiability, graph and combinatorial problems, when restricted to planar instances. These problems include \begin{romannum} \item[{}] {\sc 3Sat, 1-3Sat, 1-Ex3Sat,…

In this paper we focus our attention on a family of finite geometry codes, called type-I projective geometry low-density parity-check (PG-LDPC) codes, that are constructed based on the projective planes PG{2,q). In particular, we study…

The robustness and correctness of SAT solvers are receiving more and more attention. In recent SAT competitions, a proof of unsatisfiability emitted by SAT solvers must be checked. So far, no proof checker has been efficient for every case.…

We present a novel propositional proof tracing format that eliminates complex processing, thus enabling efficient (formal) proof checking. The benefits of this format are demonstrated by implementing a proof checker in C, which outperforms…

We observe that Hall's free projective extension $P \mapsto F(P)$ of partial planes is a Borel map, and use a modification of the construction introduced in [9] to conclude that the class of countable non-Desarguesian projective planes is…

The problem of estimating the proportion of satisfiable instances of a given CSP (constraint satisfaction problem) can be tackled through weighting. It consists in putting onto each solution a non-negative real value based on its…

In this paper we find projective plane models of $X_0(N)$ by constructing maps from $X_0(N)$ to the projective plane using modular forms. We use eta-quotients of weight 12. We find those eta-quotients of weight 12 which have maximal order…

This note considers checking satisfiability of sets of propositional clauses (SAT instances). It shows that "unipolar sets" of clauses (containing no positive or no negative clauses) provide an "early sign" of satisfiability of SAT…

A fake projective plane is a smooth complex surface which is not the complex projective plane but has the same Betti numbers as the complex projective plane. The first example of such a surface was constructed by David Mumford in 1979 using…