1. Trang chủ
  2. » Thể loại khác

DSpace at VNU: Some problem on the shadow of segments infinite boolean rings

4 109 0

Đang tải... (xem toàn văn)

THÔNG TIN TÀI LIỆU

Thông tin cơ bản

Định dạng
Số trang 4
Dung lượng 838,19 KB

Các công cụ chuyển đổi và chỉnh sửa cho tài liệu này

Nội dung

References [1] I.Anderson,Combinatorics o f JInìte sets, Clarendon Press, Oxford, 1989.. [2] B.Bolloba?. Combinatorics, Cambridge University Press, 1986.. H.Katona, A ứìeorem on ílnite s

Trang 1

V N U Joum al o f Science, M ath em atics - P hysics 23 (2 0 0 7 ) 2 2 1 -2 2 4

Some problem on the shadow of segments inĩmite boolean

rings

A b s t r a c t In this p a p e r , vve co n sid er finite B oolean rings in vvhich w ere d efm e d tw o orders:

natural o rd er and an tilex ico g ra p h ic order T he m ain resu lt is co n c em ed to the n o tio n o f shadovv

o f a segm ent We sh a ll p rove som e necessary and su íĩic ie n t co n d itio n s for th e sh ad o w o f a

segm ent to be a segm ent

1 Introduction

C o nsid er a íin ite B oolean ring: B ( n ) = { x = XỊX2 -Xn : Xi € {0 , 1 }} w ith natural o rd er < /v

defined by X <N y <=> x y = X. For each elem en t X 6 B (n), w eigh t o f X is d c íin e d to be: w (x) =

XỊ -h X2 + + x n i.e the n u m b er o f m em bers Xi Ỷ 0 -In the ring B (n), let B (n,k) be the su b se t o f all

the elem ents x € B (n ) such th a t w (x ) = k

W e d e f in e a lin e a r o r d e r <L, o n B ( n ,k ) b y fo llo w in g r c la tio n F o r c a c h p a ir o f c l c m c n ts X, y €

B (n,k), w h ere X = x \ x n, y = 2/1 ■■■yn , £ < 1 y if and only if th ere exists an index t such that Xt < yt

and Xi — yi w henever i > t. T h a t linear o rd er is also called an tilexicog raph ical order N o te th a t each

elem ent X = x \ x n € B (n,k) can be rep resen ted by s e q u e n c e o f all in d ic e s n \ < < njt su ch th at

x n = 1 T h u s w e can id e n tiíy th e elem en t X w ith its co rrespo nd in g seq u en ce and w rite X = ịn \ , Tik)

t such that n t < Tĩit and Tiị = rrii if i > t

It has been shown by Kruskal (1963), see [1], [2] that the place of element x=( n 1 , Tik) 6 B(n,k)

in the antilexicographic ordering is:

We rem ark that <p is Ihe one-one correspondence.T hereíòre ip{A) = <p(B) is e q u iv a le n t to A = B , fo r

every subsets A , B in B (n ,k )

N o w , su p p o se a € B (n ,k ) w ith k > 1, the shadow o f e le m e n t a is d e í ì n e d to b e Aa = { x G

B (n ,k - 1) : X <yv tt}- I f A c B ( n ,k ) , the shadoui of A is th e Union o f a ll A a, a e A i.e =

* Corresponding author E-mail: lecaotusp@yahoo.com

221

T ra n H u ye n , L e C ao T u *

D e p a rtm e n t o f M a th e m a tic s a n d C o m p u ter Scien ces U niversitỵ o f P edagogy, H o c h im in h City

745/2A L a c L ư n g Q uan, w a rd 10, D ìst Tan Binh, H o c h im in h City, Vietnam

R eceived 18 S ep tem b er 2007; received in revised form 8 O c to b e r 20 0 7

Trang 2

222 Tran Huy en, Le Cao Tu / VNU Journaỉ o f Science, Maihematics - Physics 23 (2007) 22 ì -224

