61. AIM Reprint Library: 1. Sur L independance des Domaines Simples Dans L Espace Euclidien A n Dimensions renyi, alfred renyi, C. Suranyi, J. http://www.aimath.org/library/library.cgi?database=reprints;mode=display;BrowseT

62. Citebase - On Observability Of Renyi's Entropy G/A, 4 A. renyi, Probability Theory (NorthHolland, Amsterdam, 1970); SelectedPapers of alfred renyi, Vol.2 (Akademia Kiado, Budapest, 1976). http://citebase.eprints.org/cgi-bin/citations?id=oai:arXiv.org:cond-mat/0307698

63. Annales De L'Institut Fourier alfred Rényi .. p. 4352 A generaltheorem of probability. Back to the previous page. http://annalif.ujf-grenoble.fr/cgi-bin/auteur?Langue=eng&AuthorName=RENYI&Author

64. The Panda's Thumb: Dembski Gets Raked Over The Coals Again Thanks to Shalizi, I’ll cite alfred renyi in future versions of my paper. alfred renyi’s generalization over and beyond the variational information is http://www.pandasthumb.org/pt-archives/000405.html

Navigation Main Weekly Archive Category: Intelligent Design Comments (55) ... Printer-friendly version Recent Comments Robert O'Brien on August 16, 2004 06:28 PM steve on August 12, 2004 06:09 PM Russell on August 12, 2004 05:37 PM Steve on August 12, 2004 03:54 PM Robert O'Brien on August 12, 2004 02:34 PM Tracy P. Hamilton on August 12, 2004 08:42 AM Great White Wonder on August 11, 2004 08:27 PM Pim van Meurs on August 11, 2004 07:14 PM FL on August 11, 2004 07:06 PM FL on August 11, 2004 07:03 PM Recent Trackbacks Recommend this entry to a friend Friend's email address: Your email address: Message (optional): Site Traffic Dembski gets raked over the coals again Posted by PZ Myers on August 10, 2004 04:10 PM Cosma Shalizi has a sharp dissection of Dembski's peculiar abuses of information theory . Things don't look happy for poor Bill. Dembski's paper seriously mis-represents the nature and use of information theory in a wide range of fields. What he puts forward as a new construction is in fact a particular case of a far more general idea, which was published in forty-four years ago. That construction is extremely well-known and widely used in a number of fields in which Dembski purports to be an expert, namely information theory, hypothesis testing and the measurement of complexity. The manuscript contains exactly no new mathematics. Such is the work of a man described on one of his book jackets as "the Isaac Newton of information theory". His home page says this is the first in a seven-part series on the "mathematical foundations of intelligent design"; I can't wait. Or rather, I can.

65. Www.mathematik.de | Das Mathematikhistorische Kalenderblatt - Januar 2004 Translate this page 1969 hat der ungarische Wahrscheinlichkeitstheoretiker alfred renyi (1921 – 1970),der auch noch alfred renyi Briefe über die Wahrscheinlichkeit. http://www.mathematik.de/mde/information/kalenderblatt/wahrscheinlichkeitsrechnu

Impressum Kontakt Suchen [Druckversion] Das mathematikhistorische Kalenderblatt - Januar 2004 Wann entstand die Wahrscheinlichkeitsrechnung? Blaise Pascal Pierre de Fermat Bartolomo Manfredi (1580-1620): Kartenspieler. Galerie Alte Meister, Dresden Das Wort Wahrscheinlichkeit siehe Grafik Fermats Antwort auf einen leider nicht erhalten gebliebenen ersten Brief von Pascal beginnt wie folgt: "Mein Herr, wenn ich versuche, eine bestimmte Augenzahl mit einem einzigen Würfel in acht Würfen zu erreichen [d.h. z.B. eine Sechs spätestens im 8. Wurf], und wir, nachdem das Geld eingesetzt ist, übereinkommen, dass ich den ersten Wurf nicht ausführen werde, dann steht mir nach meinem Prinzip 1/6 des Gesamteinsatzes als Entschädigung zu auf Grund des besagten ersten Wurfes. Wenn wir danach noch übereinkommen, dass ich den zweiten Wurf nicht ausführen werde, muss ich zu meiner Entschädigung ein Sechstel des Restes [des Einsatzes] nehmen, das sind 5/36 [nämlich 1/6 von 5/6] des Gesamteinsatzes [...]" [Schneider 1989] Reinier de la Haye (ca. 1640 - 1695): Tricktrack spielende Offiziere. Staatliche Galerie Dessau, Schloss Georgium

