language:
Find link is a tool written by Edward Betts.Longer titles found: Combinatorics, Probability and Computing (view), Combinatorics: The Rota Way (view), Combinatorics and dynamical systems (view), Combinatorics and physics (view), Combinatorics of Experimental Design (view), Combinatorics of Finite Geometries (view), Combinatorics on words (view), Electronic Journal of Combinatorics (view), European Journal of Combinatorics (view), Outline of combinatorics (view), Enumerative combinatorics (view), Algebraic combinatorics (view), History of combinatorics (view), Institute of Combinatorics and its Applications (view), Arithmetic combinatorics (view), Polyhedral combinatorics (view), Infinitary combinatorics (view), Graphs and Combinatorics (view), Topological combinatorics (view), Symbolic method (combinatorics) (view), Necklace (combinatorics) (view), Extremal combinatorics (view), Composition (combinatorics) (view), Stars and bars (combinatorics) (view), Journal of Algebraic Combinatorics (view), Large set (combinatorics) (view), Transversal (combinatorics) (view), European Prize in Combinatorics (view), Additive combinatorics (view), Journal of Automata, Languages and Combinatorics (view), Geometric combinatorics (view), Australasian Journal of Combinatorics (view), Analytic Combinatorics (book) (view), Kneser's theorem (combinatorics) (view), Algebraic Combinatorics (journal) (view), Index of combinatorics articles (view), Algorithms and Combinatorics (view), Rule of division (combinatorics) (view), Stirling numbers and exponential generating functions in symbolic combinatorics (view)
searching for combinatorics 47 found (2989 total)
alternate case: Combinatorics
Squaring the square
(1,680 words)
[view diff]
no match in snippet
view article
find links to article
Squaring the square is the problem of tiling an integral square using only other integral squares. (An integral square is a square whose sides have integerGeometric transformation (1,073 words) [view diff] no match in snippet view article find links to article
In mathematics, a geometric transformation is any bijection of a set to itself (or to another such set) with some salient geometrical underpinning, suchGeorge Pólya Prize (314 words) [view diff] exact match in snippet view article find links to article
Exposition, established in 2013; the George Pólya Prize in Applied Combinatorics, established in 1969, and first awarded in 1971; and the George PólyaAlternating sign matrix (917 words) [view diff] exact match in snippet view article find links to article
"Proof of the alternating sign matrix conjecture", Electronic Journal of Combinatorics 3 (1996), R13. Kuperberg, Greg, "Another proof of the alternating signMathematical Sciences Publishers (189 words) [view diff] exact match in snippet view article find links to article
Geometry Mathematics and Mechanics of Complex Systems Moscow Journal of Combinatorics and Number Theory Pacific Journal of Mathematics Probability and MathematicalTransformation (function) (340 words) [view diff] no match in snippet view article
In mathematics, a transformation, transform, or self-map is a function f, usually with some geometrical underpinning, that maps a set X to itself, i.eAnnales Henri Poincaré (315 words) [view diff] exact match in snippet view article find links to article
Analyse Non Linéaire (1983–) ISSN 0294-1449 Annales de l'Institut Henri Poincaré D: Combinatorics, Physics and their Interactions (2014–) ISSN 2308-5827Three-letter acronym (981 words) [view diff] no match in snippet view article find links to article
A three-letter acronym (TLA), or three-letter abbreviation is, as the phrase suggests, an abbreviation consisting of three letters. The term has a specialK-vertex-connected graph (772 words) [view diff] exact match in snippet view article find links to article
algorithm design manual, p 506, and Computational discrete mathematics: combinatorics and graph theory with Mathematica, p. 290-291 Diestel (2016), p.84 DiestelDedekind number (2,046 words) [view diff] exact match in snippet view article find links to article
Sauer, N. W.; Woodrow, R. E.; Sands, B. (eds.), Finite and Infinite Combinatorics in Sets and Logic (Proc. NATO Advanced Study Inst., Banff, Alberta,Octagonal number (366 words) [view diff] no match in snippet view article find links to article
In mathematics, an octagonal number is a figurate number. The nth octagonal number on is the number of dots in a pattern of dots consisting of the outlinesRobert Sedgewick (computer scientist) (1,550 words) [view diff] exact match in snippet view article
research expertise is in algorithm science, data structures, and analytic combinatorics. He is also active in developing college curriculums in computer scienceVertex enumeration problem (379 words) [view diff] no match in snippet view article find links to article
In mathematics, the vertex enumeration problem for a polytope, a polyhedral cell complex, a hyperplane arrangement, or some other object of discrete geometryCombinatorial group theory (221 words) [view diff] exact match in snippet view article find links to article
subsumes combinatorial group theory, using techniques from outside combinatorics besides. It also comprises a number of algorithmically insoluble problemsMagma (algebra) (1,825 words) [view diff] no match in snippet view article
In abstract algebra, a magma, binar, or, rarely, groupoid is a basic kind of algebraic structure. Specifically, a magma consists of a set equipped withFinitely generated group (977 words) [view diff] no match in snippet view article find links to article
In algebra, a finitely generated group is a group G that has some finite generating set S so that every element of G can be written as the combinationCircle packing (1,315 words) [view diff] exact match in snippet view article find links to article
generally known as "circle packing" is concerned with the geometry and combinatorics of packings of arbitrarily-sized circles: these give rise to discreteDehn–Sommerville equations (780 words) [view diff] exact match in snippet view article find links to article
simplicial polytope and this has become the standard formulation in recent combinatorics literature. By duality, analogous equations hold for simple polytopesPhilippe Flajolet (553 words) [view diff] exact match in snippet view article find links to article
theory of average-case complexity. He introduced the theory of analytic combinatorics. With Robert Sedgewick of Princeton University, he wrote the first book-lengthEight queens puzzle (3,793 words) [view diff] no match in snippet view article find links to article
The eight queens puzzle is the problem of placing eight chess queens on an 8×8 chessboard so that no two queens threaten each other; thus, a solution requiresList of permutation topics (282 words) [view diff] no match in snippet view article find links to article
This is a list of topics on mathematical permutations. Alternating permutation Circular shift Cyclic permutation Derangement Even and odd permutations—seeReye configuration (956 words) [view diff] no match in snippet view article find links to article
In geometry, the Reye configuration, introduced by Theodor Reye (1882), is a configuration of 12 points and 16 lines. Each point of the configuration belongsErdős–Rado theorem (289 words) [view diff] no match in snippet view article find links to article
In partition calculus, part of combinatorial set theory, a branch of mathematics, the Erdős–Rado theorem is a basic result extending Ramsey's theorem toMathematical visualization (764 words) [view diff] no match in snippet view article find links to article
Mathematical phenomena can be understood and explored via visualization. Classically, this consisted of two-dimensional drawings or building three-dimensionalComplex analysis (2,538 words) [view diff] exact match in snippet view article find links to article
mathematics, including algebraic geometry, number theory, analytic combinatorics, and applied mathematics, as well as in physics, including the branchesHall–Littlewood polynomials (522 words) [view diff] no match in snippet view article find links to article
In mathematics, the Hall–Littlewood polynomials are symmetric functions depending on a parameter t and a partition λ. They are Schur functions when t isTelephone number (mathematics) (2,039 words) [view diff] exact match in snippet view article
(2015), "Gelfand models for diagram algebras", Journal of Algebraic Combinatorics, 41 (2): 229–255, arXiv:1302.6150, doi:10.1007/s10801-014-0534-5, MR 3306071Order (mathematics) (499 words) [view diff] exact match in snippet view article
permutation Ordered selections and partitions of the twelvefold way in combinatorics Ordered set, a bijection, cyclic order, or permutation Weak order ofMarie-France Sagot (349 words) [view diff] exact match in snippet view article find links to article
interests concern computational biology, algorithm analysis and design, and combinatorics. Marie-France Sagot publications indexed by Google Scholar Marie-FranceAhmad ibn Munim al-Abdari (141 words) [view diff] exact match in snippet view article find links to article
28-8-2010) Djebbar, Ahmed (2013), "Islamic combinatorics", in Wilson, Robin; Watkins, John J. (eds.), Combinatorics: Ancient & Modern, Oxford University PressAhmad ibn Munim al-Abdari (141 words) [view diff] exact match in snippet view article find links to article
28-8-2010) Djebbar, Ahmed (2013), "Islamic combinatorics", in Wilson, Robin; Watkins, John J. (eds.), Combinatorics: Ancient & Modern, Oxford University PressBirkhoff polytope (1,007 words) [view diff] exact match in snippet view article find links to article
Pak, Igor (2000), "Four questions on Birkhoff polytope", Annals of Combinatorics, 4: 83–90, doi:10.1007/PL00001277, S2CID 1250478. De Loera, Jesus ASet (card game) (1,704 words) [view diff] exact match in snippet view article
Pellegrino's 20-Caps in S4, 3", North-Holland Mathematics Studies, Combinatorics '81 in honour of Beniamino Segre, vol. 78, North-Holland, pp. 433–447Noncrossing partition (762 words) [view diff] no match in snippet view article find links to article
In combinatorial mathematics, the topic of noncrossing partitions has assumed some importance because of (among other things) its application to the theoryTree (graph theory) (3,385 words) [view diff] exact match in snippet view article
Dasgupta (1999). See Kim & Pearl (1983). Stanley Gill Williamson (1985). Combinatorics for Computer Science. Courier Dover Publications. p. 288. ISBN 978-0-486-42076-9Hereditary property (1,698 words) [view diff] exact match in snippet view article find links to article
said to be "hereditarily P". Hereditary properties occur throughout combinatorics and graph theory, although they are known by a variety of names. ForRobinson–Schensted–Knuth correspondence (2,102 words) [view diff] exact match in snippet view article find links to article
\mathrm {column} (A)=\nu } . Stanley, Richard P. (1999). Enumerative Combinatorics. Vol. 2. New York: Cambridge University Press. pp. 316–380. ISBN 0-521-55309-1Alexander Schrijver (941 words) [view diff] exact match in snippet view article find links to article
the highest scientific award in the Netherlands, for his research in combinatorics and algorithms. Later in the same year he became a Knight of the OrderFinite ring (1,500 words) [view diff] no match in snippet view article find links to article
In mathematics, more specifically abstract algebra, a finite ring is a ring that has a finite number of elements. Every finite field is an example of aBuilding (mathematics) (3,216 words) [view diff] no match in snippet view article
In mathematics, a building (also Tits building, named after Jacques Tits) is a combinatorial and geometric structure which simultaneously generalizes certainRon Rivest (1,543 words) [view diff] exact match in snippet view article find links to article
computer scientist whose work has spanned the fields of algorithms and combinatorics, cryptography, machine learning, and election integrity. He is an InstituteRandomized algorithm (4,248 words) [view diff] no match in snippet view article find links to article
A randomized algorithm is an algorithm that employs a degree of randomness as part of its logic or procedure. The algorithm typically uses uniformly randomList of lemmas (525 words) [view diff] no match in snippet view article find links to article
This following is a list of lemmas (or, "lemmata", i.e. minor theorems, or sometimes intermediate technical results factored out of proofs). See also listMacdonald polynomials (3,160 words) [view diff] exact match in snippet view article find links to article
the n! conjecture. It is still a central open problem in algebraic combinatorics to find a combinatorial formula for the qt-Kostka coefficients. TheDixon's identity (743 words) [view diff] no match in snippet view article find links to article
In mathematics, Dixon's identity (or Dixon's theorem or Dixon's formula) is any of several different but closely related identities proved by A. C. DixonPartially ordered set (5,351 words) [view diff] exact match in snippet view article find links to article
Connections from Combinatorics to Topology. Birkhäuser. ISBN 978-3-319-29788-0. Stanley, Richard P. (1997). Enumerative Combinatorics 1. Cambridge StudiesFence (mathematics) (691 words) [view diff] exact match in snippet view article
Combinatoria, 87: 105–117, MR 2414008. Stanley, Richard P. (1986), Enumerative Combinatorics, Wadsworth, Inc. Exercise 3.23a, page 157. Valdes, Jacobo; Tarjan, Robert