|
List Of Things Named After Stanislaw Ulam
This is a (partial) list of things named after Stanislaw Ulam, a 20th-century Polish-American mathematician who also worked in physics and biological sciences: Computer science *Stan, probabilistic programming language Mathematics * Borsuk–Ulam theorem *Erdős–Ulam problem * Fermi–Pasta–Ulam–Tsingou problem *Hyers–Ulam–Rassias stability * Kuratowski–Ulam theorem *Mazur–Ulam theorem * Ulam's conjecture **Collatz conjecture ** Kelly–Ulam conjecture, or reconstruction conjecture **Ulam's packing conjecture *Ulam matrix *Ulam numbers * Ulam spiral *Ulam's game * Ulam–Warburton cellular automaton Physics * Fermi–Pasta–Ulam–Tsingou problem * Fermi–Ulam model *Teller–Ulam design See also *{{intitle, Ulam Ulam Ulam may refer to: * ULAM, the ICAO airport code for Naryan-Mar Airport, Russia * Ulam (surname) * Ulam (salad), a type of Malay salad * ''Ulam'', a Filipino term loosely translated to viand or side dish; see Tapa (Filipino cuisine) * Ulam, the ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Stanislaw Ulam
Stanisław Marcin Ulam (; 13 April 1909 – 13 May 1984) was a Polish-American scientist in the fields of mathematics and nuclear physics. He participated in the Manhattan Project, originated the Teller–Ulam design of thermonuclear weapons, discovered the concept of the cellular automaton, invented the Monte Carlo method of computation, and suggested nuclear pulse propulsion. In pure and applied mathematics, he proved some theorems and proposed several conjectures. Born into a wealthy Polish Jewish family, Ulam studied mathematics at the Lwów Polytechnic Institute, where he earned his PhD in 1933 under the supervision of Kazimierz Kuratowski and Włodzimierz Stożek. In 1935, John von Neumann, whom Ulam had met in Warsaw, invited him to come to the Institute for Advanced Study in Princeton, New Jersey, for a few months. From 1936 to 1939, he spent summers in Poland and academic years at Harvard University in Cambridge, Massachusetts, where he worked to establish import ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Kelly–Ulam Conjecture
Informally, the reconstruction conjecture in graph theory says that graphs are determined uniquely by their subgraphs. It is due to KellyKelly, P. J.A congruence theorem for trees ''Pacific J. Math.'' 7 (1957), 961–968. and Ulam.Ulam, S. M., A collection of mathematical problems, Wiley, New York, 1960. Formal statements Given a graph G = (V,E), a vertex-deleted subgraph of G is a subgraph formed by deleting exactly one vertex from G. By definition, it is an induced subgraph of G. For a graph G, the deck of G, denoted D(G), is the multiset of isomorphism classes of all vertex-deleted subgraphs of G. Each graph in D(G) is called a card. Two graphs that have the same deck are said to be hypomorphic. With these definitions, the conjecture can be stated as: * Reconstruction Conjecture: Any two hypomorphic graphs on at least three vertices are isomorphic. : (The requirement that the graphs have at least three vertices is necessary because both graphs on two vertices h ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Fermi–Ulam Model
The Fermi–Ulam model (FUM) is a dynamical system that was introduced by Poland, Polish mathematician Stanislaw Ulam in 1961. FUM is a variant of Enrico Fermi's primary work on acceleration of cosmic rays, namely Fermi acceleration. The system consists of a particle that elastic collision, collides elastically between a fixed wall and a moving one, each of infinite mass. The walls represent the magnetic mirrors with which the cosmic rays, cosmic particles collide. A. J. Lichtenberg and M. A. Lieberman provided a simplified version of FUM (SFUM) that derives from the Poincaré map, Poincaré surface of section x=const. and writes : u_=, u_n+U_\mathrm(\varphi_n), : \varphi_=\varphi_n+\frac \pmod k, where u_n is the velocity of the particle after the n-th collision with the fixed wall, \varphi_n is the corresponding phase of the moving wall, U_\mathrm is the velocity law of the moving wall and M is the stochasticity parameter of the system. If the velocity law of the m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Ulam–Warburton Automaton
The Ulam–Warburton cellular automaton (UWCA) is a 2-dimensional fractal pattern that grows on a regular grid of cells consisting of squares. Starting with one square initially ON and all others OFF, successive iterations are generated by turning ON all squares that share precisely one edge with an ON square. This is the von Neumann neighborhood. The automaton is named after the Polish-American mathematician and scientist Stanislaw Ulam and the Scottish engineer, inventor and List of amateur mathematicians, amateur mathematician Mike Warburton. Properties and relations The UWCA is a 2D 5-neighbor outer totalistic cellular automaton using rule 686. The number of cells turned ON in each iteration is denoted u(n), with an explicit formula: u(0)=0, u(1)=1, and for n \ge 2 u(n) = 4\cdot 3^ where wt(n) is the Hamming weight function which counts the number of 1's in the binary expansion of n wt(n)=n-\sum_^ \left\lfloor\frac\right\rfloor The minimum upper bound of summation for ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
