The Hypercube of Resistors, Asymptotic Expansions, and Preferential Arrangements

@article{Pippenger2009TheHO,
  title={The Hypercube of Resistors, Asymptotic Expansions, and Preferential Arrangements},
  author={Nicholas Pippenger},
  journal={Mathematics Magazine},
  year={2009},
  volume={83},
  pages={331 - 346},
  url={https://api.semanticscholar.org/CorpusID:17260512}
}
  • N. Pippenger
  • Published 10 April 2009
  • Mathematics
  • Mathematics Magazine
Summary Using a classic puzzle concerning a cube of resistors as a point of departure, we use its generalization to a hypercube of resistors as an excuse to survey a number of results concerning generating functions, asymptotic expansions, and combinatorial enumeration. We conclude by giving, apparently for the first time, the complete solution to the problem of the hypercube of resistors. 

The resistance of an n-dimensional tetrahedron

We consider here a problem that is suitable for introducing high-school students to the notion of generalizing shapes and solids to n dimensions. In particular, we calculate the effective resistance…

Pattern-avoiding Cayley permutations via combinatorial species

A Cayley permutation is a word of positive integers such that if a letter appears in this word, then all positive integers smaller than that letter also appear. We initiate a systematic study of…

Some applications of S-restricted set partitions

In the paper, the authors present several new relations and applications for the combinatorial sequence that counts the possible partitions of a finite set with the restriction that the size of each…

Some applications of S-restricted set partitions

In the paper, the authors present several new relations and applications for the combinatorial sequence that counts the possible partitions of a finite set with the restriction that the size of each…

On Some Identities of Barred Preferential Arrangements

A preferential arrangement of a finite set is an ordered partition. Associated with each such ordered partition is a chain of subsets or blocks endowed with a linear order. The chain may be split…

On higher order generalized geometric polynomials with shifted parameters

Abstract We study a special class of higher order generalized geometric polynomials. Based on our combinatorial interpretation of labeled barred preferential arrangements, we prove several…

Experiments with Polygonal and Polyhedral Resistive Structures

In this work the equivalent resistors of eight regular polygonal and five polyhedral resistive structures are studied experimentally. The structures were constructed using commercial precision…

The Telephone Exchange Problem Revisited: A Combinatorial Approach

In this study we revisit the telephone exchange problem. We discuss a generalization of the telephone exchange problem by discuss two generalizations of the Bessel polynomials. We study combinatorial…

The Art of Computer Programming

The History of Fascicles, a seven-volume set of fascicle installments based on a single book with twelve chapters written by B.B.Knuth in the period of 1962 to 1973, is published.

History of Mathematics

IT is only during the last fifty or sixty years that the history of mathematics has been systematically studied. In that time, however, the field has been gradually covered by an increasing number of…

Choice and Chance

WE should think that not a few copies of the first edition of this work must have been purchased under the impression that it was an interesting story; and it is surprising that so neat and…

Ordinary Differential Equations

The numerical treatment of ordinary differential equations is a field whose scope has broadened quite a bit over the last 50 years. In particular, a whole spectrum of different stability conditions…

The On-Line Encyclopedia of Integer Sequences

The On-Line Encyclopedia of Integer Sequences (or OEIS) is a database of some 130000 number sequences which serves as a dictionary, to tell the user what is known about a particular sequence and is widely used.