Faster access than browser!
171 relations: Abraham ibn Ezra, Abstract algebra, Additive number theory, Algebra, Algebraic combinatorics, Algebraic topology, Analysis, Analysis of algorithms, Analytic number theory, Ancient Greece, Ancient history, Archimedes, Associahedron, Astronomer, Asymptotic analysis, Automata theory, Bijective proof, Binomial coefficient, Birkhoff polytope, Blaise Pascal, Block design, Boolean algebra (structure), Cambridge University Press, Campanology, Catalan number, Cauchy's theorem (geometry), Cayley graph, Chomsky hierarchy, Chromatic polynomial, Chrysippus, Classification of finite simple groups, Coding theory, Combination, Combinatorial biology, Combinatorial chemistry, Combinatorial data analysis, Combinatorial design, Combinatorial game theory, Combinatorial group theory, Combinatorial optimization, Combinatorial topology, Combinatorics and dynamical systems, Combinatorics and physics, Complete bipartite graph, Complex analysis, Computational complexity theory, Computational geometry, Computer science, Convex geometry, Convex polytope, ..., Countable set, Culture of Europe, Decision tree, Discrete geometry, Discrete mathematics, Discrete Morse theory, Dynamical system, Encyclopædia Britannica Eleventh Edition, England in the Middle Ages, Enumerative combinatorics, Ergodic theory, Error correction code, Eventually (mathematics), Evolutionary biology, Fair division, Family of sets, Fibonacci number, Finite set, Formal grammar, Formal language, Four color theorem, Fractal analysis, Functional analysis, Generating function, Geometric probability, Geometry, Gersonides, Gian-Carlo Rota, Graph coloring, Graph dynamical system, Graph theory, Group theory, H. J. Ryser, Hamiltonian path, Harmonic analysis, Hassler Whitney, Hipparchus, Historian, Inclusion map, India, Information theory, Intersection (set theory), Isaac Newton, Ising model, Jacob Bernoulli, James Joseph Sylvester, Kirkman's schoolgirl problem, Kissing number problem, Lattice (order), Lattice graph, Leon Mirsky, Leonhard Euler, Linear independence, Linguistics, Logic, Mahāvīra (mathematician), Markov chain, Markov chain mixing time, Mathematical logic, Mathematical problem, Mathematical structure, Mathematician, Mathematics, MathWorld, Metric space, Middle Ages, Necklace problem, Number theory, Operations research, Orthogonal polynomials, Ostomachion, Outline of combinatorics, Partially ordered set, Partition (number theory), Partition of a set, Pascal's triangle, Paul Erdős, Percy Alexander MacMahon, Permutation, Permutohedron, Philosopher, Phylogenetics, Physician, Pigeonhole principle, Plutarch, Polyhedral combinatorics, Potts model, Power set, Probabilistic method, Probabilistic number theory, Probability, Probability theory, Pure mathematics, Q-Pochhammer symbol, Ramsey theory, Random graph, Real projective space, Renaissance, Representation theory, Richard P. Stanley, Schröder–Hipparchus number, Science, Set theory, Special functions, Statistical mechanics, Statistical physics, Steiner system, Sushruta, Sushruta Samhita, Symbolic method (combinatorics), Talmud, Theoretical computer science, Tiling puzzle, Timeline of Indian history, Topology, Triangle-free graph, Tutte polynomial, Twelvefold way, Two-dimensional space, Vector space, Vertex (graph theory). Expand index (121 more) »
Abraham ibn Ezra
Abraham ben Meir Ibn Ezra (אַבְרָהָם אִבְּן עֶזְרָא or ראב"ע; ابن عزرا; also known as Abenezra or Aben Ezra, 1089–c.1167) was one of the most distinguished Jewish biblical commentators and philosophers of the Middle Ages.
New!!: Combinatorics and Abraham ibn Ezra · See more »
Abstract algebra
In algebra, which is a broad division of mathematics, abstract algebra (occasionally called modern algebra) is the study of algebraic structures.
New!!: Combinatorics and Abstract algebra · See more »
Additive number theory
In number theory, the specialty additive number theory studies subsets of integers and their behavior under addition.
New!!: Combinatorics and Additive number theory · See more »
Algebra
Algebra (from Arabic "al-jabr", literally meaning "reunion of broken parts") is one of the broad parts of mathematics, together with number theory, geometry and analysis.
New!!: Combinatorics and Algebra · See more »
Algebraic combinatorics
Algebraic combinatorics is an area of mathematics that employs methods of abstract algebra, notably group theory and representation theory, in various combinatorial contexts and, conversely, applies combinatorial techniques to problems in algebra.
New!!: Combinatorics and Algebraic combinatorics · See more »
Algebraic topology
Algebraic topology is a branch of mathematics that uses tools from abstract algebra to study topological spaces.
New!!: Combinatorics and Algebraic topology · See more »
Analysis
Analysis is the process of breaking a complex topic or substance into smaller parts in order to gain a better understanding of it.
New!!: Combinatorics and Analysis · See more »
Analysis of algorithms
In computer science, the analysis of algorithms is the determination of the computational complexity of algorithms, that is the amount of time, storage and/or other resources necessary to execute them.
New!!: Combinatorics and Analysis of algorithms · See more »
Analytic number theory
In mathematics, analytic number theory is a branch of number theory that uses methods from mathematical analysis to solve problems about the integers.
New!!: Combinatorics and Analytic number theory · See more »
Ancient Greece
Ancient Greece was a civilization belonging to a period of Greek history from the Greek Dark Ages of the 13th–9th centuries BC to the end of antiquity (AD 600).
New!!: Combinatorics and Ancient Greece · See more »
Ancient history
Ancient history is the aggregate of past events, "History" from the beginning of recorded human history and extending as far as the Early Middle Ages or the post-classical history.
New!!: Combinatorics and Ancient history · See more »
Archimedes
Archimedes of Syracuse (Ἀρχιμήδης) was a Greek mathematician, physicist, engineer, inventor, and astronomer.
New!!: Combinatorics and Archimedes · See more »
Associahedron
In mathematics, an associahedron Kn is an (n − 2)-dimensional convex polytope in which each vertex corresponds to a way of correctly inserting opening and closing parentheses in a word of n letters and the edges correspond to single application of the associativity rule.
New!!: Combinatorics and Associahedron · See more »
Astronomer
An astronomer is a scientist in the field of astronomy who concentrates their studies on a specific question or field outside the scope of Earth.
New!!: Combinatorics and Astronomer · See more »
Asymptotic analysis
In mathematical analysis, asymptotic analysis, also known as asymptotics, is a method of describing limiting behavior.
New!!: Combinatorics and Asymptotic analysis · See more »
Automata theory
Automata theory is the study of abstract machines and automata, as well as the computational problems that can be solved using them.
New!!: Combinatorics and Automata theory · See more »
Bijective proof
In combinatorics, bijective proof is a proof technique that finds a bijective function f: A → B between two finite sets A and B, or a size-preserving bijective function between two combinatorial classes, thus proving that they have the same number of elements, |A|.
New!!: Combinatorics and Bijective proof · See more »
Binomial coefficient
In mathematics, any of the positive integers that occurs as a coefficient in the binomial theorem is a binomial coefficient.
New!!: Combinatorics and Binomial coefficient · See more »
Birkhoff polytope
The Birkhoff polytope Bn, also called the assignment polytope, the polytope of doubly stochastic matrices, or the perfect matching polytope of the complete bipartite graph K_, is the convex polytope in RN (where N.
New!!: Combinatorics and Birkhoff polytope · See more »
Blaise Pascal
Blaise Pascal (19 June 1623 – 19 August 1662) was a French mathematician, physicist, inventor, writer and Catholic theologian.
New!!: Combinatorics and Blaise Pascal · See more »
Block design
In combinatorial mathematics, a block design is a set together with a family of subsets (repeated subsets are allowed at times) whose members are chosen to satisfy some set of properties that are deemed useful for a particular application.
New!!: Combinatorics and Block design · See more »
Boolean algebra (structure)
In abstract algebra, a Boolean algebra or Boolean lattice is a complemented distributive lattice.
New!!: Combinatorics and Boolean algebra (structure) · See more »
Cambridge University Press
Cambridge University Press (CUP) is the publishing business of the University of Cambridge.
New!!: Combinatorics and Cambridge University Press · See more »
Campanology
Campanology (from Late Latin campana, "bell"; and Greek -λογία, -logia) is the study of bells.
New!!: Combinatorics and Campanology · See more »
Catalan number
In combinatorial mathematics, the Catalan numbers form a sequence of natural numbers that occur in various counting problems, often involving recursively-defined objects.
New!!: Combinatorics and Catalan number · See more »
Cauchy's theorem (geometry)
Cauchy's theorem is a theorem in geometry, named after Augustin Cauchy.
New!!: Combinatorics and Cauchy's theorem (geometry) · See more »
Cayley graph
In mathematics, a Cayley graph, also known as a Cayley colour graph, Cayley diagram, group diagram, or colour group is a graph that encodes the abstract structure of a group.
New!!: Combinatorics and Cayley graph · See more »
Chomsky hierarchy
In the formal languages of computer science and linguistics, the Chomsky hierarchy (occasionally referred to as Chomsky–Schützenberger hierarchy) is a containment hierarchy of classes of formal grammars.
New!!: Combinatorics and Chomsky hierarchy · See more »
Chromatic polynomial
The chromatic polynomial is a graph polynomial studied in algebraic graph theory, a branch of mathematics.
New!!: Combinatorics and Chromatic polynomial · See more »
Chrysippus
Chrysippus of Soli (Χρύσιππος ὁ Σολεύς, Chrysippos ho Soleus) was a Greek Stoic philosopher.
New!!: Combinatorics and Chrysippus · See more »
Classification of finite simple groups
In mathematics, the classification of the finite simple groups is a theorem stating that every finite simple group belongs to one of four broad classes described below.
New!!: Combinatorics and Classification of finite simple groups · See more »
Coding theory
Coding theory is the study of the properties of codes and their respective fitness for specific applications.
New!!: Combinatorics and Coding theory · See more »
Combination
In mathematics, a combination is a selection of items from a collection, such that (unlike permutations) the order of selection does not matter.
New!!: Combinatorics and Combination · See more »
Combinatorial biology
In biotechnology, combinatorial biology is the creation of a large number of compounds (usually proteins or peptides) through technologies such as phage display.
New!!: Combinatorics and Combinatorial biology · See more »
Combinatorial chemistry
Combinatorial chemistry comprises chemical synthetic methods that make it possible to prepare a large number (tens to thousands or even millions) of compounds in a single process.
New!!: Combinatorics and Combinatorial chemistry · See more »
Combinatorial data analysis
In statistics, combinatorial data analysis (CDA) is the study of data sets where the order in which objects are arranged is important.
New!!: Combinatorics and Combinatorial data analysis · See more »
Combinatorial design
Combinatorial design theory is the part of combinatorial mathematics that deals with the existence, construction and properties of systems of finite sets whose arrangements satisfy generalized concepts of balance and/or symmetry.
New!!: Combinatorics and Combinatorial design · See more »
Combinatorial game theory
Combinatorial game theory (CGT) is a branch of mathematics and theoretical computer science that typically studies sequential games with perfect information.
New!!: Combinatorics and Combinatorial game theory · See more »
Combinatorial group theory
In mathematics, combinatorial group theory is the theory of free groups, and the concept of a presentation of a group by generators and relations.
New!!: Combinatorics and Combinatorial group theory · See more »
Combinatorial optimization
In applied mathematics and theoretical computer science, combinatorial optimization is a topic that consists of finding an optimal object from a finite set of objects.
New!!: Combinatorics and Combinatorial optimization · See more »
Combinatorial topology
In mathematics, combinatorial topology was an older name for algebraic topology, dating from the time when topological invariants of spaces (for example the Betti numbers) were regarded as derived from combinatorial decompositions of spaces, such as decomposition into simplicial complexes.
New!!: Combinatorics and Combinatorial topology · See more »
Combinatorics and dynamical systems
The mathematical disciplines of combinatorics and dynamical systems interact in a number of ways.
New!!: Combinatorics and Combinatorics and dynamical systems · See more »
Combinatorics and physics
Combinatorial physics or physical combinatorics is the area of interaction between physics and combinatorics.
New!!: Combinatorics and Combinatorics and physics · See more »
Complete bipartite graph
No description.
New!!: Combinatorics and Complete bipartite graph · See more »
Complex analysis
Complex analysis, traditionally known as the theory of functions of a complex variable, is the branch of mathematical analysis that investigates functions of complex numbers.
New!!: Combinatorics and Complex analysis · See more »
Computational complexity theory
Computational complexity theory is a branch of the theory of computation in theoretical computer science that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other.
New!!: Combinatorics and Computational complexity theory · See more »
Computational geometry
Computational geometry is a branch of computer science devoted to the study of algorithms which can be stated in terms of geometry.
New!!: Combinatorics and Computational geometry · See more »
Computer science
Computer science deals with the theoretical foundations of information and computation, together with practical techniques for the implementation and application of these foundations.
New!!: Combinatorics and Computer science · See more »
Convex geometry
In mathematics, convex geometry is the branch of geometry studying convex sets, mainly in Euclidean space.
New!!: Combinatorics and Convex geometry · See more »
Convex polytope
A convex polytope is a special case of a polytope, having the additional property that it is also a convex set of points in the n-dimensional space Rn.
New!!: Combinatorics and Convex polytope · See more »
Countable set
In mathematics, a countable set is a set with the same cardinality (number of elements) as some subset of the set of natural numbers.
New!!: Combinatorics and Countable set · See more »
Culture of Europe
The culture of Europe is rooted in the art, architecture, music, literature, and philosophy that originated from the continent of Europe.
New!!: Combinatorics and Culture of Europe · See more »
Decision tree
A decision tree is a decision support tool that uses a tree-like graph or model of decisions and their possible consequences, including chance event outcomes, resource costs, and utility.
New!!: Combinatorics and Decision tree · See more »
Discrete geometry
Discrete geometry and combinatorial geometry are branches of geometry that study combinatorial properties and constructive methods of discrete geometric objects.
New!!: Combinatorics and Discrete geometry · See more »
Discrete mathematics
Discrete mathematics is the study of mathematical structures that are fundamentally discrete rather than continuous.
New!!: Combinatorics and Discrete mathematics · See more »
Discrete Morse theory
Discrete Morse theory is a combinatorial adaptation of Morse theory developed by.
New!!: Combinatorics and Discrete Morse theory · See more »
Dynamical system
In mathematics, a dynamical system is a system in which a function describes the time dependence of a point in a geometrical space.
New!!: Combinatorics and Dynamical system · See more »
Encyclopædia Britannica Eleventh Edition
The Encyclopædia Britannica Eleventh Edition (1910–11) is a 29-volume reference work, an edition of the Encyclopædia Britannica.
New!!: Combinatorics and Encyclopædia Britannica Eleventh Edition · See more »
England in the Middle Ages
England in the Middle Ages concerns the history of England during the medieval period, from the end of the 5th century through to the start of the Early Modern period in 1485.
New!!: Combinatorics and England in the Middle Ages · See more »
Enumerative combinatorics
Enumerative combinatorics is an area of combinatorics that deals with the number of ways that certain patterns can be formed.
New!!: Combinatorics and Enumerative combinatorics · See more »
Ergodic theory
Ergodic theory (Greek: έργον ergon "work", όδος hodos "way") is a branch of mathematics that studies dynamical systems with an invariant measure and related problems.
New!!: Combinatorics and Ergodic theory · See more »
Error correction code
In computing, telecommunication, information theory, and coding theory, an error correction code, sometimes error correcting code, (ECC) is used for controlling errors in data over unreliable or noisy communication channels.
New!!: Combinatorics and Error correction code · See more »
Eventually (mathematics)
In the mathematical areas of number theory and analysis, an infinite sequence (a_n) is said to eventually have a certain property if all terms beyond some (finite) point in the sequence have that property.
New!!: Combinatorics and Eventually (mathematics) · See more »
Evolutionary biology
Evolutionary biology is the subfield of biology that studies the evolutionary processes that produced the diversity of life on Earth, starting from a single common ancestor.
New!!: Combinatorics and Evolutionary biology · See more »
Fair division
Fair division is the problem of dividing a set of goods or resources between several people who have an entitlement to them, such that each person receives his/her due share.
New!!: Combinatorics and Fair division · See more »
Family of sets
In set theory and related branches of mathematics, a collection F of subsets of a given set S is called a family of subsets of S, or a family of sets over S. More generally, a collection of any sets whatsoever is called a family of sets.
New!!: Combinatorics and Family of sets · See more »
Fibonacci number
In mathematics, the Fibonacci numbers are the numbers in the following integer sequence, called the Fibonacci sequence, and characterized by the fact that every number after the first two is the sum of the two preceding ones: Often, especially in modern usage, the sequence is extended by one more initial term: By definition, the first two numbers in the Fibonacci sequence are either 1 and 1, or 0 and 1, depending on the chosen starting point of the sequence, and each subsequent number is the sum of the previous two.
New!!: Combinatorics and Fibonacci number · See more »
Finite set
In mathematics, a finite set is a set that has a finite number of elements.
New!!: Combinatorics and Finite set · See more »
Formal grammar
In formal language theory, a grammar (when the context is not given, often called a formal grammar for clarity) is a set of production rules for strings in a formal language.
New!!: Combinatorics and Formal grammar · See more »
Formal language
In mathematics, computer science, and linguistics, a formal language is a set of strings of symbols together with a set of rules that are specific to it.
New!!: Combinatorics and Formal language · See more »
Four color theorem
In mathematics, the four color theorem, or the four color map theorem, states that, given any separation of a plane into contiguous regions, producing a figure called a map, no more than four colors are required to color the regions of the map so that no two adjacent regions have the same color.
New!!: Combinatorics and Four color theorem · See more »
Fractal analysis
Fractal analysis is assessing fractal characteristics of data.
New!!: Combinatorics and Fractal analysis · See more »
Functional analysis
Functional analysis is a branch of mathematical analysis, the core of which is formed by the study of vector spaces endowed with some kind of limit-related structure (e.g. inner product, norm, topology, etc.) and the linear functions defined on these spaces and respecting these structures in a suitable sense.
New!!: Combinatorics and Functional analysis · See more »
Generating function
In mathematics, a generating function is a way of encoding an infinite sequence of numbers (an) by treating them as the coefficients of a power series.
New!!: Combinatorics and Generating function · See more »
Geometric probability
Problems of the following type, and their solution techniques, were first studied in the 18th century, and the general topic became known as geometric probability.
New!!: Combinatorics and Geometric probability · See more »
Geometry
Geometry (from the γεωμετρία; geo- "earth", -metron "measurement") is a branch of mathematics concerned with questions of shape, size, relative position of figures, and the properties of space.
New!!: Combinatorics and Geometry · See more »
Gersonides
Levi ben Gershon (1288–1344), better known by his Graecized name as Gersonides or by his Latinized name Magister Leo Hebraeus the abbreviation of first letters as RaLBaG, was a medieval French Jewish philosopher, Talmudist, mathematician, physician and astronomer/astrologer.
New!!: Combinatorics and Gersonides · See more »
Gian-Carlo Rota
Gian-Carlo Rota (April 27, 1932 – April 18, 1999) was an Italian-born American mathematician and philosopher.
New!!: Combinatorics and Gian-Carlo Rota · See more »
Graph coloring
In graph theory, graph coloring is a special case of graph labeling; it is an assignment of labels traditionally called "colors" to elements of a graph subject to certain constraints.
New!!: Combinatorics and Graph coloring · See more »
Graph dynamical system
In mathematics, the concept of graph dynamical systems can be used to capture a wide range of processes taking place on graphs or networks.
New!!: Combinatorics and Graph dynamical system · See more »
Graph theory
In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects.
New!!: Combinatorics and Graph theory · See more »
Group theory
In mathematics and abstract algebra, group theory studies the algebraic structures known as groups.
New!!: Combinatorics and Group theory · See more »
H. J. Ryser
Herbert John Ryser (July 28, 1923 – July 12, 1985) was a professor of mathematics, widely regarded as one of the major figures in combinatorics in the 20th century.
New!!: Combinatorics and H. J. Ryser · See more »
Hamiltonian path
In the mathematical field of graph theory, a Hamiltonian path (or traceable path) is a path in an undirected or directed graph that visits each vertex exactly once.
New!!: Combinatorics and Hamiltonian path · See more »
Harmonic analysis
Harmonic analysis is a branch of mathematics concerned with the representation of functions or signals as the superposition of basic waves, and the study of and generalization of the notions of Fourier series and Fourier transforms (i.e. an extended form of Fourier analysis).
New!!: Combinatorics and Harmonic analysis · See more »
Hassler Whitney
Hassler Whitney (March 23, 1907 – May 10, 1989) was an American mathematician.
New!!: Combinatorics and Hassler Whitney · See more »
Hipparchus
Hipparchus of Nicaea (Ἵππαρχος, Hipparkhos) was a Greek astronomer, geographer, and mathematician.
New!!: Combinatorics and Hipparchus · See more »
Historian
A historian is a person who studies and writes about the past, and is regarded as an authority on it.
New!!: Combinatorics and Historian · See more »
Inclusion map
In mathematics, if A is a subset of B, then the inclusion map (also inclusion function, insertion, or canonical injection) is the function \iota that sends each element, x, of A to x, treated as an element of B: A "hooked arrow" is sometimes used in place of the function arrow above to denote an inclusion map; thus: \iota: A\hookrightarrow B. (On the other hand, this notation is sometimes reserved for embeddings.) This and other analogous injective functions from substructures are sometimes called natural injections.
New!!: Combinatorics and Inclusion map · See more »
India
India (IAST), also called the Republic of India (IAST), is a country in South Asia.
New!!: Combinatorics and India · See more »
Information theory
Information theory studies the quantification, storage, and communication of information.
New!!: Combinatorics and Information theory · See more »
Intersection (set theory)
In mathematics, the intersection A ∩ B of two sets A and B is the set that contains all elements of A that also belong to B (or equivalently, all elements of B that also belong to A), but no other elements.
New!!: Combinatorics and Intersection (set theory) · See more »
Isaac Newton
Sir Isaac Newton (25 December 1642 – 20 March 1726/27) was an English mathematician, astronomer, theologian, author and physicist (described in his own day as a "natural philosopher") who is widely recognised as one of the most influential scientists of all time, and a key figure in the scientific revolution.
New!!: Combinatorics and Isaac Newton · See more »
Ising model
The Ising model, named after the physicist Ernst Ising, is a mathematical model of ferromagnetism in statistical mechanics.
New!!: Combinatorics and Ising model · See more »
Jacob Bernoulli
Jacob Bernoulli (also known as James or Jacques; – 16 August 1705) was one of the many prominent mathematicians in the Bernoulli family.
New!!: Combinatorics and Jacob Bernoulli · See more »
James Joseph Sylvester
James Joseph Sylvester FRS (3 September 1814 – 15 March 1897) was an English mathematician.
New!!: Combinatorics and James Joseph Sylvester · See more »
Kirkman's schoolgirl problem
Kirkman's schoolgirl problem is a problem in combinatorics proposed by Rev.
New!!: Combinatorics and Kirkman's schoolgirl problem · See more »
Kissing number problem
In geometry, a kissing number is defined as the number of non-overlapping unit spheres that can be arranged such that they each touch another given unit sphere.
New!!: Combinatorics and Kissing number problem · See more »
Lattice (order)
A lattice is an abstract structure studied in the mathematical subdisciplines of order theory and abstract algebra.
New!!: Combinatorics and Lattice (order) · See more »
Lattice graph
A lattice graph, mesh graph, or grid graph, is a graph whose drawing, embedded in some Euclidean space Rn, forms a regular tiling.
New!!: Combinatorics and Lattice graph · See more »
Leon Mirsky
Leonid Mirsky (19 December 1918 Russia – 1 December 1983 Sheffield, England) was a Russian-British mathematician who worked in number theory, linear algebra, and combinatorics.
New!!: Combinatorics and Leon Mirsky · See more »
Leonhard Euler
Leonhard Euler (Swiss Standard German:; German Standard German:; 15 April 170718 September 1783) was a Swiss mathematician, physicist, astronomer, logician and engineer, who made important and influential discoveries in many branches of mathematics, such as infinitesimal calculus and graph theory, while also making pioneering contributions to several branches such as topology and analytic number theory.
New!!: Combinatorics and Leonhard Euler · See more »
Linear independence
In the theory of vector spaces, a set of vectors is said to be if one of the vectors in the set can be defined as a linear combination of the others; if no vector in the set can be written in this way, then the vectors are said to be.
New!!: Combinatorics and Linear independence · See more »
Linguistics
Linguistics is the scientific study of language, and involves an analysis of language form, language meaning, and language in context.
New!!: Combinatorics and Linguistics · See more »
Logic
Logic (from the logikḗ), originally meaning "the word" or "what is spoken", but coming to mean "thought" or "reason", is a subject concerned with the most general laws of truth, and is now generally held to consist of the systematic study of the form of valid inference.
New!!: Combinatorics and Logic · See more »
Mahāvīra (mathematician)
Mahāvīra (or Mahaviracharya, "Mahavira the Teacher") was a 9th-century Jain mathematician from Karnataka, India.
New!!: Combinatorics and Mahāvīra (mathematician) · See more »
Markov chain
A Markov chain is "a stochastic model describing a sequence of possible events in which the probability of each event depends only on the state attained in the previous event".
New!!: Combinatorics and Markov chain · See more »
Markov chain mixing time
In probability theory, the mixing time of a Markov chain is the time until the Markov chain is "close" to its steady state distribution.
New!!: Combinatorics and Markov chain mixing time · See more »
Mathematical logic
Mathematical logic is a subfield of mathematics exploring the applications of formal logic to mathematics.
New!!: Combinatorics and Mathematical logic · See more »
Mathematical problem
A mathematical problem is a problem that is amenable to being represented, analyzed, and possibly solved, with the methods of mathematics.
New!!: Combinatorics and Mathematical problem · See more »
Mathematical structure
In mathematics, a structure on a set is an additional mathematical object that, in some manner, attaches (or relates) to that set to endow it with some additional meaning or significance.
New!!: Combinatorics and Mathematical structure · See more »
Mathematician
A mathematician is someone who uses an extensive knowledge of mathematics in his or her work, typically to solve mathematical problems.
New!!: Combinatorics and Mathematician · See more »
Mathematics
Mathematics (from Greek μάθημα máthēma, "knowledge, study, learning") is the study of such topics as quantity, structure, space, and change.
New!!: Combinatorics and Mathematics · See more »
MathWorld
MathWorld is an online mathematics reference work, created and largely written by Eric W. Weisstein.
New!!: Combinatorics and MathWorld · See more »
Metric space
In mathematics, a metric space is a set for which distances between all members of the set are defined.
New!!: Combinatorics and Metric space · See more »
Middle Ages
In the history of Europe, the Middle Ages (or Medieval Period) lasted from the 5th to the 15th century.
New!!: Combinatorics and Middle Ages · See more »
Necklace problem
The necklace problem is a problem in recreational mathematics, solved in the early 21st century.
New!!: Combinatorics and Necklace problem · See more »
Number theory
Number theory, or in older usage arithmetic, is a branch of pure mathematics devoted primarily to the study of the integers.
New!!: Combinatorics and Number theory · See more »
Operations research
Operations research, or operational research in British usage, is a discipline that deals with the application of advanced analytical methods to help make better decisions.
New!!: Combinatorics and Operations research · See more »
Orthogonal polynomials
In mathematics, an orthogonal polynomial sequence is a family of polynomials such that any two different polynomials in the sequence are orthogonal to each other under some inner product.
New!!: Combinatorics and Orthogonal polynomials · See more »
Ostomachion
Ostomachion, also known as loculus Archimedius (Archimedes' box in Latin) and also as syntomachion, is a mathematical treatise attributed to Archimedes.
New!!: Combinatorics and Ostomachion · See more »
Outline of combinatorics
Combinatorics is a branch of mathematics concerning the study of finite or countable discrete structures.
New!!: Combinatorics and Outline of combinatorics · See more »
Partially ordered set
In mathematics, especially order theory, a partially ordered set (also poset) formalizes and generalizes the intuitive concept of an ordering, sequencing, or arrangement of the elements of a set.
New!!: Combinatorics and Partially ordered set · See more »
Partition (number theory)
In number theory and combinatorics, a partition of a positive integer n, also called an integer partition, is a way of writing n as a sum of positive integers.
New!!: Combinatorics and Partition (number theory) · See more »
Partition of a set
In mathematics, a partition of a set is a grouping of the set's elements into non-empty subsets, in such a way that every element is included in one and only one of the subsets.
New!!: Combinatorics and Partition of a set · See more »
Pascal's triangle
In mathematics, Pascal's triangle is a triangular array of the binomial coefficients.
New!!: Combinatorics and Pascal's triangle · See more »
Paul Erdős
Paul Erdős (Erdős Pál; 26 March 1913 – 20 September 1996) was a Hungarian mathematician.
New!!: Combinatorics and Paul Erdős · See more »
Percy Alexander MacMahon
Percy Alexander MacMahon (born 26 September 1854, Sliema, British Malta – 25 December 1929, Bognor Regis, England) was a mathematician, especially noted in connection with the partitions of numbers and enumerative combinatorics.
New!!: Combinatorics and Percy Alexander MacMahon · See more »
Permutation
In mathematics, the notion of permutation relates to the act of arranging all the members of a set into some sequence or order, or if the set is already ordered, rearranging (reordering) its elements, a process called permuting.
New!!: Combinatorics and Permutation · See more »
Permutohedron
In mathematics, the permutohedron of order n (also spelled permutahedron) is an (n − 1)-dimensional polytope embedded in an n-dimensional space, the vertices of which are formed by permuting the coordinates of the vector (1, 2, 3,..., n).
New!!: Combinatorics and Permutohedron · See more »
Philosopher
A philosopher is someone who practices philosophy, which involves rational inquiry into areas that are outside either theology or science.
New!!: Combinatorics and Philosopher · See more »
Phylogenetics
In biology, phylogenetics (Greek: φυλή, φῦλον – phylé, phylon.
New!!: Combinatorics and Phylogenetics · See more »
Physician
A physician, medical practitioner, medical doctor, or simply doctor is a professional who practises medicine, which is concerned with promoting, maintaining, or restoring health through the study, diagnosis, and treatment of disease, injury, and other physical and mental impairments.
New!!: Combinatorics and Physician · See more »
Pigeonhole principle
In mathematics, the pigeonhole principle states that if items are put into containers, with, then at least one container must contain more than one item.
New!!: Combinatorics and Pigeonhole principle · See more »
Plutarch
Plutarch (Πλούταρχος, Ploútarkhos,; c. CE 46 – CE 120), later named, upon becoming a Roman citizen, Lucius Mestrius Plutarchus, (Λούκιος Μέστριος Πλούταρχος) was a Greek biographer and essayist, known primarily for his Parallel Lives and Moralia.
New!!: Combinatorics and Plutarch · See more »
Polyhedral combinatorics
Polyhedral combinatorics is a branch of mathematics, within combinatorics and discrete geometry, that studies the problems of counting and describing the faces of convex polyhedra and higher-dimensional convex polytopes.
New!!: Combinatorics and Polyhedral combinatorics · See more »
Potts model
In statistical mechanics, the Potts model, a generalization of the Ising model, is a model of interacting spins on a crystalline lattice.
New!!: Combinatorics and Potts model · See more »
Power set
In mathematics, the power set (or powerset) of any set is the set of all subsets of, including the empty set and itself, variously denoted as, 𝒫(), ℘() (using the "Weierstrass p"),,, or, identifying the powerset of with the set of all functions from to a given set of two elements,.
New!!: Combinatorics and Power set · See more »
Probabilistic method
The probabilistic method is a nonconstructive method, primarily used in combinatorics and pioneered by Paul Erdős, for proving the existence of a prescribed kind of mathematical object.
New!!: Combinatorics and Probabilistic method · See more »
Probabilistic number theory
Probabilistic number theory is a subfield of number theory, which explicitly uses probability to answer questions of number theory.
New!!: Combinatorics and Probabilistic number theory · See more »
Probability
Probability is the measure of the likelihood that an event will occur.
New!!: Combinatorics and Probability · See more »
Probability theory
Probability theory is the branch of mathematics concerned with probability.
New!!: Combinatorics and Probability theory · See more »
Pure mathematics
Broadly speaking, pure mathematics is mathematics that studies entirely abstract concepts.
New!!: Combinatorics and Pure mathematics · See more »
Q-Pochhammer symbol
In mathematics, in the area of combinatorics, a q-Pochhammer symbol, also called a q-shifted factorial, is a ''q''-analog of the Pochhammer symbol.
New!!: Combinatorics and Q-Pochhammer symbol · See more »
Ramsey theory
Ramsey theory, named after the British mathematician and philosopher Frank P. Ramsey, is a branch of mathematics that studies the conditions under which order must appear.
New!!: Combinatorics and Ramsey theory · See more »
Random graph
In mathematics, random graph is the general term to refer to probability distributions over graphs.
New!!: Combinatorics and Random graph · See more »
Real projective space
In mathematics, real projective space, or RPn or \mathbb_n(\mathbb), is the topological space of lines passing through the origin 0 in Rn+1.
New!!: Combinatorics and Real projective space · See more »
Renaissance
The Renaissance is a period in European history, covering the span between the 14th and 17th centuries.
New!!: Combinatorics and Renaissance · See more »
Representation theory
Representation theory is a branch of mathematics that studies abstract algebraic structures by representing their elements as linear transformations of vector spaces, and studies modules over these abstract algebraic structures.
New!!: Combinatorics and Representation theory · See more »
Richard P. Stanley
Richard Peter Stanley (born June 23, 1944 in New York City, New York) is the Norman Levinson Professor of Applied Mathematics at the Massachusetts Institute of Technology, in Cambridge, Massachusetts.
New!!: Combinatorics and Richard P. Stanley · See more »
Schröder–Hipparchus number
In number theory, the Schröder–Hipparchus numbers form an integer sequence that can be used to count the number of plane trees with a given set of leaves, the number of ways of inserting parentheses into a sequence, and the number of ways of dissecting a convex polygon into smaller polygons by inserting diagonals.
New!!: Combinatorics and Schröder–Hipparchus number · See more »
Science
R. P. Feynman, The Feynman Lectures on Physics, Vol.1, Chaps.1,2,&3.
New!!: Combinatorics and Science · See more »
Set theory
Set theory is a branch of mathematical logic that studies sets, which informally are collections of objects.
New!!: Combinatorics and Set theory · See more »
Special functions
Special functions are particular mathematical functions which have more or less established names and notations due to their importance in mathematical analysis, functional analysis, physics, or other applications.
New!!: Combinatorics and Special functions · See more »
Statistical mechanics
Statistical mechanics is one of the pillars of modern physics.
New!!: Combinatorics and Statistical mechanics · See more »
Statistical physics
Statistical physics is a branch of physics that uses methods of probability theory and statistics, and particularly the mathematical tools for dealing with large populations and approximations, in solving physical problems.
New!!: Combinatorics and Statistical physics · See more »
Steiner system
The Fano plane is an S(2,3,7) Steiner triple system. The blocks are the 7 lines, each containing 3 points. Every pair of points belongs to a unique line. In combinatorial mathematics, a Steiner system (named after Jakob Steiner) is a type of block design, specifically a t-design with λ.
New!!: Combinatorics and Steiner system · See more »
Sushruta
Sushruta, or Suśruta (Sanskrit: सुश्रुत, lit. "well heard") was an ancient Indian physician during 1500 BCE to 1000 BCE, known as the main author of the treatise The Compendium of Suśruta (Sanskrit: ''Suśruta-saṃhitā'').
New!!: Combinatorics and Sushruta · See more »
Sushruta Samhita
The Sushruta Samhita (सुश्रुतसंहिता, IAST: Suśrutasaṃhitā, literally "Suśruta's Compendium") is an ancient Sanskrit text on medicine and surgery, and one of the most important such treatises on this subject to survive from the ancient world.
New!!: Combinatorics and Sushruta Samhita · See more »
Symbolic method (combinatorics)
In combinatorics, especially in analytic combinatorics, the symbolic method is a technique for counting combinatorial objects.
New!!: Combinatorics and Symbolic method (combinatorics) · See more »
Talmud
The Talmud (Hebrew: תַּלְמוּד talmūd "instruction, learning", from a root LMD "teach, study") is the central text of Rabbinic Judaism and the primary source of Jewish religious law and theology.
New!!: Combinatorics and Talmud · See more »
Theoretical computer science
Theoretical computer science, or TCS, is a subset of general computer science and mathematics that focuses on more mathematical topics of computing and includes the theory of computation.
New!!: Combinatorics and Theoretical computer science · See more »
Tiling puzzle
Tiling puzzles are puzzles involving two-dimensional packing problems in which a number of flat shapes have to be assembled into a larger given shape without overlaps (and often without gaps).
New!!: Combinatorics and Tiling puzzle · See more »
Timeline of Indian history
This is a timeline of Indian history, comprising important legal and territorial changes and political events in India and its predecessor states.
New!!: Combinatorics and Timeline of Indian history · See more »
Topology
In mathematics, topology (from the Greek τόπος, place, and λόγος, study) is concerned with the properties of space that are preserved under continuous deformations, such as stretching, crumpling and bending, but not tearing or gluing.
New!!: Combinatorics and Topology · See more »
Triangle-free graph
In the mathematical area of graph theory, a triangle-free graph is an undirected graph in which no three vertices form a triangle of edges.
New!!: Combinatorics and Triangle-free graph · See more »
Tutte polynomial
The Tutte polynomial, also called the dichromate or the Tutte–Whitney polynomial, is a graph polynomial.
New!!: Combinatorics and Tutte polynomial · See more »
Twelvefold way
In combinatorics, the twelvefold way is a systematic classification of 12 related enumerative problems concerning two finite sets, which include the classical problems of counting permutations, combinations, multisets, and partitions either of a set or of a number.
New!!: Combinatorics and Twelvefold way · See more »
Two-dimensional space
Two-dimensional space or bi-dimensional space is a geometric setting in which two values (called parameters) are required to determine the position of an element (i.e., point).
New!!: Combinatorics and Two-dimensional space · See more »
Vector space
A vector space (also called a linear space) is a collection of objects called vectors, which may be added together and multiplied ("scaled") by numbers, called scalars.
New!!: Combinatorics and Vector space · See more »
Vertex (graph theory)
In mathematics, and more specifically in graph theory, a vertex (plural vertices) or node is the fundamental unit of which graphs are formed: an undirected graph consists of a set of vertices and a set of edges (unordered pairs of vertices), while a directed graph consists of a set of vertices and a set of arcs (ordered pairs of vertices).
New!!: Combinatorics and Vertex (graph theory) · See more »
Redirects here:
Calculate-opportunities, CombinaTorics, Combinational analysis, Combinatorial, Combinatorial analysis, Combinatorial mathematics, Combinatorial theory, Combinatoric, Combinatronic.
References
[1] https://en.wikipedia.org/wiki/Combinatorics
