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

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

Since the Renaissance, every century has seen the solution of more mathematical problems than the century before, yet many mathematical problems, both major and minor, still remain unsolved. These unsolved problems occur in multiple domains, including physics, computer science, algebra, analysis, combinatorics, algebraic, differential, discrete and Euclidean geometries, graph, group, model, number, set and Ramsey theories, dynamical systems, partial differential equations, and more. Some problems may belong to more than one discipline of mathematics and be studied using techniques from different areas. Prizes are often awarded for the solution to a long-standing problem, and lists of unsolved problems (such as the list of Millennium Prize Problems) receive considerable attention.

The medieval Cistercian numerals, or "ciphers" in nineteenth-century parlance, were developed by the Cistercian monastic order in the early thirteenth century at about the time that Arabic numerals were introduced to northwestern Europe. They are more compact than Arabic or Roman numerals, with a single glyph able to indicate any integer from 1 to 9,999.

Digits are based on a horizontal or vertical stave, with the position of the digit on the stave indicating its place value (units, tens, hundreds or thousands). These digits are compounded on a single stave to indicate more complex numbers. The Cistercians eventually abandoned the system in favor of the Arabic numerals, but marginal use outside the order continued until the early twentieth century.

In computer science and graph theory, the Canadian traveller problem (CTP) is a generalization of the shortest path problem to graphs that are partially observable. In other words, the graph is revealed while it is being explored, and explorative edges are charged even if they do not contribute to the final path.

This optimization problem was introduced by Christos Papadimitriou and Mihalis Yannakakis in 1989 and a number of variants of the problem have been studied since. The name supposedly originates from conversations of the authors who learned of a difficulty Canadian drivers had: traveling a network of cities with snowfall randomly blocking roads. The stochastic version, where each edge is associated with a probability of independently being in the graph, has been given considerable attention in operations research under the name "the Stochastic Shortest Path Problem with Recourse" (SSPPR).

3 (three) is a number, numeral and digit. It is the natural number following 2 and preceding 4, and is the smallest odd prime number and the only prime preceding a square number. It has religious and cultural significance in many societies.

A Penrose tiling is an example of an aperiodic tiling. Here, a tiling is a covering of the plane by non-overlapping polygons or other shapes, and aperiodic means that shifting any tiling with these shapes by any finite distance, without rotation, cannot produce the same tiling. However, despite their lack of translational symmetry, Penrose tilings may have both reflection symmetry and fivefold rotational symmetry. Penrose tilings are named after mathematician and physicist Roger Penrose, who investigated them in the 1970s.

There are several different variations of Penrose tilings with different tile shapes. The original form of Penrose tiling used tiles of four different shapes, but this was later reduced to only two shapes: either two different rhombi, or two different quadrilaterals called kites and darts. The Penrose tilings are obtained by constraining the ways in which these shapes are allowed to fit together. This may be done in several different ways, including matching rules, substitution tiling or finite subdivision rules, cut and project schemes, and coverings. Even constrained in this manner, each variation yields infinitely many different Penrose tilings.

Penrose tilings are self-similar: they may be converted to equivalent Penrose tilings with different sizes of tiles, using processes called inflation and deflation. The pattern represented by every finite patch of tiles in a Penrose tiling occurs infinitely many times throughout the tiling. They are quasicrystals: implemented as a physical structure a Penrose tiling will produce diffraction patterns with Bragg peaks and five-fold symmetry, revealing the repeated patterns and fixed orientations of its tiles. The study of these tilings has been important in the understanding of physical materials that also form quasicrystals. Penrose tilings have also been applied in architecture and decoration, as in the floor tiling shown.

Reverse mathematics is a program in mathematical logic that seeks to determine which axioms are required to prove theorems of mathematics. Its defining method can briefly be described as "going backwards from the theorems to the axioms", in contrast to the ordinary mathematical practice of deriving theorems from axioms. It can be conceptualized as sculpting out necessary conditions from sufficient ones.

The reverse mathematics program was foreshadowed by results in set theory such as the classical theorem that the axiom of choice and Zorn's lemma are equivalent over ZF set theory. The goal of reverse mathematics, however, is to study possible axioms of ordinary theorems of mathematics rather than possible axioms for set theory.

Reverse mathematics is usually carried out using subsystems of second-order arithmetic, where many of its definitions and methods are inspired by previous work in constructive analysis and proof theory. The use of second-order arithmetic also allows many techniques from recursion theory to be employed; many results in reverse mathematics have corresponding results in computable analysis. Recently, higher-order reverse mathematics has been introduced, in which the focus is on subsystems of higher-order arithmetic, and the associated richer language.

The program was founded by Harvey Friedman (1975, 1976) and brought forward by Steve Simpson. A standard reference for the subject is (Simpson 2009), while an introduction for non-specialists is (Stillwell 2018). An introduction to higher-order reverse mathematics, and also the founding paper, is (Kohlenbach (2005)).

Connes' embedding problem, formulated by Alain Connes in the 1970s, is a major problem in von Neumann algebra theory. During that time, the problem was reformulated in several different areas of mathematics. Dan Voiculescu developing his free entropy theory found that Connes' embedding problem is related to the existence of microstates. Some results of von Neumann algebra theory can be obtained assuming positive solution to the problem. The problem is connected to some basic questions in quantum theory, which led to the realization that it also has important implications in computer science.

The problem admits a number of equivalent formulations. Notably, it is equivalent to the following long standing problems:

• Kirchberg's QWEP conjecture in C*-algebra theory
• Tsirelson's problem in quantum information theory
• The predual of any (separable) von Neumann algebra is finitely representable in the trace class.

In January 2020, Ji, Natarajan, Vidick, Wright, and Yuen announced a result in quantum complexity theory that implies a negative answer to Connes' embedding problem. However, an error was discovered in September 2020 in an earlier result they used; a new proof avoiding the earlier result was published as a preprint in September. A broad outline was published in Communications of the ACM in November 2021, and an article explaining the connection between MIP*=RE and the Connes Embedding Problem appeared in October 2022.

Ronald Lewis Graham (born October 31, 1935) is an American mathematician credited by the American Mathematical Society as being "one of the principal architects of the rapid development worldwide of discrete mathematics in recent years". He has done important work in scheduling theory, computational geometry, Ramsey theory, and quasi-randomness.

He is the Chief Scientist at the California Institute for Telecommunications and Information Technology (also known as Cal-(IT)²) and the Irwin and Joan Jacobs Professor in Computer Science and Engineering at the University of California, San Diego (UCSD).

Terence Chi-Shen Tao (born 17 July 1975) is an Australian-American mathematician who has worked in various areas of mathematics. He currently focuses on harmonic analysis, partial differential equations, algebraic combinatorics, arithmetic combinatorics, geometric combinatorics, probability theory, compressed sensing and analytic number theory. As of 2015, he holds the James and Carol Collins chair in mathematics at the University of California, Los Angeles.

Tao was a recipient of the 2006 Fields Medal and the 2014 Breakthrough Prize in Mathematics. He is also a 2006 MacArthur Fellow. Tao has been the author or co-author of 275 research papers.

Tao is the second mathematician of Han Chinese descent to win the Fields medal after Shing-Tung Yau, and the first Australian citizen to win the medal.

A mathematical coincidence is said to occur when two expressions with no direct relationship show a near-equality which has no apparent theoretical explanation.

For example, there is a near-equality close to the round number 1000 between powers of 2 and powers of 10:

${\displaystyle 2^{10}=1024\approx 1000=10^{3}.}$

Some mathematical coincidences are used in engineering when one expression is taken as an approximation of another.