ỊJ A a = { r r G D (n, k — 1) : X <JV OL fo r some a € A } T h u s the sh ad o w o f A co nta in a ll the elements

X € B ( n , k - l ) w h ic h can be o bta in ed b y re m o v in g an in d e x fro m the elem ent in A T h e co nce p tion about the shadow o f a set was used e flfìc ie n tly b y m a n y m a th e m a ticia n s as: S pem er, K ru s k a l, K atona,

C lem ent, ?

We s h a ll s tu d y here the sh ad o w o f segm ents in B (n ,k ) and m ake som e c o n d itio n s fo r that the shadovv o f a segm ent is a segm ent A s in any lin e a rly ordered set, fo r e very p a ir o f elem ents a,b

€ B (n ,k ), the segm ent [a ,b ] is d e íĩn e d to be: [ a , b ] = { x e £ ( n , k) : a < 1 X < 1 6 } Hovvever, i f

a = ( l, 2 v ? ,k )€ B (n ,k ) is the íir s t elem ent in the a n tile x ic o g ra p h ic o rd e rin g , the se g m e n t’ [a ,b ] is ca lle d

an initial segment and denoted b y IS (b ) so IS ( b ) = { x € B ( n , k) : X < 1 b}. We re m in d here a v e ry

u se fu l re su lt, prooĩ o f w h ic h had been g ive n b y K ru s k a l e a rlie r (1 9 6 3 ), see [4 ], [2 ] We State th is as

a le m m a

L e m m a 1.1 Given b = ( m i , m2, rrik)^B(n,k) wiíh k > 1 then A IS (b ) = IS(Ư), where ư =

