Torrent details for "Ruskey F. Combinatorial Generation 2003" Log in to bookmark
Controls:
×
Report Torrent
Please select a reason for reporting this torrent:
Your report will be reviewed by our moderation team.
×
Report Information
Loading report information...
This torrent has been reported 0 times.
Report Summary:
| User | Reason | Date |
|---|
Failed to load report information.
×
Success
Your report has been submitted successfully.
Checked by:
Category:
Language:
None
Total Size:
32.6 MB
Info Hash:
8F28DE62BDB697A1C31725CF5FB0DA83F04B0466
Added By:
Added:
April 20, 2026, 2:14 p.m.
Stats:
|
(Last updated: April 20, 2026, 2:14 p.m.)
| File | Size |
|---|---|
| ['Ruskey F. Combinatorial Generation 2003.pdf'] | 0 bytes |
Name
DL
Uploader
Size
S/L
Added
-
32.6 MB
[28
/
26]
2026-04-20
| Uploaded by andryold1 | Size 32.6 MB | Health [ 28 /26 ] | Added 2026-04-20 |
NOTE
SOURCE: Ruskey F. Combinatorial Generation 2003
-----------------------------------------------------------------------------------
COVER
-----------------------------------------------------------------------------------
MEDIAINFO
Textbook in PDF format Humanity has long enjoyed making lists. All children delight in their new-found ability to count 1,2,3, etc., and it is a profound revelation that this process can be carried out indefinitely. The fascination of finding the next unknown prime or of listing the digits of π appeals to the general population, not just mathematicians. The desire to produce lists almost seems to be an innate part of our nature. Furthermore, the solution to many problems begins by listing the possibilities that can arise. There are lists of mathematical objects that have a historical interest, or maybe I should say that there are lists of historical objects that have a mathematical interest. Examples include the Fu Hsi sequencing of the hexagrams of the I Ching (e.g., as described in Martin Gardner - Knotted Donuts) and the Murasaki diagrams of the Tale of the Genji (by Lady Shikibu Murasaki, 1000 A.D.) as explained in Gould. Viewed properly, these are lists of the first 64 binary numbers 0, 1... 63 and all 52 partitions of a 5-set, respectively. They are illustrated in Figures 1 and 2 at the end of this preface. However, it was not until the advent of the digital computer that the construction of long lists of combinatorial objects became a non-tedious exercise. Indeed, some of the first applications of computers were for producing such lists. With the computer as our able assistant we can construct interesting lists to our hearts content. There is deeply satisfying feeling that one obtains by watching a well ordered list of combinatorial objects marching down the computer screen. The author hopes that the readers of this book will implement some of the algorithms found herein and experience this feeling for themselves! These lists are not only interesting but can be extremely useful. Nearly every computer scientist and mathematician has encountered some instance where they solved a problem simply by listing all the possibilities and checking for a desired property. One can find applications of the ideas in this book to circuit design, statistical computing, chemistry, and operations research, just to name a few
×