21. The Discrete Mathematics Project The discrete mathematics Project The discrete mathematics Project University of Colorado at Boulder Dominic Peressini Project Director. http://www.colorado.edu/education/DMP/

The Discrete Mathematics Project University of Colorado at Boulder Dominic Peressini Project Director Developed in collaboration by the School of Education and the Department of Applied Mathematics . Sponsored by the Colorado Commission on Higher Education through an Eisenhower Professional Development Grant Activities Definitions Hyperlinks for Discrete Mathematics ... The schedule The National Council of Teachers of Mathematics has recently (1989) elevated discrete mathematics to the level of algebra, geometry, and calculus by including a separate discrete mathematics standard in their Standards document. Indeed, the use of discrete mathematics has an essential part in the development of students' mathematical power in a society grounded in technology and communication. In particular, discrete mathematics includes and addresses: Social Decision Making, Fair Division, Election Theory, Graph Theory, Counting Techniques, Matrix Models, and Mathematical Iteration/Recursion. Last Updated January 17, 1997 send updates/corrections/suggestions to Dominic.Peressini@Colorado.EDU

22. DMP: Definitions From Discrete Mathematics A page by a student in a University of Oregon discrete math class has its own Terms Index page. The Graph Theory Tutorial has a http://www.colorado.edu/education/DMP/def.html

DMP: Definitions INDEX: A B C D ... Z This is a tentative, and growing list of definitions, taken from various sources on Discrete Mathematics. Sources include: Discrete Mathematics Through Applications Discrete Mathematics across the Curriculum, K - 12, NCTM 1991 Yearbook A page by a student in a University of Oregon Discrete Math class has its own Terms Index page. The Graph Theory Tutorial has a Graph Theory Glossary of its own. A glossary of mathematical terms used in the Colorado Model Content Standards for Mathematics lists some general mathematics terms that are important for mathematics educators. Please send corrections, comments, additions to Dominic Peressini Last updated January 19, 1997. Definitions: A Absorbing State Addition Principle Adjacent Vertices, Adjacency Matrix Two vertices in a graph are said to be adjacent if they are connected directly by an edge An adjacency matrix is a means of representing a graph in the form of a matrix. In the adjacency matrix, both the rows and columns represent the vertices . If If two vertices are adjacent, then a 1 is place in the corresponding position in the matrix, otherwise a zsero appears. Note the this applies to a

23. Juergen Bierbrauer's Home Page Michigan Technological University. discrete mathematics and its interactions with Geometry, Cryptology and Algorithms. http://www.math.mtu.edu/~jbierbra/

Juergen Bierbrauer's home page I am Professor of Mathematics in the Department of Mathematical Sciences at Michigan Technological University . My address, phone and fax number are given below Mathematical Interests My interest is in Discrete Mathematics and its interactions with Geometry, Cryptology and Algorithms. Coding Theory and Applications New codes via the lengthening of BCH codes with UEP codes , (coauthors Yves Edel and Ludo Tolhuizen). A family of 2-weight codes related to BCH-codes , (coauthor Yves Edel). Dense sphere packings from new codes , (coauthor Yves Edel). New code parameters from Reed Solomon subfield codes , (coauthor Yves Edel). Extending and lengthening BCH-codes , (coauthor Yves Edel). Lengthening and the Gilbert-Varshamov bound , (coauthor Yves Edel). Some codes related to BCH-codes of low dimension , (coauthor Yves Edel). Inverting construction Y1 , (coauthor Yves Edel). Parameters for binary codes , (coauthor Yves Edel). Parameters for ternary codes , (coauthor Yves Edel). Parameters for quaternary codes , (coauthor Yves Edel).

24. Australasian Journal Of Combinatorics Published for the Combinatorial Mathematics Society of Australasia (Inc.) by the Centre for discrete mathematics and Computing, University of Queensland. Contents of all volumes, author and keyword searchable index. http://ajc.math.auckland.ac.nz/

