Báo cáo toán học: "Computing parametric rational generating functions with a primal Barvinok algorithm" docx
... variants have simpler implementations than the primal irrational variant [15, Algorithm 5.1] and the all -primal irrational variant [15, Algorithm 6.4] because computations with large rational numbers ... journal of combinatorics 15 (2008), #R16 16 Computing parametric rational generating functions with a primal Barvinok algorithm Matthias K¨oppe ∗ Otto-von-Guericke-Uni...
Ngày tải lên: 07/08/2014, 15:23
... latex application and drying, and after submersion in standard MFC media. The latex film applied with an airbrush to an exoelectrogenic biofilm on a carbon paper anode remained completely intact, ... 3, or 5 layers 7 of latex applied to a carbon paper anode using an airbrush, compared to a reactor with no 8 latex (dashed line). Representative reactors are shown. 9 10 Fig. 3...
Ngày tải lên: 20/06/2014, 21:20
... monochromatic subgraphs with a given minimum degree Yair Caro ∗ and Raphael Yuster † Department of Mathematics University of Haifa at Oranim Tivon 36006, Israel Submitted: Jan 10, 2003; Accepted: Aug ... Dierker and W. Voxman, Either a graph or its complement is connected : A continuing saga, Mathematics Magazine, to appear. [3] D. W. Matula, Ramsey Theory for graph connectivity, J. G...
Ngày tải lên: 07/08/2014, 07:21
Báo cáo toán học: "On the number of subsequences with a given sum in a finite abelian grou" pptx
... Wang, 5§ and Haiyan Zha ng 6¶ 1 Department of Mathematics, National Taiwan University, Taipei 10617, Taiwan 2 Taida Institute for Mathematical Sciences, National Taiwan University, Taipei 10617, Taiwan 3 National ... Non-unique factorizations, Combinatorial and Analytic Theory, Pure and Applied Mathematics, vol. 278, Chapman & Hall/CRC, 2006. [15] A. Geroldinger, Additive group theory an...
Ngày tải lên: 08/08/2014, 14:23
Báo cáo toán học: " Random walks on generating sets for finite groups" docx
... w(G)tobetheleastintegersuchthatforanyminimalbasisB, and any g ∈ G, we can write g as a product of at most w terms of the form x ±1 , x ∈ B. Finally, define s(G) to be the cardinality of a minimum basis for G. We abbreviate ... pages. [7] P. Diaconis and L. Saloffe-Coste, Walks on generating sets of abelian groups, Probab. Theory Relat. Fields, 105 (1996), 393-421. [8] P. Diaconis and L. S...
Ngày tải lên: 07/08/2014, 06:22
Báo cáo toán học: "Computing Evolutionary Chains in Musical Sequences" pdf
... certain circumstances; in case (b), a variant of the pattern may actually cancel out the effect of a previous variant, so the overall distance from the original may remain within the bounds allowed ... desirable for the original pattern, rather than arbitrarily-selected successive variants, to appear as a term in the index table. Approximate repetitions in musical entities play a cruci...
Ngày tải lên: 07/08/2014, 06:23
Báo cáo toán học: "Computing the period of an Ehrhart quasi-polynomial" ppt
... use are rational generating functions. Given a set S ⊂ Z d , define the generating function f(S; x)= a= (a 1 , ,a d )∈S x a 1 1 x a 2 2 ···x a d d = a S x a . Sets that are very large can sometimes ... 8 [Buc00] Anders Skovsted Buch. The saturation conjecture (after A. Knutson and T. Tao). Enseign. Math. (2), 46(1-2):43–60, 2000. With an appendix by William Fulton....
Ngày tải lên: 07/08/2014, 13:21
Báo cáo toán học: "Minimum rank of matrices described by a graph or pattern over the rational, real and complex numbers" doc
... a rational matrix (equivalently, an integer matrix) B ∈ Q (A) such that rank B = k. With our notation, this would be: For any m × n sign pattern matrix Z with mr(M R Z ) = k, there exists a rational ... Li and B. Rao. On Rational Realizations of the Minimums Rank of a Sign Pattern Matrix. Linear Alg. Appls., 2005, 409:11–125. [BFH] F. Barioli, S.M. Fallat, and L. Hogben. Compu...
Ngày tải lên: 07/08/2014, 15:23
Báo cáo toán học: "Computing the Domination Number of Grid Graphs" potx
... 1989. [12] E. O. Hare and D. C. Fisher, An application of beatable dominating sets to algo- rithms for complete grid graphs, in Y. Alavi and A. Schwenk (Eds.), Graph Theory, Combinatorics, and Algorithms, ... Finland simon.crevals@aalto.fi Anton Isopoussu Department of Pure Mathematics and Mathematical Statistics Centre for Mathematical Sciences, University of Cambridge Wilberforce Road, Cam...
Ngày tải lên: 08/08/2014, 14:23
Báo cáo toán học: " Interface modification effect between p-type a-SiC:H and ZnO:Al in p-i-n amorphous silicon solar cells" potx
... optical properties such as transparency and haze ratio. Additionally, the interface properties with an adjacent p-layer are also important. The FTO has been widely used as a front TCO in a single ... cell fabrication. All investigated cells have a 500-nm Ag back contact that defines a 0.25-cm 2 cell area. The illuminated I-V properties of solar cells are measured by an AM 1.5G...
Ngày tải lên: 20/06/2014, 20:20