Find link

language:

Find link is a tool written by Edward Betts.

Longer titles found: Discrete Mathematics (journal) (view), Graph (discrete mathematics) (view), SIAM Journal on Discrete Mathematics (view), Outline of discrete mathematics (view), Inversion (discrete mathematics) (view), Discrete Mathematics & Theoretical Computer Science (view), Discharging method (discrete mathematics) (view)

searching for Discrete mathematics 190 found (1612 total)

alternate case: discrete mathematics

Minimax (3,815 words) [view diff] no match in snippet view article find links to article

Minimax (sometimes Minmax, MM or saddle point) is a decision rule used in artificial intelligence, decision theory, combinatorial game theory, statistics

Cameron–Erdős conjecture (254 words) [view diff] case mismatch in snippet view article find links to article

Sapozhenko, Alexander A. (2008), "The Cameron-Erdős conjecture", Discrete Mathematics, 308 (19): 4361–4369, doi:10.1016/j.disc.2007.08.103, MR 2433862

Myhill–Nerode theorem (1,178 words) [view diff] no match in snippet view article find links to article

In the theory of formal languages, the Myhill–Nerode theorem provides a necessary and sufficient condition for a language to be regular. The theorem is

Gibbard–Satterthwaite theorem (2,646 words) [view diff] no match in snippet view article find links to article

The Gibbard–Satterthwaite theorem is a theorem in social choice theory. It was first conjectured by the philosopher Michael Dummett and the mathematician

Noisy-channel coding theorem (2,786 words) [view diff] no match in snippet view article find links to article

In information theory, the noisy-channel coding theorem (sometimes Shannon's theorem or Shannon's limit), establishes that for any given degree of noise

Alexander Schrijver (941 words) [view diff] exact match in snippet view article find links to article

is a Dutch mathematician and computer scientist, a professor of discrete mathematics and optimization at the University of Amsterdam and a fellow at the

Buchholz hydra (1,431 words) [view diff] no match in snippet view article find links to article

In mathematics, especially mathematical logic, graph theory and number theory, the Buchholz hydra game is a type of hydra game, which is a single-player

Fixed-point theorem (1,278 words) [view diff] no match in snippet view article find links to article

In mathematics, a fixed-point theorem is a result saying that a function F will have at least one fixed point (a point x for which F(x) = x), under some

Hales–Jewett theorem (1,760 words) [view diff] no match in snippet view article find links to article

In mathematics, the Hales–Jewett theorem is a fundamental combinatorial result of Ramsey theory named after Alfred W. Hales and Robert I. Jewett, concerning

Holland's schema theorem (852 words) [view diff] no match in snippet view article find links to article

Holland's schema theorem, also called the fundamental theorem of genetic algorithms, is an inequality that results from coarse-graining an equation for

Multiply perfect number (1,833 words) [view diff] case mismatch in snippet view article find links to article

"Bi-unitary multiperfect numbers, I" (PDF). Notes on Number Theory and Discrete Mathematics. 26 (1): 93–171. doi:10.7546/nntdm.2020.26.1.93-171. Haukkanen, Pentti;

Joel Spencer (369 words) [view diff] exact match in snippet view article find links to article

Industrial and Applied Mathematics in 2017, "for contributions to discrete mathematics and theory of computing, particularly random graphs and networks

Erdős–Szekeres theorem (1,179 words) [view diff] no match in snippet view article find links to article

In mathematics, the Erdős–Szekeres theorem asserts that, given r, s, any sequence of distinct real numbers with length at least (r − 1)(s − 1) + 1 contains

Star of David theorem (420 words) [view diff] no match in snippet view article find links to article

The Star of David theorem is a mathematical result on arithmetic properties of binomial coefficients. It was discovered by Henry W. Gould in 1972. The

Star height problem (1,353 words) [view diff] no match in snippet view article find links to article

The star height problem in formal language theory is the question whether all regular languages can be expressed using regular expressions of limited star

Parthasarathy's theorem (526 words) [view diff] no match in snippet view article find links to article

In mathematics – and in particular the study of games on the unit square – Parthasarathy's theorem is a generalization of Von Neumann's minimax theorem

Akra–Bazzi method (929 words) [view diff] no match in snippet view article find links to article

In computer science, the Akra–Bazzi method, or Akra–Bazzi theorem, is used to analyze the asymptotic behavior of the mathematical recurrences that appear

May's theorem (658 words) [view diff] no match in snippet view article find links to article

In social choice theory, May's theorem, also called the general possibility theorem, says that majority vote is the unique ranked social choice function

Analyst's traveling salesman theorem (931 words) [view diff] no match in snippet view article find links to article

The analyst's traveling salesman problem is an analog of the traveling salesman problem in combinatorial optimization. In its simplest and original form

Steven Skiena (719 words) [view diff] exact match in snippet view article find links to article

contributions to undergraduate education in the areas of algorithms and discrete mathematics and for influential textbook and software." Skiena has worked on

Folkman's theorem (780 words) [view diff] no match in snippet view article find links to article

Folkman's theorem is a theorem in mathematics, and more particularly in arithmetic combinatorics and Ramsey theory. According to this theorem, whenever

Curtis–Hedlund–Lyndon theorem (1,607 words) [view diff] no match in snippet view article find links to article

The Curtis–Hedlund–Lyndon theorem is a mathematical characterization of cellular automata in terms of their symbolic dynamics. It is named after Morton

Selected papers series of Knuth (234 words) [view diff] case mismatch in snippet view article find links to article

ISBN 1-57586-382-0. Donald Ervin Knuth (2003). Selected Papers on Discrete Mathematics. Stanford, California: Center for the Study of Language and Information

Erdős–Szemerédi theorem (2,727 words) [view diff] case mismatch in snippet view article find links to article

"The sum-product phenomenon in arbitrary rings", Contributions to Discrete Mathematics, 4 (2): 59–82, arXiv:0806.2497, Bibcode:2008arXiv0806.2497T, doi:10

Large set (Ramsey theory) (435 words) [view diff] no match in snippet view article