THE AUSTRALASIAN JOURNAL OF COMBINATORICS ISSN 1034-4942 Published for the Combinatorial Mathematics Society of Australasia (Inc.) by the Centre for Discrete Mathematics and Computing, The University of Queensland, Queensland 4072, Australia Fax: +61-7-3365 1477 Email: ajc@maths.uq.edu.au HONORARY EDITORS: R.G. Stanton and Anne Penfold Street EDITOR-IN-CHIEF: Elizabeth J. Billington (UQ) CHIEF MANAGING EDITOR: C. Paul Bonnington (UA, Mathematics) FINANCIAL MANAGER: Peter Adams (UQ) MANAGING EDITORS: Charles Little (Institute of Fundamental Sciences, Massey University, Palmerston North, New Zealand) , Asha Rao (Department of Mathematics and Statistics, RMIT University, Melbourne, Australia) ASSOCIATE EDITORS: Darryn Bryant (UQ), Diane Donovan (UQ), Peter Gibbons (UA, Computer Science), George Havas (UQ, Info Tech and Elec Eng), Barry D. Jones (UQ), Sheila Oates-Williams (UQ) (UQ = Department of Mathematics, The University of Queensland, Qld 4072, Australia. UA = University of Auckland, Private Bag 92019, Auckland, New Zealand) Editorial Board Instructions to Authors 2004 Subscription Information Formatted 2004 Subscription Information (pdf file),

25. Princeton Discrete Mathematics Seminar Princeton discrete mathematics Seminar mchudnov@math.princeton.edu. Talks from Fall 2003. Talks from 2002/2003. Talks from 2001/2002. Talks from 2000/2001. http://www.math.princeton.edu/~bsudakov/seminar.html

Princeton Discrete Mathematics Seminar Department of Mathematics Princeton University Regular meeting time: Wednesday 3:004:00 P.M. Place: Fine 224 Spring 2004 Lectures Date Speaker Title and Abstract February 11 Noga Alon, Tel Aviv University and IAS Equidistant sets under the 1-norm February 18 Roy Meshulam, Technion A topological colorful Helly theorem February 25 Jozsef Beck, Rutgers University Van der Waerden type problems for 2-dimensional lattices March 3 Eli Berger, Princeton University The intersection of a matroid and a simplicial complex March 10 Sang-il Oum, Princeton University From binary matroids to graphs March 17 No seminar, Spring break March 24 Joel Spencer, Courant Institute, NYU Analysis of a random graph processes using differential equations March 31 Doron Zeilberger, Rutgers University April 7 Michael Krivelevich, Tel Aviv University Sphere packing in R^n through Graph Theory April 14 Robert Calderbank, Princeton University Learning in Groups April 21 Bernard Chazelle, Princeton University Lower Bounds for Degeneracy Testing Other seminars in this department If you want to be added to our mailing list, please email to:

26. ISETL Interactive SET Language, distant SETL variant widely used in discrete mathematics downloads on lower 2/3 of page, for DOS, Mac OS, Windows; source code available. http://www.math.purdue.edu/~ccc/distribution.html

27. Galois.uoregon.edu/~discrete/ galois.uoregon.edu/~discrete/Frames/Terms.html DMTCS discrete mathematics and Theoretical Computer Science DMTCS is a high standard peerreviewed electronic journal devoted to rapid publication of innovative research which covers discrete mathematics and theoretical http://galois.uoregon.edu/~discrete/

28. ScienceDirect - Discrete Mathematics - List Of Issues HTML 4.0 Lesson 6discrete math in the Classroom. discrete math is a topic that is increasingly becoming important in school mathematics, from primary to graduate levels. http://www.sciencedirect.com/science/journal/0012365X

This Feature requires JavaScript Register or Login: Password: Athens Login Discrete Mathematics Bookmark this page as: http://www.sciencedirect.com/science/journal/0012365X Articles in Press Volumes 281 - 283 Volume 283, Issues 1-3 , Pages 1-299 (6 June 2004) Volume 282, Issues 1-3 , Pages 1-293 (6 May 2004) Volume 281, Issues 1-3 , Pages 1-314 (28 April 2004) Volumes 271 - 280 Volumes 261 - 270 Volumes 251 - 260 Volumes 241 - 250 ... Volumes 1 - 10 Alert me when new Journal Issues are available Add this journal to My Favorite Journals Sample Issue Online More Publication Info Information for Authors Feedback ... Elsevier B.V.

29. Past Open Problems Columns By Douglas B. West, from the SIAM Activity Group Newsletter in discrete mathematics. http://www.math.uiuc.edu/~west/pcol/pcolink.html

