SettingsFixed points
Applied general equilibrium
In mathematical economics, applied general equilibrium models were pioneered by Herbert Scarf at Yale University in 1967, in two papers, and a follow up book with Terje Hansen in 1973, with the ...
In mathematical economics, applied general equilibrium models were pioneered by Herbert Scarf at Yale University in 1967, in two papers, and a follow up book with Terje Hansen in 1973, with the ...
Artin-Mazur zeta function
In mathematics, the Artin–Mazur zeta function, named after Michael Artin and Barry Mazur, is a tool for studying the iterated functions that occur in dynamical systems and fractals.
In mathematics, the Artin–Mazur zeta function, named after Michael Artin and Barry Mazur, is a tool for studying the iterated functions that occur in dynamical systems and fractals.
Artin–Mazur zeta function
In mathematics, the Artin–Mazur zeta function, named after Michael Artin and Barry Mazur, is a tool for studying the iterated functions that occur in dynamical systems and fractals.
In mathematics, the Artin–Mazur zeta function, named after Michael Artin and Barry Mazur, is a tool for studying the iterated functions that occur in dynamical systems and fractals.
Atiyah-Bott fixed-point theorem
In mathematics, the Atiyah–Bott fixed-point theorem, proven by Michael Atiyah and Raoul Bott in the 1960s, is a general form of the Lefschetz fixed-point theorem for smooth manifolds M, whic...
In mathematics, the Atiyah–Bott fixed-point theorem, proven by Michael Atiyah and Raoul Bott in the 1960s, is a general form of the Lefschetz fixed-point theorem for smooth manifolds M, whic...
Atiyah–Bott fixed-point theorem
In mathematics, the Atiyah–Bott fixed-point theorem, proven by Michael Atiyah and Raoul Bott in the 1960s, is a general form of the Lefschetz fixed-point theorem for smooth manifolds M, whic...
In mathematics, the Atiyah–Bott fixed-point theorem, proven by Michael Atiyah and Raoul Bott in the 1960s, is a general form of the Lefschetz fixed-point theorem for smooth manifolds M, whic...
Autonomous convergence theorem
In mathematics, an autonomous convergence theorem is one of a family of related theorems which specify conditions guaranteeing global asymptotic stability of a continuous autonomous dynamical...
In mathematics, an autonomous convergence theorem is one of a family of related theorems which specify conditions guaranteeing global asymptotic stability of a continuous autonomous dynamical...
Banach fixed point theorem
In mathematics, the Banach fixed point theorem (also known as the contraction mapping theorem or contraction mapping principle) is an important tool in the theory of metric spaces; i...
In mathematics, the Banach fixed point theorem (also known as the contraction mapping theorem or contraction mapping principle) is an important tool in the theory of metric spaces; i...
Banach fixed-point theorem
In mathematics, the Banach fixed-point theorem is an important tool in the theory of metric spaces; it guarantees the existence and uniqueness of fixed points of certain self-maps of metric spac...
In mathematics, the Banach fixed-point theorem is an important tool in the theory of metric spaces; it guarantees the existence and uniqueness of fixed points of certain self-maps of metric spac...
Banks-Zaks fixed point
If the value of the coupling at that point is less than one, then the fixed point is called a Banks–Zaks fixed point.
If the value of the coupling at that point is less than one, then the fixed point is called a Banks–Zaks fixed point.
Banks–Zaks fixed point
If the value of the coupling at that point is less than one, then the fixed point is called a Banks–Zaks fixed point.
If the value of the coupling at that point is less than one, then the fixed point is called a Banks–Zaks fixed point.
Borel fixed-point theorem
In mathematics, the Borel fixed-point theorem is a fixed-point theorem in algebraic geometry generalizing the Lie-Kolchin theorem.
In mathematics, the Borel fixed-point theorem is a fixed-point theorem in algebraic geometry generalizing the Lie-Kolchin theorem.
Bourbaki-Witt theorem
In mathematics, the Bourbaki–Witt theorem in order theory, named after Nicolas Bourbaki and Ernst Witt, is a basic fixed point theorem for partially ordered sets.
In mathematics, the Bourbaki–Witt theorem in order theory, named after Nicolas Bourbaki and Ernst Witt, is a basic fixed point theorem for partially ordered sets.
Bourbaki–Witt theorem
In mathematics, the Bourbaki–Witt theorem in order theory, named after Nicolas Bourbaki and Ernst Witt, is a basic fixed point theorem for partially ordered sets.
In mathematics, the Bourbaki–Witt theorem in order theory, named after Nicolas Bourbaki and Ernst Witt, is a basic fixed point theorem for partially ordered sets.
Brouwer fixed point theorem
Brouwer's fixed point theorem is a fixed point theorem in topology, named after Luitzen Brouwer.
Brouwer's fixed point theorem is a fixed point theorem in topology, named after Luitzen Brouwer.
Brouwer fixed-point theorem
Brouwer's fixed point theorem is a fixed point theorem in topology, named after Luitzen Brouwer.
Brouwer's fixed point theorem is a fixed point theorem in topology, named after Luitzen Brouwer.
Caristi fixed point theorem
In mathematics, the Caristi fixed point theorem generalizes the Banach fixed point theorem for maps of a complete metric space into itself.
In mathematics, the Caristi fixed point theorem generalizes the Banach fixed point theorem for maps of a complete metric space into itself.
Caristi fixed-point theorem
In mathematics, the Caristi fixed-point theorem generalizes the Banach fixed point theorem for maps of a complete metric space into itself.
In mathematics, the Caristi fixed-point theorem generalizes the Banach fixed point theorem for maps of a complete metric space into itself.
Coincidence point
In mathematics, a coincidence point (or simply coincidence) of two mappings is a point in their domain having the same image point under both mappings.
In mathematics, a coincidence point (or simply coincidence) of two mappings is a point in their domain having the same image point under both mappings.
Common knowledge (logic)
Common knowledge is a special kind of knowledge for a group of agents.
Common knowledge is a special kind of knowledge for a group of agents.
Conley index theory
In dynamical systems theory, Conley index theory, named after Charles Conley, analyzes topological structure of invariant sets of diffeomorphisms and of smooth flows.
In dynamical systems theory, Conley index theory, named after Charles Conley, analyzes topological structure of invariant sets of diffeomorphisms and of smooth flows.
Cycle detection
In computer science, cycle detection is the algorithmic problem of finding a cycle in a sequence of iterated function values.
In computer science, cycle detection is the algorithmic problem of finding a cycle in a sequence of iterated function values.
Cycles and fixed points
In combinatorial mathematics, the cycles of a permutation π of a finite set S correspond bijectively to the orbits of the subgroup generated by π acting on S.
In combinatorial mathematics, the cycles of a permutation π of a finite set S correspond bijectively to the orbits of the subgroup generated by π acting on S.
Derangement
In combinatorial mathematics, a derangement is a permutation of the elements of a set such that none of the elements appear in their original position.
In combinatorial mathematics, a derangement is a permutation of the elements of a set such that none of the elements appear in their original position.
Diagonal lemma
In mathematical logic, the diagonal lemma or fixed point theorem establishes the existence of self-referential sentences in certain formal theories of the natural numbers -- specifically ...
In mathematical logic, the diagonal lemma or fixed point theorem establishes the existence of self-referential sentences in certain formal theories of the natural numbers -- specifically ...
Domain theory
Domain theory is a branch of mathematics that studies special kinds of partially ordered sets (posets) commonly called domains.
Domain theory is a branch of mathematics that studies special kinds of partially ordered sets (posets) commonly called domains.
Fixed point (mathematics)
In mathematics, a fixed point of a function is an element of the domain that is mapped to itself by the function.
In mathematics, a fixed point of a function is an element of the domain that is mapped to itself by the function.
Fixed point combinator
A fixed point combinator is a higher-order function that computes a fixed point of other functions.
A fixed point combinator is a higher-order function that computes a fixed point of other functions.
Fixed point index
In mathematics, the fixed point index is a concept in topological fixed point theory, and in particular Nielsen theory.
In mathematics, the fixed point index is a concept in topological fixed point theory, and in particular Nielsen theory.
Fixed point property
A mathematical object X has the fixed point property if every suitably well-behaved mapping from X to itself has a fixed point.
A mathematical object X has the fixed point property if every suitably well-behaved mapping from X to itself has a fixed point.
Fixed point theorem
In mathematics, a fixed point theorem is a result saying that a function F will have at least one fixed point (a point x for which F(x) = x), under some conditions on F t...
In mathematics, a fixed point theorem is a result saying that a function F will have at least one fixed point (a point x for which F(x) = x), under some conditions on F t...
Fixed point theorems in infinite-dimensional spaces
In mathematics, a number of fixed point theorems in infinite-dimensional spaces generalise the Brouwer fixed point theorem.
In mathematics, a number of fixed point theorems in infinite-dimensional spaces generalise the Brouwer fixed point theorem.
Fixed points of isometry groups in Euclidean space
A fixed point of an isometry group is a point that is a fixed point for every isometry in the group.
A fixed point of an isometry group is a point that is a fixed point for every isometry in the group.
Fixed-point combinator
A fixed-point combinator is a higher-order function that computes a fixed point of other functions.
A fixed-point combinator is a higher-order function that computes a fixed point of other functions.
Fixed-point index
In mathematics, the fixed-point index is a concept in topological fixed-point theory, and in particular Nielsen theory.
In mathematics, the fixed-point index is a concept in topological fixed-point theory, and in particular Nielsen theory.
Fixed-point lemma for normal functions
The fixed-point lemma for normal functions is a basic result in axiomatic set theory stating that any normal function has arbitrarily large fixed points (Levy 1979: p. 117).
The fixed-point lemma for normal functions is a basic result in axiomatic set theory stating that any normal function has arbitrarily large fixed points (Levy 1979: p. 117).
Fixed-point property
A mathematical object X has the fixed point property if every suitably well-behaved mapping from X to itself has a fixed point.
A mathematical object X has the fixed point property if every suitably well-behaved mapping from X to itself has a fixed point.
Fixed-point theorems in infinite-dimensional spaces
In mathematics, a number of fixed-point theorems in infinite-dimensional spaces generalise the Brouwer fixed-point theorem.
In mathematics, a number of fixed-point theorems in infinite-dimensional spaces generalise the Brouwer fixed-point theorem.
Functional renormalization group
In theoretical physics, functional renormalization group (FRG) is an implementation of the renormalization group (RG) concept which is used in quantum and statistical field theory, especially wh...
In theoretical physics, functional renormalization group (FRG) is an implementation of the renormalization group (RG) concept which is used in quantum and statistical field theory, especially wh...
Hairy ball theorem
The hairy ball theorem of algebraic topology states that there is no nonvanishing continuous tangent vector field on an even-dimensional n-sphere.
The hairy ball theorem of algebraic topology states that there is no nonvanishing continuous tangent vector field on an even-dimensional n-sphere.
Infrared fixed point
In physics, an infrared fixed point is a set of coupling constants, or other parameters that evolve from initial values at very high energies (short distance), to fixed stable values, usually pr...
In physics, an infrared fixed point is a set of coupling constants, or other parameters that evolve from initial values at very high energies (short distance), to fixed stable values, usually pr...
Iterated function
In mathematics, an iterated function is a function which is composed with itself, possibly ad infinitum, in a process called iteration.
In mathematics, an iterated function is a function which is composed with itself, possibly ad infinitum, in a process called iteration.
Kakutani fixed point theorem
In mathematical analysis, the Kakutani fixed point theorem is a fixed-point theorem for set-valued functions.
In mathematical analysis, the Kakutani fixed point theorem is a fixed-point theorem for set-valued functions.
Kakutani fixed-point theorem
In mathematical analysis, the Kakutani fixed point theorem is a fixed-point theorem for set-valued functions.
In mathematical analysis, the Kakutani fixed point theorem is a fixed-point theorem for set-valued functions.
Kleene fixed-point theorem
In the mathematical areas of order and lattice theory, the Kleene fixed-point theorem, named after American mathematician Stephen Cole Kleene, states the following: :Let L be a complete partia...
In the mathematical areas of order and lattice theory, the Kleene fixed-point theorem, named after American mathematician Stephen Cole Kleene, states the following: :Let L be a complete partia...
Knaster-Tarski theorem
In the mathematical areas of order and lattice theory, the Knaster–Tarski theorem, named after Bronisław Knaster and Alfred Tarski, states the following: :Let L be a complete lattice and let f...
In the mathematical areas of order and lattice theory, the Knaster–Tarski theorem, named after Bronisław Knaster and Alfred Tarski, states the following: :Let L be a complete lattice and let f...
Knaster–Tarski theorem
In the mathematical areas of order and lattice theory, the Knaster–Tarski theorem, named after Bronisław Knaster and Alfred Tarski, states the following: :Let L be a complete lattice and let f...
In the mathematical areas of order and lattice theory, the Knaster–Tarski theorem, named after Bronisław Knaster and Alfred Tarski, states the following: :Let L be a complete lattice and let f...
Least fixed point
In order theory, a branch of mathematics, the least fixed point (lfp or LFP) of a function is the fixed point which is less than or equal to all other fixed points, according to some...
In order theory, a branch of mathematics, the least fixed point (lfp or LFP) of a function is the fixed point which is less than or equal to all other fixed points, according to some...
Lefschetz fixed-point theorem
In mathematics, the Lefschetz fixed-point theorem is a formula that counts the number of fixed points of a continuous mapping from a compact topological space X to itself by means of traces...
In mathematics, the Lefschetz fixed-point theorem is a formula that counts the number of fixed points of a continuous mapping from a compact topological space X to itself by means of traces...
Lefschetz zeta function
In mathematics, the Lefschetz zeta-function is a tool used in topological periodic and fixed point theory, and dynamical systems.
In mathematics, the Lefschetz zeta-function is a tool used in topological periodic and fixed point theory, and dynamical systems.
Local zeta-function
In number theory, a local zeta-function :Z(t) is a function whose logarithmic derivative is a generating function for the number of solutions of a set of equations defined over a finit...
In number theory, a local zeta-function :Z(t) is a function whose logarithmic derivative is a generating function for the number of solutions of a set of equations defined over a finit...
Lotka-Volterra equation
The Lotka–Volterra equations, also known as the predator–prey equations, are a pair of first-order, non-linear, differential equations frequently used to describe the dynamics of biolo...
The Lotka–Volterra equations, also known as the predator–prey equations, are a pair of first-order, non-linear, differential equations frequently used to describe the dynamics of biolo...
Lotka–Volterra equation
The Lotka–Volterra equations, also known as the predator–prey equations, are a pair of first-order, non-linear, differential equations frequently used to describe the dynamics of biolo...
The Lotka–Volterra equations, also known as the predator–prey equations, are a pair of first-order, non-linear, differential equations frequently used to describe the dynamics of biolo...
Markus−Yamabe conjecture
In mathematics, the Markus-Yamabe conjecture is a conjecture on global asymptotic stability.
In mathematics, the Markus-Yamabe conjecture is a conjecture on global asymptotic stability.
Minimax
Minimax (sometimes minmax) is a decision rule used in decision theory, game theory, statistics and philosophy for minimizing the possible loss while maximizing the potential gain.
Minimax (sometimes minmax) is a decision rule used in decision theory, game theory, statistics and philosophy for minimizing the possible loss while maximizing the potential gain.
Nash equilibrium
In game theory, Nash equilibrium (named after John Forbes Nash, who proposed it) is a solution concept of a game involving two or more players, in which each player is assumed to know the equili...
In game theory, Nash equilibrium (named after John Forbes Nash, who proposed it) is a solution concept of a game involving two or more players, in which each player is assumed to know the equili...
Nielsen theory
Nielsen theory is a branch of mathematical research with its origins in topological fixed point theory.
Nielsen theory is a branch of mathematical research with its origins in topological fixed point theory.
Price of stability
In game theory, the price of stability (PoS) of a game is the ratio between the best objective function value of one of its equilibria and that of an optimal outcome.
In game theory, the price of stability (PoS) of a game is the ratio between the best objective function value of one of its equilibria and that of an optimal outcome.
Rencontres numbers
In combinatorial mathematics, the rencontres numbers are a triangular array of integers that enumerate permutations of the set { 1, ..., n } with specified numbers of fix...
In combinatorial mathematics, the rencontres numbers are a triangular array of integers that enumerate permutations of the set { 1, ..., n } with specified numbers of fix...
Renormalization group
In theoretical physics, the renormalization group refers to a mathematical apparatus that allows systematic investigation of the changes of a physical system as viewed at different distance s...
In theoretical physics, the renormalization group refers to a mathematical apparatus that allows systematic investigation of the changes of a physical system as viewed at different distance s...
Rotation number
In mathematics, the rotation number is an invariant of homeomorphisms of the circle.
In mathematics, the rotation number is an invariant of homeomorphisms of the circle.
Schauder fixed point theorem
The Schauder fixed point theorem is an extension of the Brouwer fixed point theorem to topological vector spaces, which may be of infinite dimension.
The Schauder fixed point theorem is an extension of the Brouwer fixed point theorem to topological vector spaces, which may be of infinite dimension.
Sperner's lemma
In mathematics, Sperner's lemma is a combinatorial analog of the Brouwer fixed point theorem.
In mathematics, Sperner's lemma is a combinatorial analog of the Brouwer fixed point theorem.
Sullivan conjecture
In mathematics, Sullivan conjecture can refer to any of several results and conjectures prompted by homotopy theory work of Dennis Sullivan.
In mathematics, Sullivan conjecture can refer to any of several results and conjectures prompted by homotopy theory work of Dennis Sullivan.
Thue-Morse sequence
In mathematics, the Thue–Morse sequence, or Prouhet–Thue–Morse sequence, is a binary sequence that begins: :0 1 10 1001 10010110 1001011001101001.
In mathematics, the Thue–Morse sequence, or Prouhet–Thue–Morse sequence, is a binary sequence that begins: :0 1 10 1001 10010110 1001011001101001.
Thue–Morse sequence
In mathematics, the Thue–Morse sequence, or Prouhet–Thue–Morse sequence, is a binary sequence that begins: :0 1 10 1001 10010110 1001011001101001.
In mathematics, the Thue–Morse sequence, or Prouhet–Thue–Morse sequence, is a binary sequence that begins: :0 1 10 1001 10010110 1001011001101001.
UV fixed point
If an ultraviolet or UV fixed point appears in the theory.
If an ultraviolet or UV fixed point appears in the theory.
Weil conjectures
In mathematics, the Weil conjectures were some highly-influential proposals by on the generating functions derived from counting the number of points on algebraic varieties over finite fields.
In mathematics, the Weil conjectures were some highly-influential proposals by on the generating functions derived from counting the number of points on algebraic varieties over finite fields.