Find link

language:

Find link is a tool written by Edward Betts.

searching for Necklace (combinatorics) 15 found (26 total)

alternate case: necklace (combinatorics)

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

Combinatorics is an area of mathematics primarily concerned with counting, both as a means and as an end to obtaining results, and certain properties

Hobby–Rice theorem (461 words) [view diff] no match in snippet view article find links to article

In mathematics, and in particular the necklace splitting problem, the Hobby–Rice theorem is a result that is useful in establishing the existence of certain

Topological combinatorics (476 words) [view diff] no match in snippet view article find links to article

discipline of topological combinatorics is the application of topological and algebro-topological methods to solving problems in combinatorics. The discipline of

Noga Alon (1,336 words) [view diff] no match in snippet view article find links to article

mathematics at Princeton University noted for his contributions to combinatorics and theoretical computer science, having authored hundreds of papers

Using the Borsuk–Ulam Theorem (530 words) [view diff] no match in snippet view article find links to article

applications to combinatorics and geometry begin in the third chapter, with topics including the ham sandwich theorem, the necklace splitting problem

Gian-Carlo Rota (1,086 words) [view diff] no match in snippet view article find links to article

career at the Massachusetts Institute of Technology, where he worked in combinatorics, functional analysis, probability theory, and phenomenology. Rota was

Hall word (3,281 words) [view diff] no match in snippet view article find links to article

In mathematics, in the areas of group theory and combinatorics, Hall words provide a unique monoid factorisation of the free monoid. They are also totally

Cyclotomic identity (283 words) [view diff] no match in snippet view article find links to article

_{j=1}^{\infty }\left({1 \over 1-z^{j}}\right)^{M(\alpha ,j)}} where M is Moreau's necklace-counting function, M ( α , n ) = 1 n ∑ d | n μ ( n d ) α d , {\displaystyle

Borsuk–Ulam theorem (2,497 words) [view diff] no match in snippet view article find links to article

in general this is not true for other functions A. Topological combinatorics Necklace splitting problem Ham sandwich theorem Kakutani's theorem (geometry)

Inclusion–exclusion principle (6,851 words) [view diff] no match in snippet view article find links to article

In combinatorics, the inclusion–exclusion principle is a counting technique which generalizes the familiar method of obtaining the number of elements

Free Lie algebra (1,272 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

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

Douglas West (mathematician) (203 words) [view diff] no match in snippet view article

Erdős–Gallai theorem Necklace splitting problem Douglas Brent West at the Mathematics Genealogy Project Peck, G. W. (2002), "Kleitman and combinatorics: a celebration"

Witt vector (7,686 words) [view diff] no match in snippet view article find links to article

p-adically complete. p-derivation Formal group Artin–Hasse exponential Necklace ring Fisher, Benji (1999). "Notes on Witt Vectors: a motivated approach"

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