scientific article; zbMATH DE number 194009
In the continuing debate on what should constitute an undergraduate background in mathematics for the mathematician or the computer scientist, this book is destined for a major role. It is not a traditional course in discrete mathematics, though it does overlap some of the material taught there. Rather it is a compendium of some of the basic techniques for solving the very specific problems that arise in all branches of the mathematical sciences. The heart of the book presents elementary number theory, binomial coefficient identities, topics from combinatorics and probability, and a primer on how to use and find asymptotic arguments. The style is extremely informal, often irreverent. But it also conveys the joy and exuberance of the craftsman who is only too pleased to share his lore by shaping a well-turned example before your eyes. My only reservation concerns the chapter on binomial coefficient identities, by far the longest in the book. While the authors do introduce hypergeometric functions, a standardized notation for binomial coefficient identities that quickly enables you to identify when the summation you are pondering is equivalent to one that has been previously studied, they wait until they are more than fifty pages into the subject before letting the reader in on the existence of this notation. They could have brought it in earlier.
- Layouts for mobility management in wireless ATM networks
- The conditional gambler's ruin problem with ties allowed
- Shortened recurrence relations for Bernoulli numbers
- On computing the semi-sum of two integers
- Riordan matrices in the reciprocation of quadratic polynomials
- Multiperfect numbers on lines of the Pascal triangle
- Using computer algebra techniques for the specification, verification and synthesis of recursive programs
- The Parikh counting functions of sparse context-free languages are quasi-polynomials
- Fibonacci, van der Corput and Riesz-Nágy
- Stickelberger elements over rational function fields
- Maintaining range trees in secondary memory. Part I: Partitions
- Average-case performance analysis of an approximation algorithm for maximum subset sum using recurrence relations
- On Whitney numbers of Dowling lattices
- The method of creative telescoping
- New modular properties of Bell numbers
- \(p\)-integral harmonic sums
- Efficient parallel algorithms can be made robust
- Fast average-case pattern matching by multiplexing sparse tables
- Computing GCD's by normalized division
- The ring of k-regular sequences
- Quasi-random subsets of \(\mathbb{Z}_ n\)
- Distances in random plane-oriented recursive trees
- A review of Mathematica
- Stirling networks: A versatile combinatorial topology for multiprocessor systems
- On the complexity of blocks-world planning
- Universal cycles for combinatorial structures
- A note on optimal area algorithms for upward drawings of binary trees
- An optimal algorithm for the period of a strongly connected digraph
- Some further results on the height of lattice paths
- The memory game
- Generalized binomial coefficients and the subset-subspace problem
- Polynomials with two values
- Random generation of trees and other combinatorial objects
- Discrepancy-based error estimates for quasi-Monte Carlo. I: General formalism
- Séries de croissance et polynômes d'Ehrhart associés aux réseaux de racines. (Growth series and Ehrhart polynomials associated to root lattices)
- Directed animals, forests and permutations
- Binomial convolutions and determinant identities
- A result in order statistics related to probabilistic counting
- Monkey tests for random number generators
- An invariant property of balls in arrangements of hyperplanes
- The first Fourier series
- Deriving algorithms on reconfigurable networks based on function decomposition
- Mellin transforms and asymptotics: Digital sums
- Double dipping: The case of the missing binomial coefficient identities
- \(k\)-sets and random hulls
- Gap-definable counting classes
- Generating words in a context-free language uniformly at random
- On minimizing the \(\forall\)-\(\neg\) degree of a connective-free formula
- Decomposition of certain products of conjugacy classes of \(S_ n\)
- Generalized Zeckendorf expansions
- A mathematical model of a mesh system and its implementation
- A note on the binomial drop polynomial of a poset
- Markov analysis of multiple-disk prefetching strategies for external merging
- Counting the number of fault patterns in redundant VLSI arrays
- Internal path length of the binary representation of heap-ordered trees
- An optimal bound for path weights in Huffman trees
- A calculus for the random generation of labelled combinatorial structures
- An analysis of a class of algorithms for S-box construction
- A random clustering process
- A mathematical model for mesh's dynamic behavior
- The minimum feature set problem
- The representation of permutations by trees
- A generalization of Gosper's algorithm
- Broadcasting in m-dimensional grid graphs with a given neighborhood template
- Measuring the instability in two-sided matching procedures
- \(T\)-chromatic polynomials
- Combinatorial variations on multidimensional quadtrees
- Stationary second-degree iterative methods
- Binomial identities -- combinatorial and algorithmic aspects
- Origins of the analysis of the Euclidean algorithm
- Sphere packing numbers for subsets of the Boolean \(n\)-cube with bounded Vapnik-Chervonenkis dimension
- On the number of descendants in an object DAG
- ``Deco polyominoes, permutations and random generation
- Markov chains for Monte Carlo tests of genetic equilibrium in multidimensional contingency tables
- The determinant of a tree's neighborhood matrix
- A combinatorial interpretation of the generalized Fibonacci numbers
- The combinatorics of discrete self-similarity
- On the number of cyclic projective planes
- Linear area upward drawings of AVL trees
- On a problem of Erdős and Rado
- Generating power of lazy semantics
- Representations of orthogonal polynomials
- On the alternating series \(1-\frac{1}{2}+\frac{1}{3}-\frac{1}{4}+\cdots\)
- Euclidean strings
- Emerging behavior as binary search trees are symmetrically updated.
- Non-Horn clause logic programming
- Combinatorial identities in dual sequences
- Standard monomials for q-uniform families and a conjecture of Babai and Frankl
- Exact formulas for moments of sums of classical parking functions
- Summations on trigonometric functions
- The calculation of average distance in mesh structures.
- On extensions of Calkin's binomial identities
- The ring of \(k\)-regular sequences. II.
- Zetas and moments of finite group actions.
- Bounds for self-dual codes over \(\mathbb{Z}_4\)
- Strip tiling and regular grammars
- Tight bounds on the solutions of multidimensional divide-and-conquer maximin recurrences
- Legendre-Bernstein basis transformations
- Stirling numbers revisited
- A characterization of inverse relations.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4040797)
