| Description |
1 online resource |
| Contents |
Foreword; CONTENTS; Monte-Carlo and Quasi-Monte-Carlo Methods for Numerical Integration; 1 INTRODUCTION; 2 POINT SETS FOR MONTE-CARLO METHODS; 3 POINT SETS FOR QUASI-MONTE-CARLO METHODS; References; Theoretical Approaches to Judgment and Choice; 1 INTRODUCTION; 2 ORDINAL PREFERENCES; 3 COMPARABLE PREFERENCE DIFFERENCES; 4 MULTIPLE ATTRIBUTES; 5 TIME STREAMS; 6 CHOICE FUNCTIONS; 7 SOCIAL CHOICE FUNCTIONS; 8 SUBSET RANKING AND CHOICE; 9 LOTTERIES AND RISK; 10 UNCERTAINTY; References; Combinatorial Aspects of Mathematical Social Science; 1 INTRODUCTION |
|
2 LIST OF APPLICABLE MATHEMATICS IN SOCIAL SCIENCE3 SOCIAL WELFARE FUNCTIONS (SWF); 4 PROSPECTS; 5 OPEN PROBLEMS; References; Twelve Views of Matroid Theory; INTRODUCTION; 1 LINEAR DEPENDENCE WITHOUT SCALARS; 2 BASIS EXCHANGE PROPERTIES; 3 GEOMETRIC LATTICES; 4 GRAPH THEORY WITHOUT VERTICES; 5 GRAPH THEORY AND LEAN LINEAR ALGEBRA; 6 VARIETIES OF FINITE MATROIDS; 7 SECRET-SHARING MATROIDS; 8 GREEDY ALGORITHMS, MATROID INTERSECTION, AND MATROID PARTITION; 9 MATRIX MULTIPLICATION AND THE CAUCHY-BINET IDENTITY; 10 BASIS GENERATING FUNCTIONS AND THE MATRIX-TREE THEOREM |
|
11 GENERIC RANK-GENERATING POLYNOMIALSReferences; Enumeration of Graph Coverings, Surface Branched Coverings and Related Group Theory; 1 Definitions and Notations; 2 Cycle permutation graphs and the double cosets of Dn in Sn; 3 Graph coverings and subgroups of free groups; 4 Regular coverings with abelian voltage groups and subgroups of free abelian groups; 5 Regular coverings having dihedral voltage groups; 6 Regular coverings; A general case; 7 New classifications of branched coverings and the number of subgroups of a surface group; 8 Distributions of branched surface coverings; References |
|
An Overview of the Poset of Irreducibles1 Introduction; 2 The Poset of Irreducibles; 3 Applications; References; Number Theory and Public-Key Cryptography; 1 Introduction; 2 Public-Key Cryptography; 3 New Requirements; 4 The Algorithmic Number Theory; 5 Trapdoor One-Way Problems; 6 Recapitulation; 7 Application to Public Key Cryptography; 8 Conclusion and Open Problems; References; Some Applications of Graph Theory; 1 Introduction; 2 Graph Coloring; 3 The Second Concept: Intersection Graph; 4 Third Concept: Competition Graph; 5 Closing Comment; References |
|
Duality and its Consequences for Ordered Cohomology of Finite Type Subshifts1 INTRODUCTION; 2 FUNDAMENTAL GROUP AND HOMOLOGY; 3 REPRESENTATION OF CLOPEN SETS; 4 ORBIT CLOSURE EQUIVALENCE; 5 ACTION OF AUTOMORPHISMS ON ORDERED COHOMOLOGY; 6 CONCLUSION; References; Simple Maximum Likelihood Methods for the Optical Mapping Problem; 1 Introduction; 2 Known Orientation; 3 Unknown Orientation; 4 Initial Values of Parameters and Independent Flipping; 5 Experimental Results; 6 Conclusion; References |
| Summary |
This book describes and summarizes past work in important areas of combinatorics and computation, as well as gives directions for researchers working in these areas in the 21st century. It contains primarily survey papers and presents original research by Peter Fishburn, Jim Ho Kwak, Jaeun Lee, K.H. Kim, F.W. Roush and Susan Williams. The papers deal with some of the most exciting and promising developments in the areas of coding theory in relation to number theory, lattice theory and its applications, graph theory and its applications, topological techniques in combinatorics, symbolic dynamics and mathematical social science |
| Subject |
Combinatorial analysis -- Congresses
|
|
Numerical analysis -- Congresses
|
|
Combinatorial analysis.
|
|
Numerical analysis.
|
| Genre/Form |
Conference papers and proceedings.
|
| Form |
Electronic book
|
| Author |
Hong, Sungpyo.
|
| ISBN |
1281951447 |
|
9781281951441 |
|
9789812799890 |
|
9812799893 |
|
