Find link

language:

Find link is a tool written by Edward Betts.

searching for Composition (combinatorics) 233 found (244 total)

alternate case: composition (combinatorics)

Enumeration (1,633 words) [view diff] no match in snippet view article find links to article

(perhaps arbitrary) ordering. In some contexts, such as enumerative combinatorics, the term enumeration is used more in the sense of counting – with emphasis

Enumerative combinatorics (1,360 words) [view diff] no match in snippet view article find links to article

Enumerative combinatorics is an area of combinatorics that deals with the number of ways that certain patterns can be formed. Two examples of this type

Transformation (function) (339 words) [view diff] no match in snippet view article

set of all transformations on a given base set, together with function composition, forms a regular semigroup. For a finite set of cardinality n, there

Permutation (11,671 words) [view diff] no match in snippet view article find links to article

The study of permutations of finite sets is an important topic in combinatorics and group theory. Permutations are used in almost every branch of mathematics

Motzkin number (846 words) [view diff] no match in snippet view article find links to article

named after Theodore Motzkin and have diverse applications in geometry, combinatorics and number theory. The Motzkin numbers M n {\displaystyle M_{n}} for

Star product (293 words) [view diff] no match in snippet view article find links to article

Well-founded Well-quasi-ordering (Better) (Pre) Well-order Constructions Composition Converse/Transpose Lexicographic order Linear extension Product order

Eulerian poset (407 words) [view diff] no match in snippet view article find links to article

research has been devoted to extending known results from polyhedral combinatorics, such as various restrictions on f-vectors of convex simplicial polytopes

Combinatorial species (2,907 words) [view diff] no match in snippet view article find links to article

Definition 8 Flajolet, Philippe; Sedgewick, Robert (2009). Analytic combinatorics. Sage documentation on combinatorial species. Haskell package species

Sheffer sequence (1,049 words) [view diff] no match in snippet view article find links to article

its degree, satisfying conditions related to the umbral calculus in combinatorics. They are named for Isador M. Sheffer. Fix a polynomial sequence (pn)

Formal power series (10,130 words) [view diff] no match in snippet view article find links to article

monomials in several indeterminates. Formal power series are widely used in combinatorics for representing sequences of integers as generating functions. In this

Power of three (894 words) [view diff] no match in snippet view article find links to article

(729 vertices). In enumerative combinatorics, there are 3n signed subsets of a set of n elements. In polyhedral combinatorics, the hypercube and all other

Cake number (347 words) [view diff] no match in snippet view article find links to article

This combinatorics-related article is a stub. You can help Wikipedia by expanding it.

Geometric transformation (1,073 words) [view diff] no match in snippet view article find links to article

whether active or passive, can be represented as a screw displacement, the composition of a translation along an axis and a rotation about that axis. The terms

Permutation group (3,367 words) [view diff] no match in snippet view article find links to article

action. Group actions have applications in the study of symmetries, combinatorics and many other branches of mathematics, physics and chemistry. A permutation

Musikalisches Würfelspiel (961 words) [view diff] no match in snippet view article find links to article

