NOTE. Some New Bounds for Cover-Free Families
|
|
- Frank Simpson
- 6 years ago
- Views:
Transcription
1 Jounal of Combinatoial Theoy, Seies A 90, (2000) doi: jcta , available online at on NOTE Some Ne Bounds fo Cove-Fee Families D. R. Stinson 1 and R. Wei Depatment of Combinatoics and Optimization, Univesity of Wateloo, Wateloo, Ontaio N2L 3G1, Canada and L. Zhu 2 Depatment of Mathematics, Suzhou Univesity, Suzhou , China Communicated by the Managing Editos Received Febuay 11, 1999 Let N((, ), T) denote the minimum numbe of points in a (, )-cove-fee family having T blocks. In this pape, e pove to ne loe bounds on N Academic Pess 1. INTRODUCTION Cove-fee families ee fist intoduced in 1964 by Kautz and Singleton [9] to investigate supeimposed binay codes. These stuctues have been discussed in seveal equivalent fomulations in subjects such as infomation theoy, combinatoics, and goup testing by numeous eseaches (see, fo example, [1, 2, 48, 12]). In 1988, Mitchell and Pipe [10] defined the concept of key distibution pattens, hich ae in fact a genealized type of cove-fee family. Some papes giving constuctions and bounds fo these objects include [3, 4, 11, 13]. Hee is the definition of a cove-fee family. Definition 1.1. Let X be an n-set and let F be a set of subsets (blocks) of X. (X, F) is called a (, )-cove-fee family (o (, )-CFF) povided 1 Reseach suppoted by NSERC Gants IRC and RGPIN Reseach suppoted by NSFC Gants Copyight 2000 by Academic Pess All ights of epoduction in any fom eseved. 224
2 NOTE 225 that, fo any blocks B 1,..., B # F and any othe blocks A 1,..., A # F, e have, i=1 B i 3. Note that the classical definition of cove-fee family is the case =1 of ou definiton. Let N((, ), T) denote the minimum numbe of points in any (, )- CFF having T blocks. The best knon uppe bounds on N((, ), T) (see [3, 4, 13]) use pobabilistic methods. In [13], the uppe bound as stated as hee N((, ), T) j=1 A j. (+) log T, &log p p=1& (+). + In this pape, e discuss loe bounds on N((, ), T). Loe bounds on N((1, ), T) have been studied by seveal eseaches. Spene's theoem states that N \(1, 1), \ n n 2 x++n fo all positive integes n2. The best loe bounds on N((1, ), T) fo geneal ae found in [2, 7, 12], hee diffeent poofs of the folloing theoem can be found. Theoem 1.1. Fo any 2, it holds that N((1, ), T)c 2 log T, log fo some constant c. The constant c in Theoem 1.1 is shon to be appoximately 12 in [2], appoximately 14 in [7] and appoximately 18 in[12]. Loe bounds on N((, ), T) fo abitay ee fist discussed in Dye et al [3]. Moe ecently, Engel [4] poved the folloing to impoved bounds.
3 226 NOTE Theoem 1.2. Theoem 1.3. N((, ), T)( +&1 )log(t&&+2). Fo any =>0, it holds that N((, ), T)(1&=) (+&2) +&2 log(t&&+2) (&1) &1 &1 (&1) fo all sufficiently lage T. We povide to ne bounds in this pape, hich ae stated as Theoem 3.2 and Theoem 4.4. The poofs e give ae puely combinatoial and quite simple, and ae based on a ne ecusive fomula that e pove in the next section. Ou loe bounds ae usually bette than the bounds given in [3, 4]. In paticula, ou bounds build on the bound of Theoem 1.2. If e fix (espectively, ) and let (espectively, ) vay, then ou esults ae alays stonge than the pevious bounds. Fo fixed, Theoem 3.2 impoves Theoem 1.2 by a facto of log, and Theoem 4.4 impoves Theoem 1.3 by a facto of 2 log. On the othe hand, hen =, Theoem 1.3 is bette than ou Theoem 4.4 by a facto of -. Logaithms used in this pape ae alays to the base to. 2. PRELIMINARY LEMMAS In this section, e pesent a fe easy peliminay lemmas that e ill use late. Lemma 2.1. Let A i be an abitay block in F=[A 1, A 2,..., A T ] and let B i A i. If F is (, )-cove-fee, hee 2, then (1) F 1 =[A j "B i :1jT, j{i] is (, &1)-cove-fee, and (2) F 1 =T&1. Poof. (1) Suppose that, t=1 (A et "B i )(A j1 "B i ) _ (A j2 "B i ) _ }}} _ (A j&1 "B i ), hee [e 1,..., e ] _ [j 1,..., j &1 ][1,..., T]"[i]. Then, t=1 hich is a contadiction. A et A j1 _ A j2 _ }}} _ A j&1 _ A i,
4 NOTE 227 (2) Fist e note that A j "B i =% < fo any j=% i. Next, e sho fo any j 1, j 2 {i that A j1 "B i {A j2 "B i. This is seen easily since A j1 "B i =A j2 "B i implies that A j1 A j2 _ A i, hich is a contadiction, since 2. The esult follos. K The folloing lemma can be poved in a simila ay. Lemma 2.2. Let A i be an abitay block in F=[A 1, A 2,..., A T ]. If F is (, )-cove-fee, hee 2. Then (1) F 2 =[A j & A i :1jT, j{i] is (&1, )-cove-fee, (2) F 2 =T&1. The folloing lemma is simple. Lemma 2.3. N((, ), T)=N((, ), T). Poof. (X, F) isa(, )-CFF if and only if (X, F )isan(, )-CFF, hee F =[F : F # F ]. K No e pove the folloing ecusive fomula that is the basis of ou ne bounds. Lemma 2.4. N((, ), T)N((, &1), T&1)+N((&1, ), T&1). Poof. Suppose (X, F) isa(, )-CFF ith X =n=n((, ), T) and F =T. Choose a block A i # F and let n 1 = A i. Then (X"A i, F 1 )isa (, &1)-CFF ith n&n 1 points, and (X & A i, F 2 ) is a (&1, )-CFF ith n 1 points (hee F 1 and F 2 ae defined in Lemmas 2.1 and 2.2, espectively). It is clea that n&n 1 N((, &1), T&1) and n 1 N((&1, ), T&1). Thus N((, ), T)=n=n&n 1 +n 1 N((, &1), T&1)+N((&1, ), T&1). K 3. THE FIRST BOUND To discuss the fist bound, e define \+ + g(,, T)= log T. log(+)
5 228 NOTE The function g has the folloing popety, hich can be easily poved using the fact that the function log xlog(x&1) is deceasing fo x>1. Lemma 3.1. Fo, 2 and T+, it holds that g(,, T)g(, &1, T&1)+g(&1,, T&1). Fom the above lemma, e obtain the folloing bound. Theoem 3.2. Fo, 1 and T+>2, e have N((, ), T)2c \+ + log T, log(+) hee c is the same constant as in Theoem 1.1. Poof. Fist conside the case =1. Fom Theoem 1.1, e have N((, ), T)c 2 log T. log We ill sho that hich is equivalent to shoing that c 2 log log T2c +1 log T, log(+1) 2 log(+1) (+1) log 2. Since the left side of the above inequality is an inceasing function of, e have since log(+1) 4 log 3>2, log 3
6 NOTE 229 The case =1 is simila, in vie of Lemma 2.3. Fo the geneal case hee, 2, e pove the bound by induction on + as N((, ), T)N((&1, ), T&1)+N((, &1), T&1) 2cg(&1,, T&1)+2cg(, &1, T&1) 2cg((, ), T). Hee, the fist inequality comes fom Lemma 2.4, the second one comes fom an induction assumption, and the thid one comes fom Lemma 3.1. K 4. THE SECOND BOUND Ou second bound is consideably lage than ou fist bound. Hoeve, e can only pove that this bound holds asymptotically. Define \+ h(, )= + (+). log \+ + We ill discuss some popeties of the function h(, ), but fist e need an easy peliminay lemma. Lemma 4.1. Fo positive integes and, e have (+) + = 1 + : i=0 i + +&i\ i + > \ + +. The folloing lemma establishes an impotant popety of the function h(, ). Lemma 4.2. Fo integes, 2, it holds that h(, )<h(&1, )+h(, &1).
7 230 NOTE Poof. Fo, 2, e have h(&1, )+h(, &1)&h(, ) \+&1 &1 + (+&1) \+&1 + (+&1) = + log \+&1 log &1 + \+&1 + \+&1 &1 + (+&1) \+&1 + (+&1) = + log \+&1 log &1 + \+&1 + \+&1 + (+) \+&1 &1 + (+) & & log \+ log + \+ + = \+&1 &1 + (+) + log &log \ + + log \+&1 &1 + log \ log &(+) log \+ + & \+&1 + log \ log \ +&1 \+ & + (+) log \+ + No suppose (note that the function h is symmetic in and, so e can make this assumption ithout loss of geneality). Then Fo, e have \ + + by Lemma 4.1, so e have \ +&1 &1 + \ +& (+)+ > \+ + (+) log + &log \ + + >0.
8 NOTE 231 Thus h(&1, )+h(, &1)&h(, ) \+&1 &1 & \+&1 + + (+) log log \+&1 \ +&1 + = log \+ & + log \+ log \+ + log \ +&1 log \+ ++. Thus, e need to sho that (+) log + + &log \ log \ log \ +&1 &(+) log+ + + \ +(+) log + hich is equivalent to shoing that Simplifying, e get o (+) log + & + +(+) log + log \+ + >0, \ + + (+)\ + (+) (+) > + \+. + \ + ((+)) + hich follos fom Lemma 4.1. \ + ) + ((+)) (+) > \+, + \ + + \ + > + \+ +, The folloing lemma is easy to veify. K
9 232 NOTE Lemma 4.3. Fo all 2, it holds that No e pove ou second bound. 0.7 (+1)2 log(+1) < 2 log. Theoem 4.4. that Fo any integes, 1, thee exists an intege T, such \+ N((, ), T)0.7c + (+) log T log \+ + fo all T>T,, hee c is the same constant as in Theoem 1.2. Poof. Fist fo =1, e have N((1, ), T)c 2 log T>0.7c (+1)2 log log(+1) log T by Lemma 4.3. The case =1 is equivalent, in vie of Lemma 2.3. Thus e can assume that, 2, and hence +4. Fo s4, let : s =min By Lemma 4.2, e have : s >1. Since )+h(, &1) : +s,, 2 = {h(&1, h(, ). lim T log T log(t&1) =1, thee exists a sequence of integes T s, s=4, 5,..., such that : s log T log(t&1) fo all T>T s and T s T s&1 +1, fo all s4. No e pove the conclusion by induction on s=+. LetT>T s ;then T&1>T s&1. By induction e have
10 NOTE 233 N((, ), T)N((&1, ), T&1)+N((, &1), T&1) 0.7c }(h(&1, )+h(, &1)) log(t&1) h(&1, )+h(, &1) =0.7c h(+) log(t&1) h(+) 0.7c } : + } h(+) log(t&1) 0.7c } h(+) logt, as equied. K Ou feeling is that the above bound is tue not only fo T sufficiently lage, but in fact fo all T. It also appeas unlikely that ou bound could be impoved significantly by an appoach based on Lemma 2.4 togethe ith Theoem 1.2. This is based on the folloing expeimental evidence. Define p(1, )=p(, 1)= 2 log and let p(, )=p(&1, )+p(, &1) fo, 2. We computed p(, ) fo +400, and found that h(, )<p(, )<1.762 h(, ) fo all such values of and. ACKNOWLEDGMENT The authos thank the efeee fo valuable comments and fo binging Engel's pape [4] to ou attention. REFERENCES 1. K. A. Bush, W. T. Fedee, H. Pesotan and D. Raghavaao, Ne combinatoial designs and thei application to goup testing, J. Statist. Plann. and Infeence 10 (1984), A. G. Dyachkov and V. V. Rykov, Bounds on the length of disjunctive codes, Poblemy Peedachi Infomatsii 18 (1982), 713. [In Russian] 3. M. Dye, T. Fenne, A. Fieze, and A. Thomason, On key stoage in secue netoks, J. Cyptology 8 (1995), K. Engel, Inteval packing and coveing in the boolean lattice, Combin. Pobab. Comput. 5 (1996), P. Edo s, P. Fankl, and Z. Fu edi, Families of finite sets in hich no set is coveed by the union of to othes, J. Combin. Theoy Se. A 33 (1982), P. Edo s, P. Fankl, and Z. Fu edi, Families of finite sets in hich no set is coveed by the union of othes, Iseal J. Math. 51 (1985), Z. Fu edi, On -cove-fee families, J. Combin. Theoy Se. A 73 (1996),
11 234 NOTE 8. F. K. Hang and V. T. So s, Non-adaptive hypegeometic goup testing, Studia Sci. Math. Hunga. 22 (1987), W. H. Kautz and R. C. Singleton, Nonandom binay supeimposed codes, IEEE Tans. Infom. Theoy 10 (1964), C. J. Mitchell and F. C. Pipe, Key stoage in secue netoks, Discete Appl. Math. 21 (1988), K. A. S. Quinn, Bounds fo key distibution pattens, J. Cyptology, in pess. 12. M. Ruszinko, On the uppe bound of the size of the -cove-fee families, J. Combin. Theoy Se. A 66 (1994), D. R. Stinson, Tan van Tung, and R. Wei, Secue famepoof codes, key distibution pattens, goup testing algoithms and elated stuctues, J. Statist. Plann. Infeence, in pess.
Research Article On Alzer and Qiu s Conjecture for Complete Elliptic Integral and Inverse Hyperbolic Tangent Function
Abstact and Applied Analysis Volume 011, Aticle ID 697547, 7 pages doi:10.1155/011/697547 Reseach Aticle On Alze and Qiu s Conjectue fo Complete Elliptic Integal and Invese Hypebolic Tangent Function Yu-Ming
More informationLower Bounds for Cover-Free Families
Loe Bouds fo Cove-Fee Families Ali Z. Abdi Covet of Nazaeth High School Gade, Abas 7, Haifa Nade H. Bshouty Dept. of Compute Sciece Techio, Haifa, 3000 Apil, 05 Abstact Let F be a set of blocks of a t-set
More informationON INDEPENDENT SETS IN PURELY ATOMIC PROBABILITY SPACES WITH GEOMETRIC DISTRIBUTION. 1. Introduction. 1 r r. r k for every set E A, E \ {0},
ON INDEPENDENT SETS IN PURELY ATOMIC PROBABILITY SPACES WITH GEOMETRIC DISTRIBUTION E. J. IONASCU and A. A. STANCU Abstact. We ae inteested in constucting concete independent events in puely atomic pobability
More informationON THE INVERSE SIGNED TOTAL DOMINATION NUMBER IN GRAPHS. D.A. Mojdeh and B. Samadi
Opuscula Math. 37, no. 3 (017), 447 456 http://dx.doi.og/10.7494/opmath.017.37.3.447 Opuscula Mathematica ON THE INVERSE SIGNED TOTAL DOMINATION NUMBER IN GRAPHS D.A. Mojdeh and B. Samadi Communicated
More informationOn the ratio of maximum and minimum degree in maximal intersecting families
On the atio of maximum and minimum degee in maximal intesecting families Zoltán Lóánt Nagy Lale Özkahya Balázs Patkós Máté Vize Septembe 5, 011 Abstact To study how balanced o unbalanced a maximal intesecting
More informationCentral Coverage Bayes Prediction Intervals for the Generalized Pareto Distribution
Statistics Reseach Lettes Vol. Iss., Novembe Cental Coveage Bayes Pediction Intevals fo the Genealized Paeto Distibution Gyan Pakash Depatment of Community Medicine S. N. Medical College, Aga, U. P., India
More informationSemicanonical basis generators of the cluster algebra of type A (1)
Semicanonical basis geneatos of the cluste algeba of type A (1 1 Andei Zelevinsky Depatment of Mathematics Notheasten Univesity, Boston, USA andei@neu.edu Submitted: Jul 7, 006; Accepted: Dec 3, 006; Published:
More informationNew problems in universal algebraic geometry illustrated by boolean equations
New poblems in univesal algebaic geomety illustated by boolean equations axiv:1611.00152v2 [math.ra] 25 Nov 2016 Atem N. Shevlyakov Novembe 28, 2016 Abstact We discuss new poblems in univesal algebaic
More informationarxiv: v1 [math.co] 6 Mar 2008
An uppe bound fo the numbe of pefect matchings in gaphs Shmuel Fiedland axiv:0803.0864v [math.co] 6 Ma 2008 Depatment of Mathematics, Statistics, and Compute Science, Univesity of Illinois at Chicago Chicago,
More informationarxiv: v1 [math.co] 4 May 2017
On The Numbe Of Unlabeled Bipatite Gaphs Abdullah Atmaca and A Yavuz Ouç axiv:7050800v [mathco] 4 May 207 Abstact This pape solves a poblem that was stated by M A Haison in 973 [] This poblem, that has
More informationFailure Probability of 2-within-Consecutive-(2, 2)-out-of-(n, m): F System for Special Values of m
Jounal of Mathematics and Statistics 5 (): 0-4, 009 ISSN 549-3644 009 Science Publications Failue Pobability of -within-consecutive-(, )-out-of-(n, m): F System fo Special Values of m E.M.E.. Sayed Depatment
More informationFunctions Defined on Fuzzy Real Numbers According to Zadeh s Extension
Intenational Mathematical Foum, 3, 2008, no. 16, 763-776 Functions Defined on Fuzzy Real Numbes Accoding to Zadeh s Extension Oma A. AbuAaqob, Nabil T. Shawagfeh and Oma A. AbuGhneim 1 Mathematics Depatment,
More informationAn intersection theorem for four sets
An intesection theoem fo fou sets Dhuv Mubayi Novembe 22, 2006 Abstact Fix integes n, 4 and let F denote a family of -sets of an n-element set Suppose that fo evey fou distinct A, B, C, D F with A B C
More informationOn the ratio of maximum and minimum degree in maximal intersecting families
On the atio of maximum and minimum degee in maximal intesecting families Zoltán Lóánt Nagy Lale Özkahya Balázs Patkós Máté Vize Mach 6, 013 Abstact To study how balanced o unbalanced a maximal intesecting
More informationarxiv: v1 [math.co] 1 Apr 2011
Weight enumeation of codes fom finite spaces Relinde Juius Octobe 23, 2018 axiv:1104.0172v1 [math.co] 1 Ap 2011 Abstact We study the genealized and extended weight enumeato of the - ay Simplex code and
More informationQuasi-Randomness and the Distribution of Copies of a Fixed Graph
Quasi-Randomness and the Distibution of Copies of a Fixed Gaph Asaf Shapia Abstact We show that if a gaph G has the popety that all subsets of vetices of size n/4 contain the coect numbe of tiangles one
More informationSurveillance Points in High Dimensional Spaces
Société de Calcul Mathématique SA Tools fo decision help since 995 Suveillance Points in High Dimensional Spaces by Benad Beauzamy Januay 06 Abstact Let us conside any compute softwae, elying upon a lage
More informationUpper Bounds for Tura n Numbers. Alexander Sidorenko
jounal of combinatoial theoy, Seies A 77, 134147 (1997) aticle no. TA962739 Uppe Bounds fo Tua n Numbes Alexande Sidoenko Couant Institute of Mathematical Sciences, New Yok Univesity, 251 Mece Steet, New
More informationKOEBE DOMAINS FOR THE CLASSES OF FUNCTIONS WITH RANGES INCLUDED IN GIVEN SETS
Jounal of Applied Analysis Vol. 14, No. 1 2008), pp. 43 52 KOEBE DOMAINS FOR THE CLASSES OF FUNCTIONS WITH RANGES INCLUDED IN GIVEN SETS L. KOCZAN and P. ZAPRAWA Received Mach 12, 2007 and, in evised fom,
More informationThis aticle was oiginally published in a jounal published by Elsevie, the attached copy is povided by Elsevie fo the autho s benefit fo the benefit of the autho s institution, fo non-commecial eseach educational
More informationGradient-based Neural Network for Online Solution of Lyapunov Matrix Equation with Li Activation Function
Intenational Confeence on Infomation echnology and Management Innovation (ICIMI 05) Gadient-based Neual Netwok fo Online Solution of Lyapunov Matix Equation with Li Activation unction Shiheng Wang, Shidong
More informationMethod for Approximating Irrational Numbers
Method fo Appoximating Iational Numbes Eic Reichwein Depatment of Physics Univesity of Califonia, Santa Cuz June 6, 0 Abstact I will put foth an algoithm fo poducing inceasingly accuate ational appoximations
More informationChapter 3: Theory of Modular Arithmetic 38
Chapte 3: Theoy of Modula Aithmetic 38 Section D Chinese Remainde Theoem By the end of this section you will be able to pove the Chinese Remainde Theoem apply this theoem to solve simultaneous linea conguences
More informationAsymptotically Lacunary Statistical Equivalent Sequence Spaces Defined by Ideal Convergence and an Orlicz Function
"Science Stays Tue Hee" Jounal of Mathematics and Statistical Science, 335-35 Science Signpost Publishing Asymptotically Lacunay Statistical Equivalent Sequence Spaces Defined by Ideal Convegence and an
More informationMath 301: The Erdős-Stone-Simonovitz Theorem and Extremal Numbers for Bipartite Graphs
Math 30: The Edős-Stone-Simonovitz Theoem and Extemal Numbes fo Bipatite Gaphs May Radcliffe The Edős-Stone-Simonovitz Theoem Recall, in class we poved Tuán s Gaph Theoem, namely Theoem Tuán s Theoem Let
More informationSTUDY OF SOLUTIONS OF LOGARITHMIC ORDER TO HIGHER ORDER LINEAR DIFFERENTIAL-DIFFERENCE EQUATIONS WITH COEFFICIENTS HAVING THE SAME LOGARITHMIC ORDER
UNIVERSITATIS IAGELLONICAE ACTA MATHEMATICA doi: 104467/20843828AM170027078 542017, 15 32 STUDY OF SOLUTIONS OF LOGARITHMIC ORDER TO HIGHER ORDER LINEAR DIFFERENTIAL-DIFFERENCE EQUATIONS WITH COEFFICIENTS
More informationJournal of Inequalities in Pure and Applied Mathematics
Jounal of Inequalities in Pue and Applied Mathematics COEFFICIENT INEQUALITY FOR A FUNCTION WHOSE DERIVATIVE HAS A POSITIVE REAL PART S. ABRAMOVICH, M. KLARIČIĆ BAKULA AND S. BANIĆ Depatment of Mathematics
More informationOn the Poisson Approximation to the Negative Hypergeometric Distribution
BULLETIN of the Malaysian Mathematical Sciences Society http://mathusmmy/bulletin Bull Malays Math Sci Soc (2) 34(2) (2011), 331 336 On the Poisson Appoximation to the Negative Hypegeometic Distibution
More informationON SPARSELY SCHEMMEL TOTIENT NUMBERS. Colin Defant 1 Department of Mathematics, University of Florida, Gainesville, Florida
#A8 INTEGERS 5 (205) ON SPARSEL SCHEMMEL TOTIENT NUMBERS Colin Defant Depatment of Mathematics, Univesity of Floida, Gainesville, Floida cdefant@ufl.edu Received: 7/30/4, Revised: 2/23/4, Accepted: 4/26/5,
More informationUsing Laplace Transform to Evaluate Improper Integrals Chii-Huei Yu
Available at https://edupediapublicationsog/jounals Volume 3 Issue 4 Febuay 216 Using Laplace Tansfom to Evaluate Impope Integals Chii-Huei Yu Depatment of Infomation Technology, Nan Jeon Univesity of
More informationConstruction and Analysis of Boolean Functions of 2t + 1 Variables with Maximum Algebraic Immunity
Constuction and Analysis of Boolean Functions of 2t + 1 Vaiables with Maximum Algebaic Immunity Na Li and Wen-Feng Qi Depatment of Applied Mathematics, Zhengzhou Infomation Engineeing Univesity, Zhengzhou,
More informationOn decompositions of complete multipartite graphs into the union of two even cycles
On decompositions of complete multipatite gaphs into the union of two even cycles A. Su, J. Buchanan, R. C. Bunge, S. I. El-Zanati, E. Pelttai, G. Rasmuson, E. Spaks, S. Tagais Depatment of Mathematics
More informationSUFFICIENT CONDITIONS FOR MAXIMALLY EDGE-CONNECTED AND SUPER-EDGE-CONNECTED GRAPHS DEPENDING ON THE CLIQUE NUMBER
Discussiones Mathematicae Gaph Theoy 39 (019) 567 573 doi:10.7151/dmgt.096 SUFFICIENT CONDITIONS FOR MAXIMALLY EDGE-CONNECTED AND SUPER-EDGE-CONNECTED GRAPHS DEPENDING ON THE CLIQUE NUMBER Lutz Volkmann
More informationTHE NUMBER OF TWO CONSECUTIVE SUCCESSES IN A HOPPE-PÓLYA URN
TH NUMBR OF TWO CONSCUTIV SUCCSSS IN A HOPP-PÓLYA URN LARS HOLST Depatment of Mathematics, Royal Institute of Technology S 100 44 Stocholm, Sweden -mail: lholst@math.th.se Novembe 27, 2007 Abstact In a
More informationA solution to a problem of Grünbaum and Motzkin and of Erdős and Purdy about bichromatic configurations of points in the plane
A solution to a poblem of Günbaum and Motzkin and of Edős and Pudy about bichomatic configuations of points in the plane Rom Pinchasi July 29, 2012 Abstact Let P be a set of n blue points in the plane,
More informationtitrrvers:rtt t>1 NO~~H CAROLINA
titvers:tt t>1 NO~~H CAROLINA Depatment of statistics Chapel Hill, N. C. ON A BOUN.D USEFUL IN THE THEORY OF FACTORIAL DESIGNS AND ERROR CORRECTING CODES by R. C. Bose and J. N. Sivastava Apil 1963 Gant
More informationOn a Hyperplane Arrangement Problem and Tighter Analysis of an Error-Tolerant Pooling Design
On a Hypeplane Aangement Poblem and Tighte Analysis of an Eo-Toleant Pooling Design Hung Q Ngo August 19, 2006 Abstact In this pape, we fomulate and investigate the following poblem: given integes d, k
More informationAuchmuty High School Mathematics Department Advanced Higher Notes Teacher Version
The Binomial Theoem Factoials Auchmuty High School Mathematics Depatment The calculations,, 6 etc. often appea in mathematics. They ae called factoials and have been given the notation n!. e.g. 6! 6!!!!!
More informationMiskolc Mathematical Notes HU e-issn Tribonacci numbers with indices in arithmetic progression and their sums. Nurettin Irmak and Murat Alp
Miskolc Mathematical Notes HU e-issn 8- Vol. (0), No, pp. 5- DOI 0.85/MMN.0.5 Tibonacci numbes with indices in aithmetic pogession and thei sums Nuettin Imak and Muat Alp Miskolc Mathematical Notes HU
More informationON LACUNARY INVARIANT SEQUENCE SPACES DEFINED BY A SEQUENCE OF MODULUS FUNCTIONS
STUDIA UNIV BABEŞ BOLYAI, MATHEMATICA, Volume XLVIII, Numbe 4, Decembe 2003 ON LACUNARY INVARIANT SEQUENCE SPACES DEFINED BY A SEQUENCE OF MODULUS FUNCTIONS VATAN KARAKAYA AND NECIP SIMSEK Abstact The
More informationA Multivariate Normal Law for Turing s Formulae
A Multivaiate Nomal Law fo Tuing s Fomulae Zhiyi Zhang Depatment of Mathematics and Statistics Univesity of Noth Caolina at Chalotte Chalotte, NC 28223 Abstact This pape establishes a sufficient condition
More informationUnobserved Correlation in Ascending Auctions: Example And Extensions
Unobseved Coelation in Ascending Auctions: Example And Extensions Daniel Quint Univesity of Wisconsin Novembe 2009 Intoduction In pivate-value ascending auctions, the winning bidde s willingness to pay
More informationNumerical approximation to ζ(2n+1)
Illinois Wesleyan Univesity Fom the SelectedWoks of Tian-Xiao He 6 Numeical appoximation to ζ(n+1) Tian-Xiao He, Illinois Wesleyan Univesity Michael J. Dancs Available at: https://woks.bepess.com/tian_xiao_he/6/
More informationEffect of no-flow boundaries on interference testing. in fractured reservoirs
Effect of no-flo boundaies on intefeence testing in factued esevois T.Aa. Jelmet 1 1 epatement of petoleum engineeing and applied geophysics,, Noegian Univesity of Science and Tecnology, NTNU. Tondheim,
More informationA Comment on Increasing Returns and Spatial. Unemployment Disparities
The Society fo conomic Studies The nivesity of Kitakyushu Woking Pape Seies No.06-5 (accepted in Mach, 07) A Comment on Inceasing Retuns and Spatial nemployment Dispaities Jumpei Tanaka ** The nivesity
More informationA proof of the binomial theorem
A poof of the binomial theoem If n is a natual numbe, let n! denote the poduct of the numbes,2,3,,n. So! =, 2! = 2 = 2, 3! = 2 3 = 6, 4! = 2 3 4 = 24 and so on. We also let 0! =. If n is a non-negative
More informationThe Congestion of n-cube Layout on a Rectangular Grid S.L. Bezrukov J.D. Chavez y L.H. Harper z M. Rottger U.-P. Schroeder Abstract We consider the pr
The Congestion of n-cube Layout on a Rectangula Gid S.L. Bezukov J.D. Chavez y L.H. Hape z M. Rottge U.-P. Schoede Abstact We conside the poblem of embedding the n-dimensional cube into a ectangula gid
More informationONE-POINT CODES USING PLACES OF HIGHER DEGREE
ONE-POINT CODES USING PLACES OF HIGHER DEGREE GRETCHEN L. MATTHEWS AND TODD W. MICHEL DEPARTMENT OF MATHEMATICAL SCIENCES CLEMSON UNIVERSITY CLEMSON, SC 29634-0975 U.S.A. E-MAIL: GMATTHE@CLEMSON.EDU, TMICHEL@CLEMSON.EDU
More informationOn Polynomials Construction
Intenational Jounal of Mathematical Analysis Vol., 08, no. 6, 5-57 HIKARI Ltd, www.m-hikai.com https://doi.og/0.988/ima.08.843 On Polynomials Constuction E. O. Adeyefa Depatment of Mathematics, Fedeal
More informationThe Erdős-Hajnal conjecture for rainbow triangles
The Edős-Hajnal conjectue fo ainbow tiangles Jacob Fox Andey Ginshpun János Pach Abstact We pove that evey 3-coloing of the edges of the complete gaph on n vetices without a ainbow tiangle contains a set
More informationHypothesis Test and Confidence Interval for the Negative Binomial Distribution via Coincidence: A Case for Rare Events
Intenational Jounal of Contempoay Mathematical Sciences Vol. 12, 2017, no. 5, 243-253 HIKARI Ltd, www.m-hikai.com https://doi.og/10.12988/ijcms.2017.7728 Hypothesis Test and Confidence Inteval fo the Negative
More information10/04/18. P [P(x)] 1 negl(n).
Mastemath, Sping 208 Into to Lattice lgs & Cypto Lectue 0 0/04/8 Lectues: D. Dadush, L. Ducas Scibe: K. de Boe Intoduction In this lectue, we will teat two main pats. Duing the fist pat we continue the
More informationPearson s Chi-Square Test Modifications for Comparison of Unweighted and Weighted Histograms and Two Weighted Histograms
Peason s Chi-Squae Test Modifications fo Compaison of Unweighted and Weighted Histogams and Two Weighted Histogams Univesity of Akueyi, Bogi, v/noduslód, IS-6 Akueyi, Iceland E-mail: nikolai@unak.is Two
More informationAlternative Tests for the Poisson Distribution
Chiang Mai J Sci 015; 4() : 774-78 http://epgsciencecmuacth/ejounal/ Contibuted Pape Altenative Tests fo the Poisson Distibution Manad Khamkong*[a] and Pachitjianut Siipanich [b] [a] Depatment of Statistics,
More informationSyntactical content of nite approximations of partial algebras 1 Wiktor Bartol Inst. Matematyki, Uniw. Warszawski, Warszawa (Poland)
Syntactical content of nite appoximations of patial algebas 1 Wikto Batol Inst. Matematyki, Uniw. Waszawski, 02-097 Waszawa (Poland) batol@mimuw.edu.pl Xavie Caicedo Dep. Matematicas, Univ. de los Andes,
More informationMultiple Criteria Secretary Problem: A New Approach
J. Stat. Appl. Po. 3, o., 9-38 (04 9 Jounal of Statistics Applications & Pobability An Intenational Jounal http://dx.doi.og/0.785/jsap/0303 Multiple Citeia Secetay Poblem: A ew Appoach Alaka Padhye, and
More informationMean Curvature and Shape Operator of Slant Immersions in a Sasakian Space Form
Mean Cuvatue and Shape Opeato of Slant Immesions in a Sasakian Space Fom Muck Main Tipathi, Jean-Sic Kim and Son-Be Kim Abstact Fo submanifolds, in a Sasakian space fom, which ae tangential to the stuctue
More informationLikelihood vs. Information in Aligning Biopolymer Sequences. UCSD Technical Report CS Timothy L. Bailey
Likelihood vs. Infomation in Aligning Biopolyme Sequences UCSD Technical Repot CS93-318 Timothy L. Bailey Depatment of Compute Science and Engineeing Univesity of Califonia, San Diego 1 Febuay, 1993 ABSTRACT:
More informationSOME SOLVABILITY THEOREMS FOR NONLINEAR EQUATIONS
Fixed Point Theoy, Volume 5, No. 1, 2004, 71-80 http://www.math.ubbcluj.o/ nodeacj/sfptcj.htm SOME SOLVABILITY THEOREMS FOR NONLINEAR EQUATIONS G. ISAC 1 AND C. AVRAMESCU 2 1 Depatment of Mathematics Royal
More informationCompactly Supported Radial Basis Functions
Chapte 4 Compactly Suppoted Radial Basis Functions As we saw ealie, compactly suppoted functions Φ that ae tuly stictly conditionally positive definite of ode m > do not exist The compact suppot automatically
More informationNotes on McCall s Model of Job Search. Timothy J. Kehoe March if job offer has been accepted. b if searching
Notes on McCall s Model of Job Seach Timothy J Kehoe Mach Fv ( ) pob( v), [, ] Choice: accept age offe o eceive b and seach again next peiod An unemployed oke solves hee max E t t y t y t if job offe has
More informationDuality between Statical and Kinematical Engineering Systems
Pape 00, Civil-Comp Ltd., Stiling, Scotland Poceedings of the Sixth Intenational Confeence on Computational Stuctues Technology, B.H.V. Topping and Z. Bittna (Editos), Civil-Comp Pess, Stiling, Scotland.
More informationLacunary I-Convergent Sequences
KYUNGPOOK Math. J. 52(2012), 473-482 http://dx.doi.og/10.5666/kmj.2012.52.4.473 Lacunay I-Convegent Sequences Binod Chanda Tipathy Mathematical Sciences Division, Institute of Advanced Study in Science
More informationTHE JEU DE TAQUIN ON THE SHIFTED RIM HOOK TABLEAUX. Jaejin Lee
Koean J. Math. 23 (2015), No. 3, pp. 427 438 http://dx.doi.og/10.11568/kjm.2015.23.3.427 THE JEU DE TAQUIN ON THE SHIFTED RIM HOOK TABLEAUX Jaejin Lee Abstact. The Schensted algoithm fist descibed by Robinson
More informationProbablistically Checkable Proofs
Lectue 12 Pobablistically Checkable Poofs May 13, 2004 Lectue: Paul Beame Notes: Chis Re 12.1 Pobablisitically Checkable Poofs Oveview We know that IP = PSPACE. This means thee is an inteactive potocol
More informationarxiv: v1 [math.ca] 31 Aug 2009
axiv:98.4578v [math.ca] 3 Aug 9 On L-convegence of tigonometic seies Bogdan Szal Univesity of Zielona Góa, Faculty of Mathematics, Compute Science and Econometics, 65-56 Zielona Góa, ul. Szafana 4a, Poland
More informationGoodness-of-fit for composite hypotheses.
Section 11 Goodness-of-fit fo composite hypotheses. Example. Let us conside a Matlab example. Let us geneate 50 obsevations fom N(1, 2): X=nomnd(1,2,50,1); Then, unning a chi-squaed goodness-of-fit test
More informationSOME GENERAL NUMERICAL RADIUS INEQUALITIES FOR THE OFF-DIAGONAL PARTS OF 2 2 OPERATOR MATRICES
italian jounal of pue and applied mathematics n. 35 015 (433 44) 433 SOME GENERAL NUMERICAL RADIUS INEQUALITIES FOR THE OFF-DIAGONAL PARTS OF OPERATOR MATRICES Watheq Bani-Domi Depatment of Mathematics
More informationAnalytical solutions to the Navier Stokes equations
JOURAL OF MATHEMATICAL PHYSICS 49, 113102 2008 Analytical solutions to the avie Stokes equations Yuen Manwai a Depatment of Applied Mathematics, The Hong Kong Polytechnic Univesity, Hung Hom, Kowloon,
More informationEQUI-PARTITIONING OF HIGHER-DIMENSIONAL HYPER-RECTANGULAR GRID GRAPHS
EQUI-PARTITIONING OF HIGHER-DIMENSIONAL HYPER-RECTANGULAR GRID GRAPHS ATHULA GUNAWARDENA AND ROBERT R MEYER Abstact A d-dimensional gid gaph G is the gaph on a finite subset in the intege lattice Z d in
More informationApplication of Parseval s Theorem on Evaluating Some Definite Integrals
Tukish Jounal of Analysis and Numbe Theoy, 4, Vol., No., -5 Available online at http://pubs.sciepub.com/tjant/// Science and Education Publishing DOI:.69/tjant--- Application of Paseval s Theoem on Evaluating
More informationSecret Exponent Attacks on RSA-type Schemes with Moduli N = p r q
Secet Exponent Attacks on RSA-type Schemes with Moduli N = p q Alexande May Faculty of Compute Science, Electical Engineeing and Mathematics Univesity of Padebon 33102 Padebon, Gemany alexx@uni-padebon.de
More informationMeasure Estimates of Nodal Sets of Polyharmonic Functions
Chin. Ann. Math. Se. B 39(5), 08, 97 93 DOI: 0.007/s40-08-004-6 Chinese Annals of Mathematics, Seies B c The Editoial Office of CAM and Spinge-Velag Belin Heidelbeg 08 Measue Estimates of Nodal Sets of
More informationA THREE CRITICAL POINTS THEOREM AND ITS APPLICATIONS TO THE ORDINARY DIRICHLET PROBLEM
A THREE CRITICAL POINTS THEOREM AND ITS APPLICATIONS TO THE ORDINARY DIRICHLET PROBLEM DIEGO AVERNA AND GABRIELE BONANNO Abstact. The aim of this pape is twofold. On one hand we establish a thee citical
More informationStanford University CS259Q: Quantum Computing Handout 8 Luca Trevisan October 18, 2012
Stanfod Univesity CS59Q: Quantum Computing Handout 8 Luca Tevisan Octobe 8, 0 Lectue 8 In which we use the quantum Fouie tansfom to solve the peiod-finding poblem. The Peiod Finding Poblem Let f : {0,...,
More informationCALCULATING THE NUMBER OF TWIN PRIMES WITH SPECIFIED DISTANCE BETWEEN THEM BASED ON THE SIMPLEST PROBABILISTIC MODEL
U.P.B. Sci. Bull. Seies A, Vol. 80, Iss.3, 018 ISSN 13-707 CALCULATING THE NUMBER OF TWIN PRIMES WITH SPECIFIED DISTANCE BETWEEN THEM BASED ON THE SIMPLEST PROBABILISTIC MODEL Sasengali ABDYMANAPOV 1,
More informationResults on the Commutative Neutrix Convolution Product Involving the Logarithmic Integral li(
Intenational Jounal of Scientific and Innovative Mathematical Reseach (IJSIMR) Volume 2, Issue 8, August 2014, PP 736-741 ISSN 2347-307X (Pint) & ISSN 2347-3142 (Online) www.acjounals.og Results on the
More informationThe r-bell Numbers. 1 Introduction
3 47 6 3 Jounal of Intege Sequences, Vol. 4 (, Aticle.. The -Bell Numbes István Meő Depatment of Applied Mathematics and Pobability Theoy Faculty of Infomatics Univesity of Debecen P. O. Box H-4 Debecen
More informationAlgorithmic Information, Plane Kakeya Sets, and Conditional Dimension
Algoithmic Infomation, Plane Kakeya Sets, and Conditional Dimension Jack H. Lutz 1 and Neil Lutz 2 1 Depatment of Compute Science, Iowa State Univesity, Ames, IA, USA lutz@cs.iastate.edu 2 Depatment of
More informationA STUDY OF HAMMING CODES AS ERROR CORRECTING CODES
AGU Intenational Jounal of Science and Technology A STUDY OF HAMMING CODES AS ERROR CORRECTING CODES Ritu Ahuja Depatment of Mathematics Khalsa College fo Women, Civil Lines, Ludhiana-141001, Punjab, (India)
More informationModified Linear Programming and Class 0 Bounds for Graph Pebbling
Modified Linea Pogamming and Class 0 Bounds fo Gaph Pebbling Daniel W. Canston Luke Postle Chenxiao Xue Cal Yege August 8, 05 Abstact Given a configuation of pebbles on the vetices of a connected gaph
More informationEcon 201: Problem Set 2 Answers
Econ 0: Poblem Set Anses Instucto: Alexande Sollaci T.A.: Ryan Hughes Winte 08 Question (a) The fixed cost is F C = 4 and the total vaiable costs ae T CV (y) = 4y. (b) To anse this question, let x = (x,...,
More informationGeometry of the homogeneous and isotropic spaces
Geomety of the homogeneous and isotopic spaces H. Sonoda Septembe 2000; last evised Octobe 2009 Abstact We summaize the aspects of the geomety of the homogeneous and isotopic spaces which ae most elevant
More informationA Short Combinatorial Proof of Derangement Identity arxiv: v1 [math.co] 13 Nov Introduction
A Shot Combinatoial Poof of Deangement Identity axiv:1711.04537v1 [math.co] 13 Nov 2017 Ivica Matinjak Faculty of Science, Univesity of Zageb Bijenička cesta 32, HR-10000 Zageb, Coatia and Dajana Stanić
More informationIdentification of the degradation of railway ballast under a concrete sleeper
Identification of the degadation of ailway ballast unde a concete sleepe Qin Hu 1) and Heung Fai Lam ) 1), ) Depatment of Civil and Achitectual Engineeing, City Univesity of Hong Kong, Hong Kong SAR, China.
More informationComputers and Mathematics with Applications
Computes and Mathematics with Applications 58 (009) 9 7 Contents lists available at ScienceDiect Computes and Mathematics with Applications jounal homepage: www.elsevie.com/locate/camwa Bi-citeia single
More informationThe VC-dimension of Unions: Learning, Geometry and Combinatorics
The VC-dimension of Unions: Leaning, Geomety and Combinatoics Mónika Csikós Andey Kupavskii Nabil H. Mustafa Abstact The VC-dimension of a set system is a way to captue its complexity, and has been a key
More informationESSENTIAL NORM OF AN INTEGRAL-TYPE OPERATOR ON THE UNIT BALL. Juntao Du and Xiangling Zhu
Opuscula Math. 38, no. 6 (8), 89 839 https://doi.og/.7494/opmath.8.38.6.89 Opuscula Mathematica ESSENTIAL NORM OF AN INTEGRAL-TYPE OPERATOR FROM ω-bloch SPACES TO µ-zygmund SPACES ON THE UNIT BALL Juntao
More informationVanishing lines in generalized Adams spectral sequences are generic
ISSN 364-0380 (on line) 465-3060 (pinted) 55 Geomety & Topology Volume 3 (999) 55 65 Published: 2 July 999 G G G G T T T G T T T G T G T GG TT G G G G GG T T T TT Vanishing lines in genealized Adams spectal
More informationANA BERRIZBEITIA, LUIS A. MEDINA, ALEXANDER C. MOLL, VICTOR H. MOLL, AND LAINE NOBLE
THE p-adic VALUATION OF STIRLING NUMBERS ANA BERRIZBEITIA, LUIS A. MEDINA, ALEXANDER C. MOLL, VICTOR H. MOLL, AND LAINE NOBLE Abstact. Let p > 2 be a pime. The p-adic valuation of Stiling numbes of the
More informationRelating Branching Program Size and. Formula Size over the Full Binary Basis. FB Informatik, LS II, Univ. Dortmund, Dortmund, Germany
Relating Banching Pogam Size and omula Size ove the ull Binay Basis Matin Saueho y Ingo Wegene y Ralph Wechne z y B Infomatik, LS II, Univ. Dotmund, 44 Dotmund, Gemany z ankfut, Gemany sauehof/wegene@ls.cs.uni-dotmund.de
More informationarxiv: v2 [physics.data-an] 15 Jul 2015
Limitation of the Least Squae Method in the Evaluation of Dimension of Factal Bownian Motions BINGQIANG QIAO,, SIMING LIU, OUDUN ZENG, XIANG LI, and BENZONG DAI Depatment of Physics, Yunnan Univesity,
More informationInteraction of Feedforward and Feedback Streams in Visual Cortex in a Firing-Rate Model of Columnar Computations. ( r)
Supplementay mateial fo Inteaction of Feedfowad and Feedback Steams in Visual Cotex in a Fiing-Rate Model of Columna Computations Tobias Bosch and Heiko Neumann Institute fo Neual Infomation Pocessing
More information6 Matrix Concentration Bounds
6 Matix Concentation Bounds Concentation bounds ae inequalities that bound pobabilities of deviations by a andom vaiable fom some value, often its mean. Infomally, they show the pobability that a andom
More informationCOLLAPSING WALLS THEOREM
COLLAPSING WALLS THEOREM IGOR PAK AND ROM PINCHASI Abstact. Let P R 3 be a pyamid with the base a convex polygon Q. We show that when othe faces ae collapsed (otated aound the edges onto the plane spanned
More informationA hybrid cross entropy algorithm for solving dynamic transit network design problem
A hybid coss entopy algoithm fo solving dynamic tansit netok design poblem TAI-YU MA Tanspot Economics Laboatoy Univesity Lyon 2 - CNRS Lyon, Fance This pape poposes a hybid multiagent leaning algoithm
More information( ) [ ] [ ] [ ] δf φ = F φ+δφ F. xdx.
9. LAGRANGIAN OF THE ELECTROMAGNETIC FIELD In the pevious section the Lagangian and Hamiltonian of an ensemble of point paticles was developed. This appoach is based on a qt. This discete fomulation can
More informationLecture 28: Convergence of Random Variables and Related Theorems
EE50: Pobability Foundations fo Electical Enginees July-Novembe 205 Lectue 28: Convegence of Random Vaiables and Related Theoems Lectue:. Kishna Jagannathan Scibe: Gopal, Sudhasan, Ajay, Swamy, Kolla An
More informationarxiv: v1 [math.nt] 28 Oct 2017
ON th COEFFICIENT OF DIVISORS OF x n axiv:70049v [mathnt] 28 Oct 207 SAI TEJA SOMU Abstact Let,n be two natual numbes and let H(,n denote the maximal absolute value of th coefficient of divisos of x n
More informationAdditive Approximation for Edge-Deletion Problems
Additive Appoximation fo Edge-Deletion Poblems Noga Alon Asaf Shapia Benny Sudakov Abstact A gaph popety is monotone if it is closed unde emoval of vetices and edges. In this pape we conside the following
More information