This content was uploaded by our users and we assume good faith they have the permission to share this book. If you own the copyright to this book and it is wrongfully on our website, we offer a simple DMCA procedure to remove your content from our site. Start by pressing the button below!
O, and is "large enough relative to c " , then every k-arc i s contained in a conic, 5) if C is complete, then its secants fill up the plane, i.e. each point of the plane is contained in at least one secant of C. There arises the problem: for which values of k and q do complete As an answer, L. Lombard0 Radice k-arcs in PG(2,q) exist? constructed complete (q+5)/2 -arcs, k-arcs] with constructed complete and Pellegrino 1191 showed that if q Among the k-arcs then complete k-arcs with k <(q+1)/2 exist. which are not necessarly complete but are not contained in a conic, we recall the k-arcs contained in a cubic (see Di Comite [ 1 3 ] , 1141, 1151 and Zirilli [37]) . I t easy to see that the order of the known complete k-arcs is very "large" with regard to the theoretical valuation k > ( 3 + 1 / 1 t U q ) / 2 (see 1 2 8 1 ) and we are still a good way from finding a solution of the following problem: I f q is fixed, what is the smallest number k, such that a complete k-arc of PG(2,q) exists?
[
-
R. Capodaglio di Cocco
116
Recently, in order to obtain new resul.ts, the definition of has been generalized as follows (see [3]).
k-arc
9
(not DEFINITION 1: A k-set K o f , a finite projective plane necessary desarguesian) is called thick if V P E 9 there exists a s-secant of K passing through P with s>l. DEFINITION 2: A thick k-set K is called minimal subset of K is not thick,
if
every
proper
Obviously every complete k-arc is a minimal thick k-set, but the next examples show that the converse is wrong: 1) Let r and s be distinct lines of a projective plane of order q > 5 . If P = r n s , let AlrA2,...,Ac., be points of r and F , , B 2 be points of s , with Ai:bPkBi (i=1,~,...,q-1;j=1,2~. Then the set K = {A11A21...IAq-l,B,,B2} is a minimal thick (q+l)-set. 2) Let r,s,t be three non-concurrent lines of Pc(2,q). If we embed PG(2,q) in PG(2,q2), the set of the points of r,s,t is a minimal 3q-set of PG(2,q2). (E. Ughi's example). In the sequel, we will be interested in the minimal thick k-sets for which k takes the maximal value, i.e. qt2 (see [3]) . We point out that minimal thick (qt2)-sets exist: a (qt2,qtl)-arc is a trivial example of such sets. Moreover we will show that a minimal thick (q+2)-set can be represented by a permutation polynomial, and so the study of these sets is connected to a subject to which many important papers have been devoted (see [ 6 1 r [8I [ 9 1 I101 i r [12I). DEFINITION 3: A point N of a k-set K is called a nucleus of every line through N is a s-secant of K with s < 3 .
K
if
A (qt2)-set with a nucleus is obviously thick, but not necessarly minimal: for example let q=ph, with p*2,3 odd and qrl (mod. 3). In PG(2,q) assume r is an irreducible cubic with an isolated I t is easy to see that is a non-minimal double point N. (qt2)-set with nucleus N. Moreover if q = 5 , and F is a point of inflection of ,then {F} is a minimal thick 6-set. Remark: Irreducible cubics with an isolated double point are used in [IS] to construct (qt9)/2-arcs. So it seems that the following problems are the most important in the theory of minimal thick (qt21-sets: I: Has every minimal thick (q+2)-set one and only one nucleus? 11: For which number n is a minimal thick (qt21-set K a (qt2,n)-arc? 111: When is a (qt2)-set K with a nucleus minimal? In the following we suppose that the order of the plane is odd and we give partial answers to these problems. In particular in: problem I: we show that a minimal thick (qt2)-set has at most one nucleus, Moreover, if the plane is PG(2,q), we find conditions for the nucleus to exist.
r
r
r-
On Thick (Q+2)-Sets
I17
problem 11: we show that if K has a nucleus, then either n=q+l or n
1
Let 9 be any finite projective plane of odd order q. DEFINITION 4 : A point A of a thick k-set K is called essential if the set K - { A ] is not thick. Obviously, a thick k-set K is minimal if and only if every point o f K is essential. Suppose now that K is a minimal thick (q+2)-set, then for each X E K there esists at least a point Px such that every line through Px is an 1-secant for K - { X } . If X is not a nucleus o f K , then P,FX, whereas if K has a nucleus N and X # N , then any point Px is on the line NX. In this section we are interested in problem I, first we shall show that a minimal thick (q+2)-set has at most one nucleus. THEOREM 1: If a (q+Z)-set K has two distinct nuclei, then i t is not minimal. Proof: The plane Y contains no (q++arc, s o K has at least a s-secant r with s > 2 . Then every point A of K n r is not essential. Corollary; If the minimalqhick (q+2)-set K has a nucleus N and XEK, X Z N , then there exists at least one s-secant r3X of K with s>2. REMARK:
We point out that some (q+2)-sets with two nuclei exist. In fact, if N1 and N are any two distinct points and r is the 2 line N N , let ,ti (i=1,2) be the set o f the lines through N. and 1 1 f: + E 2 be any bijection. It differen$ from k, moreover let is easy to prove that K= { snf(s); s E g l } u { N1, N2 ] is a thick (q+Z)-set and Nl, N2 are nuclei of K . So the number of the is equal to the number of the (q+2)-sets with nuclei N1,N2 bijections from to , i.e. q!. On the other hand , if .iP = =PG(Z,q) , in[4] it is siown that a (q+2)-set can have more than two nuclei only if q is even. Now we find conditions for a minimal thick (q+2)-set to have a nucleus.
El
El
THEOREM 2 : Let K be any minimal thick (q+2)-set o f PG(Z,q), with q odd; then K contains two points C and D, such that, if the frame is conveniently chosen, it is possible to represent the set W = K - { C , D )
R. Capodaglio di COCCO
118
by an equation y=f(x), where f(x) is a permutation polynomial with 1) the polynomial f(x)-x has no root in G F ( q ) . Moreover if K has a nucleus, we have 2 ) v m € G F ( q ) , m-1-1,the polynomial f(x)-mx has only one root in GF(q). Proof : In the first place we suppose that K has no nucleus and we define an application r:K--->PG(2,q) in the following way: we choose a point X l € K and we pose r ( X 1 ) = P where Pq is one of the above-stated points. The line X , C ( X l f l 'intersects K at XI and at an other point, say X 2 . We pose z ( X 2 ) = Z ( X l ) . Then we choose a point X 3 f X 1 , X 2 and. we call z ( X 3 ) one of the points Px3' The line X 3 r ( X 3 ) intersects K at X 3 and at an Other point, say X4. If either X 4 = X 1 or X 4 = X 2 , we have nothing to define; if X 4 k X 1 1 X 2 we pose r i X 4 ) = r ( X 3 ) and so on. Since qt2 is odd, there must exist at least two points A and B of K such that the distinct lines A r ( A ) and B r ; B ) intersect K at the same point C, because otherwise the set K would have a partition in disjoint pairs. Obviously z ( A ) , r ( B ) and C are not collinear, so we can choose r ( A ) as the improper point of the axis x, r ( B ) a s the improper Let D be the only point of the axis y and C as the point ( 0 , O ) . point of K on the improper line, then, using the terminology of 1311, the set W=K-(C,D} is a diagram relative both to z ( A ) and to z(B) and so it can be regresented by an equation y=f(x), where f(x) is a permutation polynomial. If we choose the point (1,l) on the line CD, we obtain the cond. 1). Now let K have a nucleus N and A,B be distinct points of K, with AcN-fB. We choose a point PA (resp. a point PB) as the improper point of the axis x (resp. of the axis y) and we call D the only improper point of K. If we pose C=N, w e can repeat the above proof. The cond, 2 ) is satisfied, because C is the nucleus of K. THEOREM 3 : In P G ( Z , q ) , with q odd,let W be the set represented by the equation y=f(x), where f(x) is a permutation polynomial with 1) the polynomial f(x)-x has no root in GF(q) 2 ) v m E G F ( q ) , mtl, the polynomial f(x)-mx has only one root in GF(q). If C is the point ( 0 , O ) and D is the improper point of the line y=x, then the set K=Wu{C,D} is a (qt2)-set with nucleus C. Proof: Self evident.
I1
Now we shall deal with problem 11. In the plane 9 let K be a (qt2)-set w i t h a nucleus N. In conformity with the terminology of ( 3 6 1 , K is a (q+2,n)-arc for a convenient number n, and it has at least three characters, because i t has s-secants for s=1,2,n. Let t be a line which intersects K exactly in the n points B 1 , B2t
. . .1 0 , .
On Thick lQ+2)-Sets
119
THEOREM 4: Suppose the minimal (qt2)-set K has a nucleus N , then either n=q+l or n<(q-l) and so q > 4 . Proof: If n=qtl, we have nothing to prove. Suppose n=q; if C ~t is point different from Bl,B2,. . , B n r we have N,B1 ,B2,...,BnrA} , where A is a convenient point of the line but this means that A is another nucleus for K, in contrast with th. 1. Suppose n=q-1; if C1 and C2 a r the points of t different from B l r B 2 , . . , B n , we have K = N,B1 ,B?, . . . ,Bn,A1 , A # where A , is a convenient point of NC, (i=l,2), Since A1 cannot be a nucleus, the line A,A2 must pass through one of the points B ~ : but this is impossible because this point would be not essential. So we have n
.
.
Ifp=PG(2,q), the above result is improved by the next theorem and its corollary. set of PG(2,q) with a nucleus N . Then any line A1 A2, Ai E K, A, 3:N , A1,/zA2,is at least a s-secant df K with s > 3 . Proof: Let A1kN:bA2 be two disinct points of K. Let PA, be the point of the line NA, definied in the section I (i=l,2). For the instead of P ~ ~ . A f t ear B. Segre's sake of brevity we write P, scheme of proof (see 1281 ) , we chose P2 ,PI ,N as the fundamental triangle of a homogeneus coordinate system in PG(2,q). The line PIP2 contains only one point of K, say A3. Let U=P2A1 n N A 3 ; we choose U as (l,l,l), so we have A l = ~ O , l , l ~A3=(l,1,0) , and A2=(l,Ora) with a.kO. For each point CEK, C#.N,AlrA2,A3,the lines NC, P I C , Pf are represented respectively by the equations x1 =m2x0, x ~ = ~ x2=mOx1 ~ x ~ with , m,-=mom 2 If we consider all the points C of K, C=FN,Al,A2,A3, we obtain that m2 and mo take all the values of GF(q) different from 0 and 1, while m 1 takes all the values of GF(q) different from 0 and a. Since the product of all non-zero elements of GF(q) is equal to -1, we have a=-1. This means that the points A1,A2,A3 are collinear . Starting from the points A1 and A3 and putting P=P by the above arguments we have that the only point of K 3 $3 ' , vhich is on the line PI P3 is a so on the 1 ne A1A3 . If this point is distinct from A2, then the line A1A2 intersects K in at least four points; otherwise the point A4, the intersection of K with the line P2P3, is certainly distinct from A 1 and lies on the line AIA2. THEOREM 5 : Suppose K is a minimal thick
Corollary: Suppose the minimal thick set K of PG(2,q) has a nucleus N, then K is a (qt2,n)-arc with either n=qtl or 4
120
R. Capodaglio di Cocco I11
We need a new definition. Let q be an odd prime power. It is known [12] that a permutation polynomial for GF(q) is in reduced form if its degree isq , For the sake of brevity we put U(f(x))=vf. DEFINITION 5: A permutation polynomial is called pseudolinear if there exists a group d , subgroup of AGL(l,q), transitive on the elements of GF(q), except for at the most one element, and such that 1 V d e A the permutation polynomial a-'( vf 6 v ; ) is of the first degree. All the permutation polynomials xk , with GCD(k,q-l)=l, are pseudolinear because for them we can choose A = { x ---> ax; a E G F ( q ) , a-kO}. On the contrary,the polynomial corresponding to the permutation x--->x if'x-l.0~1; 0--->1:1--->0 is not pseudolinear. THEOREM 6: In PG(2,q) let H be the set represented by the equation y=f(x), where f(x) is a pseudolinear permutation polynomial and is the group of the affinities which map H onto itself. assume Then 17 is transitive on H , except for at the most one point. Proof : It is sufficient to point out that I1 cointains all the affinities x= a - $ 6 ) (xl ) ly= a- ( vf 6 v;' )(y') where ~ E A .
n
Now we treat the problem 111. Suppose the (q+2)-set K of PG(2,q) has a nucleus N. We choose a coordinate system different from the one we used in the proof of th. 2. Let A k N be a point of K , then we choose A N as the improper line and N as the improper point of the axis y . Since the set H=X-{N,A} is a diagram relative to N, so i t can be represented by an equation ( 1 ) y=f(x) where f(x) is a polynomial. THEOREM 7 : Suppose K is minimal, then it is possible to choose the improper point of the axis x such that f(x) is a permutation polynomial, Proof: self-evident.
On Thick (Q+2)-Sets
121
If in (1) f(x) is a pseudolinear permutation polynomial, then, by th. 6 , the group of the affinities that map H onto itself is not trivial. Now we suppose K is a (q+2,n)-arc with ncq+l and we prove that if some conditions are satisfied, then K is not minimal.
n
THEOREM 8: Let f(x) be a pseudolinear permutation polynomial. Assume 17 contains a subgroup 17, of the group of the is transitive on H, then A and N are the translations and only essential points of K . Proof: Let B be any point of H and t E 0 be a s-secant of K with s>l; assume T is the improper point of t. Since n < q + l , then there exists Q such that o(t)=t'+t. Obviously t' passes through T and it is likewise a s-secant of K . On the other hand, since any affine line through T is either external or s-secant of K , then no 1-secant of K passes through T. Let now Q be any point of the line BN: since the line QT is not a 1-secant of K - { B ) - , then the point B is not essential.
nq
THEOREM 9 : Let f(x) be a pseudolinear permutation polynomial. Assume any element of n fixes the improper points of the axes and a proper point 0 (obviously 0 is on H ) ; moreover assume 17 is transitive on the points of H different from 0, then 0 is not essential. Proof: Let X be the improper point of the axis x; since the line XO is an 1-secant of K , then there exists at least a line 2 3 0 that is a s-secant of K with s>2. The line r is a m-secant of H, where m=s-1 if A is on r , m=s otherwise. Since is transitive on H - { O } , then the q points of H are shared among d lines which pass through 0 and are m-secant H , with obviously q-l=d(m-l). It is easy to see that is transitive on the lines passing through X and different from XN and XO, and therefore also on the points of the line ON different from 0 and N. Suppose the line ON contains a point Q:bO,N such that any line u3Q is t-secant H with t<2, then the same is true for every point R of ON (RI0,N). But evidently this is absurd, So the point 0 is not essential. EXAMPLES :In PG(Z,q), with q=phodd, let N and A be respectively the improper point of the axis y and the improper point of the line y=x. Moreover let he the set represented by the equation xpt. . tch- xp%-I y=f (x)'COX where c i EGF(P) and GCD(cotclx +. . .+ck1xh-l,1-xh )=l. It is known [12] that f(x) pseudolinear because we can K=Hu{A,N}. Since the satisfied, no point of H is essential for K . 2 ) Let A , N , K have the same meaning d s in l), while H is the set represented by the equation
.
y=xk
As we have already proved, xk is a where GCD(k,q-l)=l. pseudolinear permutation polynomial. In this case the conditions
122
R. Capodaglio di Cocco
required by th. 9 are satisfied, so the point ( 0 , O ) essential for K.
of H
is
not
LITERATURE [l] A.Barlotti:Sui (k,n)-archi di un piano lineare finito. Un.Mat.Ital.11 (1956) 553-556.
Boll.
[2] A.Barlotti: Un'osservaziome intorno ad un teorema di B. Segre sui q-archi. Matematiche (Catania) 21 (1966) 287-395. [3] U.Bartocci: k-insiemi densi in piani di Ga1ois;in c o r s o di pubbl.su1 Boll.Un.Mat.It. [4] A.Bichara,G.Korchmaros: Note on (qt2)-sets in a Galois plane of order q . Ann. of discr.Math.14 (1982) 117-122 [5] R.C.Bose: Mathematical theory of the symmetrical factorial design. Sankhya 8 (1947) 323-338.
161 A.Bruen: Permutation functions on a finite field. Canad. Math.Bull.15 (1972) [ 7 ] :A.Bruen:The number of Lines Determined by n2 Points.Journ.of Comb.Theory (A)15 (1973) 225-241.
[8] L.Carlitz:Permutations in a finite field. Soc.4 (1953) 538.
Proc.Amer.Math.
[9] L.Carlitz: A Theorem on permutations in a finite field.Proc. Amer.Math.Soc.11 (1960) 456-459.
[lo] L.Carlitz: A note on permutation functions over finite field. Duke Math.J.29 (1962) 325-332.
[Ill L.Carlitz: Some theorems on permutation polynomials. Amer.Math. 68 (1962) 120-122. [lZ].L.Carlitz: Permutations in finite field. ged. 24 (1963) 196-203.
Bull,
Acta Sci Math-Sze-
[13] C. Di Comite: Sui k-archi deducibili da cubiche p ane. Acc.Naz.Lincei ( 8 ) 33 (1962) 429-435.
Rend.
On Thick (Q+Zl-Sets
123
[14] C. Di Comite: Sui k-archi contenuti in cubiche piane. Acc.Naz.Lincei ( 8 ) 35 (1963) 274-278.
Rend,
[15] C. Di Comite: Intorno a certi (q+9)/2-archi d i S(2,q). Acc.Naz.Lincei ( 8 ) 36 (1964) 819-824.
Rend.
[16] F. Karteszi: Introduzione alle geometrie finite. Feltrinelli 1978 (traduzione italiana)
[17] G. Korchmaros: New examples of complete k-arcs in PG(2,q). Eur.J. of Comb. [18] L.Lombardo Radice: Sul p r o b l e m dei k-archi completi di S(2,q).Boll.Un.Mat.It.l1 (1956) 178-181. [19] G.Pellegrino: Sur les k-arcs complets des plans des Galois d'ordre impair.Ann. Discr. Math. 18 (1983) 667-694. [20] B. Qvist: Some remarks concernin g curves of the second degree in a finite plane. Ann.Acad.Sci.Fenn.1 134 (1952) [21] L. Redei: Uber eindeutig umkerbare Polinome in endliche Korpern. Acta Sci.Math.Szegd. 11 (1946-1948) 85-92 [22] M. Sce, L. Lunelli: Sulla ricerca dei k-archi completi mediante calcolatrice elettronica. Convegno reticoli e geometrie proiettive.(Palermo 1957) Roma Cremonese 81-86 (1958) [23] B.Segre: Sulle ovali nei piani lineari finiti. Naz.Lincei (8) 17 (1954) 141-142.
Rend.Acc.
[24] B.Segre: Curve razionali normali e k-archi negli spazi finiti. Ann. Mat.Pura Appl. 39 (1955) 357-379. [25] B.Segre: Ovals in a finite projective plane. Canad. J. Math 7 (1955) 414-416. [26] B.Segre: Sui k-archi nei piani finiti di caratteristica 2.Rev. de Math.Pure et Appl. 2 (1957) 289-300. [27] B.Segre: (1959) 1-96
Le geometrie di Galois.
Ann.Mat.Pura Appl.
[ L 8 ] B.Segre:
Lectures on modern Geometry.
48
Cremonese,Roma 1961
[29] B.Segre: Ovali e curve nei piani di Galois stica due. Rend.Acc.Naz.Lince1 32 (1962) 785-790 [30] B.Segre: Introduction to Galois geometries. Lincei, 8 (1967) 135-236.
di
caratteri-
Mem.Acc.Naz.
R. Capodaglio di Cocco
124
[31] B.Segre,U.Bartocci: Ovali ed altre curve nei piani di Galois di caratteristica due. Acta Arithm. 18 (1971) 423-449 [32] B.Segre,G.Korchmaros: Una proprietd degli insiemi di punti di un piano d Galois caratterizzante quelli formati dalle singole rette esterne ad una conica,Rend.Acc.Naz.Lincei 62 (1977) 613-618.
[33] G.Tallin teristica p=2
Sui q-archi di un piano lineare finito di caratRend.Acc.Naz.Lince1 23 (1957) 242-245.
:
[34] G.Tallini: Le geometrie di Galois e le loro applicazioni alla statistica e alla teria del'informazione. Rend.Mat.e Appl. 19 (1960) 379-400. [35] M.Tallini Scafati: Sui k,n -archi di un piano grafico finito. Atti Acc. Naz. Lincei.Rend. 40 (1966) 373-378. [36] M.Tallini Scafati: k,n -archi di un piano grafico finito, con particolare riguardo a quelli con due caratteri (Note I e 1 1 ) Atti Acc.Naz. Lincei Rend. 4 0 (1966) 812-818; 1020-1025. [37] F.Zirilli: Su una classe di k-archi di un piano di Galois. Rend. Acc.Naz.Lincei 54 (1973) 393-397.
Annals of Discrete Mathematics 30(1986) 125-136 0 Elsevier Science Publishers B.V. (NorthHolland)
125
ON A GENERALIZATION OF INJECTION GEOMETRIES P i e r V i t t o r i o C e c c h e r i n i and N a t a l i n a Venanzangeli D i p a r t i m e n t o d i Matematica "G. Castelnuovo" U n i v e r s i t a d i Roma "La Sapienza" C i t t a U n i v e r s i t a r i a , 00100 Roma, I t a l y
I n j e c t i o n geometries have been i n t r o d u c e d i n [ 3 ] as a gene r a l i z a t i o n o f p e r m u t a t i o n geometries s t u d i e d in [ 1 1 . We p r e s e n t a g e n e r a l i z a t i o n o f i n j e c t i o n geometries, namely 7-geometries, i m p r o v i n g i n some cases p r o p e r t i e s o f i n j e c t i o n geometries s t a t e d i n [ 3 ] . 7-geometries have been i n t r o d u c e d i n [ 9 1, and a l s o preannounced i n [ 3 1 , i n a "Concluding remark" unknown t o t h e authors , F g e o m e t r i e s have been r e c e n t l y c o n s i d e r e d a l s o i n [ 4 1, under t h e name o f "squashed geometries" and i n [ 6 1 , [ 8 ] .
1. INTRODUCTION I n what f o l l o w s a l l s e t s w i l l be f i n i t e . L e t N be a non empty s e t and
2
N =
=NxN. I(x,y)
2
EN
f a E N , we g e t t h e g e n e r a t o r s g ( a ) = { ( x , Y ) E N2 : x = a) and g ( a ) = 1 2 : y = a]; t h e f i r s t (resp. second) system o f g e n e r a t o r s i s
= g 2 ( a ) : a € N 1. A ( p a r t i a l ) correspondence o f N 2 i s any subset o f N ; a p a r t i a l a p p l i c a t i o n ( r e s p . c o a p p l i c a t i o n ) o f N i s any sub2 s e t o f N which i s 0- o r 1-secant each g E G ( r e s p . g E G ) ; a subpermutation F 1 1 2 2 o f N i s any subset o f N2 which i s 0- o r 1-secant each g e n e r a t o r ; i f dom F = N,
G1
=
Igl(a)
aEN1 (resp. G
z
t h e n F i s a p e r m u t a t i o n o f N.
I n [ 7 1 s e t s and groups o f p e r m u t a t i o n s o f N a r e
studied ( w i t h special a t t e n t i o n t o t r a n s i t i v i t y p r o p e r t i e s ) from t h i s geometrical p o i n t o f wiew.
I n [ 2 ] c e r t a i n semigroups o f subpermutations a r e c h a r a c t e r i z e d i n
t h e c l a s s o f a l l semigroups. p e r m u t a t i o n geometries,
In [ 1 1 s p e c i a l s e t s o f subpermutations o f N (namely
c f . no. 2 ) a r e i n t r o d u c e d by means o f axioms s i m i l a r t o
m a t r o i d axioms; more g e n e r a l r e s u l t s a r e o b t a i n e d i n a s i m i l a r way i n ( 5 1 , where s e t s o f p a r t i a l a p p l i c a t i o n s ( o r c o a p p l i c a t i o n s ) i n s t e a d o f subpermutations a r e considered. Other g e n e r a l i z a t i o n s o f p e r m u t a t i o n geometries a r e i n j e c t i o n geomed t r i e s , c f . [31. I f d a l i s an i n t e g e r , i n t h e s e t N we have d systems o f genera-
tors :
P.V . Ceccherini and N. Venanzangeli
126
G . = t g . ( a ) : a e N ) , where g . ( a ) = I ( x l 1
1
1
,...,x d ) e Nd
: x . = a1 1
(i=ly...yd);
d . a subset o f N i s c a l l e d i n j e c t i v e i f i t i s 0- o r 1-secant each g e n e r a t o r ; an d i n j e c t i o n geometry i s a s e t o f i n j e c t i v e s e t s o f N s a t i s f y i n g s u i t a b l e axioms, which a r e s i m i l a r t o m a t r o i d axioms and which reduce t o t h o s e f o r d = 1 and t o p e r m u t a t i o n geometry axioms f o r d = 2. T h i s t a l k concerns a g e n e r a l i z a t i o n o f i n j e c t i o n geometries (namely 9-geom e t r i e s ) g i v e n i n [ 9 ] i n a v e r y a b s t r a c t way which i n c l u d e s a l s o p a r t i a l a p p l i c a t i o n ( o r c o a p p l i c a t i o n ) geometries ( c f . no. 2 ) . P r o f . M. Deza i n f o r m e d us d u r i n g t h i s conference t h a t t h e concept o f 9-geom e t r i e s i s claimed i n a c o n c l u d i n g remark (added i n p r o o f s ) i n [31 and t h a t i t i s going t o be developed i n [ 4 1 , where our 3-geometries a r e c a l l e d squashed geometries.
A d i f f e r e n t and v e r y e l e g a n t approach t o squashed geometries as "bou-
quets o f m a t r o i d s " i s g i v e n i n [81, where i n s t e a d o f o u r s e t 7 an a n t i c h a i n C i s c o n s i d e r e d s a t i s f y i n g s u i t a b l e axioms ( i n o u r language C i s t h e s e t o f maximal elements o f A ) ; t h a t approach seems t o be v e r y e f f i c i e n t . I n what f o l l o w s we s k e t c h a t h e o r y o f 9-geometries, i m p r o v i n g i n some cases p r o p e r t i e s o f i n j e c t i o n geometries s t a t e d i n [31.
2. DEFINITION OF 9-GEOMETRIES L e t us s t a r t w i t h t h e f a m i l i a r concept o f m a t r o i d . A m a t r o i d Mr(X), o r rank r on s e t X, i s a p a i r Mr(X) = (X,A)
DEFINITION 2.1.
where A i s a s e t o f subsets o f X, p a r t i t i o n e d i n t o A = A,,u...
UAr
w i t h Ar # 0,
s a t i s f y i n g t h e f o l l o w i n g axioms ( t h e elements A . E A . a r e c a l l e d t h e f l a t s o f r a n k 1
1
i o f M (X), O < i < r ) : r ( 1 ) A i s c l o s e d under i n t e r s e c t i o n ; ( 2 ) i f Ai E Ai
( 3 ) i f AifAi, such t h a t Ait,
A' 3
AU
,
A . E A , and Ai C_ A . t h e n i 6 j; J J J i < r and b E X \ A t h e n t h e r e e x i s t s an u n i q u e AitlE
i'
>_ A i u I b 1 ;
moreover A
it1
i s i n c l u d e d i n each A ' E A
Aitl such t h a t
[bl.
We r e c a l l now t h e d e f i n i t i o n s o f t h e s t r u c t u r e s mentioned i n $ 1 . DEFINITION 2.2
( [ 1 1). L e t N be a non empty s e t and X c N x N. A p e r m u t a t i o n
127
On a Generalization offnjection Geometries
geometry P ( X ) o f r a n k r on X, i s a p a i r P ( X ) = ( X , A ) where A i s a s e t o f subperr r w i t h A # 0, s a t i s f y i n g t h e m u t a t i o n s o f N, p a r t i t i o n e d i n t o A = A o u UAr r axioms ( 1 ) - ( 3 ) w i t h t h e r e s t r i c t i o n t h a t axiom ( 3 ) h o l d s f o r t h o s e b E X \ A . such
...
1
i s a subpermutation of N. (Note t h a t t h e o r i g i n a l d e f i n i t i o n g i v e n 2 . i n [ 1 1 concerns t h e p a r t i c u l a r case X = N ; 1.e. o u r d e f i n i t i o n i s s l i g h t l y more t h a t AiU t b l
general 1. DEFINITION 2.3
([5]). L e t N be a non empty s e t and X C N x N. A p a r t i a l ap-
p l i c a t i o n ( r e s p . c o a p p l i c a t i o n ) geometry o f r a n k r on X i s a p a i r ( X , A ) , where
A i s a s e t o f p a r t i a l a p p l i c a t i o n s ( r e s p . c o a p p l i c a t i o n s ) o f N, p a r t i t i o n e d i n t o A = A,
U...
UA
r
with A
r
# 0, s a t i s f y i n g t h e axioms ( 1 ) - ( 3 ) w i t h t h e r e s t r i c -
t i o n t h a t axiom ( 3 ) h o l d s f o r t h o s e b E X \ A . such t h a t A . u i b 1 i s a p a r t i a l a p p l i 1
1
c a t i o n ( r e s p . c o a p p l i c a t i o n ) o f N. DEFINITION 2.4 “ 3 1 ) .
d L e t d > 1 be an i n t e g e r , N a non empty s e t and Xc- N
.
An i n j e c t i o n geometry o f rank r on X i s a p a i r I ( X I = (X,A) where A i s a s e t o f r d i n j e c t i v e subsets o f N , p a r t i t i o n e d i n t o A A , U U A w i t h Ar # 0, s a t i s f y r i n g axioms ( 1 ) - ( 3 ) w i t h t h e r e s t r i c t i o n t h a t axiom ( 3 ) h o l d s f o r t h o s e b E X \ Ai d The number d w i l l be c a l l e d t h e such t h a t A . u t b l i s an i n j e c t i v e subset o f N
...
.
1
dimension o f I r ( X ) . We g i v e now t h e de i n i t i o n o f
3-geometries.
DEFINITION 2.5 ( c f . [9], and a l s o [ 3 ] , [ 4 ] , [ 8 ] where t h e d e f i n i t i o n i s g i v e n i n a s l i g h t l y d i f f e r e n t f o r m ) . An 9-geometry o f r a n k r on a s e t X, i s a quadruple
G ( X ) = (S,3,X,A) where S i s a non empty set, I i s a s i m p l i c i a 1 complex o f d i s t i n -
r
guished subsets o f S ( i . e .
Z C Z ’ E ~ i m p l i e s Z E I ) , A i s a subset o f 9 p a r t i t i o n e d
... u
A w i t h A # 0 and X = u A, s a t i s f y i n g t h e axioms ( 1 ) - ( 3 ) r r AEA w i t h t h e r e s t r i c t i o n t h a t axiom ( 3 ) h o l d s f o r t h o s e b € X \ Ai such t h a t i n t o A = A,u
A . U t b l E 3. 1
Ai a r e c a l l e d t h e f l a t s o f r a n k i o f t h e geometry G ( X I . r = A. v i b l f o r t h e s e t Ai+l mentioned i n axiom ( 3 ) . We s h a l l w r i t e A i+l 1 S A m a t r o i d M ( X ) i s a geometry Gr(X) = (S,Y,X,A) w i t h 9 = 2 and X = S, and The elements
r
AiE
2
c o n v e r s e l y . A p e r m u t a t i o n geometry Pr(X) = (X,A), w i t h XcN , i s a geometry Gr(X) = 2 = (S,3,X,A) w i t h S = N and 3 = IF c N2 : F i s a subpermutation o f N l , and convers e l y . P a r t i a l a p p l i c a t i o n ( r e s p . c o a p p l i c a t i o n ) geometries can be e a s i l y c h a r a c t e -
P.V, Ceccherini and N. Venanzangeli
128
r i z e d i n a s i m i l a r way between %geometries. An i n j e c t i o n geometry I r ( X ) = (X,d) d w i t h XsNd i s a geometry Gr(X) = (S,Y,X,A) w i t h S = N and 9 = I F 2 Nd : F i s i n j e c t i v e ) , and conversely. Several examples o f geometries G ( X I can then be dedx r ced from [ l ] , [5], [ 3 ] where examples o f permutation geometries and o f i n j e c t i o n geometries are given. We now g i v e some o t h e r examples. EXAMPLE 2.6.
Free 9-geometries.
Gr(X) = (S,9,X,A)
The f r e e geometry
d e f i n e d by assuming X = S, 9 a s i m p l i c i a 1 complex o f S, A
i
is
= t A E 9 : ( A ( = il,
ral.
O
EXAMPLE 2.7.
S t a r 9-geometries.
A s t a r geometry G (X) = (S,9,X,A)
1 center C i s defined by assuming CCS, A, = t C l , A , = t D ( t a 2 , i,j=l,...,t, i # j ) ,X =
and D.n 0 . = C 1
J
l,...,Dt
where C C D . c S J
t
t
Di,
5’=
with
u 2Di.
i=1
REMARK 2.8. S t a r %geometries are 9-geometries o f rank 1 w i t h IA
1
I > 1 and
conversely ( c f . Theorem 5 . 3 ) . EXAMPLE 2.9. metry w i t h A =
Truncations o f an 9-geometry. I f Gr(X) = (S,9,X,A) A,U
...u A r
(k)
Then Grlk) = (S,9,X,A
i s an 9-geo-
and i f 1 6 k < r , we can consider A ( k ) = A , u . . UAk. . . ) i s an 9-geometry o f rank k, c a l l e d t h e k - t r u n c a t i o n o f
Gr’
EXAMPLE 2.10.
Cotruncation o f an 9-geometry. If Gr(X) = (S,S,X,A)
i s an
9-geometry and i f Ah€ Ah (06 h c r ) i s i n c l u d e d i n some Are Ar, then we can consider =
2i = g,i(A,,)
=
(S,g,X,A) w i t h
G (A,) r
=
tAhti€Ah+i
i, U... ~ f i
c_
Ahti,
i=O,l,.
c f . 5.1 ( a ) .
= Gr,
EXAMPLE 2.11.
B i t r u n c a t i o n s o f an 9-geometry.
metry and i f A h € Ah, w i t h O < h c k c r and A h c A sider
-
-
A = A,
Ji
=
..,r-h].
Then G r ( A h 1 = ~i s -an~9-geometry , o f rank r - h , Note t h a t
: Ah
i.(A ) i h
=
{Ahti
E Ahti
: AhCAh+i,
k i=O,
u... uA;(-~i s an 9-geometry o f rank k-h.
EXAMPLE 2.12.
I n t e r v a l s o f an 9-geometry.
I f Gr = (S,Y,X,A)
i s an 9-geo-
f o r some A k € A k then we can con-
...,k-h}.
I f Gr
=
Then G = (S,Y,X,#)
(S,g,X,A)
i s an %geometry
and i f Ah€ Ah, Ak€ Ak w i t h Ahc Ak, O d h < k < r, then we can consider Ai(A =
{Ahti
E Ahti
: A h L AhtiCAk,
o f rank k-h on Ah.
i=O
,...,k - h l .
Then i i , u . . . u f i k-h
with
A ) = h’ k gives a m a t r o i d
129
On a Generalization of Injection Geometries
EXAMPLE 2.13.
Restrictions of
J-geometries.
l e t Gr(X) = (S,9,X,A)
be an 9-
geometry and l e t be S ' such t h a t A € S ' C X f o r some A E d Define A' = 1 1 1' LJ Z A ' , r ' = max t i : A i E A ' l . Then = tAEA: AcSIl, X I = u ,A, 9' = A€ A A' € 4 ' G r , ( X ' ) = (S'J',X',A') i s an 3-geometry o f rank r ' on X ' .
A s p e c i a l i n t e r e s t i n g case i s obtained when S 1 = X ' = U A f o r some f i x e d AE B Bc A such t h a t D n A l # 0; i n t h i s case r ' = max l i : d i n B f 01, A' = t A E A : A C E f o r some B C B } and 9' =
A€ D
2A.
3. D I R E C T SUMS OF 9-GEOMETRIES By s t a r t i n g from two g i v e n 9-geometries, i t i s p o s s i b l e t o c o n s t r u c t a new one (namely t h e i r d i r e c t sum), i n t h e standard way described below. DEFINITION 3.1. G",,
=
Q
of
9-geometries.
Let GIr,
= ( S ' , 9 ' , X 1 , d ' )and
( S " , ~ " , X " , ~ " ) be two 9-geometries; we can suppose w i t h o u t l o s s o f genera-
0. Assume:
l i t y t h a t S'n S" =
A. = [A!, 1
D i r e c t sum
1
uA" : A ! , € A ! , , A!,,€ i" 1 1 1
A = A, u.. . u A
r = r'
r'
t
A'.',,, i ' t 1
i " =
i},
r".
w i l l be c a l l e d t h e d i r e c t sum G '
Then (S,9,X,A)
r'
8
GI,, o f G,;
and G I , , . It i s
easy t o prove t h e f o l l o w i n g : THEOREM 3.2.
The d i r e c t sum G,;
b G'',
o f two
9-geometries i s an 9-geometry
o f rank r = r ' t r " . DEFINITION 3.3. = (S',9',X',A')
F u l l d i r e c t sum 6 o f i n j e c t i o n geometries. L e t G,;
and G'',
= (S",?',X",A")
dimension d. A c t u a l l y X ' c - S'
=
be two i n j e c t i o n geometries o f t h e
N o d and X " c - S" = NtId. We can suppose w i t h o u t l o s s
o f g e n e r a l i t y t h a t N'n N" = 0, so t h a t S'n S" = N =
N'UN",
-
s
A. = ( A ' u A;, 1 i' A = A, u...uAr, Then (S,?,X,A)
d
= N
-
, x
=
x'ux", T = r 1 E 2
: A i l € A ; , , A;,
r
~ame
0 . Assume:
: I i s injective),
E A;,,, i ' t i"= il,
= r ' t r".
w i l l be c a l l e d t h e f u l l d i r e c t sum
cr
= G,;
s
G I , , o f G;,
and GF,,.
P.V , Ceccherini and N. Venanrangeli
130
THEOREM 3.4.
The f u l l d i r e c t sum GAI & GFII o f two i n j e c t i o n geometries o f di
mension d i s an i n j e c t i o n geometry o f rank r = r ' t r " and dimension d. P r o o f . L e t Gr = (S,5',XP)=G', B G" be t h e d i r e c t sum o f G,; and G;,, c o n s i d r r" d ered as 9-geometries ( c f . Theorem 3.2). A c t u a l l y S = S ' U S " = N ' u N1IdcNd = 3 and 9 C T . I t f o l l o w s immediately t h a t
Er
i s an i n j e c t i o n geometry o f rank
r = r ' t r " and dimension d. F o r d = 2 we have COROLLARY 3.5.
The f u l l d i r e c t sum G L I
5 G;,
o f two p e r m u t a t i o n
( c o n s i d e r e d as i n j e c t i o n geometries o f dimension d.2) i t i s a p e r m u t a t i o n geometry.
o f dimension two, i . e . REMARK 3.6.
t e d meaning -
L e t GAI and G",,
o f (1 1.
geometries
i s an i n j e c t i o n geometry 0
be two " p e r m u t a t i o n geometries" i n t h e r e s t r i c -
Then t h e f u l l d i r e c t sum GAI
G;I,
i s a p e r m u t a t i o n geometry
( i n o u r meaning), b u t i t i s n o t a " p e r m u t a t i o n geometry" i n t h e meaning o f [l], 2 because ( w i t h t h e n o t a t i o n o f D e f i n i t i o n 2.2) XcN ,
4. REGULAR 9-GEOMETRIES
A geometry Gr (X)
= (W,9,XyA)
i s c a l l e d r e g u l a r i f each A Ed i s i n c l u d e d i n
.
Every s t a r 9-geametry i s r e g u l a r . The f o l l o w i n g G2(X) = (S,S,X,A) some A E A r r i s not regular : A, = tA,
X = S = ta,b,c,d),
A
9
=
(A,,
2
[A
=
2
t b ) , {c}, t d l ,
:[
all,
A;,
1
=
[A
= Ia,bl,
1
A ' = Ia,cl, 1
A" = ta,dl.}, 1
A = A, u A u A 1 2'
= Ia,b,c}},
A1,
A
A", 1
{b,cl,
A21. We n o t e t h a t A;' i s n o t i n c l u d e d
in A
2' The same example shows t h a t i f G (X) = ( S , S , X , A ) i s a geometry, t h e n 9 i s r n o t n e c e s s a r i l y t h e f a m i l y o f t h e independent s e t s o f a m a t r o i d on S . I t i s a l s o easy t o g i v e examples o f r e g u l a r Gr(X) w i t h t h e same p r o p e r t y (191).
A geometry G (X) = (W,Y,X,A) i s r e g u l a r i f and o n l y i f f o r r each A. E A , , w i t h i < r , t h e r e e x i s t s b e X \ A. such t h a t A. u [ ~ } 1 E . PROPOSITION 4.1. 1
1
1
P r o o f . Suppose G ( X I r e g u l a r , A. E Ai,
1
i< r . L e t A . c A E dr. We have r 1 1 r A.cA s i n c e i < r ( c f . Prop. 5.1. ( e ) ) . If b E A r \ A t h e n b E X \ A i and i r i' A . W b I E 9 , s i n c e A.u:bl C_ A r E 9 and 7 i s a s i m p l i c i a 1 complex. 1
1
On a Generalization of Injection Geometries Conversely, i f f o r each A.E Ai, 1
A.U 1
w i t h i < r. t h e r e e x i s t s b € X \ A. such t h a t 1
I b I E 9, t h e n A . i s i n c l u d e d i n some 1
times.
131
ArE
A : t h i s f o l l o w s by a p p l y i n g ( 3 ) r - i
r
0
P R O P O S I T I O N 4.2. A geometry Gr(X) i s r e g u l a r w i t h lArl
1 i f f Ar
=
=
[XI.
( I n t h i s case G ( X I i s e x a c t l y a m a t r o i d ) .
r P r o o f . I f A = ( X I , t h e n each A. E A. w i t h i < r i s i n c l u d e d i n A = X = u A r 1 1 r AEA s o t h a t G i s r e g u l a r w i t h IA 1 = 1. Conversely l e t G (X) be r e g u l a r w i t h r r r A = ( A I . I f X E X = u A, t h e n XE A. f o r some A. E A , , so t h a t X E A . c A AE A 1 1 1 1 r r r by r e g u l a r i t y . T h e r e f o r e X c Ar, i.e. X = A r
.
5. FIRST PROPERTIES OF .?'-GEOMETRIES PROPOSITION 5.1.
( a ) IA,1
L e t Gr
=
(S,S,X,A)
1 and t h e element A,EA,
=
be an 3-geometry. i s t h e minimum o f A .
( b ) I f Ah E Ah, A E A w i t h A c A and 0 s h < k-< r. t h e n t h e r e e x i s t s a k k h k k). c h a i n A h C Ah+l c...c A w i t h A E A ( s = h , h t l , k s s ( c ) Each A. E A . ( O < i s r ) i s i n c l u d e d i n a c h a i n A,C A C . . C A. w i t h
...,
1
A
S
E
AS (s=O,l,
1
1
...,i ) .
1
( d ) I f Gr i s r e g u l a r , each A.E A . ( O < i < r ) i s i n c l u d e d i n a c h a i n 1
A, c...c Ai
C...C
( e ) I f Aie where Ai
=
A, v { b }
=
1
w i t h A E A ( s = O ,...,r ) . r s s A i , A . € A . ( w i t h i , j = 0,1, A
J
...,r ) ,
J
and i f A . L A . , 1 J
then i C j ,
A . i f and o n l y i f i = j . J P r o o f . ( a ) L e t 1.) A = A . E A . . From ( 2 ) i t f o l l o w s t h a t i = 0. I f AAEA,, AEA 1 t h e n A,, C - A:. Then A, = A;; o t h e r w i s e i f bEA:\ A,, then from ( 3 ) i t f o l l o w s t h a t A
C A; w i t h AIEA1, contradicting (2). 1C A w i t h Ah+l~Ahtl. I f h t l = k, From (31, Ah v I b } = A ( b ) Let b E A k \ A h' htl - k t h e n Ahtl = Ak by (3). I f h t l < k , t h e n Ahtl C A and i t e r a t i o n o f t h e same a r g u k ment l e a d s t o a c h a i n A h C ... C Ak-l C "A, A,, w i t h A S e A ( h < s < k ) and A ; ( € A k .
S
A c t u a l l y k - 1 < r , so t h a t ( 3 ) i m p l i e s A;( = Ak, required. ( c ) Take h = 0 and k
=
and Ahc
r e g u l a r i t y . By ( c ) we have a c h a i n A, C...C
s=O,
Ar-lC
...,r ) .
Ar,
a c h a i n as
i i n (b).
( d ) If i = r, ( d ) f o l l o w s f r o m ( c ) . I f i c r , t h e n
Ai
... C A ~ - ~ kC iAs
C...C
s o t h a t we g e t a c h a i n
A.C
i
A
r
f o r some A
r
A. and b y ( b ) we have a c h a i n 1
A,C
...C
A.
1
C...C
Ar
(AS€ A
S'
E
A
r
by
P. V. Ceccherini and N . Venanzangeli
132
( e ) We have i c j by ( 2 ) . From Ai pose now A.
A ! w i t h Ai,
C
1 -
1
we g e t a c h a i n
A.
1
=
A,C
A . i t f o l l o w s o b v i o u s l y t h a t i = j. SupJ I f i = O , t h e n A, = A: by ( a ) . I f i f O , t h e n by ( c )
A;EAi.
...CAi-lCAi
C_ A;,
=
so t h a t c o n d i t i o n ( 3 ) i m p l i e s
v { b ] = A! where b E A . \ A . So A . C A! i m p l i e s A. = A ! . Ai-l 1 1 1-11 1 1 1
0
From 5.1 ( e l f o l l o w s COROLLARY 5.2. then AinA;
E A .
J
THEOREM 5.3.
L e t Gr be an 9-geometry.
I f Ai,
A; €Ai
w i t h Ai
# A;(O c i s r ) ,
with O s j c i - 1 . L e t Gr
=
(S,3',X,A)
be an
%geometry.
I f x i s i n c l u d e d i n some i n c l u d e d i n a unique A E A 1 1' A . ( j > O ) , t h e n x i s i n c l u d e d i n some Ai E Ai f o r e v e r y O < i c j . I n p a r t i c u l a r i f J G i s r e g u l a r , t h e n each x i s i n c l u d e d i n some A. E A . f o r e v e r y 0 < i c r . ( a ) Each X E X \ A,is
r
1
1
( b ) I f 0 < i < j < r , each A . E A . i s t h e u n i o n o f t h e elements o f A . which J J 1 are included i n A j' ( c ) I f Ai E A i ( O 6 i < r ) i s i n c l u d e d i n two d i s t i n c t element A ! A'.' E Aitl, ltl'
ltl
then A. = A ' n A:' = n A. 1 it1 it1 Ai 5 A €Aitl ( d ) The f o l l o w i n g c o n d i t i o n s a r e e q u i v a l e n t : ( d l ) f o r a l l 0s i < r, each A . E Ai i s i n c l u d e d i n two d i s t i n c t elements o f 1
Aitl; ( d ) f o r a l l 0 c i < r , each A . E A . i s i n c l u d e d i n two d i s t i n c t elements o f 2 1 1 ( d 1 f o r a l l 0 s i < r , each A. E A. i s t h e i n t e r s e c t i o n o f elements o f A * 3 1 1 r' (d f o r a l l O c i < j 6 r , each A. E A . i s t h e i n t e r s e c t i o n o f t h e elements 4 1 1 o f A. c o n t a i n i n g A i ' J P r o o f . ( a ) Suppose x E X \ A , . Since X = U A, we have X E A . f o r some A.EA AE A J J j' Then x E A , v {XI = A C A , and A i s t h e unique element o f A i n c l u d i n g x. I f 1 - j 1 1 x E A . and O < i < j , t h e r e i s a c h a i n A,CA C . . . C Aic c A. ( A S € A s , O t s < j ) , J 1 J w i t h x E A1 = A, v {XI, so t h a t x E A cA 1 i' ( b ) I t i s enough t o prove t h a t i f x E A . \ A,, t h e r e e x i s t s some A. E A . such J 1 1 t h a t xEAi CA This f o l l o w s from ( a ) .
...
j'
5 Aitl
= A . E A ., w i t h i s j s ( i t l l - 1 by C o r o l l a r y 5.2, so t h a t n J J A! n Uyt1 by P r o p o s i t i o n 5.1 ( e ) . i it1 ( d ) ( d l ) * ( d 2 ) . From ( d i t f o l l o w s t h a t each A.E A . ( O < i < r ) i s i n c l u d e d 1 1 1
( c ) Ai
j = i and A
=
On a Generalization of Injection Geometries
133
and Ar-l i s i n c l u d e d i n two d i s t i n c t elements o f A Ar-1 r' ( d 2 ) * ( d 1. From ( d we have t h a t A . C A ' n A " w i t h A,; A" d i s t i n c t e l e 2 1 r r r = ments o f Ar. I f x ' EA; \ A:; and x" EA; \ ,A; t h e n Ai 2 A;+1 n AYtl w i t h A! 1+ I = A. v t x ' l and A! = A. v t x " 1 , A ' 1 l+l 1 it 1 # AYtl. i n a chain A.C 1
. e C
L
1 2 1 2 ( d 3 ) . From ( d 1 we have A. c A. "Aitl w i t h Ai+l # Ai+l and f r o m ( a ) 1 1 - 1+1 L we g e t Ai = A : nAit,. I f i t 1 = r t h e n ( d ) i s proved. I f i t 1 < r t h e n f r o m ( d ) 1 +1 3 1 11 12 2 21 and f r o m ( a ) we g e t A1 = Ait2 nAi+2 and Ai+2 = A. nA:f2 so t h a t it1 1t 2 hk A. = /--\ Ait2, and so on. i l ~ h k, c 2 (dl)
=,
(d4) * ( d
3
1. Obviously.
(dl) * ( d 4 ) . I n d u c t i o n on j - i . If j - i = 1, then, by ( a ) , ( d 1 i m p l i e s ( d ) . 1 4 Suppose t h a t each Ai E Ai i s t h e i n t e r s e c t i o n o f t h e elements o f A including j-1 A.. By t h e p r e v i o u s argument each such A . i s t h e i n t e r s e c t i o n o f t h e elements 1 J-1 o f A. i n c l u d i n g A * a l l such A . a r e p r e c i s e l y t h e elements o f A . i n c l u d i n g A J - j-1' J J i (because i f AiC A. f o r some A . E A . , t h e n t h e r e e x i s t s Aj-, E Aj-l w i t h J J J A.C A . C J\., by P r o p o s i t i o n 5.1 ( b ) ) . 1 J-1 J I f A E A h and A E A we say t h a t A and A a r e j o i n a b l e i f t h e y a r e i n h k k' h k A; c l u d e d i n some A E A . I f A h and A k a r e j o i n a b l e , we d e f i n e Ah v A k = A n EA A2AhU A t h e n Ah v A = A E A f o r some c >, max [ h , k l . k k c c
P R O P O S I T I O N 5.4.
I f A,,€
Ah, Ak E Ak a r e j o i n a b l e w i t h Ah v A
A nA = A . E A . t h e n h+k>Ii+c. h k 1 1 Proof. I n d u c t i o n on k - i 2 0 . I f k = i , t h e n A =
A
h
v Ai
=
Ah;
k
= A . C_
i
A
h
and A
c
= Ac E Ac and
k =
A v A = h k
i t follows htk = c t i . E A Then w i t h Ai 5 Ak-lCAk. k-1 k-1 Ah v Ak = Ac. Then c ' t c . I f c ' c c t h e n t d A c , ; i f x E A k \ A c , , t h e n
ifk & i + l , l e t be A
Ac, = Ah v Ak-l x
c_
) v Ix) = A v Ix) = = A v Ak = Ah v (A v {XI) = (Ah v A c h k- 1 k- 1 C' I n c o n c l u s i o n c ' t l > c . By t h e i n d u c t i o n h y p o t h e s i s h t k - 1 2 i + c ' , so
A so ~ t-h a~t A
~
Acl+l' that h
t
k %i t c'
THEOREM 5.5.
t
1> i
t
L e t Gr(X)
c. =
0
(S,S,X,A)
be a geometry o f r a n k r 6 3 . Then Gr(X)
satisfies the following condition: ( * ) i f Ah€
and A
k
$,
AkC
Aky A h n A k = A . w i t h h
are j o i n a b l e ,
1
t
k s i t r and i f AhU A E 7, t h e n Ah k
P.V. Ceccherini and N . Venanzangeli
134
Proof. We can suppose w i t h o u t l o s s o f g e n e r a l i t y t h a t h s k . The theorem i s t r u e f o r r = 1.
If r
=
-
2, t h e n a c t u a l l y h t k
i s 2. We can ObViOUSlY
assume t h a t Ah and A
k
a r e n o t i n i n c l u s i o n . I n t h i s case, t h e p o s s i b l e values o f h, k and i a r e : i = O , h = k = l . L e t A1, A ' € A be such t h a t AIUA' E 7 w i t h A nA' = A,€ A,. Then A1 # A' 1 1 1 1 1 1' and i f x E A ' \ A i t i s easy t o prove t h a t A v ( X Ii s an element o f A i n c l u d i n g 1 1 1 2 A1 and A;.
If r
= 3 then a c t u a l l y h t k -
i -<3. kk can obviously
assume t h a t Ah and A
k a r e n o t i n i n c l u s i o n . I n t h i s case, t h e p o s s i b l e values o f h, k and i, which a r e d i s t i n c t from t h e choice
i=O,
h = k = l a l r e a d y considered, a r e
Ii=O,
h = l , k=21 and
li=1, h=k=2) ,
we have A E A1, A2€A2, A1 n A2 = A, A U A € 9 . It 1 1 2 i s easy t o check t h a t t h e element A 3 € A 3 d e f i n e d by A v {XIwhere x E A \ A o , 2 1 c o n t a i n s A and A 1 2' When i = l , h=k=2, we have A A;EA2, A nA' = A € A and A 2 U A ' € 9 , Then i t 2' 2 2 1 1 2 i s easy t o prove t h a t t h e element A E A d e f i n e d by A3 = A v { X Iwhere 3 3' 2 xEA' \ A = A' \ A c o n t a i n s A and A' 2 2 2 1 ' 2 2' When i = O , h = l and k.2,
REMARK 5.6. rem 5.8).
When r ,4,
c o n d i t i o n ( * ) i s n o t n e c e s s a r i l y s a t i s f i e d ( c f . Theo-
I t can be proved t h a t t h e f i r s t values o f i, h and k , f o r which t h e
p r e v i o u s argument f a i l s , a r e I i = O , h=k=2). There e x i s t s an 9-geometry G ( X ) = ( S , 9 , X , A ) , namely a p e r m u t a t i o n 4 geometry o f rank 4, f o r which c o n d i t i o n ( * ) i s n o t s a t i s f i e d . 2 P r o o f . L e t be N = {1,2, 61. An element ( h , k ) E N w i l l b e w r i t t e n hk. L e t LEMMA 5.7.
...,
X
U l , 22, 33, 44, 45, 35, 26, 15), A,,
=
A.
I
=
I t h e set o f singletons o f X I
=
=
0, A,
tIxy1 : x y E X 1 ,
A = I t h e s e t of a l l t h e i n j e c t i v e p a i r s o f X I , 2 A:')=
t l l , 22, 33, 451,
A):'
= t l l , 22, 44, 351,
A:3)=
[33, 44, 11, 261,
A:4)
= I33, 44, 22, 151,
A:51=
Ill, 45, 261,
Ai6)
=
= IAJ,
(11, 35, 26),
A:7)
10 A = U A(i) 3 i=l 3
with:
= I33, 45, 261,
135
On a Generalization of Injection Geometries
) !A
= (33, 26,
151,
A )':
A"):
= (44, 35, 261,
= t44, 26,
151,
3
A = ." A(i) 4 1=1 4
with:
A:)'
ill, 44, 35, 26),
A:')=
= (11,
33, 45, 261,
A t 3 ) = f33, 44, 26, 15). L e t be
4 9
I1 c - N2 : I i s i n j e c t i v e 1 and A =
=
A
i'
i s a p e r m u t a t i o n geometry G ( X ) o f r a n k 4 4
I t i s easy t o check t h a t (S,y,X,A)
on
i =uo
x.
L e t us c o n s i d e r t h e elements o f A2 '. A 2 = ill, 221 and A; = I33, 441. Actual= 0 = A,, 2 + 2 - 0 6 4 , A p U A ; € 7 , b u t A and A ' a r e n o t j o i n a b l e , i . e . 2 2 G ( X I does n o t s a t i s f y c o n d i t i o n [ * I . 4 l y A2nA;
F o r each r >, 4 t h e r e e x i s t s an 9-geometry (resp. a p e r m u t a t i o n
THEOREM 5.8.
geometry) Gr(X) o f r a n k r, such t h a t c o n d i t i o n ( * ) i s n o t s a t i s f i e d . P r o o f . I n d u c t i o n on r 3 4 . For r = 4, t h e theorem reduces t o Lemma 5.7. Suppose t h a t t h e r e e x i s t s an 9-geometry ( r e s p . a p e r m u t a t i o n geometry) G;-l =
(S',S',X',A')
o f r a n k r - 1 2 4, f o r which c o n d i t i o n ( * ) i s n o t s a t i s f i e d ; i n o t h e r
A ' E A ' such t h a t : A ' n A ' = A!, h t k - i s r - 1, k k h k i A' UA' E 7' and A' and A ' a r e n o t j o i n a b l e . h k h k be an F g e o m e t r y ( r e s p . a p e r m u t a t i o n geometry) of L e t GI' = (S",7",X",d") 1 r a n k 1 w i t h A: = (A:). Then we c l a i m t h a t Gr = GAq1 b G; = (A,9,X,A) ( r e s p . words, t h e r e e x i s t
-
b G;) i s an 9-geometry ( r e s p . a p e r m u t a t i o n geometry) o f rank r such Gr = G ' r-1 t h a t c o n d i t i o n ( * ) i s n o t s a t i s f i e d . Indeed
Ah = A ' U A t E A h h'
A = A' U A: E A a r e such t h a t : k k k
A h n A k = (A; n A ; ( ) u A :
= A;UA:
€Ai,
5
k ( A ' U A " ) E A t h e n A,',uA'
h
t
k - i s r
-
I
and A a r e n o t j o i n a b l e , because i f h k C A ' E A ' , which i s i m p o s s i b l e . k -
AhUAk = (A;uAt)uA:€9(resp.E3), AhUAk
but A
0
REMARK 5.9. o f [31 f o r a l l r
=
From Theorem 5.8. 5
we g e t a
counterexample f o r P r o p o s i t i o n 2.3.
4. The p r o o f o f P r o p o s i t i o n 2.3.
i s i n c o r r e c t because t h e f l a t s
" A " and " B ' " a r e n o t n e c e s s a r i l y such t h a t A u B ' i s an i n j e c t i v e s e t .
We n o t e t h a t P r o p o s i t i o n 2.3. o f [ 3 ] i s t r u e f o r r 4 3 , by Theorem 5.6.
136
P. V. Ceccherini and N. Venanzangeli Other p r o p e r t i e s o f 3'-geometries,
s t a t e d i n [ 9 ] , w i l l be developed i n ano-
t h e r paper. ACKNOWLEDGEMENT. This r e s e a r c h was p a r t i a l l y supported b y GNSAGA o f CNR and by M P I . BIBLIOGRAPHY
[ l ]P.J. Cameron and M. Deza, On p e r m u t a t i o n geometries, J. London Math. SOC. ( 2 ) 20 (1979) 373-386. [ 2 ] P.V. Ceccherini and G. Ghera, A Vagner-Preston t y p e theorem f o r semigroups w i t h r i g h t i d e n t i t i e s , Quad. Sem. Geom. Comb. 1 s t . Mat. Appl. Univ. L ' A q u i l a 4, (1984). [ 3 ] M. Deza and P. F r a n k l , I n j e c t i o n geometries, J . Comb. Theory ( B ) 37 (1984) 31-40.
[ 4 1 M. Deza and P. F r a n k l , On squashed designs, ( t o appear).
[51 G. Ghera, Algebra e geometria d e l l e corrispondenze p a r z i a l i d i un insierne i n
se,
Tesi, Roma, 1 s t . Mat. " G . Castelnuovo",
l u g l i o 1983.
[ 6 1 M. Laurent, Geometries laminges: aspects a l g e b r i q u e s e t a l g o r i t h m i q u e s , These Univ. P a r i s V I I ( t o appear). I 7 1 6. Segre, I s t i t u z i o n i d i geometria s u p e r i o r e (a.a. 1963-641, Appunti d i P . V . C e c c h e r i n i Vol. 111: Complessi, r e t i , d i s e g n i , Roma, 1 s t . Mat. "G. Castelnuovo", 1965.
[81 M.C.
S c h i l l i n g , GBometries laminees e t bouquets de m a t r o i d s , P a r i s V I ( t o appear).
These,
Univ.
[ 9 ] N. Venanzangeli, Geometrie d i permutazioni, geometrie i n i e t t i v e e l o r o gener a l i z z a z i o n e , Tesi, Roma, 1 s t . Mat. "G. Castelnuovo", l u g l i o 1984.
Annals of Discrete Mathematics 30 (1986) 137-142 0 Elsevier Science Publishers B.V. (North-Holland)
137
A NEW CHARACTERIZATION OF HYPERCUBES P i e r V i t t o r i o C e c c h e r i n i and Anna Sappa O i p a r t i m e n t o d i Matematica "G. Castelnuovo" U n i v e r s i t i d i Roma "La Sapienza" C i t t i U n i v e r s i t a r i a , 00100 Roma, I t a l y
By u s i n g a theorem o f S. Foldes [ Z ] , we p r o v e t h a t a f i n i t e graph G i s a hypercube i f f i t i s connected, b i p a r t i t e , and t h e number o f geodesics between any two v e r t i c e s o f t h e graph GxK2 depends o n l y on t h e i r d i s t a n c e . Graphs o f t h e t y p e GxK, are also considered.
1. INTRODUCTION I n what f o l l o w s ,
a l l graphs w i l l be f i n i t e w i t h o u t l o o p s o r m u l t i p l e edges.
I f G = (V,E)
i s a graph and i f two v e r t i c e s x , y ~ V a r e j o i n e d by a path, t h e dis-
tance d(x,y) -
i s d e f i n e d as t h e number o f edges i n a g e o d e s i c ( s h o r t e s t p a t h ) be-
tween x and y . We denote by u ( x , y )
= v G ( x , y ) t h e number o f d i s t i n c t geodesics o f
G between x and y . I f x=y, we p u t d(x,y)=O and y ( x , y ) = l . We say t h a t a connected graph G i s a graph w i t h a g e o d e t i c f u n c t i o n i f t h e r e e x i s t s a map F:[O,l,..,
diam G I - N
such t h a t u ( x , y )
= F(d(x,y));in
t h i s case we
s h a l l say a l s o t h a t G i s F-geodetic. A s t u d y o f F - g e o d e t i c graphs i s developed i n
[8] i n a more general c o n t e x t . For each p o s i t i v e i n t e g e r n, t h e n-cube Q
i s d e f i n e d ( u n i q u e l y up t o i s o n morphism) as t h e graph whose v e r t i c e s a r e t h e subsets o f a s e t S w i t h n elements and t w o v e r t i c e s a r e j o i n e d by an edge i f and o n l y i f t h e y d i f f e r f o r e x a c t l y one element. I n o t h e r words t h e v e r t e x s e t o f Qn i s t h e s e t o f o r d e r e d n - p l e s o f 0 and 1; two v e r t i c e s a r e j o i n e d b y an edge i f and o n l y i f t h e y d i f f e r f o r e x a c t l y one d i g i t . A hypercube i s a graph isomorphic t o some
9,.
Several c h a r a c t e r i z a t i o n s o f hypercubes were g i v e n i n [ 1 1 - [ 5 1 ;
i n [51
p r e v i o u s c h a r a c t e r i z a t i o n s a r e a l s o summarized. We m e n t i o n h e r e t h e f o l l o w i n g c h a r a c t e r i z a t i o n g i v e n by S. Foldes. THEOREM 1.1 (S. Foldes [ 2 1 ) . A graph G i s a hypercube i f and o n l y i f
the
P.V. Ceccherini and A . Sappa
138
( 1 ) G i s connected and b i p a r t i t e , ( 2 ) G i s F-geodetic w i t h F ( k ) = k ! . Theorem 1.1 has been extended i n [ 6 ] t o a q-analogous r e s u l t . A q-hypercube Qq i s d e f i n e d as t h e graph whose v e r t i c e s a r e t h e subspaces o f a g r a p h i c space S n o f o r d e r q and dimension n-1, and two v e r t i c e s a r e j o i n e d b y an edge i f f one o f
them i s covered by t h e o t h e r i n t h e l a t t i c e o f a l l subspaces. For q = l , we have 1 Qn 9., I n t h i s paper we g i v e a c h a r a c t e r i z a t i o n o f hypercubes which i s based on theorem 1.1
and on t h e concept o f t h e t r a n s l a t i o n graph TG' o f a graph G '
(V',E').
The graph TG'
where K
i s t h e complete graph on two v e r t i c e s ( 1 and 21, ( c f . a l s o [ 7 1 ) .
2
i s t h e p e r m u t a t i o n graph ( G ' , i d V , ) ,
copy o f
X'E
V';
be a copy o f G ' = ( V ' , E ' )
more g e n e r a l l y ,
i . e . A" = { ~ " E V " : x ' E A ' I .
E
=
E ' uE"LI{(x' ,XI')€ V'XV":
= G'xK
2'
A'CV',
and l e t x " E V " denote t h e
t h e n A"cV" - w i l l denote t h e copy o f A ' ,
Then T G ' = (V,E) where V = V'uV" and X'
EV'l
The d e s c r i p t i o n o f TG' = (V,E)
V = V'xt1,ZI = t(x',h)
-
if
TG'
as t h e p e r m u t a t i o n graph ( G ' , i d V , 1 i s t h e
The d e s c r i p t i o n o f TG' = (V,E) f o l l o w i n g . L e t G" = (V",E")
i.e.
=
. as t h e graph G'xK
2
i s the following:
: x ' E V ' , h=1,2},
E = t((x',h),(y',k))EVxV
: [ ( x ' = y ' and ( h , k ) E E ( K 2 ) ) o r ( ( x ' , y ' ) E E '
and h=k) 11. We s h a l l prove t h e f o l l o w i n g THEOREM 1 . 2 A graph G ' i s a hypercube i f and o n l y i f
( 1 ) G ' i s connected and b i p a r t i t e , (2) G' x K
2
i s F-geodetic, for some F.
2. PROOF OF THEOREM 1.2. We s h a l l s t a r t w i t h t h e f o l l o w i n g lemma. LEMMA 2.1.
L e t G ' be a connected graph and l e t G = G ' x K 2 = TG' be t h e t r a n s -
l a t i o n graph o f G ' .
The f o l l o w i n g c o n d i t i o n s a r e e q u i v a l e n t
( a ) G' i s F'-geodetic w i t h F ' ( k )
k!,
(b) G
i s F-geodetic w i t h F ( k ) = k ! ,
(c) G
i s F - g e o d e t i c for some F.
A New Characterization of Hypercubes Proof. O b v i o u s l y ( b ) - ( a ) , ( c ) . p e r m u t a t i o n graph ( G ' , i d V , ) (a)-(bl:
We use t h e d e s c r i p t i o n o f G = G'xK
o f G ' = (V',E'!
=
dG(x,y!!.
I f x = x ' E V ' and y = y " ~V " ,
2
= (V,E)
as t h e
( 5 1).
l e t x,y€ V. It i s enough t o suppose d ( x , y b 2 .
=uG,'x,y) = d G , ( x , y ) !
139
I f x,y€V',
then
S i m i l a r l y i f x , y ~ V " , then yG(x,y) l e t x " E V " and
Y'E
=
(x,y) G dG(x,y)!. Y
=
V ' be t h e c o p i e s o f x ' and y "
r e s p e c t i v e l y . We have d ( x , y ) = d (x',y'')= d , ( x ' , y ' ) t d ( y ' , y " ) = d ( x ' , y ' ) t l . G G G G G Moreover each geodesic o f G between x = x ' and y=y" i s o f t h e f o r m g ( x , y ) =
...,z',z" ,...,y " )
i s a geodesic o f G '
between x ' and y ' and i t s copy g " ( x " , y " )
=
i s a geodesic o f G"
between x " and y".
z"=x", and t h e case z ' = y ' , i . e . z"=y", a r e
(x',
where g ' ( x ' , y ' )
...,z ' , ...,y ' ) ( x " , ...,z", ...,y" )
= (x',
=
(The case z'=x', i . e .
n o t e x c l u d e d ) . I n o t h e r words, each geodesic g ( x , y ) i s o b t a i n e d e x a c t l y once f r o m a geodesic g ' ( x ' , y ' )
by choosing i n g ' ( x ' , y ' )
(z',z") between
bridge
Y~(x,Y) = Y
G
V ' and V " ) .
(c)-(b): X'E
The number o f such z ' i s d G , ( x t , y ' ) t l . So
, ( x ' , y ' ) .(dG , ( x ' , y ' ) + l )
= (dG,(x',y')+l)!
a c t u a l l y F(0) = F ( 1 )
=
a vertex z ' (as t h e basis o f t h e
= d G , ( x ' ,y '
1. (dG,(X',Y')+l)
=
dG(x,Y)!. =
1. When x , y c V w i t h dG(x,y)
= k>2,
there exist
V ' and y " E V " such t h a t d G ( x ' , y " ) = k . I f Y ' E V ' i s t h e copy o f y", we
have
d , ( x ' , y ' ) = d ( x ' , y O = k - 1 2 1 . With t h e same argument used f o r p r o v i n g G G ( a ) * ( b ) we o b t a i n f r o m ( c ) :
By u s i n g Theorem 1.1 we can now g i v e a new p r o o f o f t h e f o l l o w i n g w e l l known
result
.
LEMMA 2.2.
Qntl
=
Q,
x Kp.
-P-r o o f . We can use t h e d e s c r i p t i o n o f Qn x K 2 ( Q n , i d v , ) o f Q, = ( V ' , E ' ) ( 5 1 ) . The graph Q,
=
TQ
n
as t h e p e r m u t a t i o n graph
i s connected and b i p a r t i t e (theorem 1.11,
so t h a t TQ,
i s also
connected and b i p a r t i t e : i f A ' u B ' i s a p a r t i t i o n o f t h e v e r t e x s e t V ' o f Q (A'u 6") u ( A "
u B ' ) i s a p a r t i t i o n o f the vertex set V
and 6" a r e t h e c o p i e s o f A ' and 6 ' r e s p e c t i v e l y .
= V'U,V" o f TQ
n'
then n where A"
P.V. Ceccherini and A. Sbppa
140
By theorem 1.1 t h e graph Q
i s F ' - g e o d e t i c w i t h F ' ( k ) = k ! , so t h a t (Lemma n 2.1) Q xK i s F-geodetic w i t h F ( k ) = k ! . The graph TQ i s consequently a hypern 2 n cube by theorem 1.1, and t h e lemma i s proved s i n c e diam (TQ,) = diamg t 1 = n t l . n
I f Tn denotes t h e n - t h power o f t h e o p e r a t o r T ( t r a n s l a t i o n n of a graph), we have Q = T K2. ntl COROLLARY 2.3.
We g i v e now t h e L e t G ' a hypercube. By theorem 1.1,
Proof o f theorem 1.2.
condition ( 1 ) i s
s a t i s f i e d . Moreover G = TG' = G'xK
i s a hypercube by lemma 2.2, so t h a t ( b y the: 2 rem 1.1 again) G'xK2 i s F-geodetic w i t h F ( k ) = k ! , ( 0 k ~ G d i a m G), and c o n d i t i o n ( 2 ' ) i s satisfied. Conversely i f G ' i s a graph s a t i s f y i n g ( 1 ) and ( 2 ' 1 , then, by lemma 2.1, s a t i s f i e s c o n d i t i o n ( 1 ) and ( 2 ) o f theorem 1.1,
G'
so t h a t G ' i s a hypercube.
3. A GENERALIZATION OF LEMMA 2.1.
If G'
= (V',E')
( m 2 2 ) , t h e graph G = G'xK, V = V'x11,2
i s t h e complete graph on m v e r t i c e s m i s defined by
i s any graph and K
,...,m l
= (V,E)
= t(x',h):x'EV',
E = [((x',h),(y',k)EVxV:
h = 1,2,..
.,ml,
[ ( x ' = y ' and ( h , k ) E E ( K
in
1) o r ( ( x ' , y ' ) E E '
and h=k)]l.
An o t h e r d e s c r i p t i o n o f t h e same graph G = G'xK = ( V , E ) i s t h e f o l l o w i n g . L e t i i i im i G = (V ,E 1 be a copy o f G ' = ( V ' , E ' ) and l e t x E V denote t h e copy o f x ' E V ' , 1 ,m, where we assume G1 = G I , x = x ' . Then i=1,2,.
..
v
=
m u i=1
i
v ,E
m =
.
. u E' 1 =1
i ' u i ( x ,~J).v
i xvj :
X'EVI,
i,j=1,z
,...,m ; i + j l .
Lemma 2.1 i s i n c l u d e d f o r m=2 i n t h e f o l l o w i n g PROPOSITION 3.1.
Let G' =
(V',E'l
be a connected graph and l e t be G
=
G'xK
( m 2 2 ) . The f o l l o w i n g c o n d i t i o n s a r e e q u i v a l e n t ( a ) G' i s F'-geodetic w i t h F ' ( k ) = k ! (b) G
i s F-geodetic w i t h F ( k ) = k !
(c) G
i s F-geodetic f o r some F.
Proof. We can use t h e same argument as f o r Lemma 2.1. Indeed, i f x,yC V w i t h i i i x=x E V and y = y j ~ V (j i # j )t,h e n t h e o n l y e s s e n t i a l p o i n t i s t h a t G x I i , j ) = i = TG " T G ' .
m
A New Characterization of Hypercubes
COROLLARY 3.2.
141
A graph G ' i s a hypercube i f and o n l y i f
( 1 ) G ' i s connected and b i p a r t i t e ,
( 2 " ) G'xK
m
REMARK 3.3.
i s F-geodetic f o r some F and some m. P r o p o s i t i o n 3.1 e a s i l y y i e l d s a f a m i l y o f connected graphs which
a r e F-geodetic w i t h F ( k ) = k ! and which a r e n o t hypercubes (because t h e y a r e n o t bipartite). ACKNOWLEDGEMENTS.
T h i s r e s e a r c h was p a r t i a l l y supported by GNSAGA o f CNk
and by M P I . BIBLIOGRAPHY [ l ] L.R. Alvarez, U n d i r e c t e d graphs r e a l i z a b l e as graphs o f modular l a t t i c e s , Can. J . Math. 17 (1965) 923-932. [ 2 j S . Foldes, A c h a r a c t e r i z a t i o n o f hypercubes, D i s c r e t e Math. 17 (1977) 155-159. 131 J.M. Laborde, C h a r a c t e r i z a t i o n l o c a l e du graphe du n-cube, t o i r e s , Grenoble (1978).
Journee Combina-
[ 4 1 J.D. McFall, Hypercubes and t h e i r c h a r a c t e r i z a t i o n s , U n i v e r s i t y o f Waterloo Dept. o f Combinatorics and O p t i m i z a t i o n Research Report CORR 78-26 ( 1 9 7 8 ) . [ 5 1 J.D. 241.
McFall,
C h a r a c t e r i z i n g hypercubes, Annals D i s c r e t e Math. 9 (1980) 237-
[ 6 1 P . V . C e c c h e r i n i , A q-analogous o f t h e c h a r a c t e r i z a t i o n o f hypercubes as graphs, J . Geometry 22 (1984) 57-74.
[ 7 1 A. Sappa, C a r a t t e r i z z a z i o n e d i g r a f i t r a m i t e geodetiche, Tesi, Univ. d i Roma, D i p a r t i m e n t o d i Matematica (1984). [81 P . V . C e c c h e r i n i and A. Sappa, F-binomial c o e f f i c i e n t s and r e l a t e d combinat o r i a l t o p i c s : p e r f e c t m a t r o i d designs, p a r t i a l l y o r d e r e d s e t s o f f u l l b i n o m i a l t y p e and F-graphs, Annals D i s c r e t e Math. ( t h i s volume).
This Page Intentionally Left Blank
Annals of Discrete Mathematics 30 (1986) 143-1 58 0 Elsevier Science Publishers B.V. (North-Holland)
143
F-BINOMIAL COEFFICIENTS AND RELATED COMBINATORIAL TOPICS: PERFECT MATROID DESIGNS, POSETS OF FULL BINOMIAL TYPE AND F-GEODETIC GRAPHS P i e r V i t t o r i o C e c c h e r i n i and Anna Sappa D i p a r t i m e n t o d i Matematica "G. Castelnuovo" Uni v e r s i t l d i Roma "La Sapi enza" C i t t a U n i v e r s i t a r i a , 00100 Roma, I t a l y
We i n t r o d u c e F-binomial c o e f f i c i e n t s as a n a t u r a l g e n e r a l i z a t i o n o f b i n o m i a l and q - b i n o m i a l c o e f f i c i e n t s . A g e n e r a l c a l c u l u s w i t h these numbers l e a d s t o u n i f y t h e a r i t h m e t i c a l p r o p e r t i e s o f ( f i n i t e ) p r o j e c t i v e and a f f i n e spaces and o f S t e i n e r systems S(t,k,v) i n t o those o f p e r f e c t matroid designs ( 5 2 ) . P a r t i a l l y o r d e r e d s e t o f f u l l b i n o m i a l t y p e ( 5 3 ) and graphs such t h a t t h e number o f geodesics between any two v e r t i c e s depends o n l y on t h e i r d i s t a n c e ( 5 4 ) a r e a l s o s t u d i e d by means o f t h i s f o r m a l c a l c u l u s .
1. F-BINOMIAL COEFFICIENTS Let N (resp.
Q ) denote t h e s e t o f non n e g a t i v e i n t e g e r s ( r e s p . r a t i o n a l
numbers) and l e t be N* = N \ ( O I , L e t F: N
+
Q*
=
Q\rO).
Q* be any f u n c t i o n such t h a t F ( 0 )
any f u n c t i o n such t h a t f ( 0 ) = 0, f ( 1 )
=
1 and f ( N * )
=
F ( 1 ) = 1 and l e t f : N
+
Q be
5 Q*.
F and f w i l l be f u n c t i o n s s a t i s f y i n g t h e above c o n d i t i o n s .
I n what f o l l o w s ,
Given an F, t h e a s s o c i a t e d f w i l l be d e f i n e d by: f(0)
0, f ( n )
F(n)/F(n-l) for n 1 1 .
=
Given an f, t h e a s s o c i a t e d F w i l l be d e f i n e d by: F ( 0 ) = 1, F ( n ) = f ( n ) F ( n - 1 )
i . e . F(n) = f ( n ) f ( n - l ) . . , f ( l )
Two such f u n c t i o n s F and f a r e t h e n m u t u a l l y associated,
f o r n 31.
and sometimes below t h e y
w i l l be used i n t e r c h a n g e a b l y . DEFINITION 1.1.
Given a p a i r ( F , f ) o f m u t u a l l y a s s o c i a t e d f u n c t i o n s and g i v e n
any i n t e g e r s k,n w i t h
OC
n
k < n , we s h a l l d e f i n e t h e F-binomial c o e f f i c i e n t ( o r
b i n o m i a l c o e f f i c i e n t ) I 1 as t h e r a t i o n a l number k F
f-
144
P. V. Ceccherini and A. Sappa
These numbers t u r n o u t t o be p o s i t i v e i n t e g e r s i n t h e f o l l o w i n g examples ( i n which f and F a l s o t a k e i n t e g e r v a l u e s ) .
EXAMPLE 1.2.
Binomial c o e f f i c i e n t s . Consider t h e p a i r o f m u t u a l l y a s s o c i -
ated functions
fl(t)
=
t
F ( t ) = t! 1
and
for a l l tEN.
Then n
in)= k F1
= Ik} i s t h e usual b i n o m i a l c o e f f i c i e n t
k fl
(O
EXAMPLE 1.3. Gaussian numbers. Given an i n t e g e r q > 1 , c o n s i d e r t h e p a i r o f m u t u a l l y associated f u n c t i o n s
f (t) = [ t l 9 9 where [ ]
9
[Ol,!
F ( t ) = [t],! 9
and [ ] ! a r e d e f i n e d by q
9
[OI
and
=
[ll
0,
=
=
9
[ll ! q
[tlq
1,
= q
t-1
t
... + q t l ,
[ t l q l= [ t l [ t - 1 1
= 1,
q
q
... [ llq,
t 22.
Then
n - n I k I F - ikIf 9 q
n
[,Iq i s
the q-binomial coefficient
EXAMPLE 1.4. Constant c o e f f i c i e n t s .
( g a u s s i a n number, c f . 141).
Given an i n t e g e r a z 1, c o n s i d e r t h e
p a i r o f mutually associated functions f(0) = 0,
f(1