zweier Würfel, ohne etwas von der Musik oder Composition zu verstehen (German for "Instructions for the composition of as many waltzes as one desires with two

Schröder–Hipparchus number (1,391 words) [view diff] no match in snippet view article find links to article

In combinatorics, the Schröder–Hipparchus numbers form an integer sequence that can be used to count the plane trees with a given set of leaves, the ways

Lobb number (458 words) [view diff] no match in snippet view article find links to article

that all of the partial sums of the sequence are non-negative. The combinatorics of parentheses is replaced with counting ballots in an election with

Schröder number (1,649 words) [view diff] no match in snippet view article find links to article

"Algebraic and geometric methods in enumerative combinatorics". Handbook of enumerative combinatorics. Boca Raton, FL: CRC Press. pp. 3–172. Sloane, N

Graded poset (1,934 words) [view diff] no match in snippet view article find links to article

In mathematics, in the branch of combinatorics, a graded poset is a partially-ordered set (poset) P equipped with a rank function ρ from P to the set

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

In mathematics, in the areas of order theory and combinatorics, Mirsky's theorem characterizes the height of any finite partially ordered set in terms

Bimal Kumar Roy (272 words) [view diff] no match in snippet view article find links to article

the Applied Statistics Unit of ISI, Kolkata. He received a Ph.D. in Combinatorics and Optimization in 1982 from the University of Waterloo under the joint

Octagonal number (366 words) [view diff] no match in snippet view article find links to article

Additive Multiplicative P-adic numbers-related Automorphic Trimorphic Digit-composition related Palindromic Pandigital Repdigit Repunit Self-descriptive Smarandache–Wellin

Euler characteristic (3,461 words) [view diff] no match in snippet view article find links to article

mathematics, and more specifically in algebraic topology and polyhedral combinatorics, the Euler characteristic (or Euler number, or Euler–Poincaré characteristic)

Delannoy number (1,163 words) [view diff] no match in snippet view article find links to article

Additive Multiplicative P-adic numbers-related Automorphic Trimorphic Digit-composition related Palindromic Pandigital Repdigit Repunit Self-descriptive Smarandache–Wellin

Parameter word (1,743 words) [view diff] no match in snippet view article find links to article

In the mathematical study of combinatorics on words, a parameter word is a string over a given alphabet having some number of wildcard characters. The

Magma (algebra) (1,828 words) [view diff] no match in snippet view article

ISBN 978-0-8218-0495-7. Bourbaki, N. (1998) [1970], "Algebraic Structures: §1.1 Laws of Composition: Definition 1", Algebra I: Chapters 1–3, Springer, p. 1, ISBN 978-3-540-64243-5

Catalan number (5,932 words) [view diff] no match in snippet view article find links to article

many counting problems in combinatorics whose solution is given by the Catalan numbers. The book Enumerative Combinatorics: Volume 2 by combinatorialist

Symmetric group (6,212 words) [view diff] no match in snippet view article find links to article

theory, invariant theory, the representation theory of Lie groups, and combinatorics. Cayley's theorem states that every group G {\displaystyle G} is isomorphic

Dilworth's theorem (2,445 words) [view diff] no match in snippet view article find links to article

In mathematics, in the areas of order theory and combinatorics, Dilworth's theorem states that, in any finite partially ordered set, the maximum size

Free monoid (2,985 words) [view diff] no match in snippet view article find links to article

commutative monoids as instances. This generalization finds applications in combinatorics and in the study of parallelism in computer science. String operations

Outline of discrete mathematics (1,824 words) [view diff] no match in snippet view article find links to article

mathematics that studies sets Number theory – Branch of mathematics Combinatorics – Branch of discrete mathematics Finite mathematics – Syllabus in college

Umbral calculus (1,616 words) [view diff] no match in snippet view article find links to article

doi:10.1016/0022-247X(73)90172-8. G.-C. Rota and J. Shen, "On the Combinatorics of Cumulants", Journal of Combinatorial Theory, Series A, 91:283–304

Dedekind number (2,046 words) [view diff] no 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,

Robert Schneider (1,975 words) [view diff] no match in snippet view article find links to article

Michigan Technological University specializing in number theory and combinatorics, particularly the theory of integer partitions and analytic number theory

Twelvefold way (5,609 words) [view diff] no match in snippet view article find links to article

In combinatorics, the twelvefold way is a systematic classification of 12 related enumerative problems concerning two finite sets, which include the classical

Butcher group (4,050 words) [view diff] no match in snippet view article find links to article

that the derivatives of a composition of functions can be conveniently expressed in terms of rooted trees and their combinatorics. Connes & Kreimer (1999)

Centered hexagonal number (728 words) [view diff] no match in snippet view article find links to article

In mathematics and combinatorics, a centered hexagonal number, or centered hexagon number, is a centered figurate number that represents a hexagon with

Graph dynamical system (1,387 words) [view diff] no match in snippet view article find links to article

the research typically involves techniques from, e.g., graph theory, combinatorics, algebra, and dynamical systems rather than differential geometry. In

Linear extension (1,494 words) [view diff] no match in snippet view article find links to article

linear extensions of a finite poset is a common problem in algebraic combinatorics. This number is given by the leading coefficient of the order polynomial

Young's lattice (1,081 words) [view diff] no match in snippet view article find links to article

even decisive, role. Young's lattice prominently figures in algebraic combinatorics, forming the simplest example of a differential poset in the sense of

Fuss–Catalan number (2,119 words) [view diff] no match in snippet view article find links to article

be converted into a product, gamma or factorial representations too. Combinatorics Statistics Binomial coefficient Binomial distribution Catalan number

Lagrange inversion theorem (2,428 words) [view diff] no match in snippet view article find links to article

There is a special case of Lagrange inversion theorem that is used in combinatorics and applies when f ( w ) = w / ϕ ( w ) {\displaystyle f(w)=w/\phi (w)}

Partially ordered set (5,378 words) [view diff] no 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 Studies

Narayana number (1,088 words) [view diff] no match in snippet view article find links to article

In combinatorics, the Narayana numbers N ⁡ ( n , k ) , n ∈ N + , 1 ≤ k ≤ n {\displaystyle \operatorname {N} (n,k),n\in \mathbb {N} ^{+},1\leq k\leq n}

Stirling numbers of the second kind (4,328 words) [view diff] no match in snippet view article find links to article

In mathematics, particularly in combinatorics, a Stirling number of the second kind (or Stirling partition number) is the number of ways to partition

Hans Heinrich Bürmann (659 words) [view diff] no match in snippet view article find links to article

Grand Duchy of Baden in 1811. He did scientific research in the area of combinatorics and he contributed to the development of the symbolic language of mathematics

Euler numbers (2,049 words) [view diff] no match in snippet view article find links to article

functions. The latter is the function in the definition. They also occur in combinatorics, specifically when counting the number of alternating permutations of

Bell number (4,511 words) [view diff] no match in snippet view article find links to article

Donald E. (2013). "Two thousand years of combinatorics". In Wilson, Robin; Watkins, John J. (eds.). Combinatorics: Ancient and Modern. Oxford University

Cycle index (4,997 words) [view diff] no match in snippet view article find links to article

Combinatorics (2nd ed.), Boca Raton: CRC Press, pp. 472–479, ISBN 978-1-4200-9982-9 Tucker, Alan (1995), "9.3 The Cycle Index", Applied Combinatorics

Lah number (1,812 words) [view diff] no match in snippet view article find links to article

n\geq k\geq 1} . Unsigned Lah numbers have an interesting meaning in combinatorics: they count the number of ways a set of n {\textstyle n} elements can

Ira Gessel (560 words) [view diff] no match in snippet view article find links to article

Pennsylvania) is an American mathematician, known for his work in combinatorics. He is a long-time faculty member at Brandeis University and resides

Modular representation theory (2,613 words) [view diff] no match in snippet view article find links to article

mathematics, such as algebraic geometry, coding theory[citation needed], combinatorics and number theory. Within finite group theory, character-theoretic results

Operator algebra (545 words) [view diff] no match in snippet view article find links to article

on a topological vector space, with the multiplication given by the composition of mappings. The results obtained in the study of operator algebras are

Roger Lyndon (807 words) [view diff] no match in snippet view article find links to article

Perrin, Dominique (2007), "The origins of combinatorics on words" (PDF), European Journal of Combinatorics, 28 (3): 996–1022, doi:10.1016/j.ejc.2005.07

Restricted representation (3,061 words) [view diff] no match in snippet view article find links to article

in classical invariant theory and its modern counterpart, algebraic combinatorics. Example. The unitary group U(N) has irreducible representations labelled

Richard K. Guy (3,160 words) [view diff] no match in snippet view article find links to article