T h is re s u lt is a special case o f m ore general results and o u r a im in the next section vvill State and pro ve those L e t a = ( n i, 7 i2 , and b = ( m i , 7712, be elem ents in B (n ,k ) C o m p a rin g

two indices ĩiịc a n d rrik , it is possible to arise three fol!owing cases:

(a) m k = n k = M

(b ) mic = rik + 1 = M + 1

(c ) m k > rik + 1

In each case ,w e shaỉl s tu d y necessary and su(Ticient c o n d itio n s fo r the shadow o f a segm ent to

bc a segment.

2 Main rcsult

B e fo re s ta tin g the m ain re su lt o f th is section, w e need some f o llo w in g te c h n ic a l lem m as F irs t

o f all, w e e sta b lish a fo llo w ing lem m a as an ap p licatio n o f th e ío rm u la (1):

L e m m a 2.1 Leỉ a = ( n i , ri2)rik) and b = ( m i , m2, Tĩik) be eỉements in B(n,k) such that

Kk < m k < n and ỉet M be a number such that rrik < M < 71 Dejìne X = ( n i , r i2, 7ifc, M ) ,

y = ( m i , m 2, , m k, jVÍ) eB(n,k+I) Then we have:[x,yj={c +M : c e [a,b]} and [a,b]={z -M : z € fx,yj}.

(Note that here we denote X = a+ M and a = X-M )

Proof. It fo llo w s fro m the fo rm u la (1 ) tha t, fo r a n y c € [a ,b ],

<p(c+M) = < ,c (c )+ ^ ^ , thereíore tp({c+M : c € [ a , 6 ] } ) = [ y > ( a ) + ^ ^ ;v > (6 )+

( M k Ị l ^ ] = [v?(ar);<,ơ(ỉ/)] = v ( [ ^ ; y ] ) So [x ; y ] = { c + M : c [ a ,b ]} B y u s in g s im ila r argum ent fo r the re m a in in g e q u a lity , vve fin is h the prove o f th e lem m a

A s an im m e d ia te consequence,w e get the fo llo w in g

m uc L e m m a 2.2 Let a,b £ B(n,k) be elements such that a = (ỉ k-1, M) and b =(M-k+l

then the shadow A [ a , 6] = IS(c) with c = (M-k+ 2 M -1M )£ B(n,k-1).

Proof C hoose g = ( l , , k - l) ; d = ( M - k + l , , M - l) in B ( n ,k - l) T h e n it fo llo w s fro m lem m a 2.1 th a t A

= { x - M : X € [ a , b ] } = [g; d ]= IS (d ) H o w e ver, w e also have fro m the le m m a 1.1 that A i4 = A IS{d) —

I S ( c — M ) R epeating to a p p ly the le m m a 2.1 to the set B ={z + M : z 6 A Ấ } We have obtained

Trang 3

Tran Huyen, Le Cao Tu / VNU Journal o f Science, Malhemalics - Physics 23 (2007) 2 2 ì -224 223

B = [h ;c ] vvhere h = (l, ? ,k -2 , M ) N o te th a t (p(d) + 1 = tp(h) so A and B are tw o c o n se cu tive segments

T h e re íò re th e ir U nion: A [ a ; b] — A u B = I S ( d) u Ị / i; c ] = IS ( c) is an in itia l segm ent T h e p ro o f is

co m p lete d We n o w get some u s e fu l consequences o f th is le m m a as fo llo w s :

C o r o lla r y 2.1 Let a = { n \ ,n /c -1, M ) and b=(M — k + 2 , M, M + 1) be elements in B(n,k) then

A Ị a , 6] =IS(c) with c = (M - k + 3 , M , M + 1 ) € B(n,k-Ỉ).

Proof. C hoose d = ( l, ? , k - l, M + l ) e B (n ,k ) then [d ; b ] c [a ;b ].B y the le m m a 2.2, vve have A [ d ,6]

= IS (c ) w it h c = (M -k + 3 , ? , M , M + l ) e B (n ,k -1 ) H o w e v e r, w e also have: [a ,b ]C lS (b ) so A [a » *ỏ ]c

AIS(b) = IS{c). T h us A [ a , 6] c A (6) = IS (c ) as re q u ire d

C o r o lla r y 2.2 Let a = (l, ?,k-ỈM ); b = ( m i, M + 1) be eỉements in B(n,k) then A ịa , 6]

=IS(c) where c ={m2, ,771*1-1, A / + l ) e B(n,k-Ỉ).

Proof. In the p r o o f o f th is re s u lt, w e denote: h = ( M - k + l, ? ,M ) € B (n ,k ), đ = (M -k + 2 , ? ,M ),

g = ( l, ? ,k - 2 , M + l ) , c = ( m2, M + 1) in B (n ,k -1 ) T h e n ,again b y the le m m a 2.2, w e have: A [ a , h} = IS (d )C A [ a ,6] O b v io u s ly , w e also have [ g ; c ] c A [ a ,6] T h e re fo re , A [ a ;6) D

ự s { d ) u [5 ; c]) = IS (c) and as in above p r o o f it fo llo w s th a tA Ịa , 6] = IS (c )

C o r o lla r y 2.ĩJLet a = ( n i , n2, Tik) andb = ( m i , 7 7 1 2 ,rrik)B(n,k) begiven such that m k > nfc + 1

then A Ị a , 6] =IS(c) where c = ( m 2, mù) 6 B(n,k-1).

Proof. S ince rrik > rifc + 1, there m ust be a n u m b e r M such th a t nic + 1 < m/c - 1 = M. Choose

d = ( l, ? , k - l, M ) £ B (n ,k ), w e th e re fo re have [ d ; b ] c [a ;b ] N o te that the segm ent [d ;b ] s a tisíys

c o n d itio n s o f c o ro lla ry 2.2, w e n o w im ita te the above p ro o f to fin is h the c o ro lla ry C e rta in tly , the last

c o ro lla ry is a s o lu tio n fo r o u r k e y que stio ns, in the case (b ) W h a t abo u t the re m a in in g case ? F irs t o f

a ll, w e tu m o u r a tte n tio n to the case (a) and have tha t:

T h e o re m 2 1 Let a,b e B(n,k) be elements such that a = { ĩ i \ ,n fc _ i, M) andb = ( m i , TTik-1, M)

