Wilf, Herbert S. 1931-2012

Algorithms and complexity by Herbert S Wilf( Book )

40 editions published between 1986 and 2002 in 3 languages and held by 1,322 WorldCat member libraries worldwide

Tekoči in diskretni algoritmi v okviru numerične analize kot osnova za načrtovanje in pisanje računalniških programov

Generatingfunctionology by Herbert S Wilf( Book )

52 editions published between 1990 and 2014 in 4 languages and held by 1,215 WorldCat member libraries worldwide

This is the Second Edition of the highly successful introduction to the use of generating functions and series in combinatorial mathematics. This new edition includes several new areas of application, including the cycle index of the symmetric group, permutations and square roots, counting polyominoes, and exact covering sequences. An appendix on using the computer algebra programs MAPLE(r) and Mathematica(r) to generate functions is also included. The book provides a clear, unified introduction to the basic enumerative applications of generating functions, and includes exercises and solutions, many new, at the end of each chapter

Mathematical methods for digital computers by Anthony Ralston( Book )

39 editions published between 1960 and 1977 in English and Italian and held by 962 WorldCat member libraries worldwide

Mathematics for the physical sciences by Herbert S Wilf( Book )

42 editions published between 1962 and 2013 in 3 languages and held by 702 WorldCat member libraries worldwide

This book offers advanced undergraduates and graduate students in physics, engineering, and other natural sciences a solid foundation in several fields of mathematics. Clear and well-written, it assumes a previous knowledge of the theory of functions of real and complex variables, and is ideal for classroom use, self-study, or as a supplementary text. Starting with vector spaces and matrices, the text proceeds to orthogonal functions; the roots of polynomial equations; asymptotic expansions; ordinary differential equations; conformal mapping; and extremum problems. Each chapter goes straight to the heart of the matter, developing subjects just far enough so that students can easily make the appropriate applications. Exercises at the end of each chapter, along with solutions at the back of the book, afford further opportunities for reinforcement. Discussions of numerical methods are oriented toward computer use, and they bridge the gap between the "there exists" perspective of pure mathematicians and the "find it to three decimal places" mentality of engineers. Each chapter features a separate bibliography

Combinatorial algorithms for computers and calculators by Albert Nijenhuis( Book )

17 editions published between 1978 and 2015 in English and held by 672 WorldCat member libraries worldwide

Combinatorial Algorithms for Computers and Calculators, Second Edition deals with combinatorial algorithms for computers and calculators. Topics covered range from combinatorial families such as the random subset and k-subset of an n-set and Young tableaux, to combinatorial structures including the cycle structure of a permutation and the spanning forest of a graph. Newton forms of a polynomial and the composition of power series are also discussed. Comprised of 30 chapters, this volume begins with an introduction to combinatorial algorithms by considering the generation of all of the 2

Finite sections of some classical inequalities by Herbert S Wilf( Book )

19 editions published in 1970 in 4 languages and held by 541 WorldCat member libraries worldwide

Hardy, Littlewood and P6lya's famous monograph on inequalities [17J has served as an introduction to hard analysis for many mathema­ ticians. Some of its most interesting results center around Hilbert's inequality and generalizations. This family of inequalities determines the best bound of a family of operators on /p. When such inequalities are restricted only to finitely many variables, we can then ask for the rate at which the bounds of the restrictions approach the uniform bound. In the context of Toeplitz forms, such research was initiated over fifty years ago by Szego [37J, and the chain of ideas continues to grow strongly today, with fundamental contributions having been made by Kac, Widom, de Bruijn, and many others. In this monograph I attempt to draw together these lines of research from the point of view of sharpenings of the classical inequalities of [17]. This viewpoint leads to the exclusion of some material which might belong to a broader-based discussion, such as the elegant work of Baxter, Hirschman and others on the strong Szego limit theorem, and the inclusion of other work, such as that of de Bruijn and his students, which is basically nonlinear, and is therefore in some sense disjoint from the earlier investigations. I am grateful to Professor Halmos for inviting me to prepare this volume, and to Professors John and Olga Todd for several helpful comments. Philadelphia, Pa. H.S.W

A=B by Marko Petkovšek( Book )

19 editions published between 1995 and 2009 in English and Undetermined and held by 509 WorldCat member libraries worldwide

In the area of combinatorial identities computers are able to find very elegant proofs of difficult theorems unassisted by human intervention. This autonomy means that not only is it possible to use a PC to find such a proof, but also the proof can be checked easily. This book shows how several recently developed computer algorithms can master the difficult job of simplifying complex summations and if there is no such simplification they will prove this to be the case. The authors present the underlying mathematical theory of these methods, the principle theorems and proofs, and include a package of computer programs that can do these tasks

Combinatorial algorithms by Albert Nijenhuis( Book )

19 editions published between 1975 and 1978 in English and held by 442 WorldCat member libraries worldwide

Combinatorial algorithms : an update by Herbert S Wilf( Book )

15 editions published in 1989 in English and Italian and held by 427 WorldCat member libraries worldwide

A survey of some of the work that has been done since the appearance of the second edition of Combinatorial Algorithms. Topics include progress in: Gray Codes, listing of subsets of given size of a given universe, listing rooted and free trees, selecting free trees and unlabeled graphs uniformly at random, and ranking and unranking problems on unlabeled trees

Mathematical aspects of electrical network analysis by Symposium in Applied Mathematics of the American Mathematical Society and the Society for Industrial and Applied Mathematics( Book )

13 editions published in 1971 in English and Undetermined and held by 347 WorldCat member libraries worldwide

The volume constitutes the final scientific report for a symposium on Mathematical Aspects of Electrical Network Theory. It contains thirteen papers presented during the April 1969 meeting of the American Mathematical Society. Topics covered include numerical techniques for nonlinear circuit analysis, network models, perturbation theory for nonlinear network synthesis, and graph theoretic applications to electrical network theory. (Author)