for his work in number theory, geometry, recreational mathematics, combinatorics, and graph theory. He is best known for co-authorship (with John Conway

Associative algebra (4,261 words) [view diff] no match in snippet view article find links to article

finite partially ordered sets are associative algebras considered in combinatorics. The partition algebra and its subalgebras, including the Brauer algebra

Comparability graph (1,398 words) [view diff] no match in snippet view article find links to article

Proceedings of the Thirty-Second Southeastern International Conference on Combinatorics, Graph Theory and Computing (Baton Rouge, LA, 2001), Congressus Numerantium

Knuth–Bendix completion algorithm (2,412 words) [view diff] no match in snippet view article find links to article

rewrite closure, (⟵R) is its converse, and (⁎⟶R ∘ ⁎⟵R) is the relation composition of their reflexive transitive closures (⁎⟶R and ⁎⟵R). For example, if

Graham–Rothschild theorem (1,220 words) [view diff] no match in snippet view article find links to article

Graham–Rothschild theorem is a theorem that applies Ramsey theory to combinatorics on words and combinatorial cubes. It is named after Ronald Graham and

Bicyclic semigroup (1,162 words) [view diff] no match in snippet view article find links to article

balanced pairs of parentheses. Thus, it finds common applications in combinatorics, such as describing binary trees and associative algebras. The first

Group theory (5,086 words) [view diff] no match in snippet view article find links to article

used for pattern recognition and other image processing techniques. In combinatorics, the notion of permutation group and the concept of group action are

Schuette–Nesbitt formula (2,873 words) [view diff] no match in snippet view article find links to article

identity operator I on the sequence space, Ek and Δk denote the k-fold composition. Direct proof of (5) by the operator method To prove (5), we first want

Generalizations of the derivative (3,555 words) [view diff] no match in snippet view article find links to article

possible generalizations within the fields of mathematical analysis, combinatorics, algebra, geometry, etc. The Fréchet derivative defines the derivative

List of unsolved problems in mathematics (20,026 words) [view diff] no match in snippet view article find links to article

such as theoretical physics, computer science, algebra, analysis, combinatorics, algebraic, differential, discrete and Euclidean geometries, graph theory

Riordan array (3,409 words) [view diff] no match in snippet view article find links to article

arrays is a field influenced by and contributing to other areas such as combinatorics, group theory, matrix theory, number theory, probability, sequences

Combinatorial chemistry (6,618 words) [view diff] no match in snippet view article find links to article

related to inventions in the domain of combinatorial chemistry: "C40B". Combinatorics Cheminformatics Combinatorial biology Drug discovery Dynamic combinatorial

Gowers' theorem (912 words) [view diff] no match in snippet view article find links to article

theorem and Gowers' FINk theorem, is a theorem in Ramsey theory and combinatorics. It is a Ramsey-theoretic result about functions with finite support

List of conjectures (1,461 words) [view diff] no match in snippet view article find links to article

Theory and Dynamical Systems in their Interactions with Arithmetics and Combinatorics: CIRM Jean-Morlet Chair, Fall 2016. Springer. p. 185. ISBN 9783319749082

Finite field (7,535 words) [view diff] no match in snippet view article find links to article

ISBN 9783110283600 Green, Ben (2005), "Finite field models in additive combinatorics", Surveys in Combinatorics 2005, Cambridge University Press, pp. 1–28, arXiv:math/0409420

Covering relation (480 words) [view diff] no match in snippet view article find links to article

Addison-Wesley, ISBN 0-321-33570-8. Stanley, Richard P. (1997), Enumerative Combinatorics, vol. 1 (2nd ed.), Cambridge University Press, ISBN 0-521-55309-1. Brian

Permutation pattern (4,037 words) [view diff] no match in snippet view article find links to article

Vatter, Vince (2006), "The Möbius function of a composition poset", Journal of Algebraic Combinatorics, 24 (2): 117–136, arXiv:math/0507485, doi:10

Oscar Nierstrasz (670 words) [view diff] no match in snippet view article find links to article

pursued his Bachelor studies in the Departments of Pure Mathematics and Combinatorics and Optimization at the University of Waterloo in 1979. He enrolled

Sorting number (436 words) [view diff] no match in snippet view article find links to article

Vincent (2018), "Universal layered permutations", Electronic Journal of Combinatorics, 25 (3): P23:1–P23:5, arXiv:1710.04240, doi:10.37236/7386, S2CID 52100342

Nielsen transformation (2,538 words) [view diff] no match in snippet view article find links to article

\ldots ,x_{i}x_{j},\ldots ,x_{n}]} . A Nielsen transformation is a finite composition of elementary Nielsen transformations. Since automorphisms of F n {\displaystyle

Section (category theory) (794 words) [view diff] no match in snippet view article

Splitting lemma Inverse function § Left and right inverses Transversal (combinatorics) Mac Lane (1978, p.19). Borsuk, Karol (1931), "Sur les rétractes", Fundamenta

Representation theory (7,269 words) [view diff] no match in snippet view article find links to article

analytic number theory, differential geometry, operator theory, algebraic combinatorics and topology. The success of representation theory has led to numerous

Train track map (2,675 words) [view diff] no match in snippet view article find links to article

homotopy equivalence. If σ : Γ → Rk is a homotopy inverse of τ then the composition σfτ : Rk → Rk induces an automorphism of Fk = π1(Rk) whose outer automorphism

Number theory (12,556 words) [view diff] no match in snippet view article find links to article

independent, but not quite. It is sometimes said that probabilistic combinatorics uses the fact that whatever happens with probability greater than 0

Cyclic order (6,392 words) [view diff] no match in snippet view article find links to article

"Reducts of Ramsey Structures", Model Theoretic Methods in Finite Combinatorics, Contemporary Mathematics, vol. 558, AMS, p. 489ff, arXiv:1105.6073

Natural number (5,889 words) [view diff] no match in snippet view article find links to article

divide evenly (divisibility), or how prime numbers are spread out. Combinatorics studies counting and arranging numbered objects, such as partitions

Affine symmetric group (10,247 words) [view diff] no match in snippet view article find links to article

a group with certain generators and relations. They are studied in combinatorics and representation theory. A finite symmetric group consists of all

Outline of academic disciplines (4,327 words) [view diff] no match in snippet view article find links to article

theory Analytic number theory Arithmetic combinatorics Geometric number theory Approximation theory Combinatorics (outline) Coding theory Cryptography Dynamical

Algebra (14,098 words) [view diff] no match in snippet view article find links to article

Algebra tile – Type of mathematical manipulative Algebraic combinatorics – Area of combinatorics C*-algebra – Topological complex vector space Clifford algebra –

Crystal structure prediction (1,454 words) [view diff] no match in snippet view article find links to article

molecular crystals, of its molecules) in space. The problem has two facets: combinatorics (the "search phase space", in practice most acute for inorganic crystals)

Frieze group (1,364 words) [view diff] no match in snippet view article find links to article

Horton Conway, Geoffrey Colin Shephard, Pierre Gabriel, and others in combinatorics and the theory of quiver representations. In the 21st century, new relations

Set theory (music) (2,636 words) [view diff] no match in snippet view article

Moreover, musical set theory is more closely related to group theory and combinatorics than to mathematical set theory, which concerns itself with such matters

Stirling number (4,065 words) [view diff] no match in snippet view article find links to article

relating three different sequences of polynomials that frequently arise in combinatorics. Moreover, all three can be defined as the number of partitions of n

Finite-state transducer (2,547 words) [view diff] no match in snippet view article find links to article

ISBN 978-0-521-19022-0. Zbl 1250.68007. Lothaire, M. (2005). Applied combinatorics on words. Encyclopedia of Mathematics and Its Applications. Vol. 105

Monoid (4,462 words) [view diff] no match in snippet view article find links to article

ISBN 978-3-642-24896-2. Zbl 1251.68135. Lothaire, M., ed. (1997), Combinatorics on words, Encyclopedia of Mathematics and Its Applications, vol. 17

Matrix (mathematics) (13,575 words) [view diff] no match in snippet view article