Past Open Problems Columns - Douglas B. West From the SIAM Activity Group Newsletter in Discrete Mathematics These columns are the pre-publication input format sent to the Newsletter editor. In making this archive available more broadly, I am hoping also for input from readers. Please send me the open problems you would like to see solved! Email contributions to west@math.uiuc.edu DBW home page Eventually, we hope to establish a more flexible archive of open problems, searchable by keywords in various fields, with direct links from the problem pages to updates about full or partial solutions. Webmaster volunteers to help establish the searchable archive system are eagerly solicited! Open Problems #25 postscript , Winter-Spring 1998. Open Problems #24 postscript , all seasons, 1997. Open Problems #23 postscript , Summer-Fall 1996. Open Problems #22 postscript , Spring 1996. Open Problems #21 postscript , Winter 1996. Open Problems #20 postscript , Fall 1995. Open Problems #19 postscript , Summer 1995. Open Problems #18 postscript , Spring 1995.

30. Discrete Math--WV Goals/Objectives discrete math in the Classroom. West Virginia Instructional Goals and Objectives. discrete mathematics, a oneyear course, is an advanced http://bhs.broo.k12.wv.us/discrete/goals.htm

Discrete Math in the Classroom West Virginia Instructional Goals and Objectives Discrete mathematics, a one-year course, is an advanced course which may be an alternative to pre-calculus, trigonometry, or calculus. The emphasis will be placed on learning and creating algorithms to perform certain computations or to process information within a discrete (finite) set. Counting, optimization, recursively defined functions, modeling situations with graphs, arranging objects, sequences, and series are a few of the topics that will be explored. As the use of computers (a discrete machine) continues to increase, so will the expansion and importance of discrete mathematics. Analyze and evaluate graphs made of vertices and edges that model real world problems. Define, use, and differentiate such concepts as Eulerian path, Eulerian ciruit, Hamiltonian path, Hamiltonian circuit, and isomorphism. Define and use algorithms, such as breadth-first, depth-first, minimum spanning tree algorithm, the shortest path, and the four color conjecture to solve problems. Understand and apply graph coloring to real situations, such as scheduling.

31. Krishnaswami Alladi University of Florida. Number theory, combinatorics, discrete mathematics. Contact information and links of interest. http://www.math.ufl.edu/~alladi/

Krishnaswami Alladi NAME: Krishnaswami Alladi TITLE: Professor and Chair ADDRESS: Department of Mathematics University of Florida 353 Little Hall Gainesville, FL 32611-8105 PHONE: (352) 392-0281 ext.236 FAX: E-MAIL: alladi@math.ufl.edu Research Interests Number theory Combinatorics Discrete mathematics Analytic number theory Sieve methods Probabilistic number theory Diophantine approximations Partitions q-series identities Professional Service Editor-in-Chief: THE RAMANUJAN JOURNAL - an international journal devoted to the areas of mathematics influenced by Srinivasa Ramanujan Editor: DEVELOPMENTS IN MATHEMATICS - a mathematics book series publishing research monographs, conference proceedings, and contributed volumes Links of Interest The Ramanujan Journal Developments in Mathematics

32. Eighth Biannual Bay Area Discrete Math Day The Bay Area discrete math Day, Spring 2004. The Eighth BADMath Day will take place at Stanford University on Saturday 1 May 2004 between 900 and 600. http://badmathday.csuhayward.edu/

The Bay Area Discrete Math Day, Spring 2004 The Eighth BADMath Day will take place at Stanford University on Saturday 1 May 2004 between 9:00 and 6:00. Further details will be posted here as they become available: http://math.stanford.edu/~maclagan/badiscretemath04.html , or you can contact the local organizer Diane Maclagan Bay Area Discrete Math Days are one-day meetings aimed at facilitating communication between researchers and graduate students of discrete mathematics around the San Francisco Bay Area. These days happen semi-annually and strive to create a fairly informal atmosphere to talk about discrete mathematics. The term "discrete mathematics" is chosen to include at least the following topics: Algebraic and Enumerative Combinatorics, Discrete Geometry, Graph Theory, Coding and Design Theory, Combinatorial Aspects of Computational Algebra and Geometry, Combinatorial Optimization, Probabilistic Combinatorics, and Combinatorics in Mathematical Physics Information about previous BAD Math Days is available below: #1 UC Davis Friday the 13th October 2000 #2 San Francisco State University 14 April 2001 #3 Cal State Hayward 17 November 2001 #4 Stanford University 30 March 2002 ... #7 San Francisco State University 18 October 2003 The BADMath Committee: Anne Schilling University of California at Davis Joseph Gubeladze San Francisco State University.