In Ramsey theory, a set S of natural numbers is considered to be a large set if and only if Van der Waerden's theorem can be generalized to assert the

Daniel Gorenstein (424 words) [view diff] case mismatch in snippet view article find links to article

rest of his life. He became the founding director of the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS) at Rutgers in 1989, and

Hausdorff Center for Mathematics (443 words) [view diff] case mismatch in snippet view article find links to article

Mathematics, Institute for Numerical Simulation, Research Institute for Discrete Mathematics), the Max Planck Institute for Mathematics (MPIM), and the Institute

Arithmeum (205 words) [view diff] case mismatch in snippet view article find links to article

Forschungsinstitut für Diskrete Mathematik (Research Institute for Discrete Mathematics) at the University of Bonn. It was founded in 2008 by the director

Mike Paterson (654 words) [view diff] case mismatch in snippet view article find links to article

British computer scientist, who was the director of the Centre for Discrete Mathematics and its Applications (DIMAP) at the University of Warwick until 2007

Advanced level mathematics (1,377 words) [view diff] case mismatch in snippet view article find links to article

schools could choose freely between taking Statistics, Mechanics or Discrete Mathematics (also known as Decision Mathematics) modules with the ability to

David P. Robbins (388 words) [view diff] exact match in snippet view article find links to article

three years to one or more researchers in algebra, combinatorics, or discrete mathematics. The first winner of the prize, in 2008, was Neil Sloane for the

Karl Svozil (198 words) [view diff] case mismatch in snippet view article find links to article

Vienna Technical University. External Researcher at the Centre for Discrete Mathematics and Theoretical Computer Science of the University of Auckland. Research

Vladimir Levenshtein (1,738 words) [view diff] exact match in snippet view article find links to article

26–42 V.I. Levenshtein, Elements of coding theory, In the book. Discrete mathematics and mathematical questions of cybernetics, Nauka, Moscow, 1974, 207–305

Information Processing Letters (520 words) [view diff] exact match in snippet view article find links to article

computational biology, coding theory, theoretical cryptography, and applied discrete mathematics. Generally, submissions in all areas of scientific inquiry are considered

Erdős–Anning theorem (1,406 words) [view diff] no match in snippet view article find links to article

The Erdős–Anning theorem states that, whenever an infinite number of points in the plane all have integer distances, the points lie on a straight line

Chomsky–Schützenberger representation theorem (562 words) [view diff] no match in snippet view article find links to article

In formal language theory, the Chomsky–Schützenberger representation theorem is a theorem derived by Noam Chomsky and Marcel-Paul Schützenberger in 1959

Australasian Journal of Combinatorics (200 words) [view diff] case mismatch in snippet view article find links to article

combinatorics. It was established in 1990 and is published by the Centre for Discrete Mathematics and Computing (University of Queensland) on behalf of the Combinatorial

Milliken's tree theorem (470 words) [view diff] no match in snippet view article find links to article

In mathematics, Milliken's tree theorem in combinatorics is a partition theorem generalizing Ramsey's theorem to infinite trees, objects with more structure

Károly Bezdek (1,731 words) [view diff] case mismatch in snippet view article find links to article

is a founding Editor-in-Chief of the e-journal Contributions to Discrete Mathematics (CDM). Károly Bezdek was born in Budapest, Hungary, but grew up in

Michael Dinneen (292 words) [view diff] case mismatch in snippet view article find links to article

of Auckland, New Zealand. He is deputy director of the Center for Discrete Mathematics and Theoretical Computer Science. He does research in combinatorial

Milliken–Taylor theorem (395 words) [view diff] no match in snippet view article find links to article

In mathematics, the Milliken–Taylor theorem in combinatorics is a generalization of both Ramsey's theorem and Hindman's theorem. It is named after Keith

Katalin Vesztergombi (395 words) [view diff] case mismatch in snippet view article find links to article

László Lovász and József Pelikán, she is the author of the textbook Discrete Mathematics: Elementary and Beyond.[DM] Vesztergombi is married to László Lovász

Arrow's impossibility theorem (6,513 words) [view diff] no match in snippet view article find links to article

Arrow's impossibility theorem is a key result in social choice theory showing that no ranked-choice procedure for group decision-making can satisfy the

Van der Waerden's theorem (3,690 words) [view diff] no match in snippet view article find links to article

Van der Waerden's theorem is a theorem in the branch of mathematics called Ramsey theory. Van der Waerden's theorem states that for any given positive

Laura Vargas Koch (365 words) [view diff] case mismatch in snippet view article find links to article

optimization as Bonn Junior Fellow in the Research Institute for Discrete Mathematics and Hausdorff Center for Mathematics at the University of Bonn. Vargas

Mikkel Thorup (564 words) [view diff] exact match in snippet view article find links to article

edge of the table. “The papers describe an impressive result in discrete mathematics; the problem is easily understood and the arguments, despite their

Chomsky–Schützenberger enumeration theorem (1,498 words) [view diff] no match in snippet view article find links to article

In formal language theory, the Chomsky–Schützenberger enumeration theorem is a theorem derived by Noam Chomsky and Marcel-Paul Schützenberger about the

E. Sampathkumar (339 words) [view diff] case mismatch in snippet view article find links to article

of Discrete Mathematics and Applications. Retrieved 5 February 2025. "The Academy of Discrete Mathematics and Applications". The Academy of Discrete Mathematics

List of things named after Pierre-Simon Laplace (486 words) [view diff] no match in snippet view article find links to article

This is a list of things named after Pierre-Simon Laplace de Moivre-Laplace theorem that approximates binomial distribution with a normal distribution

David P. Robbins Prize (573 words) [view diff] exact match in snippet view article find links to article

for papers reporting novel research in algebra, combinatorics, or discrete mathematics is awarded both by the American Mathematical Society (AMS) and by

Henry Cohn (674 words) [view diff] exact match in snippet view article find links to article

Fellow of the American Mathematical Society "for contributions to discrete mathematics, including applications to computer science and physics." In 2018

Kaplansky's game (192 words) [view diff] case mismatch in snippet view article find links to article