but soon grew to include subjects related to graph theory, algebra, combinatorics and statistics. A matrix is a rectangular array of numbers (or other

Squared triangular number (1,874 words) [view diff] no match in snippet view article find links to article

"A combinatorial proof of the sum of q-cubes", Electronic Journal of Combinatorics, 11 (1), Research Paper 9, doi:10.37236/1762, MR 2034423. Gulley, Ned

Comparability (716 words) [view diff] no match in snippet view article find links to article

incomparability is a transitive relation Trotter, William T. (1992), Combinatorics and Partially Ordered Sets:Dimension Theory, Johns Hopkins Univ. Press

Norm (mathematics) (5,937 words) [view diff] no match in snippet view article

descriptions of redirect targets Gowers norm – Class of norms in additive combinatorics Kadec norm – All infinite-dimensional, separable Banach spaces are homeomorphicPages

Change-making problem (1,353 words) [view diff] no match in snippet view article find links to article

Adamaszek, A. Niewiarowska (2010). "Combinatorics of the change-making problem". European Journal of Combinatorics. 31 (1): 47–63. arXiv:0801.0120. doi:10

Operad (5,457 words) [view diff] no match in snippet view article find links to article

MR 3643404, Zbl 1373.55014 Miguel A. Mendéz (2015). Set Operads in Combinatorics and Computer Science. SpringerBriefs in Mathematics. ISBN 978-3-319-11712-6

Calculus (disambiguation) (671 words) [view diff] no match in snippet view article

analysis), the study of numerical approximations Umbral calculus, the combinatorics of certain operations on polynomials The calculus of variations, a field

Groupoid (6,232 words) [view diff] no match in snippet view article find links to article

Zivaljevic. "Groupoids in combinatorics—applications of a theory of local symmetries". In Algebraic and geometric combinatorics, volume 423 of Contemp.

Logical matrix (1,989 words) [view diff] no match in snippet view article find links to article

array is a special case of a permutation matrix. An incidence matrix in combinatorics and finite geometry has ones to indicate incidence between points (or

Alberto Posadas (1,038 words) [view diff] no match in snippet view article find links to article

discovered new techniques for musical form creation such as mathematical combinatorics and the fractals. Nonetheless, his determination and constant search

Better-quasi-ordering (1,149 words) [view diff] no match in snippet view article find links to article

class of trees". In Rota, Gian-Carlo (ed.). Studies in foundations and combinatorics. Academic Press. pp. 31–48. ISBN 978-0-12-599101-8. MR 0520553.

List of group theory topics (800 words) [view diff] no match in snippet view article find links to article

Perfect group p-core Schreier refinement theorem Subgroup Transversal (combinatorics) Torsion subgroup Zassenhaus lemma Automorphism Automorphism group Factor

Binomial type (2,069 words) [view diff] no match in snippet view article find links to article

f^{-1}(D)p_{n}(x)=np_{n-1}(x).} The concept of binomial type has applications in combinatorics, probability, statistics, and a variety of other fields. List of factorial

Stirling numbers of the first kind (7,262 words) [view diff] no match in snippet view article find links to article

In mathematics, especially in combinatorics, Stirling numbers of the first kind arise in the study of permutations. In particular, the unsigned Stirling

Jakob Steiner (1,003 words) [view diff] no match in snippet view article find links to article

their areas. Steiner also made a small but important contribution to combinatorics. In 1853, Steiner published a two-page article in Crelle's Journal on

Texas sharpshooter fallacy (981 words) [view diff] no match in snippet view article find links to article

Explanations given after the fact Ramsey theory – Branch of mathematical combinatorics Scan statistic – Statistics scanning space or time for clusters of eventsPages

List of women in mathematics (23,282 words) [view diff] no match in snippet view article find links to article

mathematics PhD Margaret Bayer, American mathematician working in polyhedral combinatorics Pilar Bayer (born 1946), Spanish number theorist Eva Bayer-Fluckiger

Bashni (1,084 words) [view diff] no match in snippet view article find links to article

Column draughts are a subject of interest for the mathematical Sciences: combinatorics, theory of paired zero-sum games, etc. It is believed, the first description

Chess puzzle (663 words) [view diff] no match in snippet view article find links to article

problem, have connections to mathematics, especially to graph theory and combinatorics. Many famous mathematicians have studied such problems, including Euler

Affine geometry (2,632 words) [view diff] no match in snippet view article find links to article

of configurations in infinite affine spaces, in group theory, and in combinatorics. Despite being less general than the configurational approach, the other

Ball (association football) (2,528 words) [view diff] no match in snippet view article

The ball's spherical shape, as well as its size, mass, and material composition, are specified by Law 2 of the Laws of the Game maintained by the International

Leonardo number (1,292 words) [view diff] no match in snippet view article find links to article

generalized k-Leonardo and Gaussian Leonardo Numbers, Communications in Combinatorics and Optimization, 9 (3), 539-553. https://comb-opt.azaruniv.ac

List of aperiodic sets of tiles (2,554 words) [view diff] no match in snippet view article find links to article

Rao, Michaël (2021), "An aperiodic set of 11 Wang tiles", Advances in Combinatorics: Paper No. 1, 37, arXiv:1506.06492, doi:10.19086/aic.18614, MR 4210631

Weak ordering (4,360 words) [view diff] no match in snippet view article find links to article

with a given relation Roberts, Fred; Tesman, Barry (2011), Applied Combinatorics (2nd ed.), CRC Press, Section 4.2.4 Weak Orders, pp. 254–256, ISBN 9781420099836

Particle physics and representation theory (2,677 words) [view diff] no match in snippet view article find links to article

up to a phase factor. The composition of the operators U ( g ) {\displaystyle U(g)} should, therefore, reflect the composition law in G {\displaystyle G}

Topological quantum field theory (3,764 words) [view diff] no match in snippet view article find links to article

bordism. This is the composition law for morphisms in the cobordism category. Since functors are required to preserve composition, this says that the linear

Ronald C. Read (521 words) [view diff] no match in snippet view article find links to article

(with G. F. Royle) Chromatic Roots of Families of Graphs. Graph Theory, Combinatorics and Applications. John Wiley (1991) 1009 - 1029 Prospects for Graph-theoretical

Anhemitonic scale (2,570 words) [view diff] no match in snippet view article find links to article

Michael Keith, in From Polychords to Polya : Adventures in Musical Combinatorics (ISBN 978-0963009708), draws his list of basic harmonies as anhemitonic

History of group theory (3,571 words) [view diff] no match in snippet view article find links to article

corresponding classifications of primitive groups. In finite geometry and combinatorics, many problems could now be settled. The modular representation theory

Mariner 9 (2,624 words) [view diff] no match in snippet view article find links to article

Grey on YouTube Reed-Muller Code (64 Shades of Grey pt2) on YouTube "Combinatorics in Space The Mariner 9 Telemetry System" (PDF). Archived from the original

Hypergraph (6,817 words) [view diff] no match in snippet view article find links to article

considerable attention, particularly in the study of Hamiltonicity in extremal combinatorics. Rödl, Szemerédi, and Ruciński showed that every n {\displaystyle n}