33. Seventh Bay Area Discrete Math Day The Bay Area discrete math Day, FALL 2003. The Seventh BADMath Day will take place at San Francisco State University on Saturday http://badmathday.csuhayward.edu/Gsfsu03.html

The Bay Area Discrete Math Day, FALL 2003 The Seventh BADMath Day will take place at San Francisco State University on Saturday October 18, 2003 between 9:30 am and 6:00 pm in the Nob Hill room of the Seven Hills Center . If you have questions you can contact the local organizers Joseph Gubeladze and Serkan Hosten Bay Area Discrete Math Days are one-day meetings aimed at facilitating communication between researchers and graduate students of discrete mathematics around the San Francisco Bay Area. These days happen semi-annually and strive to create a fairly informal atmosphere to talk about discrete mathematics. The term "discrete mathematics" is chosen to include at least the following topics: Algebraic and Enumerative Combinatorics, Discrete Geometry, Graph Theory, Coding and Design Theory, Combinatorial Aspects of Computational Algebra and Geometry, Combinatorial Optimization, Probabilistic Combinatorics, and Combinatorics in Mathematical Physics. Schedule 9:30-10:00 Refreshments and Informal Discussion Allen Knutson (UC Berkeley) Simplicial complexes from non-stratification decompositions pdf Carly Klivans (MSRI) Shifting and shifted complexes pdf Julian Pfeifle (MSRI) Many triangulated 3-spheres pdf 12:40-2:30 Lunch - provided on-site.

34. Cryptography Theory And Practice Douglas Stinson. Subtitled discrete mathematics and Its Applications . Written with more emphasis on theory than practice, as acknowledged in the preface. http://www.cacr.math.uwaterloo.ca/~dstinson/CTAP.html

Cryptography Theory and Practice last modified March 27, 2000 This is the (old) web page for the first edition of the book. A second edition has now been published, and its web page is here This cryptography textbook by Doug Stinson was published in March, 1995, by CRC Press, Inc It was reprinted with corrections in late 1996: click here This home page contains the following sections: The Fourth Printing Table of Contents Translations Reviews ... Errata List (printings 1, 2, and 3) [October 1, 1996] Errata List (fourth and later printings) [March 18, 1999] Supplementary Material The Fourth Printing At the end of Novermber, 1996, the book was reprinted with corrections. This is the fourth printing of the book. (You can check which printing of the book you have by looking at the second last line of the back of the cover page. The first number in the sequence specifies the printing. For example, the fourth printing looks like 4 5 6 7 8 9 0.) The following are the (only) changes in the fourth pringing: All errors in the Errata List have been corrected.

35. Discrete Math Glossary discrete mathematics glossary. Below are links to pages containing definitions and examples of many discrete mathematics concepts. http://home.comcast.net/~lcopes/SciMathMN/concepts/concepts.html

Discrete mathematics glossary Below are links to pages containing definitions and examples of many discrete mathematics concepts. Included in the list are some concepts that are not cited specifically in the tours. We include them for you to tinker with on your own. adjacent algorithm arc arithmetic sequence ... weighted graph

36. IAMR KarRC RAS. Conference "Probabilistic Methods In Discrete Mathematics" Fifth International Petrozavodsk Conference. Karelia, Russia; 16 June 2000. http://www.krc.karelia.ru/structure/math/conf/probabl/index.shtml

Steklov Mathematical Institute of Russian Academy of Science Institute of Applied Mathematical Reasearch, Russian Academy of Science Petrozavodsk State University The Fifth International Petrozavodsk Conference "Probabilistic Methods in Discrete Mathematics" June 1-6, 2000. Petrozavodsk Simultaneously "The First Symposium on Applied and Industrial Mathematics" will take place (organized with help of "Probability Theory and its Applications" publishers) Conference Committee Conference Sections Conference Languages Conference Publications ... Picture Gallery Conference Committee: V.Y. Kozlov , chairman, V.F. Kolchin , vice-chairman V.V. Mazalov , vice-chairman A.S. Fomin, G.I. Ivchenko, V.I. Khokhlov, V.G. Mikhailov, Y.L. Pavlov, Y.V. Prokhorov, B.À. Sevastianov, A.D. Sorokin, V.À. Vatutin, À.B. Zhizhchenko, A.M. Zubkov Conference Sections: Probabilistic Problems In Combinatorial Analysis; Statistical Problems In Discrete Mathematics; Mathematical Methods of Information Security; Dynamic Games; Conference Languages Official languages of the conference are Russian and English Conference Publications All submitted abstracts will be published in "Surveys of Applied and Industrial Mathematics" before the beginning of the conference, and in "Proceedings of The Fifth International Petrozavodsk Conference".

