Related Research Articles
In mathematics, the Cantor set is a set of points lying on a single line segment that has a number of unintuitive properties. It was discovered in 1874 by Henry John Stephen Smith and introduced by German mathematician Georg Cantor in 1883.
In geometry, the convex hull or convex envelope or convex closure of a shape is the smallest convex set that contains it. The convex hull may be defined either as the intersection of all convex sets containing a given subset of a Euclidean space, or equivalently as the set of all convex combinations of points in the subset. For a bounded subset of the plane, the convex hull may be visualized as the shape enclosed by a rubber band stretched around the subset.
In the mathematical field of graph theory, a bipartite graph is a graph whose vertices can be divided into two disjoint and independent sets and , that is, every edge connects a vertex in to one in . Vertex sets and are usually called the parts of the graph. Equivalently, a bipartite graph is a graph that does not contain any odd-length cycles.
In geometry, a sphere packing is an arrangement of non-overlapping spheres within a containing space. The spheres considered are usually all of identical size, and the space is usually three-dimensional Euclidean space. However, sphere packing problems can be generalised to consider unequal spheres, spaces of other dimensions or to non-Euclidean spaces such as hyperbolic space.
In mathematics, a closure operator on a set S is a function from the power set of S to itself that satisfies the following conditions for all sets
In combinatorics, a Helly family of order k is a family of sets in which every minimal subfamily with an empty intersection has k or fewer sets in it. Equivalently, every finite subfamily such that every k-fold intersection is non-empty has non-empty total intersection. The k-Helly property is the property of being a Helly family of order k.
In knot theory, a torus knot is a special kind of knot that lies on the surface of an unknotted torus in R3. Similarly, a torus link is a link which lies on the surface of a torus in the same way. Each torus knot is specified by a pair of coprime integers p and q. A torus link arises if p and q are not coprime. A torus knot is trivial if and only if either p or q is equal to 1 or −1. The simplest nontrivial example is the (2,3)-torus knot, also known as the trefoil knot.
A mass deficit is the amount of mass that has been removed from the center of a galaxy, presumably by the action of a binary supermassive black hole.
In graph theory, a branch of mathematics, the circuit rank, cyclomatic number, cycle rank, or nullity of an undirected graph is the minimum number of edges that must be removed from the graph to break all its cycles, making it into a tree or forest. It is equal to the number of independent cycles in the graph. Unlike the corresponding feedback arc set problem for directed graphs, the circuit rank r is easily computed using the formula
In mathematics, the corona theorem is a result about the spectrum of the bounded holomorphic functions on the open unit disc, conjectured by Kakutani (1941) and proved by Lennart Carleson (1962).
In the mathematical area of knot theory, a ribbon knot is a knot that bounds a self-intersecting disk with only ribbon singularities. Intuitively, this kind of singularity can be formed by cutting a slit in the disk and passing another part of the disk through the slit. More precisely, this type of singularity is a closed arc consisting of intersection points of the disk with itself, such that the preimage of this arc consists of two arcs in the disc, one completely in the interior of the disk and the other having its two endpoints on the disk boundary.
The circle packing theorem describes the possible tangency relations between circles in the plane whose interiors are disjoint. A circle packing is a connected collection of circles whose interiors are disjoint. The intersection graph of a circle packing is the graph having a vertex for each circle, and an edge for every pair of circles that are tangent. If the circle packing is on the plane, or, equivalently, on the sphere, then its intersection graph is called a coin graph; more generally, intersection graphs of interior-disjoint geometric objects are called tangency graphs or contact graphs. Coin graphs are always connected, simple, and planar. The circle packing theorem states that these are the only requirements for a graph to be a coin graph:
In graph theory, a branch of mathematics, a clique-sum is a way of combining two graphs by gluing them together at a clique, analogous to the connected sum operation in topology. If two graphs G and H each contain cliques of equal size, the clique-sum of G and H is formed from their disjoint union by identifying pairs of vertices in these two cliques to form a single shared clique, and then possibly deleting some of the clique edges. A k-clique-sum is a clique-sum in which both cliques have at most k vertices. One may also form clique-sums and k-clique-sums of more than two graphs, by repeated application of the two-graph clique-sum operation.
The Banach–Tarski paradox is a theorem in set-theoretic geometry, which states the following: Given a solid ball in three-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.
András Hajnal was a professor of mathematics at Rutgers University and a member of the Hungarian Academy of Sciences known for his work in set theory and combinatorics.
In mathematics and especially complex geometry, the Kobayashi metric is a pseudometric intrinsically associated to any complex manifold. It was introduced by Shoshichi Kobayashi in 1967. Kobayashi hyperbolic manifolds are an important class of complex manifolds, defined by the property that the Kobayashi pseudometric is a metric. Kobayashi hyperbolicity of a complex manifold X implies that every holomorphic map from the complex line C to X is constant.
In the mathematical theory of minimal surfaces, the double bubble theorem states that the shape that encloses and separates two given volumes and has the minimum possible surface area is a standard double bubble: three spherical surfaces meeting at angles of 120° on a common circle. The double bubble theorem was formulated and thought to be true in the 19th century, and became a "serious focus of research" by 1989, but was not proven until 2002.
In probability theory, an interacting particle system (IPS) is a stochastic process on some configuration space given by a site space, a countable-infinite graph and a local state space, a compact metric space . More precisely IPS are continuous-time Markov jump processes describing the collective behavior of stochastically interacting components. IPS are the continuous-time analogue of stochastic cellular automata.
In affine geometry, a cap set is a subset of with no three elements in a line. The cap set problem is the problem of finding the size of the largest possible cap set, as a function of . The first few cap set sizes are 1, 2, 4, 9, 20, 45, 112, ....
References
- Feinstein, J. F.; Morley, S.; Yang, H. (2016). "Abstract Swiss cheese space and classicalisation of Swiss cheeses". Journal of Mathematical Analysis and Applications. 438 (1): 119–141. arXiv: 1503.03785 . doi:10.1016/j.jmaa.2016.02.004. MR 3462570. S2CID 55614027.
- van den Berg, M.; Bolthausen, E.; den Hollander, F. (2004). "On the volume of the intersection of two Wiener sausages" (PDF). Annals of Mathematics . 159 (2): 741–783. doi: 10.4007/annals.2004.159.741 .
 | This mathematical analysis–related article is a stub. You can help Wikipedia by expanding it. |