Michał Morayne
Michał Morayne has a total of 17 co-authors. Here are the top co-authors by number of shared publications:
- James D. Mitchell
School of Mathematics and Statistics, University of St Andrews
5 shared publications - Y. Péresse
Mathematical Institute, University of St Andrews, North Haugh, St Andrews, Fife, KY16 9SS, Scotland
4 shared publications - Robert Rałowski
Faculty of Pure and Applied Mathematics, Wrocław University of Science and Technology, Wrocław, Poland
3 shared publications - Szymon Żeberski
Faculty of Pure and Applied Mathematics, Wrocław University of Science and Technology, Wrocław, Poland
3 shared publications - Taras Banakh
Ivan Franko Univ Lviv, Lvov, Ukraine
3 shared publications - Andrzej Grzesik
Faculty of Mathematics and Computer Science Jagiellonian University Kraków Poland
1 shared publication
Latest Publications
- Open Access
Topological Graph Inverse Semigroups
To every directed graph $E$ one can associate a \emph{graph inverse semigroup} $G(E)$, where elements roughly correspond to possible paths in $E$. These semigroups generalize polycylic monoids, and they arise in the study of Leavitt path algebras, Cohn path algebras, Cuntz-Krieger $C^*$-algebras, and Toeplitz $C^*$-algebras. We investigate topologies that turn $G(E)$ into a topological semigroup. For instance, we show that in any such topology that is Hausdorff, $G(E)\setminus \{0\}$ must be discrete for any directed graph $E$. On the other hand, $G(E)$ need not be discrete in a Hausdorff semigroup topology, and for certain graphs $E$, $G(E)$ admits a $T_1$ semigroup topology in which $G(E)\setminus \{0\}$ is not discrete. We also describe, in various situations, the algebraic structure and possible cardinality of the closure of $G(E)$ in larger topological semigroups.Open AccessTopological Graph Inverse Semigroups
To every directed graph $E$ one can associate a \emph{graph inverse semigroup} $G(E)$, where elements roughly correspond to possible paths in $E$. These semigroups generalize polycylic monoids, and they arise in the study of Leavitt path algebras, Cohn path algebras, Cuntz-Krieger $C^*$-algebras, and Toeplitz $C^*$-algebras. We investigate topologies that turn $G(E)$ into a topological semigroup. For instance, we show that in any such topology that is Hausdorff, $G(E)\setminus \{0\}$ must be discrete for any directed graph $E$. On the other hand, $G(E)$ need not be discrete in a Hausdorff semigroup topology, and for certain graphs $E$, $G(E)$ admits a $T_1$ semigroup topology in which $G(E)\setminus \{0\}$ is not discrete. We also describe, in various situations, the algebraic structure and possible cardinality of the closure of $G(E)$ in larger topological semigroups. - 1 September 2015
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 209 (2) , 715-743
Topologically invariant σ-ideals on the Hilbert cube
- 1 September 2015
- Published by Springer Nature in Israel Journal of Mathematics
- Vol. 209 (2) , 715-743
Topologically invariant σ-ideals on the Hilbert cube
- Open Access
Topologically invariant $σ$-ideals on the Hilbert cube
We study and classify topologically invariant $\sigma$-ideals with a Borel base on the Hilbert cube and evaluate their cardinal characteristics. One of the results of this paper solves (positively) a known problem whether the minimal cardinalities of the families of Cantor sets covering the unit interval and the Hilbert cube are the same.
Open AccessTopologically invariant $σ$-ideals on the Hilbert cube
We study and classify topologically invariant $\sigma$-ideals with a Borel base on the Hilbert cube and evaluate their cardinal characteristics. One of the results of this paper solves (positively) a known problem whether the minimal cardinalities of the families of Cantor sets covering the unit interval and the Hilbert cube are the same.
- Open Access
From directed path to linear order - the best choice problem for powers of directed path
We examine the evolution of the best choice algorithm and the probability of its success from a directed path to the linear order of the same cardinality through $k$th powers of a directed path, $1 \leq k < n$. The vertices of a $k$th power of a directed path of a known length $n$ are exposed one by one to a selector in some random order. At any time the selector can see the graph induced by the vertices that have already come. The selector's aim is to choose online the maximal vertex (i.e. the vertex with no outgoing edges). It is shown that the probability of success $p_n$ for the optimal algorithm for the $k$th power of a directed path satisfies $p_n = \Theta(n^{-1/(k+1)})$. We also consider the case when the selector knows the distance in the underlying path between each two vertices that are joined by an edge in the induced graph. An optimal algorithm for this choice problem is presented. The exact probability of success when using this algorithm is given.Open AccessFrom directed path to linear order - the best choice problem for powers of directed path
We examine the evolution of the best choice algorithm and the probability of its success from a directed path to the linear order of the same cardinality through $k$th powers of a directed path, $1 \leq k < n$. The vertices of a $k$th power of a directed path of a known length $n$ are exposed one by one to a selector in some random order. At any time the selector can see the graph induced by the vertices that have already come. The selector's aim is to choose online the maximal vertex (i.e. the vertex with no outgoing edges). It is shown that the probability of success $p_n$ for the optimal algorithm for the $k$th power of a directed path satisfies $p_n = \Theta(n^{-1/(k+1)})$. We also consider the case when the selector knows the distance in the underlying path between each two vertices that are joined by an edge in the induced graph. An optimal algorithm for this choice problem is presented. The exact probability of success when using this algorithm is given. - Open Access
- 24 November 2012
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 30 (1) , 159-170
A Note on Counting Homomorphisms of Paths
- 24 November 2012
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 30 (1) , 159-170
Open AccessA Note on Counting Homomorphisms of Paths
- Open Access
- 19 October 2012
- Published by Wiley in Mathematical Logic Quarterly
- Vol. 58 (6) , 424-433
The Bergman‐Shelah preorder on transformation semigroups
Let \documentclass{article}\usepackage{amssymb}\pagestyle{empty}$\mathbb {N}^\mathbb {N}$ be the semigroup of all mappings on the natural numbers \documentclass{article}\usepackage{amssymb}\pagestyle{empty}$\mathbb {N}$ , and let U and V be subsets of \documentclass{article}\usepackage{amssymb}\pagestyle{empty}$\mathbb {N}^\mathbb {N}$ . We write U≼V if there exists a countable subset C of \documentclass{article}\usepackage{amssymb}\pagestyle{empty}$\mathbb {N}^\mathbb {N}$ such that U is contained in the subsemigroup generated by V and C. We give several results about the structure of the preorder ≼. In particular, we show that a certain statement about this preorder is equivalent to the Continuum Hypothesis.The preorder ≼ is analogous to one introduced by Bergman and Shelah on subgroups of the symmetric group on \documentclass{article}\usepackage{amssymb}\pagestyle{empty}$\mathbb {N}$ . The results in this paper suggest that the preorder on subsemigroups of \documentclass{article}\usepackage{amssymb}\pagestyle{empty}$\mathbb {N}^\mathbb {N}$ is much more complicated than that on subgroups of the symmetric group.
- 19 October 2012
- Published by Wiley in Mathematical Logic Quarterly
- Vol. 58 (6) , 424-433
Open AccessThe Bergman‐Shelah preorder on transformation semigroups
Let \documentclass{article}\usepackage{amssymb}\pagestyle{empty}$\mathbb {N}^\mathbb {N}$ be the semigroup of all mappings on the natural numbers \documentclass{article}\usepackage{amssymb}\pagestyle{empty}$\mathbb {N}$ , and let U and V be subsets of \documentclass{article}\usepackage{amssymb}\pagestyle{empty}$\mathbb {N}^\mathbb {N}$ . We write U≼V if there exists a countable subset C of \documentclass{article}\usepackage{amssymb}\pagestyle{empty}$\mathbb {N}^\mathbb {N}$ such that U is contained in the subsemigroup generated by V and C. We give several results about the structure of the preorder ≼. In particular, we show that a certain statement about this preorder is equivalent to the Continuum Hypothesis.The preorder ≼ is analogous to one introduced by Bergman and Shelah on subgroups of the symmetric group on \documentclass{article}\usepackage{amssymb}\pagestyle{empty}$\mathbb {N}$ . The results in this paper suggest that the preorder on subsemigroups of \documentclass{article}\usepackage{amssymb}\pagestyle{empty}$\mathbb {N}^\mathbb {N}$ is much more complicated than that on subgroups of the symmetric group.
- Open Access
Topologically invariant σ-ideals on Euclidean spaces
We study and classify topologically invariant sigma-ideals with an analytic base on Euclidean spaces and evaluate the cardinal characteristics of such ideals.
Open AccessTopologically invariant σ-ideals on Euclidean spaces
We study and classify topologically invariant sigma-ideals with an analytic base on Euclidean spaces and evaluate the cardinal characteristics of such ideals.
- 15 February 2011
- Published by Elsevier in Topology and its Applications
- Vol. 158 (3) , 412-423
Relative ranks of Lipschitz mappings on countable discrete metric spaces
- 15 February 2011
- Published by Elsevier in Topology and its Applications
- Vol. 158 (3) , 412-423
Relative ranks of Lipschitz mappings on countable discrete metric spaces
- Open Access
- 1 February 2011
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society
- Vol. 139 (02) , 401
Generating the infinite symmetric group using a closed subgroup and the least number of other elements
Let <!-- MATH $S_{\infty}$ --> denote the symmetric group on the natural numbers <!-- MATH $\mathbb{N}$ --> . Then <!-- MATH $S_{\infty}$ --> is a Polish group with the topology inherited from <!-- MATH $\mathbb{N}^{\mathbb{N}}$ --> with the product topology and the discrete topology on <!-- MATH $\mathbb{N}$ --> . Let <!-- MATH $\mathfrak{d}$ --> denote the least cardinality of a dominating family for <!-- MATH $\mathbb{N}^{\mathbb{N}}$ --> and let <!-- MATH $\mathfrak{c}$ --> denote the continuum. Using theorems of Galvin, and Bergman and Shelah we prove that if is any subgroup of <!-- MATH $S_{\infty}$ --> that is closed in the above topology and is a subset of <!-- MATH $S_{\infty}$ --> with least cardinality such that generates <!-- MATH $S_{\infty}$ --> , then <!-- MATH $|H|\in \{0,1,\mathfrak{d},\mathfrak{c}\}$ --> .- 1 February 2011
- Published by American Mathematical Society (AMS) in Proceedings of the American Mathematical Society
- Vol. 139 (02) , 401
Open AccessGenerating the infinite symmetric group using a closed subgroup and the least number of other elements
Let <!-- MATH $S_{\infty}$ --> denote the symmetric group on the natural numbers <!-- MATH $\mathbb{N}$ --> . Then <!-- MATH $S_{\infty}$ --> is a Polish group with the topology inherited from <!-- MATH $\mathbb{N}^{\mathbb{N}}$ --> with the product topology and the discrete topology on <!-- MATH $\mathbb{N}$ --> . Let <!-- MATH $\mathfrak{d}$ --> denote the least cardinality of a dominating family for <!-- MATH $\mathbb{N}^{\mathbb{N}}$ --> and let <!-- MATH $\mathfrak{c}$ --> denote the continuum. Using theorems of Galvin, and Bergman and Shelah we prove that if is any subgroup of <!-- MATH $S_{\infty}$ --> that is closed in the above topology and is a subset of <!-- MATH $S_{\infty}$ --> with least cardinality such that generates <!-- MATH $S_{\infty}$ --> , then <!-- MATH $|H|\in \{0,1,\mathfrak{d},\mathfrak{c}\}$ --> . - 30 September 2010
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 161 (12) , 1471-1485
Generating transformation semigroups using endomorphisms of preorders, graphs, and tolerances
- 30 September 2010
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 161 (12) , 1471-1485
Generating transformation semigroups using endomorphisms of preorders, graphs, and tolerances