The completion of the classification of the regular near octagons with thick quads

Brouwer and Wilbrink [3] showed the nonexistence of regular near octagons whose parameters s, t₂, t₃ and t satisfy s ≥ 2, t₂ ≥ 2 and t₃ ≠ t₂(t₂+1). Later an arithmetical error was discovered in the proof. Because of this error, the existence problem was still open for the near octagons corresponding with certain values of s, t₂ and t₃. In the present paper, we will also show the nonexistence of these remaining regular near octagons. MSC2000 05B25, 05E30, 51E12 Postdoctoral Fellow of the Research Foundation - Flanders     

The Regular Near Polygons of Order (s, 2)

In this note we classify the regular near polygons of order (s, 2).     

A Higman-Haemers Inequality for Thick Regular Near Polygons

In this note we will generalize the Higman-Haemers inequalities for generalized polygons to thick regular near polygons.     

Some Extensions and Embeddings of Near Polygons

Let (P, L, *) be a near polygon having s + 1 points per line, s > 1, and suppose k is a field. Let V _k be the k-vector space with basis Then the subspace generated by the vectors , where l L, has codimension at least 2 in V _k.This observation is used in two ways. First we derive the existence of certain diagram geometries with flag transitive automorphism group, and secondly, we show that any finite near polygon with 3 points per line can be embedded in an affine GF(3)-space.     

正多边形的最优分割问题

记平面边长为1的正m边形为S_m,将S_m剖分成n块:S_(m1),S_(m2),…,S_(mn),这样的剖分称S_m的n剖分,并以T(m,n)表示.以d_(mi)表示区域S_(mi)(i=1,2,…,n)的直径(即区域S_(mi)任意两点之间距离的最大者).记D(m,n)=max{d_(m1),d_(m2),…,d_(mn)}及Ψ(m,n)=■{D(m,n)}.本文将估计Ψ(m,n)的上下界.证明Ψ(6,3)=3/2,Ψ(6,4)=3-3~(1/2),Ψ(6.6)=1,Ψ(6,7)=3/2,估计Ψ(6,n)的渐进性.提出几个猜想.     

The Non-Collinearity Graph of the O+(8,2) Quadric Is Uniquely Geometrisable

The graph of the titlehas the points of the O⁺(8,2) polar space as itsvertices, two such vertices being adjacent iff the correspondingpoints are non-collinear in the polar space. We prove that, uptoisomorphism, there is a unique partial geometry pg(8,7,4)whose point graph is this graph. This is the partial geometryof Cohen, Haemers and Van Lint and De Clerck, Dye and Thas. Ouruniqueness proof shows that this geometry has a subgeometry isomorphicto the affine plane of order three, and the geometry is canonicallydescribeable in terms of this affine plane.     

一类(a+1,3)型的距离正则图

设Γ是直径为d且型为(α 1,3)的距离正则图,其中α≥2.用l(c,a,b)表示交叉阵列l(Γ)中列(c,a,b)~t的个数,记r=r(Γ)=l(c_1,a_1,b_1),s=s(Γ)=l(c_(r 1),a(r 1),b_(r 1)).那末,若c_(r 1)=3且a_(r 1)=3a,则d=r s 1,c_d=4且Γ为正则拟2d边形.     

An exact construction of digital convex polygons with minimal diameter

Given a natural number n, an exact formula is derived for the minimal possible size MD(n) of a square grid, in which a digital convex n-gon can be inscribed. An exact construction of a digital convex n-gon which can be inscribed into a square grid of size MD(n) is also given.     

Computing optimal islands

Let S be a bicolored set of n points in the plane. A subset I of S is an island if there is a convex set C such that I=C∩S. We give an O(n³)-time algorithm to compute a monochromatic island of maximum cardinality. Our approach is adapted to optimize similar (decomposable) objective functions. Finally, we use our algorithm to give an O(logn)-approximation for the problem of computing the minimum number of convex polygons that cover a class region.     

Nested regular polygon solutions for planar 2N-body problems

In this paper we study the necessary conditions for the masses of the nested regular polygon solutions of the planar 2N-body problem.We prove that the masses at the vertices of each regular polygon must be equal to each other.     

Periodic solutions for planar 2N-body problems

In this paper we study some necessary conditions and sufficient conditions for the nested polygonal solutions of planar 2N-body problems.

     

A Family of Geometries Related to the Suzuki Tower

ABSTRACT

Michio Suzuki constructed a sequence of five simple groups G _i , with i = 0,…, 4, and five graphs Δ _i , with i = 0,…, 4, such that Δ _i appears as a subgraph of Δ _i+1 for i = 0,…, 3 and G _i is an automorphism group of Δ _i for i = 0,…, 4. The largest group G ₄ was a new sporadic group of order 448 345 497 600. It is now called the Suzuki group Suz. These groups and graphs form what Jacques Tits calls the Suzuki tower. In a previous work, we constructed a rank four geometry Γ(HJ) on which the Hall-Janko sporadic simple group acts flag-transitively and residually weakly primitively. In this article, we show that Γ(HJ) belongs to a family of five geometries in bijection with the Suzuki tower. The largest of them is a geometry of rank six, on which the Suzuki sporadic group acts flag-transitively and residually weakly primitively.     

On Strongly Regular Graphs with k=2μ and Their Extensions

We obtain a convenient expression for the parameters of a strongly regular graph with k=2 in terms of the nonprincipal eigenvalues x and –y. It turns out in particular that such graphs are pseudogeometric for pG _x(2x,y–1). We prove that a strongly regular graph with parameters (35,16,6,8) is a quotient of the Johnson graph (8,4). We also find the parameters of strongly regular graphs in which the neighborhoods of vertices are pseudogeometric graphs for pG _x(2x,t),x3. In consequence, we establish that a connected graph in which the neighborhoods of vertices are pseudogeometric graphs for pG ₃(6,2) is isomorphic to the Taylor graph on 72 vertices or to the alternating form graph Alt(4,2) with parameters (64,35,18,20).     

正多边形的最优染色分割问题

任意将边长为1的正m边形及其内部每点染n种颜色Y1,Y2,…,Yn中的一种颜色.分别记染色为Y1,Y2,…,Yn的点组成的集合为Sm 1,Sm 2,…,Sm n,这样的剖分称为Sm的n-染色剖分,并以T(m,n)表示.以dm i表示集合Sm i(i=1,2,…,n)的直径.记D(m,n)=m ax{dm 1,dm 2,…,dm n}及θ(m,n)=in fT(m,n){D(m,n)}.证明了θ(6,2)=132,θ(6,3)=32,θ(6,4)=3-3.最后提出了猜想和问题.