Báo cáo toán học: "Computing the period of an Ehrhart quasi-polynomial" ppt

Báo cáo toán học: "Computing the period of an Ehrhart quasi-polynomial" ppt

Báo cáo toán học: "Computing the period of an Ehrhart quasi-polynomial" ppt

... time, and the proof follows. Proof of Corollary 6: Compute D = D (P ) by taking the least common multiple of the denominators of all of the coordinates of the vertices of P . Assume that we can ... factor p of n j , decide whether n j p is a period of i P (t). • If none are periods, then n j is the minimum period of i P (t), and we are done. • if n j p is a...

Ngày tải lên: 07/08/2014, 13:21

12 222 0
Báo cáo toán học: "Computing the Domination Number of Grid Graphs" potx

Báo cáo toán học: "Computing the Domination Number of Grid Graphs" potx

... Y. Chang, Domination Numbers of Grid Graphs, Ph.D. thesis, Dept. of Mathe- matics, University of South Florida, 1992. [3] T. Y. Chang and W. E. Clark, The domination numbers of the 5 × n and 6 ... it follows from the discussion above that the range of settled cases of γ n,n is actually n  19. In the current work, this range will be extended to n  29. The explanation...

Ngày tải lên: 08/08/2014, 14:23

18 251 0
Báo cáo toán học: " On the boundedness of the solutions in nonlinear discrete Volterra difference equations" pot

Báo cáo toán học: " On the boundedness of the solutions in nonlinear discrete Volterra difference equations" pot

... R + , 0 ≤ j ≤ n and p ∈ (0, 1). The following result provides a necessary and sufficient condition for the boundedness of the solution of (4.4) and (4.5). The necessary part of the next theorem was ... satisfied. Proof. The proof is immediate consequence from proof of Theorem 4.3 with Remark 5.1. Remark 5.6. The Corollary 5.5 is analogous to the corresponding result of...

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

24 371 0
Từ khóa:
w