7 resultados para Equivalence Proof

em Bulgarian Digital Mathematics Library at IMI-BAS


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Let (X, d) be a metric space and CL(X) the family of all nonempty closed subsets of X. We provide a new proof of the fact that the coincidence of the Vietoris and Wijsman topologies induced by the metric d forces X to be a compact space. In the literature only a more involved and indirect proof using the proximal topology is known. Here we do not need this intermediate step. Moreover we prove that (X, d) is boundedly compact if and only if the bounded Vietoris and Wijsman topologies on CL(X) coincide.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This article discusses techniques for organization of propaedeutic stage of teaching proof in mathematics course. It identifies types of tasks that allow students of 5–6 classes to form the ability to carry out simple proofs. This article describes each type of tasks features, it gives some examples.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Methods for representing equivalence problems of various combinatorial objects as graphs or binary matrices are considered. Such representations can be used for isomorphism testing in classification or generation algorithms. Often it is easier to consider a graph or a binary matrix isomorphism problem than to implement heavy algorithms depending especially on particular combinatorial objects. Moreover, there already exist well tested algorithms for the graph isomorphism problem (nauty) and the binary matrix isomorphism problem as well (Q-Extension). ACM Computing Classification System (1998): F.2.1, G.4.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 46B70, 41A10, 41A25, 41A27, 41A35, 41A36, 42A10.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 49J52, 49J50, 58C20, 26B09.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: Primary 11A15.