Results 11  20
of
21,580
GENERATING EQUIVALENCE RELATIONS BY HOMEOMORPHISMS
, 2008
"... Abstract. We give a construction of a single homeomorphism of 2 N which generates the equivalence relation E0. We then consider ways of generating this equivalence relation using homeomorphisms with nicer structural properties, and show that several such properties are impossible for a homeomorphism ..."
Abstract
 Add to MetaCart
Abstract. We give a construction of a single homeomorphism of 2 N which generates the equivalence relation E0. We then consider ways of generating this equivalence relation using homeomorphisms with nicer structural properties, and show that several such properties are impossible for a
AF equivalence relations and their cocycles
"... After a review of some the main results about hyper nite equivalence relations and their cocycles in the measured setting, we give a de nition of a topological AF equivalence relation. We show that every cocycle is cohomologous to a quasiproduct cocycle. We then study the problem of determini ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
After a review of some the main results about hyper nite equivalence relations and their cocycles in the measured setting, we give a de nition of a topological AF equivalence relation. We show that every cocycle is cohomologous to a quasiproduct cocycle. We then study the problem
EQUIVALENCE RELATIONS OF MEALY AUTOMATA
"... Two independent equivalence relations are considered for Mealy automata. Simulation equivalence, on the one hand, arises from a new multistep simulation concept under the constraint that the process of switching from one automaton to the other is reversible. Retiming equivalence, on the other han ..."
Abstract
 Add to MetaCart
Two independent equivalence relations are considered for Mealy automata. Simulation equivalence, on the one hand, arises from a new multistep simulation concept under the constraint that the process of switching from one automaton to the other is reversible. Retiming equivalence, on the other
The Complexity of Equivalence Relations
, 2008
"... To determine if two given lists of numbers are the same set, we would sort both lists and see if we get the same result. The sorted list is a canonical form for the equivalence relation of set equality. Other canonical forms for equivalences arise in graph isomorphism and its variants, and the equal ..."
Abstract
 Add to MetaCart
To determine if two given lists of numbers are the same set, we would sort both lists and see if we get the same result. The sorted list is a canonical form for the equivalence relation of set equality. Other canonical forms for equivalences arise in graph isomorphism and its variants
The classification of hypersmooth Borel equivalence relations
 J. Amer. Math. Soc
, 1997
"... This paper is a contribution to the study of Borel equivalence relations in standard Borel spaces, i.e., Polish spaces equipped with their Borel structure. A class of such equivalence relations which has received particular attention is the class of hyperfinite Borel equivalence relations. These can ..."
Abstract

Cited by 50 (4 self)
 Add to MetaCart
This paper is a contribution to the study of Borel equivalence relations in standard Borel spaces, i.e., Polish spaces equipped with their Borel structure. A class of such equivalence relations which has received particular attention is the class of hyperfinite Borel equivalence relations
4. Representation by Equivalence Relations
"... No taxation without representation! So far we have no analogue for lattices of the Cayley theorem for groups, that every group is isomorphic to a group of permutations. The corresponding representation theorem for lattices, that every lattice is isomorphic to a lattice of equivalence relations, turn ..."
Abstract
 Add to MetaCart
No taxation without representation! So far we have no analogue for lattices of the Cayley theorem for groups, that every group is isomorphic to a group of permutations. The corresponding representation theorem for lattices, that every lattice is isomorphic to a lattice of equivalence relations
Symmetric Operations on Equivalence Relations
, 2003
"... A new binary operation on the family of equivalence relations was introduced and studied by Britz, Mainetti, and Pezzoli. In this paper we give an equivalent, easier to grasp, denition of the same binary operation, and we prove it to be just an example of a bigger family of binary operations, whic ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
A new binary operation on the family of equivalence relations was introduced and studied by Britz, Mainetti, and Pezzoli. In this paper we give an equivalent, easier to grasp, denition of the same binary operation, and we prove it to be just an example of a bigger family of binary operations
Analytic equivalence relations and biembeddability
 J. Symbolic Logic
"... Abstract. Louveau and Rosendal [5] have shown that the relation of biembeddability for countable graphs as well as for many other natural classes of countable structures is complete under Borel reducibility for analytic equivalence relations. This is in strong contrast to the case of the isomorphi ..."
Abstract

Cited by 7 (4 self)
 Add to MetaCart
Abstract. Louveau and Rosendal [5] have shown that the relation of biembeddability for countable graphs as well as for many other natural classes of countable structures is complete under Borel reducibility for analytic equivalence relations. This is in strong contrast to the case
Some natural equivalence relations in the
, 2008
"... We obtain some nonreducibility results concerning some natural equivalence relations on reals in the Solovay model. The proofs use the existence of reals x which are minimal with respect to the cardinals in L[x] , in a certain sense. 1 ..."
Abstract
 Add to MetaCart
We obtain some nonreducibility results concerning some natural equivalence relations on reals in the Solovay model. The proofs use the existence of reals x which are minimal with respect to the cardinals in L[x] , in a certain sense. 1
Results 11  20
of
21,580