Equichordal Point Problem
   HOME
*





Equichordal Point Problem
In Euclidean plane geometry, the equichordal point problem is the question whether a closed planar convex body can have two equichordal points. The problem was originally posed in 1916 by Fujiwara and in 1917 by Wilhelm Blaschke, Hermann Rothe, and Roland Weitzenböck. W. Blaschke, H. Rothe, and R. Weitzenböck. Aufgabe 552. Arch. Math. Phys., 27:82, 1917 A generalization of this problem statement was answered in the negative in 1997 by Marek R. Rychlik. Problem statement An equichordal curve is a closed planar curve for which a point in the plane exists such that all chords passing through this point are equal in length. Such a point is called an equichordal point. It is easy to construct equichordal curves with a single equichordal point, particularly when the curves are symmetric; the simplest construction is a circle. It has long only been conjectured that no convex equichordal curve with two equichordal points can exist. More generally, it was asked whether there exists ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Euclidean Plane Geometry
Euclidean geometry is a mathematical system attributed to ancient Greek mathematician Euclid, which he described in his textbook on geometry: the '' Elements''. Euclid's approach consists in assuming a small set of intuitively appealing axioms (postulates) and deducing many other propositions (theorems) from these. Although many of Euclid's results had been stated earlier,. Euclid was the first to organize these propositions into a logical system in which each result is '' 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, explained in geometrical language. For more than two thousand years, the adjective "Euclidean" was unnecessary because no other sort of geomet ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


picture info

Convex Function
In mathematics, a real-valued function is called convex if the line segment between any two points on the graph of a function, graph of the function lies above the graph between the two points. Equivalently, a function is convex if its epigraph (mathematics), epigraph (the set of points on or above the graph of the function) is a convex set. A twice-differentiable function of a single variable is convex if and only if its second derivative is nonnegative on its entire domain. Well-known examples of convex functions of a single variable include the quadratic function x^2 and the exponential function e^x. In simple terms, a convex function refers to a function whose graph is shaped like a cup \cup, while a concave function's graph is shaped like a cap \cap. Convex functions play an important role in many areas of mathematics. They are especially important in the study of optimization problems where they are distinguished by a number of convenient properties. For instance, a st ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Chordal Problem
In the mathematical area of graph theory, a chordal graph is one in which all cycles of four or more vertices have a ''chord'', which is an edge that is not part of the cycle but connects two vertices of the cycle. Equivalently, every induced cycle in the graph should have exactly three vertices. The chordal graphs may also be characterized as the graphs that have perfect elimination orderings, as the graphs in which each minimal separator is a clique, and as the intersection graphs of subtrees of a tree. They are sometimes also called rigid circuit graphs. or triangulated graphs.. Chordal graphs are a subset of the perfect graphs. They may be recognized in linear time, and several problems that are hard on other classes of graphs such as graph coloring may be solved in polynomial time when the input is chordal. The treewidth of an arbitrary graph may be characterized by the size of the cliques in the chordal graphs that contain it. Perfect elimination and efficient reco ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Chordal Problem
In the mathematical area of graph theory, a chordal graph is one in which all cycles of four or more vertices have a ''chord'', which is an edge that is not part of the cycle but connects two vertices of the cycle. Equivalently, every induced cycle in the graph should have exactly three vertices. The chordal graphs may also be characterized as the graphs that have perfect elimination orderings, as the graphs in which each minimal separator is a clique, and as the intersection graphs of subtrees of a tree. They are sometimes also called rigid circuit graphs. or triangulated graphs.. Chordal graphs are a subset of the perfect graphs. They may be recognized in linear time, and several problems that are hard on other classes of graphs such as graph coloring may be solved in polynomial time when the input is chordal. The treewidth of an arbitrary graph may be characterized by the size of the cliques in the chordal graphs that contain it. Perfect elimination and efficient reco ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Ushiki's Theorem
In mathematics, particularly in the study of functions of several complex variables, Ushiki's theorem, named after S. Ushiki, states that certain well-behaved functions cannot have certain kinds of well-behaved invariant manifolds. The theorem A biholomorphic mapping F:\mathbb^n\to\mathbb^n cannot have a 1-dimensional compact smooth invariant manifold. In particular, such a map cannot have a homoclinic connection or heteroclinic connection. Commentary Invariant manifolds typically appear as solutions of certain asymptotic problems in dynamical systems. The most common is the stable manifold or its kin, the unstable manifold. The publication Ushiki's theorem was published in 1980.S. Ushiki. Sur les liaisons-cols des systèmes dynamiques analytiques. C. R. Acad. Sci. Paris, 291(7):447–449, 1980 The theorem appeared in print again several years later, in a certain Russian journal, by an author apparently unaware of Ushiki's work. An application The standard map ca ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Algebraic Geometry And Analytic Geometry
In mathematics, algebraic geometry and analytic geometry are two closely related subjects. While algebraic geometry studies algebraic varieties, analytic geometry deals with complex manifolds and the more general analytic spaces defined locally by the vanishing of analytic functions of several complex variables. The deep relation between these subjects has numerous applications in which algebraic techniques are applied to analytic spaces and analytic techniques to algebraic varieties. Main statement Let ''X'' be a projective complex algebraic variety. Because ''X'' is a complex variety, its set of complex points ''X''(C) can be given the structure of a compact complex analytic space. This analytic space is denoted ''X''an. Similarly, if \mathcal is a sheaf on ''X'', then there is a corresponding sheaf \mathcal^\text on ''X''an. This association of an analytic object to an algebraic one is a functor. The prototypical theorem relating ''X'' and ''X''an says that for any t ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Liouville's Theorem (complex Analysis)
In complex analysis, Liouville's theorem, named after Joseph Liouville (although the theorem was first proven by Cauchy in 1844), states that every bounded entire function must be constant. That is, every holomorphic function f for which there exists a positive number M such that , f(z), \leq M for all z in \Complex is constant. Equivalently, non-constant holomorphic functions on \Complex have unbounded images. The theorem is considerably improved by Picard's little theorem, which says that every entire function whose image omits two or more complex numbers must be constant. Proof This important theorem has several proofs. A standard analytical proof uses the fact that holomorphic functions are analytic. Another proof uses the mean value property of harmonic functions. The proof can be adapted to the case where the harmonic function f is merely bounded above or below. See Harmonic function#Liouville's theorem. Corollaries Fundamental theorem of algebra There is a ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Complex Analysis
Complex analysis, traditionally known as the theory of functions of a complex variable, is the branch of mathematical analysis that investigates Function (mathematics), functions of complex numbers. It is helpful in many branches of mathematics, including algebraic geometry, number theory, analytic combinatorics, applied mathematics; as well as in physics, including the branches of hydrodynamics, thermodynamics, and particularly quantum mechanics. By extension, use of complex analysis also has applications in engineering fields such as nuclear engineering, nuclear, aerospace engineering, aerospace, mechanical engineering, mechanical and electrical engineering. As a differentiable function of a complex variable is equal to its Taylor series (that is, it is Analyticity of holomorphic functions, analytic), complex analysis is particularly concerned with analytic functions of a complex variable (that is, holomorphic functions). History Complex analysis is one of the classical ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Stable Manifold
In mathematics, and in particular the study of dynamical systems, the idea of ''stable and unstable sets'' or stable and unstable manifolds give a formal mathematical definition to the general notions embodied in the idea of an attractor or repellor. In the case of hyperbolic dynamics, the corresponding notion is that of the hyperbolic set. Physical example The gravitational tidal forces acting on the rings of Saturn provide an easy-to-visualize physical example. The tidal forces flatten the ring into the equatorial plane, even as they stretch it out in the radial direction. Imagining the rings to be sand or gravel particles ("dust") in orbit around Saturn, the tidal forces are such that any perturbations that push particles above or below the equatorial plane results in that particle feeling a restoring force, pushing it back into the plane. Particles effectively oscillate in a harmonic well, damped by collisions. The stable direction is perpendicular to the ring. The unstable di ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  