1/3–2/3 conjecture (2,199 words) [view diff] no match in snippet view article find links to article

Trotter, William T. (1993), "Balancing pairs in partially ordered sets", Combinatorics, Paul Erdős is eighty, Bolyai Society Mathematical Studies, vol. 1,

Jacques Riguet (641 words) [view diff] no match in snippet view article find links to article

441 1989 : "Galois correspondences in category theory", Hesselberg-Combinatorics 1992: (with Rene Guitart) Enveloppe Karoubienne et categorie de Kleisli

Theory of computation (2,168 words) [view diff] no match in snippet view article find links to article

application of a basic function or follow from the entries above by using composition, primitive recursion or μ recursion. For instance if f ( x ) = h ( x

Institute of Mathematical Sciences (Spain) (983 words) [view diff] no match in snippet view article

the inclusion of research lines in Number Theory, Group Theory and Combinatorics in 2011. Among the research results obtained by researchers from the

Mathematical physics (5,512 words) [view diff] no match in snippet view article find links to article

parts of probability theory. There are increasing interactions between combinatorics and physics, in particular statistical physics. The usage of the term

Superalgebra (1,687 words) [view diff] no match in snippet view article find links to article

all linear maps) of a super vector space forms a superalgebra under composition. The set of all square supermatrices with entries in K forms a superalgebra

Forte number (813 words) [view diff] no match in snippet view article find links to article

version that is most dispersed away from the right. In the language of combinatorics, the Forte numbers correspond to the binary bracelets of length 12:

Hermite polynomials (12,144 words) [view diff] no match in snippet view article find links to article

the Edgeworth series, as well as in connection with Brownian motion; combinatorics, as an example of an Appell sequence, obeying the umbral calculus; numerical

Distributive lattice (2,061 words) [view diff] no match in snippet view article find links to article

"Distributive lattices, polyhedra, and generalized flows", European Journal of Combinatorics, 32 (1): 45–59, doi:10.1016/j.ejc.2010.07.011, MR 2727459. Peirce, Charles

Upper set (1,291 words) [view diff] no match in snippet view article find links to article

ISBN 0-521-78451-4. LCCN 2001043910. Stanley, R.P. (2002). Enumerative combinatorics. Cambridge studies in advanced mathematics. Vol. 1. Cambridge University

Abstract algebra (4,336 words) [view diff] no match in snippet view article find links to article

permutations closed under composition. Arthur Cayley's 1854 paper On the theory of groups defined a group as a set with an associative composition operation and the

Generating function (14,462 words) [view diff] no match in snippet view article find links to article

packages provided for non-commercial use on the RISC Combinatorics Group algorithmic combinatorics software site. Despite being mostly closed-source, particularly

Glossary of mathematical symbols (9,833 words) [view diff] no match in snippet view article find links to article

{\displaystyle \mathbb {R} } in combinatorics, one should immediately know that this denotes the real numbers, although combinatorics does not study the real

Well-quasi-ordering (3,055 words) [view diff] no match in snippet view article find links to article

1016/1385-7258(77)90067-1. Gasarch, W. (1998), "A survey of recursive combinatorics", Handbook of Recursive Mathematics, Vol. 2, Stud. Logic Found. Math

Random permutation statistics (11,998 words) [view diff] no match in snippet view article find links to article

series. An involution is a permutation σ so that σ2 = 1 under permutation composition. It follows that σ may only contain cycles of length one or two, i.e

Orbifold notation (1,192 words) [view diff] no match in snippet view article find links to article

for Surface Groups". In: M. W. Liebeck and J. Saxl (eds.), Groups, Combinatorics and Geometry, Proceedings of the L.M.S. Durham Symposium, July 5–15

Percolation theory (3,133 words) [view diff] no match in snippet view article find links to article

Yersinia pestis spreads. Bunkbed conjecture – Conjecture in probabilistic combinatorics Continuum percolation theory Critical exponent – Parameter describing

Palindrome (5,145 words) [view diff] no match in snippet view article find links to article

diophantine approximation", in Berthé, Valérie; Rigo, Michael (eds.), Combinatorics, automata, and number theory, Encyclopedia of Mathematics and its Applications

Schützenberger group (533 words) [view diff] no match in snippet view article find links to article

et al. (August 29, 1996). "Marcel-Paul Schützenberger (1920–1996)". The Electronic Journal of Combinatorics. 3. doi:10.37236/2063. Retrieved 2015-12-30.

Half-exponential function (1,160 words) [view diff] no match in snippet view article find links to article

D. T.; Nakano, Shin-ichi; Tokuyama, Takeshi (eds.). Computing and Combinatorics, 5th Annual International Conference, COCOON '99, Tokyo, Japan, July

Semigroup (4,714 words) [view diff] no match in snippet view article find links to article

ISBN 978-981-02-3316-7. Zbl 1079.20505. Lothaire, M. (2011) [2002]. Algebraic combinatorics on words. Encyclopedia of Mathematics and Its Applications. Vol. 90

Tree rearrangement (851 words) [view diff] no match in snippet view article find links to article

complexity of the rooted subtree prune and regraft distance". Annals of Combinatorics. 8 (4): 409–423. doi:10.1007/s00026-004-0229-z. S2CID 13002129. Whidden

Equivalence class (2,700 words) [view diff] no match in snippet view article find links to article

Mathematical construction of a set with an equivalence relation Transversal (combinatorics) – Set that intersects every one of a family of sets Devlin 2004, p

Timeline of number theory (742 words) [view diff] no match in snippet view article find links to article

Brahmagupta's identity and solves the so called Pell's equation using his composition method. ca. 650 — Mathematicians in India create the Hindu–Arabic numeral

Boltzmann sampler (2,949 words) [view diff] no match in snippet view article find links to article

of Boltzmann sampling is closely related to the symbolic method in combinatorics. Let C {\displaystyle {\mathcal {C}}} be a combinatorial class with

Cyclic permutation (2,039 words) [view diff] no match in snippet view article find links to article

Programming. Addison-Wesley. p. 35. Bogart, Kenneth P. (2000). Introductory combinatorics (3 ed.). London: Harcourt Academic Press. p. 554. ISBN 978-0-12-110830-4

Goldberg–Coxeter construction (1,928 words) [view diff] no match in snippet view article find links to article

constructions for 3-and 4-valent plane graphs". The Electronic Journal of Combinatorics. 11: #R20. doi:10.37236/1773. Deza, M.-M.; Sikirić, M. D.; Shtogrin

Alfred Pringsheim (3,098 words) [view diff] no match in snippet view article find links to article

necessarily a singularity at the point 1. This theorem is used in analytic combinatorics and the Perron–Frobenius theory of positive operators on ordered vector