37. Discrete Math Applets discrete math Applets. http://www.cs.tau.ac.il/~nachumd/discrete.html

Discrete Math Applets Truth Table Generator by Peter Mannix Venn Diagram Plotter by Jason Shah

38. Discrete Math (Spring 2004) Textbooks, Introduction to discrete math, A. Avron, discrete mathematics, S. Dar and S. Gueron, discrete mathematics, N. Linial and M. Parnas, discrete math for http://www.cs.tau.ac.il/~odedr/teaching/discrete_math_spring_2004/

Computer Science Tel-Aviv University Discrete Mathematics Spring 2004 Announcements [May 30] The final exam is on Friday, 2004/6/18, 9:00. Good luck !! [May 15] The lecture on Monday, 2004/5/24 is cancelled. [May 3] The midterm exam and a sample solution are available below. [May 2] Midterm grades are now available here [Apr 19] Extra office hour this Wednesday, 2004/4/21, 16:00-17:00, Schreiber 220 (in case there are too many people, we'll move) [Apr 19] Solutions to homework 4 and 5 are now available below [Mar 13] We will have a midterm exam on Friday, 2004/4/23, 10:00 and an extra class on Friday, 2004/4/16, 10:00 [Feb 29] ניתן לקחת את ספר התרגילים של דר וגרון מאגודת הסטודנטים [Feb 27] The discussion board is now open; try it here Homeworks and Solutions Solution to homework 4 Homework 5 and solution Homework 6 and solution Homework 7 and solution Homework 8 and solution Homework 9 and solution Homework 10 and solution Exams Midterm and a sample solution Administrative Basics Lectures Sunday 12:00-14:00, Dan-David 001

39. Finite & Discrete Math Langara College Department of Mathematics and Statistics Internet Resources for the College Math Student. http://www.langara.bc.ca/mathstats/resource/onWeb/finite&discrete/

Langara College - Department of Mathematics and Statistics Internet Resources for the College Math Student Finite and Discrete Math Full Courses Individual Topic Items Logic, etc Classic Fallacies Appetizers and Lessons for Mathematics and Reason Sets MathsOnlineGallery (@uVienn.austria) - Sets Combinatorics Permutations and Combinations@langara Perms, Combs and BinomialThm@MathCentral.uregina Combinatorics (for K-8 Teachers)@illinoisStU Amazing Mathematical Object Factory ... ArithProps of BinCoeffs(byAGranville@uGeorgia) Probability Let's Make a Deal Applet Graph Theory IB Graphs and Trees Graph Theory Lessons@MathCove.uTennChatt Discrete Dynamical Systems Graphical Iteration Recurrence(1)@ies Recurrence(2)@ies Recursion(3)@ies ... The Game of Nim(@ArkansasStU) cryptography CRYPTOGRAPHY@uHawaii TOP OF FINITE MATH You might also check our 'raw list' (of links provided without comment) to see if there are any more examples there that we haven't yet included here. If you have come across any good web-based materials on linear algebra that are not included in the above indexes, please do

40. Triangle Discrete Math And Optimization Day Triangle discrete math and Optimization Day. Time March 22, 2004. Place Conference Room 1112, The Fuqua School of Business, Duke University Driving directions. http://www.or.unc.edu/~pataki/optday/

Triangle Discrete Math and Optimization Day Time: March 22, 2004 Place: Conference Room 11-12, The Fuqua School of Business, Duke University Driving directions Speakers This one-day meeting hopes to facilitate the communication between researchers and graduate students of discrete mathematics and optimization around the Research Triangle. We want to create a fairly informal atmosphere to talk about discrete mathematics. The term ``discrete mathematics'' is chosen to include at least the following topics: Algebraic and Enumerative Combinatorics, Discrete Geometry, Graph Theory, Coding and Design Theory, Combinatorial Aspects of Computational Algebra and Geometry, Combinatorial Optimization and Integer Programming, Probabilistic Combinatorics, Combinatorics in Mathematical Physics, etc. Registration Deadline: March 21. There is no registration fee. However, space (and food!) is limited, so if you plan to come, please register. Louis Billera Abstract Martin Groetschel Abstract ... J. Scott Provan

Page 2     21-40 of 116    Back | 1  | 2  | 3  | 4  | 5  | 6  | Next 20