Báo cáo toán học: " PROBLEMS IN ALGEBRAIC COMBINATORICS" ppsx

... square-counting or an interlacing argument, one can show that the max- imum number of vertices in an independent set in the Hoffman-Singleton graph is 15. If S is an independent set of size 15 in this ... Then H is the Hoffman-Singleton graph. Note that we may view the vertices in S as points and the vertices not in S as lines, with a point and line incident if the corresponding verti...

Ngày tải lên: 07/08/2014, 06:20

... we use more general algebraic curves such as y n = f(x) for some positive integer n. As a consequence, we obtain new in nite families of 3-designs. In particular, we get in nite family of 3-designs ... any odd integer t greater than 1. In this case, we obtain 3 − (11 7t + 1, 11 7t −1 43 , (11 7t −44)(11 7t −87) 3698 ) design. Since 11 7t −1 43 ≡ 1 (mod 11), this design is not consider...

Ngày tải lên: 07/08/2014, 15:22

... bear in answering thls question. Prom a purely ~echodologica ! standpoint, then, one would hope to define some more restricted notion of meaning as an intermediate step in developing ... processing of an utterance involves producing an expression or structure that is in some sense a representation of the literal meaning of the utterance. It is often maintained that underst...

Ngày tải lên: 24/03/2014, 01:21

... diabetes [1]. In the field of tissue engineering, magnetic nanoparticles have been previously reported for many applications including cellular labelling, sorting and monitoring, targeted in- vivo ... containing 10% heat inactivated foetal bovine serum [FBS], 2 mM L-glutamine and 1% penicillin streptomycin [Penstrep] (all purchased from Invitrogen Ltd., Renfrew, UK). RAW264.7 cells (ki...

Ngày tải lên: 20/06/2014, 20:20

... cos(0.2πn) 0 0.1 sin(0.2πn) 0 0 0 0 0.01 sin(0.2πn)   , B(n) = (b ij (n)) =   7 + sin(0.2πn) 0.1 sin(0.2πn) 0.01 sin(0.2πn) 0.1 cos(0.2πn) 7 + sin(0.2πn) 0 0.01 sin(0.2πn) 0 7 + sin(0.2π n )   . 11 and (C L u) i (n) ... below). For information about publishing your research in Advances in Difference Equations go to http://www.advancesindifferenceequations.com/authors/instructions/ F...

Ngày tải lên: 20/06/2014, 20:20

... a very large database of RSS fingerprints. Machine learning techniques are employed to extract the location information from online RSS measurements showing promising performance for room-level ... reproduction in any medium, provided the original work is properly cited. al. propose a channel parameter estimator for joint com- munications and positioning systems, using soft infor- mation co...

Ngày tải lên: 20/06/2014, 21:20

... class="bi x0 y0 w2 h 1" alt =""

Ngày tải lên: 05/08/2014, 09:46

... H. Prodinger. On the number of descendants and ascendants in random search trees. In preparation, 1996. DESCENDANTS IN HEAP ORDERED TREES OR A TRIUMPH OF COMPUTER ALGEBRA Helmut Prodinger Institut ... monotonically increasing when going from the root to the leaves. Figure 1. All 15 heap ordered trees with 4 nodes the electronic journal of combinatorics 3 (1996), #R29 7 Figure 3. The beg...

Ngày tải lên: 07/08/2014, 06:20

... =(P, B, I), with point set P,blocksetB and incidence I is a 2-(v,k, λ) design, if |P| = v,everyblockB ∈Bis incident with precisely k points, and every pair of points are together incident with precisely ... non-embeddable.AHadamard 2-design is one in which v =4λ +3, and k =2λ +1. Anincidence matrix ofa2-(v, k, λ)designisab × v matrix A = a ij ,in which a ij =1ifblocki contains point j and...

Ngày tải lên: 07/08/2014, 06:20