Beck, József (1982). "On a generalization of Kaplansky's game". Discrete Mathematics. 42 (1): 27–35. doi:10.1016/0012-365X(82)90050-4. Beck, József (2008)

Jeannette Janssen (443 words) [view diff] case mismatch in snippet view article find links to article

Mathematics and Statistics, and the chair of the Activity Group on Discrete Mathematics of the Society for Industrial and Applied Mathematics. Janssen earned

Martin Goldstern (511 words) [view diff] case mismatch in snippet view article find links to article

the TU Wien and head of the research unit 8 of the Institute of Discrete Mathematics and Geometry. His main research lies in set theory of the real line

Herbert Fleischner (542 words) [view diff] case mismatch in snippet view article find links to article

the Institute for Information Processing, then at the Institute of Discrete Mathematics. He worked at the ÖAW until the end of 2002, but took leaves to work

Gibbard's theorem (1,906 words) [view diff] no match in snippet view article find links to article

In the fields of mechanism design and social choice theory, Gibbard's theorem is a result proven by philosopher Allan Gibbard in 1973. It states that for

Jacob Fox (430 words) [view diff] case mismatch in snippet view article find links to article

Society for Industrial and Applied Mathematics Activity Group on Discrete Mathematics. He was an invited speaker at the International Congress of Mathematicians

Jeannette Janssen (443 words) [view diff] case mismatch in snippet view article find links to article

Mathematics and Statistics, and the chair of the Activity Group on Discrete Mathematics of the Society for Industrial and Applied Mathematics. Janssen earned

Gregory Gutin (251 words) [view diff] exact match in snippet view article find links to article

17 January 1957) is a scholar in theoretical computer science and discrete mathematics. He received his PhD in Mathematics in 1993 from Tel Aviv University

Vineet Bafna (358 words) [view diff] case mismatch in snippet view article find links to article

Pavel Pevzner, and was a post-doctoral researcher at Center for Discrete Mathematics and Theoretical Computer Science. From 1999 to 2002, he worked at

Derek Corneil (1,089 words) [view diff] case mismatch in snippet view article find links to article

several publications such as Ars Combinatoria and SIAM Monographs on Discrete Mathematics and Applications. He was inducted as a Fields Institute Fellow in

Nonomino (592 words) [view diff] case mismatch in snippet view article find links to article

Redelmeier, D. Hugh (1981). "Counting polyominoes: yet another attack". Discrete Mathematics. 36 (2): 191–203. doi:10.1016/0012-365X(81)90237-5. Weisstein, Eric

Alphabet (formal languages) (842 words) [view diff] case mismatch in snippet view article

Fletcher, Peter; Hoyle, Hughes; Patty, C. Wayne (1991). Foundations of Discrete Mathematics. PWS-Kent. p. 114. ISBN 0-53492-373-9. An alphabet is a nonempty

Biregular graph (408 words) [view diff] case mismatch in snippet view article find links to article

H. (1997), Fractional graph theory, Wiley-Interscience Series in Discrete Mathematics and Optimization, New York: John Wiley & Sons Inc., p. 137, ISBN 0-471-17864-0

Crossing Numbers of Graphs (469 words) [view diff] case mismatch in snippet view article find links to article

University, and published in 2018 by the CRC Press in their book series Discrete Mathematics and its Applications. The main text of the book has two parts, on

Terminal and nonterminal symbols (947 words) [view diff] exact match in snippet view article find links to article

Rosen, K. H. (2012). Discrete mathematics and its applications. McGraw-Hill. pages 847-851. Rosen, K. H. (2018). Discrete mathematics and its applications

Jiří Matoušek (mathematician) (904 words) [view diff] case mismatch in snippet view article

Scholia has a profile for Jiří Matoušek (Q472657). Invitation to Discrete Mathematics (with Jaroslav Nešetřil). Oxford University Press, 1998. ISBN 978-0-19-850207-4

Algorithmic Combinatorics on Partial Words (668 words) [view diff] case mismatch in snippet view article find links to article

Blanchet-Sadri, and published in 2007 by Chapman & Hall/CRC in their Discrete Mathematics and its Applications book series. A partial word is a string whose

Adjacent-vertex-distinguishing-total coloring (777 words) [view diff] case mismatch in snippet view article find links to article

"Concise proofs for adjacent vertex-distinguishing total colorings". Discrete Mathematics. 309 (8): 2548–2550. doi:10.1016/j.disc.2008.06.002. Chen, Xiang'en

Mihyun Kang (261 words) [view diff] case mismatch in snippet view article find links to article

properties of random graphs. She is a professor in the Institute of Discrete Mathematics at the Graz University of Technology. Kang completed a PhD at KAIST

Anne Penfold Street (956 words) [view diff] case mismatch in snippet view article find links to article

as professor in 1985. At Queensland, she directed the Centre for Discrete Mathematics and Computing from its formation in 1998 until 2004. She has also

S. L. Hakimi (587 words) [view diff] case mismatch in snippet view article find links to article

Havel–Hakimi theorem", How to Count: An Introduction to Combinatorics, Discrete Mathematics and Its Applications (2nd ed.), CRC Press, p. 159, ISBN 9781420082616

Anne Penfold Street (956 words) [view diff] case mismatch in snippet view article find links to article

as professor in 1985. At Queensland, she directed the Centre for Discrete Mathematics and Computing from its formation in 1998 until 2004. She has also

Ant on a rubber rope (2,537 words) [view diff] no match in snippet view article find links to article

The ant on a rubber rope is a mathematical puzzle with a solution that appears counterintuitive or paradoxical. It is sometimes given as a worm, or inchworm

Sarah-marie belcastro (1,133 words) [view diff] exact match in snippet view article find links to article

of Discrete Mathematics with Ducks: Ashbacher, Charles (August 2012). "Review". MAA Reviews. Székely, László A. "Belcastro, Sarah-Marie: Discrete mathematics

Martin Aigner (517 words) [view diff] exact match in snippet view article find links to article

in Enumeration, 2007, ISBN 3-540-39032-4 Aigner, Martin (2007). Discrete mathematics. Providence, R.I.: American Mathematical Society. ISBN 978-0-8218-4151-8