Normally Hyperbolic Invariant Manifold
A normally hyperbolic invariant manifold (NHIM) is a natural generalization of a hyperbolic fixed point and a hyperbolic set. The difference can be described heuristically as follows: For a manifold \Lambda to be normally hyperbolic we are allowed to assume that the dynamics of \Lambda itself is neutral compared with the dynamics nearby, which is not allowed for a hyperbolic set. NHIMs were introduced by Neil Fenichel in 1972. In this and subsequent papers, Fenichel proves that NHIMs possess stable and unstable manifolds and more importantly, NHIMs and their stable and unstable manifolds persist under small perturbations. Thus, in problems involving perturbation theory, invariant manifolds exist with certain hyperbolicity properties, which can in turn be used to obtain qualitative information about a dynamical system.A. Katok and B. Hasselblatt''Introduction to the Modern Theory of Dynamical Systems'', Cambridge University Press (1996), Definition Let ''M'' be a compact smo ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Complexification
In mathematics, the complexification of a vector space over the field of real numbers (a "real vector space") yields a vector space over the complex number field, obtained by formally extending the scaling of vectors by real numbers to include their scaling ("multiplication") by complex numbers. Any basis for (a space over the real numbers) may also serve as a basis for over the complex numbers. Formal definition Let V be a real vector space. The of is defined by taking the tensor product of V with the complex numbers (thought of as a 2-dimensional vector space over the reals): :V^ = V\otimes_ \Complex\,. The subscript, \R, on the tensor product indicates that the tensor product is taken over the real numbers (since V is a real vector space this is the only sensible option anyway, so the subscript can safely be omitted). As it stands, V^ is only a real vector space. However, we can make V^ into a complex vector space by defining complex multiplication as follows: :\alpha ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]  


Perturbation Problem Beyond All Orders
In mathematics, perturbation theory works typically by expanding unknown quantity in a power series in a small parameter. However, in a perturbation problem beyond all orders, all coefficients of the perturbation expansion vanish and the difference between the function and the constant function 0 cannot be detected by a power series. A simple example is understood by an attempt at trying to expand e^ in a Taylor series in \epsilon > 0 about 0. All terms in a naïve Taylor expansion are identically zero. This is because the function e^ possesses an essential singularity at z = 0 in the complex z-plane, and therefore the function is most appropriately modeled by a Laurent series In mathematics, the Laurent series of a complex function f(z) is a representation of that function as a power series which includes terms of negative degree. It may be used to express complex functions in cases where a Taylor series expansion c ... -- a Taylor series has a zero radius of convergence. ...
[...More Info...]      
[...Related Items...]     OR:     [Wikipedia]   [Google]   [Baidu]