Semiring (8,021 words) [view diff] no match in snippet view article find links to article

1007/978-94-015-9333-5, ISBN 0-7923-5786-8, MR 1746739 Lothaire, M. (2005). Applied combinatorics on words. Encyclopedia of Mathematics and Its Applications. Vol. 105

List of academic fields (4,652 words) [view diff] no match in snippet view article find links to article

Algebraic number theory Geometric number theory Arithmetic Arithmetic combinatorics Logic and Foundations of mathematics Set theory Proof theory Model theory

Square pyramidal number (2,323 words) [view diff] no match in snippet view article find links to article

"Revisiting the spreading and covering numbers", The Australasian Journal of Combinatorics, 56: 77–84, arXiv:1109.5847, MR 3097709 Conway, John H.; Guy, Richard

Automata theory (3,851 words) [view diff] no match in snippet view article find links to article

finite fields: the set of irreducible polynomials that can be written as composition of degree two polynomials is in fact a regular language. Another problem

Metric space (11,434 words) [view diff] no match in snippet view article find links to article

metric spaces (those having a finite number of points) are studied in combinatorics and theoretical computer science. Embeddings in other metric spaces

Cayley graph (4,692 words) [view diff] no match in snippet view article find links to article

Graham, Ronald L.; Grötschel, Martin; Lovász, László (eds.). Handbook of Combinatorics. Vol. 1. Elsevier. pp. 1447–1540. ISBN 9780444823465. White, Arthur

Geometry (10,101 words) [view diff] no match in snippet view article find links to article

Kneser-Poulsen conjecture, etc. It shares many methods and principles with combinatorics. Computational geometry deals with algorithms and their implementations

Gabriel Pareyon (2,727 words) [view diff] no match in snippet view article find links to article

{\displaystyle Fs} ω (i.e. Fourier spectrum) that represents specific combinatorics for a Dirichlet L-function, L {\displaystyle L} . Thus, sumarizing:

International Mathematical Olympiad selection process (6,884 words) [view diff] no match in snippet view article find links to article

four problem usually covering geometry, number theory, algebra, and combinatorics (elementary level) and last four hours each. After successfully completing

Median graph (6,003 words) [view diff] no match in snippet view article find links to article

"On the number of vertices and edges of the Buneman graph", Annals of Combinatorics, 1 (1): 329–337, doi:10.1007/BF02558484, MR 1630739, S2CID 120716928

Thābit ibn Qurra (3,235 words) [view diff] no match in snippet view article find links to article

the nature of solutions possible. In Thābit's case, he worked with combinatorics to work on the permutations needed to win a game of chess. In addition

Structural Ramsey theory (2,383 words) [view diff] no match in snippet view article find links to article

arXiv:1412.3254 [math.CO]. Larson, Jean A. (2012-01-01). "Infinite Combinatorics". In Gabbay, Dov M.; Kanamori, Akihiro; Woods, John (eds.). Handbook

Graph homomorphism (4,860 words) [view diff] no match in snippet view article find links to article

4086/toc.2010.v006a005 Cameron, Peter (2006), Graph Homomorphisms, Combinatorics Study Group Notes (PDF) Hell, Pavol; Nešetřil, Jaroslav (2004), Graphs

Multivariable calculus (2,369 words) [view diff] no match in snippet view article find links to article

superposition from single-variable calculus carry over to multivariate calculus. Composition: If f : R n → R m {\displaystyle f:\mathbb {R} ^{n}\to \mathbb {R} ^{m}}

Shaw Prize (3,546 words) [view diff] no match in snippet view article find links to article

application to partial differential equations, mathematical physics, combinatorics, number theory, ergodic theory and theoretical computer science. 2011

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

(1978), "Enumeration of isomorphism classes of semiorders", Journal of Combinatorics, Information &System Sciences, 3 (2): 58–61, MR 0538212. Luce, R. Duncan

TC0 (4,889 words) [view diff] no match in snippet view article find links to article

the counting hierarchy". Proceedings 2nd International Computing and Combinatorics Conference (COCOON). Springer Lecture Notes in Computer Science. Vol

Klavierstücke (Stockhausen) (11,977 words) [view diff] no match in snippet view article

Klavierstücke (German for "Piano Pieces") constitute a series of nineteen compositions by German composer Karlheinz Stockhausen. Stockhausen has said the Klavierstücke

Lattice (order) (5,872 words) [view diff] no match in snippet view article

sec II.8. ISBN 9780821810255. Stanley, Richard P (1997), Enumerative Combinatorics (vol. 1), Cambridge University Press, pp. 103–104, ISBN 0-521-66351-2

Minkowski's question-mark function (3,857 words) [view diff] no match in snippet view article find links to article

Christian; Siegel, A. (eds.), Substitutions in dynamics, arithmetics and combinatorics, Lecture Notes in Mathematics, vol. 1794, Berlin: Springer-Verlag,

Special classes of semigroups (428 words) [view diff] no match in snippet view article find links to article

generalizations and special subclasses" in Advances in Algebra and Combinatorics edited by K P Shum et al. (2008), World Scientific, ISBN 981-279-000-4

Algorithm (6,907 words) [view diff] no match in snippet view article find links to article

engineering Algorithm characterizations Algorithmic bias Algorithmic composition Algorithmic entities Algorithmic synthesis Algorithmic technique Algorithmic

Order theory (4,510 words) [view diff] no match in snippet view article find links to article

equations Functional analysis Harmonic analysis Measure theory Discrete Combinatorics Graph theory Order theory Geometry Algebraic Analytic Arithmetic Differential

Exponentiation (13,629 words) [view diff] no match in snippet view article find links to article

{\displaystyle 0^{-n}=1/0^{n}=1/0} is undefined. In some contexts (e.g., combinatorics), the expression 00 is defined to be equal to 1 {\displaystyle 1} ;

Morristown High School (4,788 words) [view diff] no match in snippet view article find links to article

Morristown, N.J. Morristown High School" Peck, G. W. (2002). "Kleitman and Combinatorics: A Celebration". Discrete Mathematics. 257 (2–3): 194. doi:10

Gersonides (2,930 words) [view diff] no match in snippet view article find links to article

early use of proof by mathematical induction, and pioneering work in combinatorics. The title Maaseh Hoshev literally means the Work of the thinker, but

Liina Pylkkänen (543 words) [view diff] no match in snippet view article find links to article

became interested in the neural mechanisms that are responsible for the combinatorics of language and syntactic structure building. Her research showed that

Ring (mathematics) (13,738 words) [view diff] no match in snippet view article

the simplicial complex, so it is of particular interest in algebraic combinatorics. In particular, the algebraic geometry of the Stanley–Reisner ring was

Modular lattice (2,417 words) [view diff] no match in snippet view article find links to article

