Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1707.02208

The properties of bordered matrix of symmetric block design

Mingchun Xu
View original source ↗Read source document ↗Export metadata ↓

Abstract

An incidence structure consists simply of a set P of points and a set B of blocks, with a relation of incidence between points and blocks.A symmetric (v,k,\lambda) block design is the subject of this paper. The symmetric (n^2+n+1, n+1,1) block design is a projective plane of order n. Despite much research no one has uncovered any further necessary conditions for the existence of a symmetric (v,k,\lambda) design apart from the equation (v-1)\lambda=k(k-1), Schutzenberger's Theorem and the Bruck-Ryser-Chowla Theorem. For no (v,k,\lambda) satisfying these requirements has it been shown that a symmetric (v,k,\lambda) design does not exist. Projective planes of order n exist for all prime powers n (aside from PG(2,n) a host of other constructions are known ) but for no other n is a construction known. The first open values are n=10, 12, 15, 18, 20, 24, 26$ and 28. It was proved by a computer search that there does not exist any projective plane of order 10 by Lam, C.W.H., Thiel, L. and Swiercz, S. Whether there exists any projective plane of order 12 is still open.The author introduces the bordered matrix of a (v,k,\lambda) symmetric design and gives some new necessary conditions for the existence of the symmetric (v,k,\lambda) design. As their application it is easy to determine that there does not exist finite projective plane of order n if n is one of the first open values 10, 12, 15, 18, 20, 24, 26 and 28, for which the Bruck-Ryser-Chowla Theorem can not be used. For large n the new method is also valid. Also some symmetric designs are excluded by the new method.

Explore related subjects

math.GM

Keep this discovery

BibTeXRIS

Mingchun Xu. 2017-07-05. The properties of bordered matrix of symmetric block design. https://arxiv.org/abs/1707.02208

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Average Chord Lengths in a Triangle

Let $P$ be a point inside a triangle $T$. We consider the average length of the chords of $T$ through $P$, where the direction of the chord is chosen uniformly. An elementary formula is obtained in terms of the distances from $P$ to the sides and vertices of the triangle. Several classical triangle centers give especially simple specializations. For example, if $I$ is the incenter, then \[ M_T(I)=\frac{2r}{\pi} \log\left(\cot\frac A4\cot\frac B4\cot\frac C4\right). \] Our main result is the sharp inequality \[ M_T(P)\le \frac{p}{\pi\sqrt3}\log(2+\sqrt3), \] valid simultaneously for every triangle of perimeter $p$ and every interior point $P$. Thus, among all such pairs $(T,P)$, the largest possible average chord length occurs only when $T$ is equilateral and $P$ is its center. The proof is an elementary symmetrization argument. We close with brief remarks relating the problem to the radial center of a convex body, the electrostatic potential center of a triangle, and dual quermassintegrals.

math.GM↗
arXiv2026

A Proof of Liu's Conjecture on the Fundamental Triangle Inequality

Let $a,b,c$ be the side lengths of a triangle, and let $R$ and $r$ denote its circumradius and inradius, respectively. We prove a conjecture of Liu stating that \[\sum_{\mathrm{cyc}} \left(\frac{a(b+c-a)}{bc}\right)^k \geq 2+\left(\frac{2r}{R}\right)^k,~~k>1, \] with the reverse inequality for $0<k<1$. The proof reduces the problem to three positive variables with fixed sum and product. We also determine the equality cases.

math.GM↗