Yuri Zhuravlyov (mathematician) (1,356 words) [view diff] exact match in snippet view article

computer science was foundational for a number of specialties within discrete mathematics, pattern recognition, and predictive analysis. Zhuravlyov was a full

Recursion (3,669 words) [view diff] case mismatch in snippet view article find links to article

doi:10.3115/1073083.1073104. Hunter, David (2011). Essentials of Discrete Mathematics. Jones and Bartlett. p. 494. ISBN 9781449604424. Shaffer, Eric. "CS

Ludwig Staiger (445 words) [view diff] case mismatch in snippet view article find links to article

Cantor Association and an external researcher of the Center for Discrete Mathematics and Theoretical Computer Science at the University of Auckland, New

George J. Minty (1,102 words) [view diff] exact match in snippet view article find links to article

American mathematician, specializing in mathematical analysis and discrete mathematics. He is known for the Klee–Minty cube, the Browder–Minty theorem,

Ellingham–Horton graph (444 words) [view diff] case mismatch in snippet view article find links to article

MathWorld. Tutte, W. T. (1971), "On the 2-factors of bicubic graphs", Discrete Mathematics, 1 (2): 203–208, doi:10.1016/0012-365X(71)90027-6. Jessica Wolz,

Linear function (652 words) [view diff] case mismatch in snippet view article find links to article

Programming", in Leslie Hogben, ed., Handbook of Linear Algebra, Discrete Mathematics and Its Applications, Chapman and Hall/CRC, chap. 50. ISBN 1-584-88510-6

Lajos Pósa (mathematician) (1,269 words) [view diff] case mismatch in snippet view article

1975, 585-595. L. Pósa: Hamiltonian circuits in random graphs, Discrete Mathematics, 14 (1976), 359-364. Pósa Lajos: Véletlen gráfok Hamilton körei,

Vera Pless (810 words) [view diff] case mismatch in snippet view article find links to article

the Theory of Error-Correcting Codes. Wiley-Interscience Series in Discrete Mathematics. John Wiley & Sons. ISBN 0-471-08684-3. 2nd ed., 1989; 3rd ed., 1998

Fred S. Roberts (505 words) [view diff] case mismatch in snippet view article find links to article

center concept". In 2003, DIMACS held a Conference on Applications of Discrete Mathematics and Theoretical Computer Science, in honor of Roberts' 60th birthday

Eight queens puzzle (3,791 words) [view diff] case mismatch in snippet view article find links to article

M. (1997), "Domination and irredundance in the queens' graph", Discrete Mathematics, 163 (1–3): 47–66, doi:10.1016/0012-365X(95)00327-S, hdl:1828/2670

Affirming a disjunct (300 words) [view diff] case mismatch in snippet view article find links to article

edition. Pearson. ISBN 978-0321747471. Rosen, Kenneth H. (2019). Discrete Mathematics and its Applications: Kenneth H. Rosen. McGraw-Hill. ISBN 978-1260091991

Balanced hypergraph (1,293 words) [view diff] case mismatch in snippet view article find links to article

Lovász, László; Plummer, M. D. (1986), Matching Theory, Annals of Discrete Mathematics, vol. 29, North-Holland, ISBN 0-444-87916-1, MR 0859549 Conforti

Subset (1,734 words) [view diff] case mismatch in snippet view article find links to article

(2012). Discrete Mathematics and Its Applications (7th ed.). New York: McGraw-Hill. p. 119. ISBN 978-0-07-338309-5. Epp, Susanna S. (2011). Discrete Mathematics

Handshaking lemma (3,598 words) [view diff] case mismatch in snippet view article find links to article

201, ISBN 9780192880727 Biggs, Norman L. (2002), "15.3: Degree", Discrete Mathematics, Oxford University Press, pp. 181–182, ISBN 9780198507178 West, Douglas

Arborescence (graph theory) (782 words) [view diff] case mismatch in snippet view article

& Sons. pp. 94–95. ISBN 978-1-84821-070-7. Jean Gallier (2011). Discrete Mathematics. Springer Science & Business Media. pp. 193–194. ISBN 978-1-4419-8046-5

Michael Drmota (310 words) [view diff] case mismatch in snippet view article find links to article

habilitation in 1990 and is now full professor at the Institute of Discrete Mathematics and Geometry, where he also served as head of institute from 2004

Dénes Kőnig (796 words) [view diff] exact match in snippet view article find links to article

Mathematics Activity Group on Discrete Mathematics to an early career researcher for outstanding research in an area of discrete mathematics. The first award was

List of aperiodic sets of tiles (2,607 words) [view diff] case mismatch in snippet view article find links to article

ISBN 978-981-02-3792-9 Kari, Jarkko (1996), "A small aperiodic set of Wang tiles", Discrete Mathematics, 160 (1–3): 259–264, doi:10.1016/0012-365X(95)00120-L Lagae, Ares

Property B (1,120 words) [view diff] case mismatch in snippet view article find links to article

of Discrete Mathematics, vol. 29, North-Holland, ISBN 0-444-87916-1, MR 0859549 Beck, J. (1978), "On 3-chromatic hypergraphs", Discrete Mathematics, 24

Carathéodory's theorem (convex hull) (2,159 words) [view diff] case mismatch in snippet view article

Lovász, László; Plummer, M. D. (1986). Matching Theory. Annals of Discrete Mathematics. Vol. 29. North-Holland. ISBN 0-444-87916-1. MR 0859549. Danzer,

Catalan number (6,013 words) [view diff] case mismatch in snippet view article find links to article

"Catalan-like number sequences and Hausdorff moment sequences", Discrete Mathematics, 343 (5): 111808, 11, arXiv:1809.07523, doi:10.1016/j.disc.2019.111808

Yuri Matiyasevich (1,056 words) [view diff] case mismatch in snippet view article find links to article

Symbolic Logic; and also of the editorial boards for the journals Discrete Mathematics and Applications and Computer Instruments in Education. As a teacher

Computer program (13,091 words) [view diff] case mismatch in snippet view article find links to article

