Displaying similar documents to “Polynomial operations on stable cohomotopy.”

On the stable equivalence problem for k[x,y]

Robert Dryło (2011)

Colloquium Mathematicae

Similarity:

L. Makar-Limanov, P. van Rossum, V. Shpilrain and J.-T. Yu solved the stable equivalence problem for the polynomial ring k[x,y] when k is a field of characteristic 0. In this note we give an affirmative solution for an arbitrary field k.

Around stable forking

Byunghan Kim, A. Pillay (2001)

Fundamenta Mathematicae

Similarity:

We discuss various conjectures and problems around the issue of when and whether stable formulas are responsible for forking in simple theories. We prove that if the simple theory T has strong stable forking then any complete type is a nonforking extension of a complete type which is axiomatized by instances of stable formulas. We also give another treatment of the first author's result which identifies canonical bases in supersimple theories.

A Note on the Uniqueness of Stable Marriage Matching

Ewa Drgas-Burchardt (2013)

Discussiones Mathematicae Graph Theory

Similarity:

In this note we present some sufficient conditions for the uniqueness of a stable matching in the Gale-Shapley marriage classical model of even size. We also state the result on the existence of exactly two stable matchings in the marriage problem of odd size with the same conditions.

Stable elements of Banach and Fréchet algebras

Graham Allan (1998)

Studia Mathematica

Similarity:

We introduce an algebraic notion-stability-for an element of a commutative ring. It is shown that the stable elements of Banach algebras, and of Fréchet algebras, may be simply described. Part of the theory of power-series embeddings, given in [1] and [4], is seen to be of a purely algebraic nature. This approach leads to other natural questions.