66. Untitled Document Translate this page Gegen Ende des zweiten Weltkriegs promoviert alfred renyi im ungarischen alfred renyi ist Gründer und fast zwei Jahrzehnte lang Jahre Direktor des http://www.exil-archiv.de/html/biografien/renyi.htm

Philosoph und Mathematiker Geb. 1921 in Budapest/ Ungarn Gest. 1970 in Budapest/ Ungarn Cauchy-Fourier-Reihen zum Doktor der Philosophie. Links (deutsch): http://www5.in.tum.de/lehre/seminare/ math_nszeit/SS03/vortraege/verfolgt International: http://www.renyi.hu/arenyi.html http://www1.cs.columbia.edu/~sanders/ graphtheory/people/Renyi.A.html http://www.bergen.org/Update/Math.pdf ... bibliography/Author/RENYI-A.html

67. Renyi Biography of Alfréd Rényi (19211970) Alfréd Rényi received a literary, ratherthan scientific, schooling. In 1944 he was forced to a Fascist Labour http://www-groups.dcs.st-and.ac.uk/~history/Mathematicians/Renyi.html

Born: 30 March 1921 in Budapest, Hungary Died: 1 Feb 1970 in Budapest, Hungary Click the picture above to see two larger pictures Show birthplace location Previous (Chronologically) Next Biographies Index Previous (Alphabetically) Next Main index Version for printing Riesz for work on Cauchy Fourier series. He was taught by at Budapest, then he went to Russia and worked with Linnik on the theory of numbers, in particular working on the Goldbach conjecture . He discovered methods described by as at present one of the strongest methods of analytical number theory After returning to Hungary he worked on probability which was to be his main research topic throughout his life. He published joint work with on random graphs and also considered random space filling curves. Known by the nickname of Buba, he is best remembered for proving that every even integer is the sum of a prime and an almost prime number (one with only two prime factors), he is also remembered as the author of the anecdote a mathematician is a machine for converting coffee into theorems developed the anecdote by describing weak coffee as fit only for lemmas Hungarian Academy of Sciences . He was a famous raconteur remembered for many performances of his dialogue, which he spoke with his daughter, on the nature of mathematics.

68. Rényi Institute The Institute. General information Contact Directions Library; Documents (inHungarian) Üvegzseb Positions Math Links http://www.renyi.hu/

The Institute General information Library Documents (in Hungarian) Üvegzseb Positions Math Links People Research divisions Management Research fellows Young researchers, post-docs, graduate students ... Visitors Activities Current Seminars (in Hungarian) European projects FIST BudAlgGeo DiscConvGeo PHD ... PhD program Announcements Fourier Analysis Extremal Problems and Approximation Conference on Lattice Theory, 2006 For Members WebMail: Read your E-mail Intraweb Information on research grants (in Hungarian) Information on OTKA grants (in Hungarian) Intézményünk országos és nemzetközi hálózati kapcsolatát az NIIF Program biztosítja

69. Graph Theory White Pages Rényi, Alfred www.graphtheory.com graph theory white pages Rényi, alfred. http://www1.cs.columbia.edu/~sanders/graphtheory/people/random.cgi?R*eacute;nyi,

70. Rényi's Polynomial -- From MathWorld Reprinted in Selected Papers of alfred Rényi, Vol. 1. Budapest, pp. 4447, 1976.CITE THIS AS. Eric W. Weisstein. Rényi s Polynomial. http://mathworld.wolfram.com/RenyisPolynomial.html

INDEX Algebra Applied Mathematics Calculus and Analysis Discrete Mathematics ... Alphabetical Index DESTINATIONS About MathWorld About the Author Headline News ... Random Entry CONTACT Contribute an Entry Send a Message to the Team MATHWORLD - IN PRINT Order book from Amazon Algebra Polynomials sparse polynomial square SEE ALSO: Sparse Polynomial Square [Pages Linking Here] REFERENCES: Coppersmith, D. and Davenport, J. "Polynomials Whose Powers Are Sparse." Acta Arith. Rényi, A. "On the Minimal Number of Terms in the Square of a Polynomial." Acta Math. Hungar. , 30-34, 1947. Reprinted in Budapest, pp. 44-47, 1976. CITE THIS AS: Eric W. Weisstein. "Rényi's Polynomial." From MathWorld A Wolfram Web Resource. http://mathworld.wolfram.com/RenyisPolynomial.html Wolfram Research, Inc.

