|
Star-shaped
In geometry, a set S in the Euclidean space \R^n is called a star domain (or star-convex set, star-shaped set or radially convex set) if there exists an s_0 \in S such that for all s \in S, the line segment from s_0 to s lies in S. This definition is immediately generalizable to any real, or complex, vector space. Intuitively, if one thinks of S as a region surrounded by a wall, S is a star domain if one can find a vantage point s_0 in S from which any point s in S is within line-of-sight. A similar, but distinct, concept is that of a radial set. Definition Given two points x and y in a vector space X (such as Euclidean space \R^n), the convex hull of \ is called the and it is denoted by \left , y\right~:=~ \left\ ~=~ x + (y - x) , 1 where z , 1:= \ for every vector z. A subset S of a vector space X is said to be s_0 \in S if for every s \in S, the closed interval \left _0, s\right\subseteq S. A set S is and is called a if there exists some point s_0 \in S such that S ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Star-shaped Preferences
In social choice theory, star-shaped preferences are a class of preferences over points in a Euclidean space. An agent with star-shaped preferences has a unique ideal point (optimum), where he is maximally satisfied. Moreover, he becomes less and less satisfied as the actual distribution moves away from his optimum. Star-shaped preferences can be seen as a multi-dimensional extension of single-peaked preferences. Background Often, society has to choose a point from a subset of a Euclidean space. For example, society has to choose how to distribute its annual budget; each potential distribution is a vector of real numbers. If there are ''m'' potential issues in the budget, then the set of all potential budget distributions is a subset of R''m'' - the m-dimensional Euclidean space. Different members of society may have different preferences over budget distributions. A ''preference'' is any total order over points. For example, a particular agent may state that he prefers the distr ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Star Domain
In geometry, a set S in the Euclidean space \R^n is called a star domain (or star-convex set, star-shaped set or radially convex set) if there exists an s_0 \in S such that for all s \in S, the line segment from s_0 to s lies in S. This definition is immediately generalizable to any real, or complex, vector space. Intuitively, if one thinks of S as a region surrounded by a wall, S is a star domain if one can find a vantage point s_0 in S from which any point s in S is within line-of-sight. A similar, but distinct, concept is that of a radial set. Definition Given two points x and y in a vector space X (such as Euclidean space \R^n), the convex hull of \ is called the and it is denoted by \left , y\right~:=~ \left\ ~=~ x + (y - x) , 1 where z , 1:= \ for every vector z. A subset S of a vector space X is said to be s_0 \in S if for every s \in S, the closed interval \left _0, s\right\subseteq S. A set S is and is called a if there exists some point s_0 \in S such that S ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Star-shaped Polygon
In geometry, a star-shaped polygon is a polygonal region in the plane that is a star domain, that is, a polygon that contains a point from which the entire polygon boundary is visible. Formally, a polygon is star-shaped if there exists a point such that for each point of the segment lies entirely within . The set of all points with this property (that is, the set of points from which all of is visible) is called the kernel of . If a star-shaped polygon is convex, the link distance between any two of its points (the minimum number of sequential line segments sufficient to connect those points) is 1, and so the polygon's link diameter (the maximum link distance over all pairs of points) is 1. If a star-shaped polygon is not convex, the link distance between a point in the kernel and any other point in the polygon is 1, while the link distance between any two points that are in the polygon but outside the kernel is either 1 or 2; in this case the maximum link distance is ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Minkowski Functional
In mathematics, in the field of functional analysis, a Minkowski functional (after Hermann Minkowski) or gauge function is a function that recovers a notion of distance on a linear space. If K is a subset of a real or complex vector space X, then the or of K is defined to be the function p_K : X \to , \infty valued in the extended real numbers, defined by p_K(x) := \inf \ \quad \text x \in X, where the infimum of the empty set is defined to be positive infinity \,\infty\, (which is a real number so that p_K(x) would then be real-valued). The set K is often assumed/picked to have properties, such as being an absorbing disk in X, that guarantee that p_K will be a real-valued seminorm on X. In fact, every seminorm p on X is equal to the Minkowski functional (that is, p = p_K) of any subset K of X satisfying \ \subseteq K \subseteq \ (where all three of these sets are necessarily absorbing in X and the first and last are also disks). Thus every seminorm (which is a d ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Convex Set
In geometry, a set of points is convex if it contains every line segment between two points in the set. For example, a solid cube (geometry), cube is a convex set, but anything that is hollow or has an indent, for example, a crescent shape, is not convex. The boundary (topology), boundary of a convex set in the plane is always a convex curve. The intersection of all the convex sets that contain a given subset of Euclidean space is called the convex hull of . It is the smallest convex set containing . A convex function is a real-valued function defined on an interval (mathematics), interval with the property that its epigraph (mathematics), epigraph (the set of points on or above the graph of a function, graph of the function) is a convex set. Convex minimization is a subfield of mathematical optimization, optimization that studies the problem of minimizing convex functions over convex sets. The branch of mathematics devoted to the study of properties of convex sets and convex f ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Balanced Set
In linear algebra and related areas of mathematics a balanced set, circled set or disk in a vector space (over a field \mathbb with an absolute value function , \cdot , ) is a set S such that a S \subseteq S for all scalars a satisfying , a, \leq 1. The balanced hull or balanced envelope of a set S is the smallest balanced set containing S. The balanced core of a set S is the largest balanced set contained in S. Balanced sets are ubiquitous in functional analysis because every neighborhood of the origin in every topological vector space (TVS) contains a balanced neighborhood of the origin and every convex neighborhood of the origin contains a balanced convex neighborhood of the origin (even if the TVS is not locally convex). This neighborhood can also be chosen to be an open set or, alternatively, a closed set. Definition Let X be a vector space over the field \mathbb of real or complex numbers. Notation If S is a set, a is a scalar, and B \subseteq \mathbb then let a ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Line Segment
In geometry, a line segment is a part of a line (mathematics), straight line that is bounded by two distinct endpoints (its extreme points), and contains every Point (geometry), point on the line that is between its endpoints. It is a special case of an ''arc (geometry), arc'', with zero curvature. The length of a line segment is given by the Euclidean distance between its endpoints. A closed line segment includes both endpoints, while an open line segment excludes both endpoints; a half-open line segment includes exactly one of the endpoints. In geometry, a line segment is often denoted using an overline (vinculum (symbol), vinculum) above the symbols for the two endpoints, such as in . Examples of line segments include the sides of a triangle or square. More generally, when both of the segment's end points are vertices of a polygon or polyhedron, the line segment is either an edge (geometry), edge (of that polygon or polyhedron) if they are adjacent vertices, or a diagonal. Wh ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Homotopy
In topology, two continuous functions from one topological space to another are called homotopic (from and ) if one can be "continuously deformed" into the other, such a deformation being called a homotopy ( ; ) between the two functions. A notable use of homotopy is the definition of homotopy groups and cohomotopy groups, important invariants in algebraic topology. In practice, there are technical difficulties in using homotopies with certain spaces. Algebraic topologists work with compactly generated spaces, CW complexes, or spectra. Formal definition Formally, a homotopy between two continuous functions ''f'' and ''g'' from a topological space ''X'' to a topological space ''Y'' is defined to be a continuous function H: X \times ,1\to Y from the product of the space ''X'' with the unit interval , 1to ''Y'' such that H(x,0) = f(x) and H(x,1) = g(x) for all x \in X. If we think of the second parameter of ''H'' as time then ''H'' describes a ''continu ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Euclidean Geometry
Euclidean geometry is a mathematical system attributed to ancient Greek mathematics, Greek mathematician Euclid, which he described in his textbook on geometry, ''Euclid's Elements, Elements''. Euclid's approach consists in assuming a small set of intuitively appealing axioms (postulates) and deducing many other propositions (theorems) from these. One of those is the parallel postulate which relates to parallel lines on a Euclidean plane. Although many of Euclid's results had been stated earlier,. Euclid was the first to organize these propositions into a logic, logical system in which each result is ''mathematical proof, proved'' from axioms and previously proved theorems. The ''Elements'' begins with plane geometry, still taught in secondary school (high school) as the first axiomatic system and the first examples of mathematical proofs. It goes on to the solid geometry of three dimensions. Much of the ''Elements'' states results of what are now called algebra and number theory ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Convex Analysis
Convex analysis is the branch of mathematics devoted to the study of properties of convex functions and convex sets, often with applications in convex optimization, convex minimization, a subdomain of optimization (mathematics), optimization theory. Convex sets A subset C \subseteq X of some vector space X is if it satisfies any of the following equivalent conditions: #If 0 \leq r \leq 1 is real and x, y \in C then r x + (1 - r) y \in C. #If 0 < r < 1 is real and with then Throughout, will be a map valued in the Extended real number line, extended real numbers with a Domain of a function, domain that is a convex subset of some vector space. The map is a if holds for any real and any |
American Mathematical Monthly
''The American Mathematical Monthly'' is a peer-reviewed scientific journal of mathematics. It was established by Benjamin Finkel in 1894 and is published by Taylor & Francis on behalf of the Mathematical Association of America. It is an expository journal intended for a wide audience of mathematicians, from undergraduate students to research professionals. Articles are chosen on the basis of their broad interest and reviewed and edited for quality of exposition as well as content. The editor-in-chief An editor-in-chief (EIC), also known as lead editor or chief editor, is a publication's editorial leader who has final responsibility for its operations and policies. The editor-in-chief heads all departments of the organization and is held accoun ... is Vadim Ponomarenko ( San Diego State University). The journal gives the Lester R. Ford Award annually to "authors of articles of expository excellence" published in the journal. Editors-in-chief The following persons are or have ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Geometry
Geometry (; ) is a branch of mathematics concerned with properties of space such as the distance, shape, size, and relative position of figures. Geometry is, along with arithmetic, one of the oldest branches of mathematics. A mathematician who works in the field of geometry is called a ''List of geometers, geometer''. Until the 19th century, geometry was almost exclusively devoted to Euclidean geometry, which includes the notions of point (geometry), point, line (geometry), line, plane (geometry), plane, distance, angle, surface (mathematics), surface, and curve, as fundamental concepts. Originally developed to model the physical world, geometry has applications in almost all sciences, and also in art, architecture, and other activities that are related to graphics. Geometry also has applications in areas of mathematics that are apparently unrelated. For example, methods of algebraic geometry are fundamental in Wiles's proof of Fermat's Last Theorem, Wiles's proof of Fermat's ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