P. (2007), "An Introduction to Hyperplane Arrangements", Geometric combinatorics, IAS/Park City Mathematics Series, vol. 13, American Mathematical Society

HSE Faculty of Mathematics (2,070 words) [view diff] no match in snippet view article find links to article

Alexander Kuznetsov (Algebraic and Complex Geometry) Grigory Olshansky (Combinatorics) International partnerships and student exchange programs in Mathematics

Square (8,941 words) [view diff] no match in snippet view article find links to article

squares in squares: a survey and new results". Electronic Journal of Combinatorics. 1000. Dynamic Survey 7. doi:10.37236/28. MR 1668055. Archived from

Quirinus Kuhlmann (1,820 words) [view diff] no match in snippet view article find links to article

read all the sonnet's redundant permutations. This fascination with combinatorics (a mechanical means of determining the possible permutations and range

Italo Jose Dejter (5,660 words) [view diff] no match in snippet view article find links to article

"Square-blocking edge subsets in hypercubes and vertex avoidance", Graph theory, combinatorics, algorithms, and applications (San Francisco, CA, 1989), 162–174, SIAM

Indian mathematics (13,949 words) [view diff] no match in snippet view article find links to article

Ganita Kaumudi is one of the most revolutionary works in the field of combinatorics with developing a method for systematic generation of all permutations

Birkhoff's representation theorem (2,980 words) [view diff] no match in snippet view article find links to article

1112/plms/s3-24.3.507, hdl:10338.dmlcz/134149. Stanley, R. P. (1997), Enumerative Combinatorics, Volume I, Cambridge Studies in Advanced Mathematics 49, Cambridge University

Cardinality (8,246 words) [view diff] no match in snippet view article find links to article

correspondence exists is not always trivial, which is the subject matter of combinatorics. An intuitive property of finite sets is that, for example, if a set

Seminorm (6,145 words) [view diff] no match in snippet view article find links to article

descriptions of redirect targets Gowers norm – Class of norms in additive combinatorics Locally convex topological vector space – Vector space with a topology

Sperner's theorem (2,010 words) [view diff] no match in snippet view article find links to article

portal Dilworth's theorem Erdős–Ko–Rado theorem Anderson, Ian (1987), Combinatorics of Finite Sets, Oxford University Press. Beck, Matthias; Zaslavsky,

General linear group (3,929 words) [view diff] no match in snippet view article find links to article

Qiang Wang (2014). Algebraic Monoids, Group Embeddings, and Algebraic Combinatorics. Springer. p. 142. ISBN 978-1-4939-0938-4. Milnor, John Willard (1971)

Timeline of category theory and related mathematics (273 words) [view diff] no match in snippet view article find links to article

quantization 1978 André Joyal Combinatorial species in enumerative combinatorics 1978 Don Anderson Building on work of Kenneth Brown defines ABC (co)fibration

Francesco Faà di Bruno (1,838 words) [view diff] no match in snippet view article find links to article

24 October 1988, p. 15). In addition to some ascetical writings, the composition of some sacred melodies, and the invention of some scientific apparatus

Conway polyhedron notation (2,673 words) [view diff] no match in snippet view article find links to article

constructions for 3-and 4-valent plane graphs". The Electronic Journal of Combinatorics. 11: #R20. doi:10.37236/1773. Deza, M.-M.; Sikirić, M. D.; Shtogrin

Beckman–Quarles theorem (2,473 words) [view diff] no match in snippet view article find links to article

(2012), Sparsity: Graphs, Structures, and Algorithms, Algorithms and Combinatorics, vol. 28, Heidelberg: Springer, p. 43, doi:10.1007/978-3-642-27875-4

Tetris (10,925 words) [view diff] no match in snippet view article find links to article

Approximate (PDF). Proceedings of the 9th International Computing and Combinatorics Conference (COCOON 2003). Big Sky, Montana. Archived (PDF) from the

Field (mathematics) (10,305 words) [view diff] no match in snippet view article

y2 = x3 + ax + b. Finite fields are also used in coding theory and combinatorics. Functions on a suitable topological space X into a field F can be added

Vladimir Arnold (5,054 words) [view diff] no match in snippet view article find links to article

Vassiliev, Oleg Ya. Viro (Eds.). Collected Works, Volume VI: Dynamics, Combinatorics, and Invariants of Knots, Curves, and Wave Fronts 1992–1995. Springer

History of geometry (6,299 words) [view diff] no match in snippet view article find links to article

Thābit ibn Qurra, using what he called the method of reduction and composition, provided two different general proofs of the Pythagorean theorem for

Go (game) (16,260 words) [view diff] no match in snippet view article

Retrieved 2007-11-30. Tromp, John; Farnebäck, Gunnar (January 31, 2016). "Combinatorics of Go" (PDF). tromp.github.io. Archived (PDF) from the original on January

List of University of Michigan faculty and staff (7,280 words) [view diff] no match in snippet view article find links to article

Research Fellow (2011) Alexander Barvinok (1994–), professor; works on the combinatorics and computational complexity of polytopes with symmetry Hyman Bass (1999–)

Carnegie Mellon University (13,387 words) [view diff] no match in snippet view article find links to article

Media 1 History 43 Mathematics 21 Mathematics-Discrete Mathematics and Combinatorics 4 Mathematics-Applied Math 12 Physics 32 Public Affairs 12 Public Affairs-Information

John von Neumann (23,696 words) [view diff] no match in snippet view article find links to article

According to Dieudonné, his specific genius was in analysis and "combinatorics", with combinatorics being understood in a very wide sense that described his ability

Feedback arc set (6,130 words) [view diff] no match in snippet view article find links to article

minimum feedback arc set problem is NP-hard for tournaments" (PDF), Combinatorics, Probability and Computing, 16 (1): 1–4, doi:10.1017/S0963548306007887

Pentagram map (6,298 words) [view diff] no match in snippet view article find links to article

identified the pentagram map as a special case of a cluster algebra. Combinatorics Periodic table of shapes Schwartz, Richard Evan (1992). "The Pentagram

Inferring horizontal gene transfer (8,981 words) [view diff] no match in snippet view article find links to article

Operations and Their Induced Metrics on Evolutionary Trees". Annals of Combinatorics. 5: 1–15. CiteSeerX 10.1.1.24.8389. doi:10.1007/s00026-001-8006-8. S2CID 2934442

Trigonometric functions (10,740 words) [view diff] no match in snippet view article find links to article

Sherbert 1999, p. 247. Whitaker and Watson, p 584 Stanley, Enumerative Combinatorics, Vol I., p. 149 Abramowitz; Weisstein. Lambert, Johann Heinrich (2004)

Allocation (oil and gas) (4,738 words) [view diff] no match in snippet view article

