Topic: Mathematics (Page 3)

You are looking at all articles with the topic "Mathematics". We found 223 matches.

Hint: To view all topics, click here. Too see the most popular topics, click here instead.

🔗 Maryam Mirzakhani

🔗 Biography 🔗 California 🔗 California/San Francisco Bay Area 🔗 Mathematics 🔗 Iran 🔗 Women scientists 🔗 Biography/science and academia 🔗 Stanford University

Maryam Mirzakhani (Persian: مریم میرزاخانی‎, pronounced [mæɾˈjæm miːɾzɑːxɑːˈniː]; 12 May 1977 – 14 July 2017) was an Iranian mathematician and a professor of mathematics at Stanford University. Her research topics included Teichmüller theory, hyperbolic geometry, ergodic theory, and symplectic geometry. In 2005, as a result of her research, she was honored in Popular Science's fourth annual "Brilliant 10" in which she was acknowledged as one of the top 10 young minds who have pushed their fields in innovative directions.

On 13 August 2014, Mirzakhani was honored with the Fields Medal, the most prestigious award in mathematics. Thus, she became both the first, and to date, the only woman and the first Iranian to be honored with the award. The award committee cited her work in "the dynamics and geometry of Riemann surfaces and their moduli spaces".

On 14 July 2017, Mirzakhani died of breast cancer at the age of 40.

Discussed on

🔗 Wireworld

🔗 Computing 🔗 Mathematics

Wireworld is a cellular automaton first proposed by Brian Silverman in 1987, as part of his program Phantom Fish Tank. It subsequently became more widely known as a result of an article in the "Computer Recreations" column of Scientific American. Wireworld is particularly suited to simulating transistors, and Wireworld is Turing-complete.

Discussed on

🔗 The moving sofa problem

🔗 Mathematics

The moving sofa problem or sofa problem is a two-dimensional idealisation of real-life furniture-moving problems and asks for the rigid two-dimensional shape of largest area A that can be maneuvered through an L-shaped planar region with legs of unit width. The area A thus obtained is referred to as the sofa constant. The exact value of the sofa constant is an open problem.

Discussed on

🔗 Banach–Tarski Paradox

🔗 Mathematics

The Banach–Tarski paradox is a theorem in set-theoretic geometry, which states the following: Given a solid ball in 3‑dimensional space, there exists a decomposition of the ball into a finite number of disjoint subsets, which can then be put back together in a different way to yield two identical copies of the original ball. Indeed, the reassembly process involves only moving the pieces around and rotating them without changing their shape. However, the pieces themselves are not "solids" in the usual sense, but infinite scatterings of points. The reconstruction can work with as few as five pieces.

A stronger form of the theorem implies that given any two "reasonable" solid objects (such as a small ball and a huge ball), the cut pieces of either one can be reassembled into the other. This is often stated informally as "a pea can be chopped up and reassembled into the Sun" and called the "pea and the Sun paradox".

The reason the Banach–Tarski theorem is called a paradox is that it contradicts basic geometric intuition. "Doubling the ball" by dividing it into parts and moving them around by rotations and translations, without any stretching, bending, or adding new points, seems to be impossible, since all these operations ought, intuitively speaking, to preserve the volume. The intuition that such operations preserve volumes is not mathematically absurd and it is even included in the formal definition of volumes. However, this is not applicable here because in this case it is impossible to define the volumes of the considered subsets. Reassembling them reproduces a volume, which happens to be different from the volume at the start.

Unlike most theorems in geometry, the proof of this result depends in a critical way on the choice of axioms for set theory. It can be proven using the axiom of choice, which allows for the construction of non-measurable sets, i.e., collections of points that do not have a volume in the ordinary sense, and whose construction requires an uncountable number of choices.

It was shown in 2005 that the pieces in the decomposition can be chosen in such a way that they can be moved continuously into place without running into one another.

Discussed on

🔗 Isochronous Curves

🔗 Mathematics

A tautochrone or isochrone curve (from Greek prefixes tauto- meaning same or iso- equal, and chrono time) is the curve for which the time taken by an object sliding without friction in uniform gravity to its lowest point is independent of its starting point on the curve. The curve is a cycloid, and the time is equal to π times the square root of the radius (of the circle which generates the cycloid) over the acceleration of gravity. The tautochrone curve is related to the brachistochrone curve, which is also a cycloid.

