{"text_format":"2","workbook":"xls","n_sheets":1,"sheets":["report2"],"not_rendered":{"charts":0,"images":0,"macros":0,"external_links":1,"defined_names":1,"comments":0,"pivot_tables":0},"unopened":[],"bounds":{"document_bytes":16777216,"sheet_cells":100000,"run_cost":"one","rows_first":2000,"rows_last":500,"rows_between":2000,"halvings":0,"cell_chars":16384,"cell_head_chars":4096},"cells_cut":0,"cells_raw":0,"read":"whole","date_system":"1900","formulas":"cached_only"}

{"sheet":"report2","index":0,"n_rows":27,"n_cols":5,"rows_kept":27,"cut":false,"hidden":false,"merged":[[0,2,0,3],[0,4,0,5],[1,2,1,3],[1,4,1,5],[2,2,2,3],[3,2,3,3],[8,2,8,3],[9,2,9,3],[10,2,10,3],[11,2,11,3],[13,2,13,3],[14,2,14,3],[19,2,19,3]],"flags":["formulas_cached_only"]}
[null,"1.","Record Nr.",null,"UNINA9910969245303321"]
[null,null,"Titolo",null,"Computer algebra 2006 : latest advances in symbolic algorithms : proceedings of the Waterloo Workshop in Computer Algebra 2006, Ontario, Canada, 10-12 April 2006 / / editors, Ilias Kotsireas, Eugene Zima"]
[null,null,"Pubbl/distr/stampa",null,"Singapore ; ; Hackensack, NJ, : World Scientific, c2007"]
[null,null,"ISBN",null,"9786611930080"]
[{"$nulls":4},"9781281930088"]
[{"$nulls":4},"1281930083"]
[{"$nulls":4},"9789812778857"]
[{"$nulls":4},"9812778853"]
[null,null,"Edizione",null,"[1st ed.]"]
[null,null,"Descrizione fisica",null,"1 online resource (220 p.)"]
[null,null,"Disciplina",null,"005.1"]
[null,null,"Soggetti",null,"Algebra - Data processing"]
[{"$nulls":4},"Computer algorithms"]
[null,null,"Lingua di pubblicazione",null,"Inglese"]
[null,null,"Formato",null,"Materiale a stampa"]
[null,null,null,"Livello bibliografico","Monografia"]
[null,null,null,"Note generali","\"The Waterloo Workshop on Computer Algebra (WWCA-2006) was held on April 10-12, 2006 at Wilfrid Laurier University (Waterloo, Ontario, Canada).\"--P. v."]
[{"$nulls":4},"Workshop dedicated to the 60th birthday of Sergei Abramov."]
[null,null,null,"Nota di bibliografia","Includes bibliographical references and index."]
[null,null,"Nota di contenuto",null,"CONTENTS; Preface; Hypergeometric Summation Revisited S. A. Abramov, M. Petkovsek; 1. Introduction; 2. Validity conditions of the discrete Newton-Leibniz formula; 2.1. A criterion; 2.2. Summation of proper hypergeometric sequences; 2.3. When the interval I contains no leading integer singularity of L; 3. The spaces VI(L) and WI(R(k), L); 3.1. The structure of WI(R(k), L); 3.2. When a rational solution of Gosper's equation is not unique; 3.3. If Gosper's equation has a rational solution R(k) then WI(R, L)  = 0; References"]
[{"$nulls":4},"Five Applications of Wilf-Zeilberger Theory to Enumeration and Probability M. Apagodu, D. ZeilbergerExplicit Formulas vs. Algorithms; The Holonomic Ansatz; Why this Paper?; The Maple packages AppsWZ and AppsWZmulti; Asymptotics; First Application: Rolling a Die; Second Application: How many ways to have r people chip in to pay a bill of n cents; Third Application: Hidden Markov Models; Fourth Application: Lattice Paths Counting; References; Factoring Systems of Linear Functional Equations Using Eigenrings M. A. Barkatou; 1. Introduction "]
[{"$nulls":4},"and notations; 2. Preliminaries"]
[{"$nulls":4},"3. Eigenrings and reduction of pseudo-linear equationsMaximal Decompsition; 4. Spaces of homomorphisms and factorization; Appendix A. K[X;  φ, δ].modules and matrix pseudo-linear equations; Appendix A.1. Pseudo-linear operators; Appendix A.2. Similarity, reducibility, decomposability and complete reducibility; Appendix A.3. The ring of endomorphisms of a pseudo-linear operator; References; Modular Computation for Matrices of Ore Polynomials H. Cheng, G. Labahn; 1. Introduction; 2. Preliminaries; 2.1. Notation; 2.2. Definitions; 2.3. The FFreduce Elimination Algorithm"]
[{"$nulls":4},"3. Linear Algebra Formulation4. Reduction to Zp[t][Z]; 4.1. Lucky Homomorphisms; 4.2. Termination; 5. Reduction to Zp; 5.1. Applying Evaluation Homomorphisms and Computation in Zp; 5.2. Lucky Homomorphisms and Termination; 6. Complexity Analysis; 7. Implementation Considerations and Experimental Results; 8. Concluding Remarks; References; Beta-Expansions of Pisot and Salem Numbers K. G. Hare; 1. Introduction and History; 2. Univoque Pisot Numbers; 3. Algorithms and Implementation Issues; 4. Conclusions and Open Questions; References"]
[{"$nulls":4},"Logarithmic Functional and the Weil Reciprocity Law A. Khovanskii1. Introduction; 1.1. The Weil reciprocity law; 1.2. Topological explanation of the reciprocity law over the field C; 1.3. Multi-dimensional reciprocity laws; 1.4. The logarithmic functional; 1.5. Organization of material; 2. Formulation of the Weil reciprocity law; 3. LB-functional of the pair of complex valued functions of the segment on real variable; 4. LB-functional of the pair of complex valued functions and one-dimensional cycle on real manifold; 5. Topological proof of the Weil reciprocity law"]
[{"$nulls":4},"6. Generalized LB-functional"]
[null,null,null,"Sommario/riassunto","Written by world-renowned experts, the book is a collection of tutorial presentations and research papers catering to the latest advances in symbolic summation, factorization, symbolic-numeric linear algebra and linear functional equations. The papers were presented at a workshop celebrating the 60th birthday of Sergei Abramov (Russia), whose highly influential contributions to symbolic methods are adopted in many leading computer algebra systems."]