71. Sparse Polynomial Square -- From MathWorld (Rényi 1947, Coppersmith and Davenport 1991), which has 29 terms and whose square 1, 3034, 1947. Reprinted in Selected Papers of alfred Rényi, Vol. 1. http://mathworld.wolfram.com/SparsePolynomialSquare.html

INDEX Algebra Applied Mathematics Calculus and Analysis Discrete Mathematics ... Alphabetical Index DESTINATIONS About MathWorld About the Author Headline News ... Random Entry CONTACT Contribute an Entry Send a Message to the Team MATHWORLD - IN PRINT Order book from Amazon Algebra Polynomials Sparse Polynomial Square A sparse polynomial square is a square of a polynomial that has fewer terms than the original polynomial . Examples include (Coppersmith and Davenport 1991), which has 18 terms and whose square has 17, and (Coppersmith and Davenport 1991; Trott 2004, p. 276), which has 13 terms and whose square has 12. In fact, Coppersmith and Davenport (1991) found eight polynomials of degree 13 having sparse squares (of degree 12), where six of the values are rational: -110, -253, , and (Abbott 2000). Using , Abbott (2002) showed that no polynomial of degree less than 12 has a sparse square, but was not able to demonstrate that these examples are exhaustive. SEE ALSO: Polynomial [Pages Linking Here] REFERENCES: Abbott, J. "Sparse Squares of Polynomials." Math. Comput.

72. LIBRIS Nyförvärvslista Rényi, alfred., 19211970. Selected papers of Alfréd Rényi. 1, 1948-1956.ISBN 963-05-0913-X (hela verket). Rényi, alfred., 1921-1970 http://www.ub.uu.se/linne/ang/maj04a.htm