then A [ a , 6] is a segment i f and only if m \ = M - k + 1 and either Tik- 1 < M — \ or nic- 2 — k — 2

Proof. T a ke c = a - M ; d = b - M e B ( n , k - l ) then A [ a ; b} = [c; d] u { x + M : X e A [ c , d]}. Suppose th a t

A [ a , 6] is a segm ent then there m u s t have g = ( l , ? , k - l ) € A [ c ; ể ] and v?(cỉ) + l = <p(g + M ). T h e re fo re

w e have th a t d = ( M - k + l, ? , M - l) i.e m i — M - k + 1 In the case rifc _ i = M — 1 , since g + M G

A [ a ,6] so h = ( l, ? ,k -2 , M - l , M )G [a ,b ] T h e re ío re , a < h. H o w e ve r, rik- 1 = M - 1 fo llo w s th a t

h = ( 1 ,? , f c - 2 , < ( n1, , n fc-2, M - 1 , M ) — a T h u s a = h , i.e, nk - 2 = k -2 C on verse ly, suppose th a t a = ( l, ? , k - 2 , M - l, M ) and b = ( M -k + 1 , ? , M - l , M ) We s h a ll pro ve th a t A [ a ,6] is a segm ent A p p ly th e lem m a 2.2 to segm ent [a - M ; b - M ] , w e o b ta in A [ a - M , b - M] = IS ( c) w h e re c

= ( M -k + 2 , ? , M - l ) We n o w have A [ a ;6] = [a — M ] b - M ] u { x + M : X 6 IS (c)} to be the Union o f

tw o c o n se cu tive segm ents T h e re fo re ,it is a segm ent In the case rik-i < M — 1, a p p ly the c o ro lla ry 2.1 ( i f Uk-I = M - 2 ) o r the c o ro lla ry 2.3 ( i f n j t _ i < M - 2 ) to the segm ent [a - M ; b - M ] w e o b ta in