Discussed on

🔗 Ulam Spiral

🔗 Mathematics

The Ulam spiral or prime spiral is a graphical depiction of the set of prime numbers, devised by mathematician Stanisław Ulam in 1963 and popularized in Martin Gardner's Mathematical Games column in Scientific American a short time later. It is constructed by writing the positive integers in a square spiral and specially marking the prime numbers.

Ulam and Gardner emphasized the striking appearance in the spiral of prominent diagonal, horizontal, and vertical lines containing large numbers of primes. Both Ulam and Gardner noted that the existence of such prominent lines is not unexpected, as lines in the spiral correspond to quadratic polynomials, and certain such polynomials, such as Euler's prime-generating polynomial x2 − x + 41, are believed to produce a high density of prime numbers. Nevertheless, the Ulam spiral is connected with major unsolved problems in number theory such as Landau's problems. In particular, no quadratic polynomial has ever been proved to generate infinitely many primes, much less to have a high asymptotic density of them, although there is a well-supported conjecture as to what that asymptotic density should be.

In 1932, more than thirty years prior to Ulam's discovery, the herpetologist Laurence Klauber constructed a triangular, non-spiral array containing vertical and diagonal lines exhibiting a similar concentration of prime numbers. Like Ulam, Klauber noted the connection with prime-generating polynomials, such as Euler's.

Discussed on

🔗 Chernoff face

🔗 Mathematics 🔗 Statistics

Chernoff faces, invented by Herman Chernoff in 1973, display multivariate data in the shape of a human face. The individual parts, such as eyes, ears, mouth and nose represent values of the variables by their shape, size, placement and orientation. The idea behind using faces is that humans easily recognize faces and notice small changes without difficulty. Chernoff faces handle each variable differently. Because the features of the faces vary in perceived importance, the way in which variables are mapped to the features should be carefully chosen (e.g. eye size and eyebrow-slant have been found to carry significant weight).

Discussed on

🔗 Visual calculus

🔗 Mathematics

Visual calculus, invented by Mamikon Mnatsakanian (known as Mamikon), is an approach to solving a variety of integral calculus problems. Many problems that would otherwise seem quite difficult yield to the method with hardly a line of calculation, often reminiscent of what Martin Gardner called "aha! solutions" or Roger Nelsen a proof without words.

Discussed on

🔗 Superformula

🔗 Mathematics

The superformula is a generalization of the superellipse and was proposed by Johan Gielis around 2000. Gielis suggested that the formula can be used to describe many complex shapes and curves that are found in nature. Gielis has filed a patent application related to the synthesis of patterns generated by the superformula.

In polar coordinates, with r {\displaystyle r} the radius and φ {\displaystyle \varphi } the angle, the superformula is:

r ( φ ) = ( | cos ( m 1 φ 4 ) a | n 2 + | sin ( m 2 φ 4 ) b | n 3 ) 1 n 1 . {\displaystyle r\left(\varphi \right)=\left(\left|{\frac {\cos \left({\frac {m_{1}\varphi }{4}}\right)}{a}}\right|^{n_{2}}+\left|{\frac {\sin \left({\frac {m_{2}\varphi }{4}}\right)}{b}}\right|^{n_{3}}\right)^{-{\frac {1}{n_{1}}}}.}

By choosing different values for the parameters a , b , m 1 , m 2 , n 1 , n 2 , {\displaystyle a,b,m_{1},m_{2},n_{1},n_{2},} and n 3 , {\displaystyle n_{3},} different shapes can be generated.

The formula was obtained by generalizing the superellipse, named and popularized by Piet Hein, a Danish mathematician.

Discussed on

🔗 Hilbert's paradox of the Grand Hotel

🔗 Mathematics

Hilbert's paradox of the Grand Hotel (colloquial: Infinite Hotel Paradox or Hilbert's Hotel) is a thought experiment which illustrates a counterintuitive property of infinite sets. It is demonstrated that a fully occupied hotel with infinitely many rooms may still accommodate additional guests, even infinitely many of them, and this process may be repeated infinitely often. The idea was introduced by David Hilbert in a 1924 lecture "Über das Unendliche", reprinted in (Hilbert 2013, p.730), and was popularized through George Gamow's 1947 book One Two Three... Infinity.

Discussed on