streams to be allocated may be split up by boiling point fractions. Other combinatorics on the allocation term include production allocation, hydrocarbon allocation

Oriented matroid (3,970 words) [view diff] no match in snippet view article find links to article

Günter (1998). "Oriented Matroids Today". The Electronic Journal of Combinatorics: DS4: Sep 10–1998. doi:10.37236/25. Malkevitch, Joseph. "Oriented Matroids:

Xuan tu (532 words) [view diff] no match in snippet view article find links to article

is one of the oldest Chinese texts on mathematics. The exact date of composition of the book has not been determined. Some estimates of the date range

List of Yale University people (23,881 words) [view diff] no match in snippet view article find links to article

made fundamental contributions to Lie Groups, Quantum Mechanics and Combinatorics Leslie Greengard (M.D., Ph.D. 1987), former director of the NYU Courant

List of University of Michigan alumni (24,101 words) [view diff] no match in snippet view article find links to article

Medal winner. Solved various famous unsolved problems in the field of combinatorics, and considered the main contributor to the creation of Combinatorial

Generating function transformation (11,140 words) [view diff] no match in snippet view article find links to article

Handbook. See section 3.5 in Riordan's book. Comtet, L. (1974). Advanced Combinatorics (PDF). D. Reidel Publishing Company. ISBN 9027703809. Archived from

List of Indian inventions and discoveries (22,431 words) [view diff] no match in snippet view article find links to article

Brahmagupta formula Brahmagupta theorem Combinatorics – the Bhagavati Sutra had the first mention of a combinatorics problem; the problem asked how many possible

Stochastic process (18,657 words) [view diff] no match in snippet view article find links to article

probability measure, the symbol ∘ {\displaystyle \circ } denotes function composition and X − 1 {\displaystyle X^{-1}} is the pre-image of the measurable function

Nicolas Bourbaki (11,924 words) [view diff] no match in snippet view article find links to article

differential equations, nothing about probability. There is also nothing about combinatorics, nothing about algebraic topology, nothing about concrete geometry.

History of science (23,303 words) [view diff] no match in snippet view article find links to article

mathematical operations. The work anticipated many developments in combinatorics. Between the 14th and 16th centuries, the Kerala school of astronomy

Timeline of scientific discoveries (10,608 words) [view diff] no match in snippet view article find links to article

arithmetical triangle", in Wilson, Robin; Watkins, John J. (eds.), Combinatorics: Ancient and Modern, Oxford University Press, pp. 166–180 Amulya Kumar

Graphon (5,460 words) [view diff] no match in snippet view article find links to article

(1993). "A correlation inequality for bipartite graphs". Graphs and Combinatorics. 9 (2–4): 201–204. doi:10.1007/BF02988307. Hatami, H. (2010). "Graph

List of University of California, Berkeley faculty (15,295 words) [view diff] no match in snippet view article find links to article

Mathematics "for multiple transformative contributions to analysis, combinatorics, partial differential equations, high-dimensional geometry and number

Ancestral reconstruction (13,030 words) [view diff] no match in snippet view article find links to article

ISSN 0196-6774. Fertin G, Labarre A, Rusu I, Vialette S, Tannier E (2009). Combinatorics of Genome Rearrangements. MIT Press. doi:10.7551/mitpress/9780262062824

Locally decodable code (3,060 words) [view diff] no match in snippet view article find links to article

Decodable Codes" (PDF). Sergey Yekhanin. "Locally Decodable Codes" (PDF). "Combinatorics in Space The Mariner 9 Telemetry System" (PDF). Sergey Yekhanin. "Private

List of University of Washington people (9,099 words) [view diff] no match in snippet view article find links to article

sets, functional analysis, analysis of algorithms, optimization, and combinatorics; president of the Mathematical Association of America, 1971–1973; a

Gauge theory (mathematics) (11,468 words) [view diff] no match in snippet view article

(of P {\displaystyle P} or E {\displaystyle E} ) form a group under composition, called the gauge group, typically denoted G {\displaystyle {\mathcal

Glossary of set theory (11,628 words) [view diff] no match in snippet view article find links to article

hierarchy in recursion theory. König's lemma A result in graph theory and combinatorics stating that every infinite, finitely branching tree has an infinite

David Pentecost (2,817 words) [view diff] no match in snippet view article find links to article

Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO). pp. 8–22. arXiv:1608.04906. doi:10.1137/1.9781611975062.2

List of set identities and relations (29,862 words) [view diff] no match in snippet view article find links to article

of a function Inclusion–exclusion principle – Counting technique in combinatorics Intersection (set theory) – Set of elements common to all of some sets

Chronological calculus (2,133 words) [view diff] no match in snippet view article find links to article

Indust. Teubner, Stuttgart. pp. 111–128. Kawski, Matthias (2002). The combinatorics of nonlinear controllability and noncommuting flows. ICTP Lect. Notes

List of agnostics (35,733 words) [view diff] no match in snippet view article find links to article

to 1953 at Stanford University. He made fundamental contributions to combinatorics, number theory, numerical analysis and probability theory. He is also

Titles of distinction awarded by the University of Oxford (16,985 words) [view diff] no match in snippet view article find links to article

McDiarmid, MA, MSc, DPhil, Fellow of Corpus Christi College: Professor of Combinatorics R.A. Cooper, MA, DPhil, Fellow of Brasenose College: Professor of French

Filters in topology (30,861 words) [view diff] no match in snippet view article find links to article

logic, model theory (ultraproducts, for example), abstract algebra, combinatorics, dynamics, order theory, generalized convergence spaces, Cauchy spaces

List of atheists in science and technology (28,276 words) [view diff] no match in snippet view article find links to article

history, working with hundreds of collaborators. He worked on problems in combinatorics, graph theory, number theory, classical analysis, approximation theory

Plancherel theorem for spherical functions (11,769 words) [view diff] no match in snippet view article find links to article

alternating sum of multidimensional Godement-type integrals, whose combinatorics is governed by that of the Cartan-Helgason theorem for U/K0. An equivalent

History of the function concept (10,688 words) [view diff] no match in snippet view article find links to article

calculus consisting of only three functions: Constancy, fusion (i.e., composition), and mutual exclusivity. Quine notes that Haskell Curry (1958) carried

Parabolic subgroup of a reflection group (3,983 words) [view diff] no match in snippet view article find links to article

1515/jgth-2016-0025, S2CID 44035800 Björner, Anders; Brenti, Francesco (2005), Combinatorics of Coxeter groups, Springer, doi:10.1007/3-540-27596-7, ISBN 978-3540-442387

Radoslav Kratina (6,179 words) [view diff] no match in snippet view article find links to article

attractive dynamic drive of kinetic art in favour of modest manual combinatorics. These "toys for adults", as Arsén Pohribný called them, indeed offered