Topological defectTopological defects or solitons are irregularities or disruptions that occur within continuous fields or ordered states of matter. These defects, which can take various forms such as points, lines, or surfaces, are characterized by their stability and the fact that they cannot be 'smoothed out' or removed through continuous transformations of the field or material. They play a significant role in various areas of physics, including condensed matter physics, cosmology, and quantum field theory, and can have profound effects on the properties and behavior of the systems in which they occur.
SphereA sphere () is a geometrical object that is a three-dimensional analogue to a two-dimensional circle. Formally, a sphere is the set of points that are all at the same distance r from a given point in three-dimensional space. That given point is the centre of the sphere, and r is the sphere's radius. The earliest known mentions of spheres appear in the work of the ancient Greek mathematicians. The sphere is a fundamental object in many fields of mathematics. Spheres and nearly-spherical shapes also appear in nature and industry.
Intersection theoryIn mathematics, intersection theory is one of the main branches of algebraic geometry, where it gives information about the intersection of two subvarieties of a given variety. The theory for varieties is older, with roots in Bézout's theorem on curves and elimination theory. On the other hand, the topological theory more quickly reached a definitive form. There is yet an ongoing development of intersection theory. Currently the main focus is on: virtual fundamental cycles, quantum intersection rings, Gromov-Witten theory and the extension of intersection theory from schemes to stacks.
Complete topological vector spaceIn functional analysis and related areas of mathematics, a complete topological vector space is a topological vector space (TVS) with the property that whenever points get progressively closer to each other, then there exists some point towards which they all get closer. The notion of "points that get progressively closer" is made rigorous by or , which are generalizations of , while "point towards which they all get closer" means that this Cauchy net or filter converges to The notion of completeness for TVSs uses the theory of uniform spaces as a framework to generalize the notion of completeness for metric spaces.
Topological indistinguishabilityIn topology, two points of a topological space X are topologically indistinguishable if they have exactly the same neighborhoods. That is, if x and y are points in X, and Nx is the set of all neighborhoods that contain x, and Ny is the set of all neighborhoods that contain y, then x and y are "topologically indistinguishable" if and only if Nx = Ny. (See Hausdorff's axiomatic .) Intuitively, two points are topologically indistinguishable if the topology of X is unable to discern between the points.
Continuation-passing styleIn functional programming, continuation-passing style (CPS) is a style of programming in which control is passed explicitly in the form of a continuation. This is contrasted with direct style, which is the usual style of programming. Gerald Jay Sussman and Guy L. Steele, Jr. coined the phrase in AI Memo 349 (1975), which sets out the first version of the Scheme programming language. John C. Reynolds gives a detailed account of the numerous discoveries of continuations.
LengthLength is a measure of distance. In the International System of Quantities, length is a quantity with dimension distance. In most systems of measurement a base unit for length is chosen, from which all other units are derived. In the International System of Units (SI) system the base unit for length is the metre. Length is commonly understood to mean the most extended dimension of a fixed object. However, this is not always the case and may depend on the position the object is in.
Topological quantum numberIn physics, a topological quantum number (also called topological charge) is any quantity, in a physical theory, that takes on only one of a discrete set of values, due to topological considerations. Most commonly, topological quantum numbers are topological invariants associated with topological defects or soliton-type solutions of some set of differential equations modeling a physical system, as the solitons themselves owe their stability to topological considerations.
Bounded set (topological vector space)In functional analysis and related areas of mathematics, a set in a topological vector space is called bounded or von Neumann bounded, if every neighborhood of the zero vector can be inflated to include the set. A set that is not bounded is called unbounded. Bounded sets are a natural way to define locally convex polar topologies on the vector spaces in a dual pair, as the polar set of a bounded set is an absolutely convex and absorbing set. The concept was first introduced by John von Neumann and Andrey Kolmogorov in 1935.
Arc lengthArc length is the distance between two points along a section of a curve. Determining the length of an irregular arc segment by approximating the arc segment as connected (straight) line segments is also called curve rectification. A rectifiable curve has a finite number of segments in its rectification (so the curve has a finite length). If a curve can be parameterized as an injective and continuously differentiable function (i.e., the derivative is a continuous function) , then the curve is rectifiable (i.
Reciprocal lengthReciprocal length or inverse length is a quantity or measurement used in several branches of science and mathematics. As the reciprocal of length, common units used for this measurement include the reciprocal metre or inverse metre (symbol: m−1), the reciprocal centimetre or inverse centimetre (symbol: cm−1). Quantities measured in reciprocal length include: absorption coefficient or attenuation coefficient, in materials science curvature of a line, in mathematics gain, in laser physics magnitude of vectors in reciprocal space, in crystallography more generally any spatial frequency e.
Control flowIn computer science, control flow (or flow of control) is the order in which individual statements, instructions or function calls of an imperative program are executed or evaluated. The emphasis on explicit control flow distinguishes an imperative programming language from a declarative programming language. Within an imperative programming language, a control flow statement is a statement that results in a choice being made as to which of two or more paths to follow.