(1991). Discrete Mathematics and Its Applications. McGraw-Hill, Inc. p. 616. ISBN 978-0-07-053744-6. Rosen, Kenneth H. (1991). Discrete Mathematics and Its

Ruchir Puri (368 words) [view diff] case mismatch in snippet view article find links to article

University, NY and was awarded John Von-Neumann Chair at Institute of Discrete Mathematics at Bonn University, Germany. Ruchir received the 2014 Asian American

Wolfram (software) (1,749 words) [view diff] exact match in snippet view article

Mathematica is the basis of the Combinatorica package, which adds discrete mathematics functionality in combinatorics and graph theory to the program. Communication

Wolfram (software) (1,749 words) [view diff] exact match in snippet view article

Mathematica is the basis of the Combinatorica package, which adds discrete mathematics functionality in combinatorics and graph theory to the program. Communication

József Beck (606 words) [view diff] case mismatch in snippet view article find links to article

114, Cambridge University Press, 2008) Inevitable Randomness in Discrete Mathematics (University Lecture Series 49, American Mathematical Society, 2009)

Chiral polytope (628 words) [view diff] case mismatch in snippet view article find links to article

(eds.), Applied Geometry and Discrete Mathematics (The Victor Klee Festschrift), DIMACS Series in Discrete Mathematics and Theoretical Computer Science

Algorithms and Combinatorics (529 words) [view diff] case mismatch in snippet view article find links to article

