Báo cáo tin học: "On a covering problem for equilateral triangles" pptx

Báo cáo tin học: "On a covering problem for equilateral triangles" pptx

Báo cáo tin học: "On a covering problem for equilateral triangles" pptx

... (a) and (b): Extend/shrink operations on T A = ∆AA 1 A 2 and a negative triangle T  = ∆MN P (phase 2, case 2c). Note that any of the original triangles T i in the covering set may participate ... equilateral triangle T A ⊂ T is called a special triangle corresponding to vertex A if T A is a smaller homothetic copy of T having A as a common vertex, e.g., ∆AUV in Fig. 1...
Ngày tải lên : 07/08/2014, 15:23
  • 7
  • 124
  • 0
Báo cáo toán học: "On a combinatorial problem of Asmus Schmidt" pps

Báo cáo toán học: "On a combinatorial problem of Asmus Schmidt" pps

... Orthogonal Polynomials and Applications (VII SPOA) (Granada, 1991), J. Comput. Appl. Math. 49:1–3 (1993), 243–249. [6] A. L. Schmidt, “Legendre transforms and Ap´ery’s sequences”, J. Austral. Math. ... was greatly encouraged by C. Krattenthaler to prove binomial iden- tities by myself. I thank him for our fruitful discussions and for pointing out to me Andrews’s formula. I thank J. Sondo...
Ngày tải lên : 07/08/2014, 08:20
  • 8
  • 347
  • 0
Báo cáo toán học: "On a Class of Constant Weight Codes" pptx

Báo cáo toán học: "On a Class of Constant Weight Codes" pptx

... t)]   and we already know that the absolute value of the inner sum was found to be smaller than 3 √ q/2. One may extend the codes C(q, n) in a similar way. Using the same approach as that in ... Pennsylvania State University E-mail: caragiu@math.psu.edu Submitted: July 31, 1995; Accepted: January 2, 1996 Abstract. For any odd prime p ower q we first construct a certain non-linear binar...
Ngày tải lên : 07/08/2014, 06:20
  • 13
  • 348
  • 0
Báo cáo toán học: "On a conjecture concerning dyadic oriented matroids" pptx

Báo cáo toán học: "On a conjecture concerning dyadic oriented matroids" pptx

... totally dyadic representation A. A dyadic oriented matriod is dyadic of order k if it has a totally dyadic representation A with full row rank and with the property that for each pair of adjacent ... Louisville. scobee@louisville.edu Submitted: January 7, 1999; Accepted: March 30, 1999 Abstract A rational matrix is totally dyadic if all of its nonzero subdeterminants are in {±2 k :...
Ngày tải lên : 07/08/2014, 06:20
  • 6
  • 215
  • 0
Báo cáo toán học: " On a Partition Function of Richard Stanley" pptx

Báo cáo toán học: " On a Partition Function of Richard Stanley" pptx

... The Main Theorem We begin with some preliminaries about partitions and their conjugates. For a given partition π with parts each  N,wedenotebyf i (π) the number of appearances of i as a part ... provides such a division at least for n = 0 and 1 (cf. [1, p.175]). Problem 2. Identity (7) cries out for combinatorial proof. I have been informed that A. Sills, A. J. Yee, and C. Bo...
Ngày tải lên : 07/08/2014, 08:22
  • 10
  • 268
  • 0
Báo cáo tin học: "On the Spectrum of the Derangement Graph" pptx

Báo cáo tin học: "On the Spectrum of the Derangement Graph" pptx

... Math. J. 9 (1998), 239-300. Available at http://arxiv.org/abs/q-alg/9605042. [17] M. Ram Murty, “Ramanujan Graphs”, J. Ramanujan Math. Soc. 18 (2003), 1-20. [18] D. J. Rasmussen and C. D. Savage, ... thank Cheng Ku for bringing his conjecture to my attention and for many stimulating discussions, David Wales for pointing out a discrepancy in an earlier draft, Rick Wilson and the mathe-...
Ngày tải lên : 07/08/2014, 15:23
  • 17
  • 204
  • 0
Báo cáo khoa học: "TELEGRAM: A GRAMMAR FORMALISM FOR LANGUAGE PLANNING" pptx

Báo cáo khoa học: "TELEGRAM: A GRAMMAR FORMALISM FOR LANGUAGE PLANNING" pptx

... TELEGRAM: A GRAMMAR FORMALISM FOR LANGUAGE PLANNING Douglas E. Appelt Artificial Intelligence Center SRI International Menlo Park, California O. Abstract Planning provides the basis for a ... by annotating a unification grammar with assertions about how grammatical choices are used to achieve various goals, and by enabling the planner to augment the func- tional descripti...
Ngày tải lên : 31/03/2014, 17:20
  • 5
  • 277
  • 0
Báo cáo hóa học: " On a boundary value problem of a class of generalized linear discrete-time systems" ppt

Báo cáo hóa học: " On a boundary value problem of a class of generalized linear discrete-time systems" ppt

... canonical form of regular matrix polynomials. Linear Algebra Appl. 385, 117–130 (2004) doi:10.1186/1687-1847-2011-51 Cite this article as: Dassios: On a boundary value problem of a class of generalized ... necessary mathematical framework for interesting applications. Dassios Advances in Difference Equations 2011, 2011:51 http://www.advancesindifferenceequations.com/content/2011/1/51...
Ngày tải lên : 20/06/2014, 22:20
  • 9
  • 388
  • 0
Báo cáo khoa học: On a two-sided Tur´an problem docx

Báo cáo khoa học: On a two-sided Tur´an problem docx

... vertices a 1 ,a 2 ∈ A such that {a i ,b}∈Ffor i =1, 2. Suppose instead, that there are three vertices a 1 ,a 2 ,a 3 ∈ A such that {a i ,b}∈F.Since F( {a 1 ,a 2 ,a 3 }, {b})=∅,wehaveF( {a 1 ,a 2 ,a 3 })=F({b, ... that F( {a, b})=∅.SinceT = { {a, b, c} : |F( {a, b, c})| = t} = ∅, we may again apply Lemma 9 and derive a contradiction as in the previous paragraph. Pr...
Ngày tải lên : 07/08/2014, 08:20
  • 17
  • 122
  • 0
Báo cáo tin học: "On the quantum chromatic number of a graph" pps

Báo cáo tin học: "On the quantum chromatic number of a graph" pps

... quantum chromatic number is in Hadamard graphs [7, 5], which are a special case of orthogonality graphs, so it is natural to consider the larger family. An orthogonal representation of a graph ... F c that we need are that its columns form an orthonormal basis and the entries all have the same modulus. So the (normalized) character table of any Abelian group of order c will do (as will a...
Ngày tải lên : 07/08/2014, 15:23
  • 15
  • 299
  • 0

Xem thêm

Từ khóa: