|
Ilona Palásti
Ilona Palásti (1924–1991) was a Hungarian mathematician who worked at the Alfréd Rényi Institute of Mathematics. She is known for her research in discrete geometry, geometric probability, and the theory of random graphs. With Alfréd Rényi and others, she was considered to be one of the members of the Hungarian School of Probability. Contributions In connection to the Erdős distinct distances problem, Palásti studied the existence of point sets for which the ith least frequent distance occurs i times. That is, in such points there is one distance that occurs only once, another distance that occurs exactly two times, a third distance that occurs exactly three times, etc. For instance, three points with this structure must form an isosceles triangle. Any n evenly-spaced points on a line or circular arc also have the same property, but Paul Erdős asked whether this is possible for points in general position (no three on a line, and no four on a circle). Palásti found an eigh ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Alfréd Rényi Institute Of Mathematics
The Alfréd Rényi Institute of Mathematics ( hu, Rényi Alfréd Matematikai Kutatóintézet) is the research institute in mathematics of the Hungarian Academy of Sciences. It was created in 1950 by Alfréd Rényi, who directed it until his death. Since its creation, the institute has been the center of mathematical research in Hungary. It received the title ''Centre of Excellence of the European Union'' (2001). The current director is András Stipsicz. The institute publishes the research journal Studia Scientiarum Mathematicarum Hungarica. Research divisions and research groups * Algebra (head: Mátyás Domokos) * Algebraic geometry and differential topology (head: András Némethi) * Algebraic Logic (head: Hajnal Andréka) * Analysis (head: András Kroó) * Combinatorics and discrete mathematics (head: Ervin Győri) * Geometry (head: Gábor Fejes Tóth) * Number theory (head: János Pintz) * Probability & statistics (head: Péter Major) * Set theory and general topology ( ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Zoltán Füredi
Zoltán Füredi (Budapest, Hungary, 21 May 1954) is a Hungarian people, Hungarian mathematician, working in combinatorics, mainly in discrete geometry and extremal combinatorics. He was a student of Gyula O. H. Katona. He is a corresponding member of the Hungarian Academy of Sciences (2004). He is a research professor of the Alfréd Rényi Institute of Mathematics, Rényi Mathematical Institute of the Hungarian Academy of Sciences, and a professor at the University of Illinois Urbana-Champaign (UIUC). Füredi received his Candidate of Sciences degree in mathematics in 1981 from the Hungarian Academy of Sciences. Some results * In infinitely many cases he determined the maximum number of edges in a Graph (discrete mathematics), graph with no cycle graph, ''C''4. * With Paul Erdős he proved that for some ''c''>1, there are ''c''''d'' points in ''d''-dimensional space such that all triangles formed from those points are triangle#By internal angles, acute. * With Imre Bárány he pro ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Women Mathematicians
A woman is an adult female human. Prior to adulthood, a female human is referred to as a girl (a female child or adolescent). The plural ''women'' is sometimes used in certain phrases such as "women's rights" to denote female humans regardless of age. Typically, women inherit a pair of X chromosomes, one from each parent, and are capable of pregnancy and giving birth from puberty until menopause. More generally, sex differentiation of the female fetus is governed by the lack of a present, or functioning, SRY-gene on either one of the respective sex chromosomes. Female anatomy is distinguished from male anatomy by the female reproductive system, which includes the ovaries, fallopian tubes, uterus, vagina, and vulva. A fully developed woman generally has a wider pelvis, broader hips, and larger breasts than an adult man. Women have significantly less facial and other body hair, have a higher body fat composition, and are on average shorter and less muscular than men. Througho ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
1991 Deaths
File:1991 Events Collage.png, From left, clockwise: Boris Yeltsin, 1991 Russian presidential election, elected as Russia's first President of Russia, president, waves the new flag of Russia after the 1991 Soviet coup d'état attempt, orchestrated by Soviet Union, Soviet hardliners; Mount Pinatubo 1991 eruption of Mount Pinatubo, erupts in the Philippines, making it the List of large historical volcanic eruptions, second-largest Types of volcanic eruptions, volcanic eruption of the 20th century; MTS Oceanos sinks off the coast of South Africa, but the crew notoriously abandons the vessel before the passengers are rescued; Dissolution of the Soviet Union: The Flag of the Soviet Union, Soviet flag is lowered from the Kremlin for the last time and replaced with the flag of the Russian Federation; The United States and soon-to-be dissolved Soviet Union sign the START I Treaty; A tropical cyclone 1991 Bangladesh cyclone, strikes Bangladesh, killing nearly 140,000 people; Lauda Air Flight ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
1924 Births
Nineteen or 19 may refer to: * 19 (number), the natural number following 18 and preceding 20 * one of the years 19 BC, AD 19, 1919, 2019 Films * ''19'' (film), a 2001 Japanese film * ''Nineteen'' (film), a 1987 science fiction film Music * 19 (band), a Japanese pop music duo Albums * ''19'' (Adele album), 2008 * ''19'', a 2003 album by Alsou * ''19'', a 2006 album by Evan Yo * ''19'', a 2018 album by MHD * ''19'', one half of the double album ''63/19'' by Kool A.D. * ''Number Nineteen'', a 1971 album by American jazz pianist Mal Waldron * ''XIX'' (EP), a 2019 EP by 1the9 Songs * "19" (song), a 1985 song by British musician Paul Hardcastle. * "Nineteen", a song by Bad4Good from the 1992 album '' Refugee'' * "Nineteen", a song by Karma to Burn from the 2001 album ''Almost Heathen''. * "Nineteen" (song), a 2007 song by American singer Billy Ray Cyrus. * "Nineteen", a song by Tegan and Sara from the 2007 album '' The Con''. * "XIX" (song), a 2014 song by Slipk ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Strongly Connected Component
In the mathematical theory of directed graphs, a graph is said to be strongly connected if every vertex is reachable from every other vertex. The strongly connected components of an arbitrary directed graph form a partition into subgraphs that are themselves strongly connected. It is possible to test the strong connectivity of a graph, or to find its strongly connected components, in linear time (that is, Θ(''V'' + ''E'')). Definitions A directed graph is called strongly connected if there is a path in each direction between each pair of vertices of the graph. That is, a path exists from the first vertex in the pair to the second, and another path exists from the second vertex to the first. In a directed graph ''G'' that may not itself be strongly connected, a pair of vertices ''u'' and ''v'' are said to be strongly connected to each other if there is a path in each direction between them. The binary relation of being strongly connected is an equivalence relation, and ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Directed Graph
In mathematics, and more specifically in graph theory, a directed graph (or digraph) is a graph that is made up of a set of vertices connected by directed edges, often called arcs. Definition In formal terms, a directed graph is an ordered pair where * ''V'' is a set whose elements are called '' vertices'', ''nodes'', or ''points''; * ''A'' is a set of ordered pairs of vertices, called ''arcs'', ''directed edges'' (sometimes simply ''edges'' with the corresponding set named ''E'' instead of ''A''), ''arrows'', or ''directed lines''. It differs from an ordinary or undirected graph, in that the latter is defined in terms of unordered pairs of vertices, which are usually called ''edges'', ''links'' or ''lines''. The aforementioned definition does not allow a directed graph to have multiple arrows with the same source and target nodes, but some authors consider a broader definition that allows directed graphs to have such multiple arcs (namely, they allow the arc set to be a m ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Hamiltonian Circuit
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. A Hamiltonian cycle (or Hamiltonian circuit) is a cycle that visits each vertex exactly once. A Hamiltonian path that starts and ends at adjacent vertices can be completed by adding one more edge to form a Hamiltonian cycle, and removing any edge from a Hamiltonian cycle produces a Hamiltonian path. Determining whether such paths and cycles exist in graphs (the Hamiltonian path problem and Hamiltonian cycle problem) are NP-complete. Hamiltonian paths and cycles are named after William Rowan Hamilton who invented the icosian game, now also known as ''Hamilton's puzzle'', which involves finding a Hamiltonian cycle in the edge graph of the dodecahedron. Hamilton solved this problem using the icosian calculus, an algebraic structure based on roots of unity with many similarities to the quaternions (also invented by Hamilt ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Random Sequential Adsorption
Random sequential adsorption (RSA) refers to a process where particles are randomly introduced in a system, and if they do not overlap any previously adsorbed particle, they adsorb and remain fixed for the rest of the process. RSA can be carried out in computer simulation, in a mathematical analysis, or in experiments. It was first studied by one-dimensional models: the attachment of pendant groups in a polymer chain by Paul Flory, and the car-parking problem by Alfréd Rényi. Other early works include those of Benjamin Widom. In two and higher dimensions many systems have been studied by computer simulation, including in 2d, disks, randomly oriented squares and rectangles, aligned squares and rectangles, various other shapes, etc. An important result is the maximum surface coverage, called the saturation coverage or the packing fraction. On this page we list that coverage for many systems. The blocking process has been studied in detail in terms of the ''random sequential a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Arrangement Of Lines
In music, an arrangement is a musical adaptation of an existing composition. Differences from the original composition may include reharmonization, melodic paraphrasing, orchestration, or formal development. Arranging differs from orchestration in that the latter process is limited to the assignment of notes to instruments for performance by an orchestra, concert band, or other musical ensemble. Arranging "involves adding compositional techniques, such as new thematic material for introductions, transitions, or modulations, and endings. Arranging is the art of giving an existing melody musical variety".(Corozine 2002, p. 3) In jazz, a memorized (unwritten) arrangement of a new or pre-existing composition is known as a ''head arrangement''. Classical music Arrangement and transcriptions of classical and serious music go back to the early history of this genre. Eighteenth century J.S. Bach frequently made arrangements of his own and other composers' pieces. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Discrete Geometry
Discrete geometry and combinatorial geometry are branches of geometry that study combinatorial properties and constructive methods of discrete geometric objects. Most questions in discrete geometry involve finite or discrete sets of basic geometric objects, such as points, lines, planes, circles, spheres, polygons, and so forth. The subject focuses on the combinatorial properties of these objects, such as how they intersect one another, or how they may be arranged to cover a larger object. Discrete geometry has a large overlap with convex geometry and computational geometry, and is closely related to subjects such as finite geometry, combinatorial optimization, digital geometry, discrete differential geometry, geometric graph theory, toric geometry, and combinatorial topology. History Although polyhedra and tessellations had been studied for many years by people such as Kepler and Cauchy, modern discrete geometry has its origins in the late 19th century. Early topics studie ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.jpg "Click for more on -> Women Mathematicians")
