Search results

In [[algebraic topology]], '''Hilton's theorem''', proved by {{harvs|txt|first {{harvs|txt|first=John|last=Milnor|authorlink=John Milnor|year=1972}} showed more generally that the loop space of the [[Suspension (topology)| ...

{{Short description|Class of algorithms in information theory}} ...imoto algorithm''' is often used to refer to a class of [[algorithm]]s for computing numerically either the [[Information theory|information theoretic]] [[Chann ...

{{Short description|Italian professor of quantum computing (born 1972)}} | caption = Morello in 2019 ...

In [[graph theory]], a branch of mathematics, '''graph canonization''' is the | series = Lecture Notes in Comput. Sci. ...

...y form the finest partition of the set of vertices that is totally ordered in this way. The weak components were defined in a 1972 paper by [[Ronald Graham]], [[Donald Knuth]], and (posthumously) [[Theodore ...

...]].<ref>{{cite journal|title=C. Bernardini et al. – Lifetime and beam size in a Storage Ring|journal=Physical Review Letters|volume=10|issue=9|pages=407– In fact, since the momentum acceptance for scattering with energy gain may be ...

...the items into bins of fixed capacity, such that the sum of sizes of items in each bin is at most the capacity. Ideally, we would like to use as few bins ...mal number of bins possible for the list L. The analysis of FF(L) was done in several steps. ...

...mb|The blue region is the relative convex hull of the finite set of points in the yellow simple polygon]] In [[discrete geometry]] and [[computational geometry]], the '''relative conve ...

...d after [[Morton L. Curtis]], [[Gustav A. Hedlund]], and [[Roger Lyndon]]; in his 1969 paper stating the theorem, Hedlund credited Curtis and Lyndon as c ...id = 21803927 }}.</ref> It has been called "one of the fundamental results in symbolic dynamics".<ref>{{citation ...

'''AN codes''' are [[error-correcting code]] that are used in arithmetic applications. ...=E. J. Weldon |title=Error-Correcting Codes, second edition |date=15 March 1972 |publisher=MIT Press |isbn=978-0-262-52731-6 |language=en}}</ref> ...

...the items into bins of fixed capacity, such that the sum of sizes of items in each bin is at most the capacity. Ideally, we would like to use as few bins ...ny. The ''load'' of a bin is defined as the sum of sizes of existing items in the bin before placing the new item. ...

{{Short description|Group-like structure appearing in global fields}} ...rastructure''' is a [[Group (mathematics)|group]]-like structure appearing in [[global field]]s. ...

{{Short description|Computing the fixed point of a function}} ...quilibrium]], in [[game theory]] for computing a [[Nash equilibrium]], and in [[dynamic system]] analysis. ...

...tern]] 231; they are counted by the [[Catalan number]]s, and may be placed in [[bijection]] with many other combinatorial objects with the same counting ...sorted: the three elements are all pushed onto the stack, and then popped in the order 1,2,3. However, the sequence 2,3,1 is not correctly sorted: the a ...

In the [[mathematics|mathematical]] field of [[graph theory]], the '''odd grap ...]] in the graph has an "odd man out", an element that does not participate in the two sets connected by the edge. ...

[[File:Polytrees in a tournament.svg|thumb|upright=1.3|A 6-vertex tournament, and copies of eve ...ure in [[extremal graph theory]] on oriented [[tree (graph theory)|trees]] in [[tournament (graph theory)|tournaments]]. It states that every [[Orientati ...

...[Ackermann function]]. For other uses, see [[Ackermann (disambiguation)]]}}In [[control theory]], '''Ackermann's formula''' provides a method for designi ...atisierungstechnik |volume=20 |issue=1–12 |pages=297–300 |doi=10.1524/auto.1972.20.112.297 |issn=2196-677X |s2cid=111291582}}</ref> is particularly useful ...

...red structures and partitions as a Ph.D. student at [[Harvard University]] in 1971 under the guidance of [[Gian-Carlo Rota]]. ...tially ordered set|poset]] with <math>p</math> elements denoted <math>x,y \in P</math>, and let <math>[n]=\{1<2<\ldots<n\}</math> be a [[total order|chai ...

{{Short description|Flip distance in triangulations}} ...en two triangles in the triangulation and then adds the other [[diagonal]] in the edge's enclosing [[quadrilateral]], forming a different triangulation o ...

In [[Graph (discrete mathematics)|graph theory]], the '''modular decomposition ...f modular quotients and the graph decomposition they give rise to appeared in ([[Tibor Gallai|Gallai]] 1967). ...