
	Where results make sense

Topic: Herbert Wilf

	The Pennsylvania Gazette: Proof & Beauty
		Thanks in large measure to the work of Dr. Herbert S. Wilf, the Thomas A. Scott Professor of Mathematics, and Dr. Doran Zeilberger of Temple University, at least one type of proof is now the province of the computer.
		Wilf and Zeilberger have shown that computers can prove a certain class of equations, known as combinatorial identities, instantly and infallibly.
		Frequently an equation could not be simplified, though it was impossible for the frustrated mathematician to tell whether this was because no simplification existed or because he or she just was not clever enough to find it.
	www.upenn.edu /gazette/0598/wilf.html (777 words)

	Herbert Wilf information - Search.com
		Herbert Wilf (born 1931) is a mathematician, specializing in combinatorics.
		The remarkably simple idea of the work of Wilf and Zeilberger has already changed a part of mathematics for the experts, for the high-level users outside the area, and the area itself." Their work has been translated into computer packages that have greatly simplified hypergeometric summation.
		In 2002, Wilf was awarded Euler Medal by the Institute of Combinatorics and its Applications.
	search.com.com /reference/Herbert_Wilf (276 words)

	Herbert Wilf - Wikipedia, the free encyclopedia
		Herbert S. Wilf (born 1931) is a mathematician, specializing in combinatorics.
		Herbert Wilf is well known for writing generatingfunctionology.
		In 1998, Wilf and Zeilberger received the Leroy P. Steele Prize for Seminal Contribution to Research for their joint paper, "Rational functions certify combinatorial identities" (Journal of the American Mathematical Society, 3 (1990) 147–158).
	en.wikipedia.org /wiki/Herbert_Wilf (255 words)

	Sister Mary Celine Fasenmyer
		As told to Herbert Wilf, Professor of Mathematics, University of Pennsylvania, in April of 1993
		We are grateful to Professor Wilf for his permisson to reproduce this material from his web page on Sister Mary Fasenmyer.
		Herbert Wilf, Marko Petkovsek, and Doron Zeilberger have published a book entitled A=B about a whole new science of proving identities by computer, a field that had formerly been the province of humans.
	www.agnesscott.edu /lriddle/women/celine.htm (446 words)

	[No title]
		Herbert S. Wilf is Thomas A. Scott Professor of Mathematics at the University of Pennsylvania.
		He is well-known for his research in Combinatorics and received the Leroy J. Steele Prize of the American Mathematical Society in 1998 (jointly with Doron Zeilberger) for Seminal Contributions to Research.
		The Involution Principle of Garsia-Milne and its automation of partition bijections; Remmel's theory of disjoint multisets; the principle of sieve-equivalence and its applications to partitions and prefabs; Gordon's bijection, in the setting of sieve equivalence; O'Hara's acceleration in the case of disjoint multisets; pairs of identically distributed partition statistics.
	www.math.uvic.ca /pims/wilf.html (200 words)

	Herbert Wilf wins AMS Steele Prize (Site not responding. Last check: 2007-10-21)
		On Thursday, January 8, 1998, the American Mathematical Society announced that Professor Herb Wilf, of Penn's Mathematics Department, was awarded a Leroy P. Steele Prize for Seminal Contribution to Research.
		He shared the award with Doron Zeilberger of Temple University for their joint work on "Rational functions certify combinatorial identities", a paper that appeared in the Journal of the AMS in 1990.
		Herb Wilf is the Thomas A. Scott Professor of Mathematics.
	www.math.upenn.edu /History/recog/steele-wilf.html (405 words)

	Discover the Wisdom of Mankind on wilf (Site not responding. Last check: 2007-10-21)
		In general this subject is like a general wilf forum or wilf message board.
		It looked as though it was going to be a very wet day, but the weather improved as the 21 pairs fought it out to be the first winners of this new event......
		wilf tags from millions of people who are bookmarking a site, an article, a blog, a picture or just about anything containing information about your Blink.
	www.blinkbits.com /blinks/wilf (677 words)

	About "Herbert Wilf" (Site not responding. Last check: 2007-10-21)
		The entire text of his books generatingfunctionology, A = B, and Algorithms and Complexity may be downloaded in PDF format, as may his "East Side, West Side" lecture notes on combinatorial objects and Maple programming.
		Wilf's other articles are available in varying formats, including PostScript,.dvi, and TeX. In particular, see his collection of critiques, facts, and opinions in negative response to the question, Is "research in mathematics education" possible?
		The Math Forum is a research and educational enterprise of the Drexel School of Education.
	mathforum.org /library/view/9572.html (84 words)

	The On-Line Encyclopedia of Integer Sequences
		The number of prime divisors of n (counted with multiplicity) of the Wilf sequence.
		The Wilf sequence in question is A083216 "Second-order linear recurrence sequence with a(n) = a(n-1) + a(n-2)." This is a second-order linear recurrence sequence with a(0) and a(1) co-prime that does not contain any primes.
		It was found by Herbert Wilf in 1990.
	www.research.att.com /~njas/sequences/A114566 (243 words)

	Amazon.com: Generatingfunctionology: Books: Herbert S. Wilf (Site not responding. Last check: 2007-10-21)
		"Wilf's writing is clear and friendly; his exorcises are instructive and plentiful..." --This text refers to the Hardcover edition.
		Interested readers should be made aware that if a person does a net search for "Herbert Wilf's Home Page", and then goes to that site, the author has this book (and a number of other things)available for FREE downloading.
		Wilf's writing style is clear, concise, and even humorous at times.
	www.amazon.com /Generatingfunctionology-Herbert-S-Wilf/dp/0127519564 (1189 words)

	School of Arts & Sciences - University of Pennsylvania
		Thomas A. Scott Professor of Mathematics Herbert Wilf has been awarded the Euler Medal by the Institute of Combinatorics and Its Applications.
		The award is given for distinguished contributions in combinatorial research by an active member of the organization.
		Professor Wilf’s other honors include the Lindback Award, a Guggenheim Fellowship, fellowship in the Institute of Combinatorics and its Applications, the Haimo Award of the Mathematics Association of America for Distinguished Teaching, and the Leroy P. Steele Prize for Seminal Research given by the American Mathematical Society.
	www.sas.upenn.edu /home/news/wilf.html (95 words)

	DBLP: Herbert S. Wilf (Site not responding. Last check: 2007-10-21)
		Herbert S. Wilf: Accelerated series for universal constants, by the WZ method.
		Herbert S. Wilf: Spectral bounds for the clique and independence numbers of graphs.
		Herbert S. Wilf: A Global Bisection Algorithm for Computing the Zeros of Polynomials in the Complex Plane.
	www.informatik.uni-trier.de /~ley/db/indices/a-tree/w/Wilf:Herbert_S=.html (577 words)

	[No title]
		On June 12 - 15, 1996, a Conference on Combinatorics and Graph Theory was held at the University of Pennsylvania to honor Herb Wilf and his many contributions to mathematics and mathematicians; on that occasion we also celebrated his 65th birthday.
		This special issue of the Electronic Journal of Combinatorics is a collection of papers by students, coauthors and friends who were among the 186 participants who gathered to pay tribute to Herb Wilf -- an outstanding mathematician and a truly wonderful teacher.
		The main area of Herb Wilf is combinatorics.
	www.combinatorics.org /Volume_4/foreword.html (606 words)

	Penn Professor Will Give Elementary Math Talk Wednesday
		Herbert Wilf is Thomas A. Scott Professor of Mathematics and co-founder of two math journals.
		EASTON, Pa.(www.lafayette.edu), July 22, 2004 — Herbert Wilf, Thomas A. Scott Professor of Mathematics at the University of Pennsylvania, will speak on “Another Class of Sums that Your Computer Can Do in Closed Form” 4 p.m.
		A member of the faculty at Penn since 1962, Wilf is author of several books and more than 100 research and expository papers.
	www.lafayette.edu /news.php/view/5828 (248 words)

	Department of Mathematics Home Page (Site not responding. Last check: 2007-10-21)
		The 1998 Steele Prize for Research awarded to Herbert S. Wilf and Doron Zeilberger.
		The Council of American Mathematical Society awarded the 1998 Leroy P. Steele Prize for a Seminal Contribution to Research to Herbert S. Wilf and Doron Zeilberger for their paper Rational functions certify combinatorial identities, Journal of American Mathematical Society 3 (1990), 147-158.
		Wilf receiving his prize while Doron looks on
	www.math.temple.edu /prize (350 words)

	Herbert Wilf'
		It's a good motivator for classes in matrix algebra since it shows how search engines like Google use eigenvectors to do their searches.
		Peter Wilf's home page, in my impartial opinion, is a rich source of paleontological information.
		The Electronic Journal of Combinatorics is a peer reviewed journal of combinatorics that is free on the WWW, and boasts an outstanding Editorial Board.
	www.cis.upenn.edu /~wilf (306 words)

	Online texts (Site not responding. Last check: 2007-10-21)
		Professor Herbert Wilf (and the publisher, Academic Press) has made available his book generatingfunctionology.
		Another one by Professor Wilf is Algorithms and Complexity.
		A = B, by Marko Petkovsek, Herbert Wilf, and Doron Zeilberger.
	www.math.gatech.edu /~cain/textbooks/onlinebooks.html (1197 words)

	Mathematics Books and Sources
		"A=B", by Marko Petkovsek, Herbert Wilf, Doron Zeilberger.
		Herbert Wilf East Side, West Side (Lectures on combinatorial objects)
		Herbert Wilf, Lectures on Integer Partitions (PIMS lectures Summer 2000 at U. of Victoria.)
	www.math.harvard.edu /library/index.html (49 words)

	[No title]
		Subject: Wilf and Zeilberger win Steele prize On January 13, 1998 I received a message from Doron Zeilberger to his E-friends that Herbert Wilf and Doron Zeilberger were awarded the 1998 Steele prize.
		He added the responses of Herbert Wilf and himself to this prize, see below.
		The pioneering, and extremely successful, Electronic J. of Combinatorics, created by Herb Wilf in 1994, should be emulated.
	math.nist.gov /opsf/personal/wilfzeil.html (903 words)

	E-Books (Site not responding. Last check: 2007-10-21)
		A Course in Universal Algebra (The Millennium Edition) is a corrected version of the original book, "A course in Universal Algebra" by Stanley M Burris & H. P Sankappanavar and and is free to download or print.
		Algorithms and Complexity is an e-book by Herbert Wilf of the University of Pennsylvania, chapters are available in PostScript or PDF format with a table of contents in HTML and Copyright 1994 by Herbert S. Wilf.
		Book Material may be reproduced for any educational purpose, multiple copies may be made for classes, etc.
	www.ub.bw /library/library/Jain/ebooks.htm (173 words)

	Syllabus for 22C:196, Computational Combinatorics
		Here is a list of books I have often referred to in learning this material.
		Most of the books are in the library and I own a copy of all of these books, except for the one by Nijenhuis and Wilf.
		If you do want to spend money on a book and want my recommendation from among the list below, Combinatorial Algorithms : An Update by Herbert Wilf would be my choice.
	www.cs.uiowa.edu /~sriram/196/fall01/syllabus.html (566 words)

	Web Directory » Web Directory » Science » Math » Publications » Online Texts
		A=B - Combinatorics text by Marko Petkovsek, Herbert Wilf and Doron Zeilberger.
		Algebraic Topology - Basic core material along with a number of optional topics of a relatively elementary nature by Allen Hatcher.
		Algorithms and Complexity - By Herbert S. Wilf.
	www.dcpages.com /DC_ODP/?c=Science/Math/Publications/Online_Texts (3034 words)

	The Book "A=B"
		The Book "A=B" Home Page for the Book "A=B" by Marko Petkovsek, Herbert Wilf and Doron Zeilberger
		A=B by Marko Petkovsek, Herbert Wilf, and Doron Zeilberger What are you waiting for?
		If your browser doesn't support the area links above, then use these alternate links to read the Foreword, to download the programs, to view the current errata sheet, or to contact the publisher.
	www.cis.upenn.edu /~wilf/AeqB.html (1133 words)

	Ars Mathematica » Blog Archive » Herbert Wilf
		Ars Mathematica » Blog Archive » Herbert Wilf
		Herbert Wilf has put several of his books online for download.
		To contact us, email Walt or Robbie (or webmaster) at arsmath.net
	www.arsmathematica.net /archives/2005/06/07/herbert-wilf (149 words)

	Herbert Wilf (Site not responding. Last check: 2007-10-21)
		Discuss this person with other users on IMDb message board for Herbert Wilf
		Find where Herbert Wilf is credited alongside another name
		You may report errors and omissions on this page to the IMDb database managers.
	imdb.com /name/nm0928879 (104 words)

	Amazon.com: A=B: Books: Marko Petkovsek,Herbert S. Wilf,Doron Zeilberger (Site not responding. Last check: 2007-10-21)
		by Marko Petkovsek, Herbert S. Wilf, Doron Zeilberger "One of the major themes of the past century has been the growing replacement of human thought by computer programs..." (more)
		The mathematics described in the book "A=B" lead to the awarding of a Steele Prize by the American Mathematical Society to Herbert Wilf and Doron Zeilberger.
		What the authors have done is to discover a way of using computer algebra and some mathematical ideas they and others had earlier to make it possible to find the sum of most of the hypergeometric and basic hypergeometric series which can be summed.
	www.amazon.com /B-Marko-Petkovsek/dp/1568810636 (1283 words)

	Fan Chung (Site not responding. Last check: 2007-10-21)
		Fan Chung grew up in Kaochiung, Taiwan, the daughter of an engineer.
		She earned her Ph.D. in mathematics from the University of Pennsylvania in 1974 with a thesis on "Ramsey Numbers in Multi-Colors" under the direction of Herbert Wilf.
		She worked for 20 years at Bell Labs and Bellcore in the area of combinatorics.
	www.agnesscott.edu /lriddle/women/chung.htm (232 words)

	Free e-books and e-lectures on Algorithms, Math, and Cryptography
		East Side, West Side, lecture notes on combinatorial objects and Maple programs for generating them, by Herbert S. Wilf
		Lecture Notes on Numerical Analysis by Dennis Deturck and Herbert S. Wilf
		Lectures on Integer Partitions by Herbert S. Wilf
	www-cse.ucsd.edu /users/maxal/e-books.html (553 words)

	The Wilf Festschrift
		This special issue of the Electronic Journal of Combinatorics has been edited by Fan Chung.
		It contains the refereed papers from a conference in honor of Herbert Wilf's 65th birthday.
		A purely combinatorial proof of the Hadwiger Debrunner (p,q) Conjecture (8pp)
	www.combinatorics.org /Volume_4/wilftoc.html (191 words)

	Numerical Analysis Lecture Notes - Wilf
		13 Mar 2004 0:45 Numerical Analysis Lecture Notes - Wilf
		13 Mar 2004 6:14 Re: Numerical Analysis Lecture Notes - Wilf
		PLease post the link with info for free stuffs on web.
	www.edaboard.com /ftopic70552.html (80 words)

	CONSULS LIST (Site not responding. Last check: 2007-10-21)
		Wilf, Herbert S., 1931- ALGORITHMS AND COMPLEXITY / HERBERT S. Natick, Mass.
		Schatzman, M. Oxford : Clarendon Press ; New York : Oxford University Press, 2002.
		Clemens, C. Herbert (Charles Herbert), 1939- A SCRAPBOOK OF COMPLEX CURVE THEORY / C. Providence, R.I. : American Mathematical Society, c2003.
	www.southernct.edu /departments/library/mat04.html (2079 words)

Try your search on: Qwika (all wikis)