A Akselsson, Patrik, 1977 Improved database enrichment with consensus scoring and multivariate data analysis / Patrik Akselsson. - Uppsala, 2004. - 44 s. (UPTEC K 1650-8297 ; 04017) Aladjev V.Z Systems of computer algebra : new software toolbox for maple / Aladjev V.Z. and Vaganov V.A. - Tallin : 2003. - 268 s. ISBN 9985-9277-6-1 Andersson, Evert, 1941 Järnvägssystem och spårfordon / Evert Andersson, Mats Berg. - Stockholm : Järnvägsgruppen, KTH, 2001. - 2 vol. : ill. Andersson, Evert, 1941 Järnvägssystem och spårfordon. D. 1, Järnvägssystem. - Stockholm : Järnvägsgruppen, KTH, 2001. - Ca 350 s. Andersson, Evert, 1941 Järnvägssystem och spårfordon. D. 2, Spårfordon. - Stockholm : Järnvägsgruppen, KTH, 2001. - Ca 350 s. Andersson Sunden, Erik, 1979 On the unfolding of synthetic and real data of the MPR fusion neutron spectrometer / Erik Andersson Sunden. - Uppsala, 2004. - 33 s. (UPTEC F 1401-5757 ; 04001) Andreescu, Titu, 1956 A path to combinatorics for undergraduates : counting strategies / Titu Andreescu, Zuming Feng. - Boston : Birkhäuser, 2003. - xviii, 228 s. : ill. ISBN 0-8176-4288-9 Artificial intelligence (Print Artificial intelligence : an international journal. - Amsterdam : Elsevier, 1970. - Vol. 1. ISSN 0374-2539 ISSN 0004-3702 (Bowker)

73. Erdos0d, Version 2004, February 2, 2004 This Is A List Of The 509 FRITZ* 6 joint papers 1950 RADO, RICHARD* 18 joint papers 1950 renyi, ALFREDA.* 32 joint papers 1951 SHAPIRO, HAROLD N. 3 joint papers 1952 MIRSKY, http://www.oakland.edu/enp/Erdos0d

Erdos0d, Version 2004, February 2, 2004 This is a list of the 509 co-authors of Paul Erdos, sorted by the year of their first joint paper. Please send corrections and comments to . The Erdos Number Project Web site can be found at the following URL:

74. Editions Jacques Gabay - RENYI : Calcul Des Probabilités http://www.gabay.com/sources/Liste_Fiche.asp?CV=164

75. Essay: Large Dynamic Graphs: What Can Researchers Learn From Them? in 1959 by the celebrated mathematicians Paul Erdös and alfred Rényi, Nevertheless, we have learned that we can extend the ErdösRényi model to http://www.mathaware.org/mam/04/essays/graphs.html

Math Awareness Month - April 2004 The Mathematics of Networks Current MAM Home Page Previous MAWs/MAMs Current Activities From SIAM News , Volume 37, Number 3, April 2004 Large Dynamic Graphs: What Can Researchers Learn from Them? By Fan Chung Graham Researchers who study massive real-world networks like the Internet and the Web are facing new and challenging mathematical problems. These problems arise in part because the usual assumptions mathematicians make in problems of this type may no longer hold. In problems involving massive data sets, for instance, the networks or graphs we use to study the systems are prohibitively large so much so that the (exact) number of nodes is no longer a useful parameter. Instead, we can obtain only partial information, and even that is changing dynamically. In terms of the Internet: The number of Internet hosts topped 109 million as of March 2001, and is estimated to be growing at more than 51% per year. And the number of Web pages indexed by large search engines now exceeds 2 billion, and more than 4000 Web sites are thought to be created every day. Given the massive and dynamic graphs arising from the Internet and the Web, is it even possible for researchers to determine simple structural properties? Here are some examples of things we would like to know about these graphs: How connected are they? In particular, what are the size and diameter of the largest component? What about the second-largest component? Are there interesting structural properties that govern or influence the development and use of these physical and virtual networks?

76. IEEE: Events: Seminars: 1999: Lattices, Boolean Algebras, And Alfréd Rényi alfred Rényi. Dr. Grätzer is the author of about 200 research papers and 16 books.He received numerous honours, including the Steacie Prize of the National http://www.ewh.ieee.org/reg/7/winnipeg/events/e1999/seminars/se990324.html

Section's Home Events Seminars in 1999 S EMINARS IN Title Date: March 24, 1999 Wednesday Time: 12:00 AM Place: Room 450 New Engineering Bldg. Univ. of Manitoba. Fort Garry Campus Contacts Speaker , Ph.D. Department of Mathematics University of Manitoba email: gbridges@ee.umanitoba.ca Department of Electrical and Computer Engineering IEEE Communications Chapter IEEE Computer Chapter and Fees IEEE Members: Students Professionals free free General Public: Students Professionals free free Parking Metered, close to the Engineering Bldg. Free in Lot U. Attendance S YNOPSIS Abstract: Bio: Your suggestions and questions are always welcome (v.3.27)

77. American Scientist Online - Graph Theory In Practice: Part II around 1960 by the Hungarian mathematicians Paul Erdos and alfred Rényi. Erdos and Rényi proved a number of interesting results about these graphs. http://www.americanscientist.org/template/AssetDetail/assetid/14717/page/3

Home Current Issue Archives Bookshelf ... Subscribe In This Section Search Book Reviews by Issue Issue Index Topical Index ... Classics Site Search Advanced Search Visitor Login Username Password Help with login Forgot your password? Change your username see full issue: March-April 2000 Volume: Number: Page: DOI: COMPUTING SCIENCE Other Formats: Postscript (gzipped) Postscript Graph Theory in Practice: Part II Lattices and Random Graphs In trying to understand very large small-world graphs, two simplified models serve as useful points of reference. n vertices has n edges, and every vertex has degree 2, meaning that two edges meet there. When edges extend both to nearest neighbors and to next-nearest neighbors, the ring has 2 n edges and vertices of degree 4. How does the ring lattice perform as a model of small-world graphs? Not terribly well. It is suitably sparse, with just n edges in the nearest-neighbor case, and there is a sense in which it is highly clustered, since all the edges are "local." But the diameter is not small. The only way to travel in a ring is to go from neighbor to neighbor; the lattice is like a railroad line without an express track. The diameter of the nearest-neighbor ring is

78. Borsuk Conference - List Of Participants Imre Bárány (alfred Rényi Institute of Mathematics Hungarian Academy of Science)Greg Bell (Penn State) Mladen Bestvina (University of Utah) http://www.impan.gov.pl/BC/05BorsukL.html

The following persons expressed intention of participating in the conference Greg Bell (Penn State) Mladen Bestvina (University of Utah) Agnieszka Bojanowska (Warsaw University) Martin R. Bridson (Imperial College London) Nikolay Brodskiy (University of Tennessee) Ken Bromberg (University of Utah) John L. Bryant (Florida State University) Kai-Uwe Bux (University of Virginia) James W. Cannon (Brigham Young University) Matija Cencelj (University of Ljubljana) Alex Chigogidze (University of North Carolina at Greensboro) Daniel Cichoń (University of Wrocław) Gregory R. Conner (Brigham Young University) Francois Dahmani (Universite de Toulouse) Robert Daverman (University of Tennessee) Michael W. Davis (Ohio State University) Jan Dijkstra (Vrije University Amsterdam) Tadeusz Dobrowolski (Pittsburg State University) Alexander Dranishnikov (University of Florida) Jerzy Dydak (University of Tennessee) Jan Dymara (University of Wrocław) Katsuya Eda (Waseda University Tokyo) Robert D. Edwards (UCLA) Tomasz Elsner (University of Wrocław) Steven Ferry (Rutgers University) Hanspeter Fischer (Ball State University) Koji Fujiwara (Tohoku University) Światosław Gal (University of Wrocław) Efraim Gelman (The Hebrew University of Jerusalem - Einstein Institute of Mathematics) Thanasis Gentimis (University of Athens) Stanisław Godlewski (University of Podlasie) Andrzej Granas (University of Montreal) Daniel Groves (California Institute of Technology) Craig Guilbault (University of Wisconsin at Milwaukee)

79. Frequently Asked Questions Isn t Paul Erdos responsible for that quote you attribute to alfred Rényi? device for turning coffee into theorems and an attribution to alfred Rényi. http://www.math.ucsd.edu/~dwildstr/faq.html

Frequently Asked Questions Do you have a stapler? No. How about in your office? Nope. I own no stapler of any sort. What about a paperclip? Nope. No fastening devices of any kind. So how do I hold these papers together? Not my problem. You might want to write your name on each page though. What else should I write on my papers? Your section number would be nice, but it's hardly required. When'd you last shave? 25 years ago. And your last haircut? Mid-2001. Do you have a stapler? No. Do you ever wear shoes? Only when sanitation or liability's an issue. Thus, in bathrooms, restaurants, and large soulless multinational chains. Do you paint your own toenails? And why? Yes, and because it's an emotional/creative outlet. And it's different and weird. And of course there are not nearly enough ways in which I'm different and weird. What's your actual name? I keep seeing different first names. I was born David Jacob Wildstrom. The "Wildstrom" part is a story in itself, but it's not my story. For the first 18 years of my life I was simply "David". This ended after I was in a class in which a third of the people were named David my senior year. Going to college is a good time for changes, so at college I introduced myself as "Jake" and nobody questioned it. And I've been Jake to everyone except bureaucrats, old friends, and family since then. I haven't officially changed my name and probably never shall, so as a matter of reconciling my official and common names, I sometimes indicate my name as "D. Jacob Wildstrom". Those are the three names I use most commonly. I occasionally go by "Bishop" or "Jack Bishop" but that's another story.

80. William Dembski And The Discovery Institute, Renewing Science And Culture By Re- in fact one of the Rényi informations, introduced by alfred Rényi in a famous1960 paper, In Dembski s notation, the Rényi information of order a, http://www.cscs.umich.edu/~crshalizi/weblog/234.html

Three-Toed Sloth Slow Takes from the Canopy of the Reality-Based Community (and occasional stochastic filtering) August 10, 2004 Main William Dembski and the Discovery Institute, Renewing Science and Culture by Re-Inventing the Wheel Pete Dunkelberg wrote to tell me that William Dembski, senior fellow at the Discovery Institute, the Mathematical Great White Hope of the "Intelligent Design" school of creationism, had a new pre-print out on information theory. So, for my sins, I downloaded it. William A. Dembski, "Information as a Measue of Variation" [ PDF link Abstract : Within information theory, information typically measures the reduction of uncertainty that results from the knowledge that an event has occurred. But what if the item of knowledge learned is not the occurrence of an event but, rather, the change in probability distribution associated with an ensemble of events? This paper takes the usual account of information, which focuses on events, and generalizes it to probability distributions/measures. In so doing, it encourages the assignment of "generalized bits" to arbitrary state transitions of physical systems. In particular, it provides a theoretical framework for characterizing the informational continuity of evolving systems and for rigorously assessing the degree to which such systems exhibit, or fail to exhibit, continuous change. Having now read this production in both the original (7 July 2004) and lightly revised (23 July 2004) version, my considered judgment is the same as my first reaction: Sweet suffering Jesus.

A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  Q  R  S  T  U  V  W  X  Y  Z

Page 4     61-80 of 90    Back | 1  | 2  | 3  | 4  | 5  | Next 20