A [a -M , b—M\ = / 5 ( c ) fo r s o m e c € B (n , k -2 ) T h u s A [ a ; 6] = [a —M \ b -M ] u { x + M : X € / S ( c ) }

as above is the U nion o f tw o co nse cu tive segm ents, the re íò re is a segm ent

F in a lly , w e re tu m a tte n tio n to the case ( b ) w ith mic = Tik + 1 T h e re are tw o a b litie s fo r in tịe x

m i : m i = M - k + 2 and m \ < M - k + 2 T h e fo rm e r is e a s ily answ eređ b y the c o ro lla ry 2.1 so hcre w e o n ly g iv e the p ro o f fo r the la tte r.In fa ct, We d e fm e the n u m b e r s as fo llo w s

s = m i n { t : m k -t < M — t} 2

We close th is section vvith the f o llo w in g the o re m :

Trang 4

224 Tran Huyen Le Cao Tu / VNU Journal o f Science, Mathematics - Physics 23 (2007) 2 2 ì -224

-k + 1 then we have that:

( a ) I n t h e c a s e T i k - S+ 1 < M - s + 1, A[a, 6] i s a s e g m e n t

(b) In the case Tik-s+ 1 = M — s + \, A [ a , 6] is a segmení if and only i f <p{a') < <p(ư) + 1

a n d e i t h e r T ĩ k - S < M — s o r r i k - s - 1 = k — s — ĩ w h e r e a ' = ( n i ,T i k - S) a n d ố ’= ( m i , m * _ s ) €

B(n,k-s).

Proof. C hoose h = ( M - k + l, , M - l ) ; c = a -M ; d = b - ( M + l ) € B (n , k -1 ) and d e fin e set x = { y + (M +

1) : y e A IS {d )}. S ince [a ;b ]= [a; h + M ] U { x + ( M + 1) : z e IS {d )}. W e have A ( a ;ò ] =

I S( d) u A [ a ; / i + A í] u X N o te that tw o m em bers IS (d ) and X o f th is u n io n are segments and

< ^(m ax A [ a , / i + M ] ) + l = ( ,ỡ ( m in X ) so A [ a , 6] is a segm ent i f and o n ly if t h e Union IS (d ) U A Ịa ; h+M)

is a segm ent In the case th a t Tik-s+ 1 < M - s + 1, there m ust be g = (l, J k -s , M -S + 1 , ,M ) 6 B (n ,k )

such th a t g € [a ; h + M ] D enote g ’ = (l, ? ,k -s , M -s + 1 ) and h ’ = ( M - k + l, , M - s , M - s + l) e B ( n , k -s+ 1 ) B y

le m m a 2.2, w e o b ta in an in itia l segm ent T h e re ío re the set Y deíìned b y Y = {2+ ( M - s + 2, M ) : z€

A[<7', / i ' ] } is a segm ent in B (n , k -1 ) ít is easy to see that d = ( m i ,rrik-s, M - s -1 - 2 , M ) e Y and

th is fo llo w s th a t IS (d ) u Y is also a segm ent T h u s , I t is c le a r that IS (d ) u X = IS (d ) u Y is a segm ent

as re q u ire d In th e case rik-3+ 1 = M - s + 1 , w e co nside r fir s t s = 1 Since m k- 1 < M — 1 ,

d = b - (M + 1) < h in B (n , k -1 ) N o te th a t A[a;h + M ] = [c; h] u {z + M : z € A Ị c ; h]}, thereíore

I S ( d ) U A [ a ; / i + M ] is a segm ent i f and o n ly i f ự>(c) < ự>(d) + 1 and A [ a , / i + M \) is a segment

A c c o rd in g to the theorem 2.1, last c o n d itio n is equavalcnt to that ĩĩk- 1 < M - 1 o r n jt_ 2 = k - 2 is

required Next, suppose that s> 1 with Uk-s +1 = M - S + 1 then a = ( n i , n/c-s, M - s + 1 | •••) M)

and d = ( m i, Ms + 2 , M ). Take

À = { x + ( A / - s + 2 , M ) : i e Á[a' + ( M - S + 1 ) ; h ' + ( M - s + 1 ) } } , where a ’= ( n i ,U k -3 )

and h ’ = ( M - k + l, , M - s ) e B (n ,k -s ) It is clear that the Union IS (d ) u A [ a ; / ỉ + M Ị is a segm ent i f

and o n ly if the u n io n IS (d ) \JA is a segm ent N o te that mfc- 3 < M - s, the re fo re b' —

( m i , m k - 3) < h ' H e n c e , th e la s t r e q u ir e m e n t is e q u iv a le n t to t h e r e q u ir e m e n t t h a t ip ( a ') < i p ( b ') + l

and A [ a ' + ( A / - S + 1 ); h' + ( M - s +1)] = Ịa '; / i ' ] u { y + ( M - s + l ) : y € A [ a '; / i '] } is a segment B y

the the o re m 2.1, th e la tte r is e q u iv a le n t to the requirem ents th a t nfc_s < M — s o r rik-3 - 1 = k - s ~ 1

T h e p r o o f is co m p le te d

References

[1] I.Anderson,Combinatorics o f JInìte sets, Clarendon Press, Oxford, (1989).

[2] B.Bolloba? Combinatorics, Cambridge University Press, (1986).

[3] G o H.Katona, A ứìeorem on ílnite sets In Theorỵo/G raphs Proc Colloq Tihany, Akadmiai Kiado Academic Press,

New York (1966) pp 187-207

[4] J B Kniskal, The number of simpliccs in a complex, In Mathematicaỉ optimization techniques (cđ R Bcllman ),

ưnivcrsity of Calíomia Press, Bcrkcley (1963) pp 251-278

Ngày đăng: 14/12/2017, 15:47

TÀI LIỆU CÙNG NGƯỜI DÙNG

TÀI LIỆU LIÊN QUAN