Monique Laurent, 1997, vol. 15) Probabilistic Methods for Algorithmic Discrete Mathematics (M. Habib, C. McDiarmid, J. Ramirez-Alfonsin, and B. Reed, 1998,

Gabriel Andrew Dirac (468 words) [view diff] case mismatch in snippet view article find links to article

Archive, University of St Andrews Gabriel Andrew Dirac. Annals of Discrete Mathematics. Vol. 41. Elsevier. 1988. pp. 1–6. doi:10.1016/S0167-5060(08)70444-8

Rostislav Grigorchuk (1,995 words) [view diff] case mismatch in snippet view article find links to article

"Geometriae Dedicata", "Ukrainian Mathematical Journal", "Algebra and Discrete Mathematics", "Carpathian Mathematical Publications", "Bukovinian Mathematical

Jo Ellis-Monaghan (333 words) [view diff] case mismatch in snippet view article find links to article

positions at the University of Vermont. In 2020, she became professor of Discrete Mathematics at the University of Amsterdam. From 2010-2020, she served as a subject

369 (number) (112 words) [view diff] case mismatch in snippet view article

Redelmeier, D. Hugh (1981). "Counting polyominoes: yet another attack". Discrete Mathematics. 36 (2): 191–203. doi:10.1016/0012-365X(81)90237-5. Sequence A000105

Archimedean Upper Conservatory (528 words) [view diff] case mismatch in snippet view article find links to article

guide the students’ minds through the ideas of Algebra, Geometry, Discrete Mathematics, Logic, and Physics as a complement to the standard Elementary Algebra/

Radius (1,199 words) [view diff] case mismatch in snippet view article find links to article

Andrew M. Gleason (ed.). Advanced Mathematics: Precalculus with Discrete Mathematics and Data Analysis. Evanston, Illinois: McDougal Littell. ISBN 0-395-77114-5

Transylvania lottery (284 words) [view diff] exact match in snippet view article find links to article

Salvador (2008), "Algebraic topics on discrete mathematics", in Moore, Kenneth B. (ed.), Discrete mathematics research progress, Hauppauge, NY: Nova

Nathaniel Dean (mathematician) (1,046 words) [view diff] case mismatch in snippet view article

Joseph; Franzblau, Deborah; Roberts, Fred (1997). Discrete Mathematics in the Schools. Discrete Mathematics and Theoretical Computer Science. Vol. 36 (1 ed

Symmetric relation (385 words) [view diff] case mismatch in snippet view article find links to article

transitivity. The proof of xRy ⇒ yRy is similar. Biggs, Norman L. (2002). Discrete Mathematics. Oxford University Press. p. 57. ISBN 978-0-19-871369-2. "MAD3105

Sergei Chernikov (971 words) [view diff] case mismatch in snippet view article find links to article

Algebra and Discrete Mathematics. 13 (2): 169–208. Plotkin, Boris. "Sergei Nikolaevich Chernikov. Memoirs". Algebra and Discrete Mathematics. 14 (1): C–F

Rational number (3,397 words) [view diff] case mismatch in snippet view article find links to article

lowest term Niven's theorem Rational data type Rosen, Kenneth (2007). Discrete Mathematics and its Applications (6th ed.). New York, NY: McGraw-Hill. pp. 105

Béla Andrásfai (480 words) [view diff] case mismatch in snippet view article find links to article

Mathematical Sciences. Designer and subject lecturer of the course Discrete Mathematics. At the invitation of the Mathematical Institute of the Eötvös Loránd

Robbins' theorem (1,040 words) [view diff] case mismatch in snippet view article find links to article

V. K. (1996), "4.6 Strong Orientation of Graphs", Introductory Discrete Mathematics, Mineola, NY: Dover Publications Inc., p. 135, ISBN 978-0-486-69115-2

Tree (graph theory) (3,383 words) [view diff] case mismatch in snippet view article

Media. pp. 167–168. ISBN 978-1-4471-2499-3. Kenneth Rosen (2011). Discrete Mathematics and Its Applications, 7th edition. McGraw-Hill Science. p. 747.

Svante Janson (1,139 words) [view diff] case mismatch in snippet view article find links to article

Rucinski, Andrzej (2000). Random graphs. Wiley-Interscience Series in Discrete Mathematics and Optimization. New York: Wiley-Interscience. pp. xii+333. ISBN 0-471-17541-2

Martin Dyer (392 words) [view diff] case mismatch in snippet view article find links to article

problems In 1991, Professor Dyer received the Fulkerson Prize in Discrete Mathematics (Jointly with Alan Frieze and Ravi Kannan for the paper "A random

Laura Person (266 words) [view diff] case mismatch in snippet view article find links to article

co-author of the textbook Write Your Own Proofs In Set Theory and Discrete Mathematics (Zinka Press, 2005). The book's other co-author, Amy Babich, is a

Concrete Mathematics (470 words) [view diff] case mismatch in snippet view article find links to article

the topics in Concrete Mathematics are "a blend of CONtinuous and disCRETE mathematics". Calculus is frequently used in the explanations and exercises.

SGP (197 words) [view diff] exact match in snippet view article find links to article

model, for orbital calculations Social Golfer Problem, a problem in discrete mathematics Shay Gap Airport, IATA airport code "SGP" Schweizer SGP 1-1, an American

Vera Traub (360 words) [view diff] case mismatch in snippet view article find links to article

Steiner tree problem. She is a junior professor in the Institute for Discrete Mathematics at the University of Bonn. Traub earned a bachelor's degree at the

Peter C. Fishburn (484 words) [view diff] case mismatch in snippet view article find links to article

A Study of Partially Ordered Sets. Wiley-Interscience Series in Discrete Mathematics. New York: John Wiley & Sons. Fishburn, Peter C. (1988), Nonlinear

MU puzzle (1,487 words) [view diff] case mismatch in snippet view article find links to article

key idea behind Gödel's Incompleteness Theorem. In her textbook, Discrete Mathematics with Applications, Susanna S. Epp uses the MU puzzle to introduce

Steiner tree problem (4,424 words) [view diff] case mismatch in snippet view article find links to article

Jaroslav (2001), "Vojtěch Jarnik's work in combinatorial optimization", Discrete Mathematics, 235 (1–3): 1–17, doi:10.1016/S0012-365X(00)00256-9, hdl:10338.dmlcz/500662

Sartaj Sahni (1,185 words) [view diff] case mismatch in snippet view article find links to article

sum problem, among his many other research results. Concepts in Discrete Mathematics. Fridley, MN: Camelot Pub. Co. 1985. ISBN 978-0-942-45000-2. Fundamentals

Graham–Pollak theorem (1,447 words) [view diff] case mismatch in snippet view article find links to article

G. W. (1984), "A new proof of a theorem of Graham and Pollak", Discrete Mathematics, 49 (3): 327–328, doi:10.1016/0012-365X(84)90174-2, MR 0743808 Cioabă

109 (number) (401 words) [view diff] case mismatch in snippet view article

(January 2015). "Uniform edge-c-colorings of the Archimedean tilings". Discrete Mathematics. 338 (1): 19–22. doi:10.1016/j.disc.2014.08.015. Zbl 1308.52017.

Partially ordered set (5,418 words) [view diff] case mismatch in snippet view article find links to article

203: DISCRETE MATHEMATICS. Retrieved 23 July 2021. Kwong, Harris (25 April 2018). "7.4: Partial and Total Ordering". A Spiral Workbook for Discrete Mathematics

Addition principle (829 words) [view diff] case mismatch in snippet view article find links to article

University Press. p. 66. ISBN 978-962-209-181-8. Penner, R. C. (1999). Discrete Mathematics: Proof Techniques and Mathematical Structures. World Scientific.

Loupekine snark (481 words) [view diff] case mismatch in snippet view article find links to article

Campos, C. N. (2014), "Fulkerson's conjecture and Loupekine snarks", Discrete Mathematics, 326: 20–28, doi:10.1016/j.disc.2014.02.016, MR 3188983 Loupekine

Closure problem (1,622 words) [view diff] case mismatch in snippet view article find links to article

closure in a digraph", Combinatorial Optimization, Wiley Series in Discrete Mathematics and Optimization, vol. 33, John Wiley & Sons, pp. 49–50, ISBN 9781118031391

Empirical algorithmics (1,220 words) [view diff] case mismatch in snippet view article find links to article

Algorithmics. DIMACS Series in Discrete Mathematics and Theoretical Computer Science. Vol. 59. DIMACS Series in Discrete Mathematics and Theoretical Computer

Modular arithmetic (3,646 words) [view diff] case mismatch in snippet view article find links to article

from the original on 2021-04-19. Retrieved 2020-08-12. Sengadir T., Discrete Mathematics and Combinatorics, p. 293, at Google Books "Euler's sum of powers

Converse relation (1,725 words) [view diff] case mismatch in snippet view article find links to article

Gunther Schmidt; Thomas Ströhlein (1993). Relations and Graphs: Discrete Mathematics for Computer Scientists. Springer Berlin Heidelberg. pp. 9–10.

Ahlswede–Khachatrian theorem (2,051 words) [view diff] no match in snippet view article find links to article

In extremal set theory, the Ahlswede–Khachatrian theorem generalizes the Erdős–Ko–Rado theorem to t-intersecting families. Given parameters n, k and t

Semiorder (2,281 words) [view diff] case mismatch in snippet view article find links to article

Falmagne, Jean-Claude (1997), "Well-graded families of relations", Discrete Mathematics, 173 (1–3): 35–44, doi:10.1016/S0012-365X(96)00095-7, MR 1468838

Z notation (930 words) [view diff] case mismatch in snippet view article find links to article

Press. ISBN 0-521-55976-6. Ince, D. C. (1993). An Introduction to Discrete Mathematics, Formal System Specification, and Z. Oxford University Press. doi:10

Z notation (930 words) [view diff] case mismatch in snippet view article find links to article

Press. ISBN 0-521-55976-6. Ince, D. C. (1993). An Introduction to Discrete Mathematics, Formal System Specification, and Z. Oxford University Press. doi:10

2-factor theorem (504 words) [view diff] case mismatch in snippet view article find links to article

Mulder, H. (1992), "Julius Petersen's theory of regular graphs", Discrete Mathematics, 100 (1–3): 157–175, doi:10.1016/0012-365X(92)90639-W. Lützen, J

Baruch Schieber (835 words) [view diff] case mismatch in snippet view article find links to article

2003. He was also a member of the executive board at the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS) until 2018, and continues

Disjoint sets (1,290 words) [view diff] case mismatch in snippet view article find links to article

1137/0216062, MR 0917035, S2CID 33265037. Ferland, Kevin (2008), Discrete Mathematics: An Introduction to Proofs and Combinatorics, Cengage Learning, p

(a, b)-decomposition (810 words) [view diff] case mismatch in snippet view article

(2009). "Planar graphs decomposable into a forest and a matching". Discrete Mathematics. 309 (1): 277–279. doi:10.1016/j.disc.2007.12.104. Bassa, A.; Burns

Circular-arc graph (866 words) [view diff] case mismatch in snippet view article find links to article

polynomials, chromatic quasisymmetric functions and graphs with cycles". Discrete Mathematics. 341 (12): 3453–3482. arXiv:1705.10353. doi:10.1016/j.disc.2018.09

Domino (mathematics) (370 words) [view diff] case mismatch in snippet view article

Redelmeier, D. Hugh (1981). "Counting polyominoes: yet another attack". Discrete Mathematics. 36 (2): 191–203. doi:10.1016/0012-365X(81)90237-5. Berger, Robert

Rudolf Ahlswede (441 words) [view diff] case mismatch in snippet view article find links to article

Leenstra, and R.E. Tarjan (Eds.), Wiley-Interscience Series in Discrete Mathematics and Optimization, 1987. I. Althöfer, N. Cai, G. Dueck, L. Khachatrian

Mehdi Behzad (1,189 words) [view diff] case mismatch in snippet view article find links to article

Iranian universities. Coauthor of a text book, entitled Pre-University Discrete Mathematics (Persian: رياضيات كسسته بيش دانشكاهى), currently taught in Iranian

Debra Boutin (745 words) [view diff] case mismatch in snippet view article find links to article

and Applied Mathematics; she was elected Secretary of the latter's Discrete Mathematics Activity Group. In 2008 Boutin was the inaugural recipient of the

Valentin Goranko (471 words) [view diff] case mismatch in snippet view article find links to article

editorial boards of several other scientific journals. 2015 Logic and Discrete Mathematics: A Concise Introduction 2016 Temporal Logics in Computer Science

V. J. Havel (121 words) [view diff] case mismatch in snippet view article find links to article

Havel–Hakimi theorem", How to Count: An Introduction to Combinatorics, Discrete Mathematics and Its Applications (2nd ed.), CRC Press, p. 159, ISBN 9781420082616

Octomino (622 words) [view diff] case mismatch in snippet view article find links to article

Redelmeier, D. Hugh (1981). "Counting polyominoes: yet another attack". Discrete Mathematics. 36 (2): 191–203. doi:10.1016/0012-365X(81)90237-5. Rhoads, Glenn

Box-making game (589 words) [view diff] case mismatch in snippet view article find links to article

Chvátal, V.; Erdös, P. (1978). "Biased Positional Games". Annals of Discrete Mathematics. 2 (C): 221–229. doi:10.1016/S0167-5060(08)70335-2. ISSN 0167-5060

Small stellated dodecahedron (935 words) [view diff] case mismatch in snippet view article find links to article

Grünbaum, Branko (2007). "Graphs of polyhedra; polyhedra as graphs". Discrete Mathematics. 307 (3–5): 445–463. doi:10.1016/j.disc.2005.09.037. Wenninger, Magnus

Decomino (389 words) [view diff] case mismatch in snippet view article find links to article

Redelmeier, D. Hugh (1981). "Counting polyominoes: yet another attack". Discrete Mathematics. 36 (2): 191–203. doi:10.1016/0012-365X(81)90237-5. Iread.it: Maximal

Kaisa Nyberg (325 words) [view diff] case mismatch in snippet view article find links to article

2006), "On some probabilistic approximations for AES-like s-boxes", Discrete Mathematics, 306 (16): 2016–2020, doi:10.1016/j.disc.2006.03.055 Shimoyama, Takeshi;

Reinhard Diestel (402 words) [view diff] exact match in snippet view article find links to article

tree decomposition, and infinite graphs. He holds the chair of discrete mathematics at the University of Hamburg. Diestel has a Ph.D. from the University

Electronic Journal of Combinatorics (474 words) [view diff] exact match in snippet view article find links to article

The Electronic Journal of Combinatorics Discipline Discrete mathematics Language English Publication details Open access Free to authors and readers Standard

Binary tree (5,097 words) [view diff] case mismatch in snippet view article find links to article

the tree Unrooted binary tree Rowan Garnier; John Taylor (2009). Discrete Mathematics:Proofs, Structures and Applications, Third Edition. CRC Press. p

Kleene star (884 words) [view diff] case mismatch in snippet view article find links to article

Fletcher, Peter; Hoyle, Hughes; Patty, C. Wayne (1991). Foundations of Discrete Mathematics. Brooks/Cole. p. 656. ISBN 0534923739. The Kleene closure L* of L

Pappus configuration (580 words) [view diff] case mismatch in snippet view article find links to article

J.; Mathon, R. A. (eds.), Combinatorial Design Theory, Annals of Discrete Mathematics, vol. 34, Elsevier, pp. 371–378, doi:10.1016/S0304-0208(08)72903-7

Rigidity matroid (2,242 words) [view diff] case mismatch in snippet view article find links to article

generic global rigidity", Applied Geometry and Discrete Mathematics, DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 4, Providence

Complete bipartite graph (960 words) [view diff] case mismatch in snippet view article find links to article

; Toft, Bjarne (2011), Graph Coloring Problems, Wiley Series in Discrete Mathematics and Optimization, vol. 39, Wiley, p. 16, ISBN 9781118030745. Bandelt

Floyd–Warshall algorithm (3,017 words) [view diff] case mismatch in snippet view article find links to article

problems in directed graphs", pp. 570–576. Kenneth H. Rosen (2003). Discrete Mathematics and Its Applications, 5th Edition. Addison Wesley. ISBN 978-0-07-119881-3

Binary tree (5,097 words) [view diff] case mismatch in snippet view article find links to article

the tree Unrooted binary tree Rowan Garnier; John Taylor (2009). Discrete Mathematics:Proofs, Structures and Applications, Third Edition. CRC Press. p

List of Greek mathematicians (1,086 words) [view diff] case mismatch in snippet view article find links to article

Peter Gritzmann; Bernd Sturmfels; Victor Klee. Applied Geometry and Discrete Mathematics: The Victor Klee Festschrift. American Mathematical Soc. p. 415.

Gary Chartrand (470 words) [view diff] case mismatch in snippet view article find links to article

Digraphs, 5th edition, CRC Press MR2766107. 2010: (with Ping Zhang) Discrete Mathematics, Waveland Press. 2012: (with Albert D. Polimeni & Ping Zhang) Mathematical

Collaboration graph (1,056 words) [view diff] exact match in snippet view article find links to article

the notion of a "rational Erdős number". Graph theory – Area of discrete mathematics Odda, Tom (1979). "On properties of a well-known graph or what is

Henri Cohen (number theorist) (240 words) [view diff] case mismatch in snippet view article

(2006). Handbook of Elliptic and Hyperelliptic Curve Cryptography. Discrete Mathematics and Its Applications. Chapman & Hall/CRC. ISBN 978-1-58488-518-4

Éric Brier (435 words) [view diff] case mismatch in snippet view article find links to article

Engineer (Physics, Mathematics) 1992—1995 Aix-Marseille University DEA (Discrete Mathematics) 2001—2002 ENSTA Paris Engineer (Physics, Computer Science) 1995—1997

Digital physics (536 words) [view diff] case mismatch in snippet view article find links to article

polytopes of periodic graphs and a no-go theorem for digital physics". Discrete Mathematics. 313 (12): 1289–1301. arXiv:1109.1963. doi:10.1016/j.disc.2013.02

Matroid representation (1,784 words) [view diff] case mismatch in snippet view article find links to article

"Infinite antichains of matroids with characteristic set {p}", Discrete Mathematics, 242 (1–3): 175–185, doi:10.1016/S0012-365X(00)00466-0, hdl:10092/13245

Wheel graph (589 words) [view diff] case mismatch in snippet view article find links to article

Weisstein, Eric W. "Wheel Graph". MathWorld. Rosen, Kenneth H. (2011). Discrete Mathematics and Its Applications (7th ed.). McGraw-Hill. p. 655. ISBN 978-0073383095

Tim Denvir (596 words) [view diff] case mismatch in snippet view article find links to article

with W. T. Harwood, M. I. Jackson and M. J. Wray Introduction to Discrete Mathematics for Software Engineering (Macmillan, Computer Science Series, 1986

Characteristic (algebra) (1,297 words) [view diff] case mismatch in snippet view article

doi:10.1007/978-3-642-61698-3. ISBN 978-3-540-00706-7. The Wikibook Discrete Mathematics has a page on the topic of: Finite fields McCoy, Neal H. (1973) [1964]

Vojtěch Rödl (395 words) [view diff] case mismatch in snippet view article find links to article

A.; Erdős, Paul; Rödl, Vojtĕch (1992). "Cycle-connected graphs". Discrete Mathematics. 108 (1–3). Elsevier BV: 261–278. doi:10.1016/0012-365x(92)90680-e

Telman Malikov (391 words) [view diff] case mismatch in snippet view article find links to article

physical-mathematics sciences. In 2005, he defended his thesis on a "Discrete Mathematics and Mathematical Cybernetics", on the topic of "Necessary conditions

Donald Knuth (6,284 words) [view diff] case mismatch in snippet view article find links to article

, ISBN 1-57586-382-0 (paperback) ——— (2003). Selected Papers on Discrete Mathematics. Lecture Notes. Stanford, CA: Center for the Study of Language and

Heptomino (669 words) [view diff] case mismatch in snippet view article find links to article

Redelmeier, D. Hugh (1981). "Counting polyominoes: yet another attack". Discrete Mathematics. 36 (2): 191–203. doi:10.1016/0012-365X(81)90237-5. Rhoads, Glenn

Graph enumeration (554 words) [view diff] case mismatch in snippet view article find links to article

Frank; Schwenk, Allen J. (1973), "The number of caterpillars" (PDF), Discrete Mathematics, 6 (4): 359–365, doi:10.1016/0012-365x(73)90067-8, hdl:2027.42/33977

Davenport–Schinzel sequence (1,677 words) [view diff] case mismatch in snippet view article find links to article

Davenport–Schinzel sequences", Contemporary Trends in Discrete Mathematics, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 49, American

Dan Romik (750 words) [view diff] exact match in snippet view article find links to article

Davis. He is known for contributions to probability theory and discrete mathematics. Romik received his Ph.D. from Tel Aviv University in 2002 under

List of mathematics awards (162 words) [view diff] exact match in snippet view article find links to article

Association of America Novel research in algebra, combinatorics, or discrete mathematics United States Deborah and Franklin Haimo Awards Mathematical Association

De Bruijn torus (823 words) [view diff] case mismatch in snippet view article find links to article

Graham, R. (1992). "Universal cycles for combinatorial structures". Discrete Mathematics. 110 (1): 43–59. doi:10.1016/0012-365x(92)90699-g. Jackson, Brad;

Hexomino (779 words) [view diff] case mismatch in snippet view article find links to article

Redelmeier, D. Hugh (1981). "Counting polyominoes: yet another attack". Discrete Mathematics. 36 (2): 191–203. doi:10.1016/0012-365X(81)90237-5. Rhoads, Glenn

Computational group theory (293 words) [view diff] case mismatch in snippet view article find links to article

Eick, Eamonn A. O'Brien, "Handbook of computational group theory", Discrete Mathematics and its Applications (Boca Raton). Chapman & Hall/CRC, Boca Raton

Square lattice (552 words) [view diff] case mismatch in snippet view article find links to article

Joseph (eds.), Handbook of Discrete and Computational Geometry, Discrete Mathematics and Its Applications (2nd ed.), CRC Press, pp. 53–72, ISBN 9781420035315

Antisymmetric relation (589 words) [view diff] case mismatch in snippet view article find links to article

Lipschutz, Seymour; Marc Lars Lipson (1997). Theory and Problems of Discrete Mathematics. McGraw-Hill. p. 33. ISBN 0-07-038045-7. nLab antisymmetric relation