相关论文: Metric spaces with complexity of the smallest infi…
An infinite permutation is a linear ordering of the set of non-negative integers. Generally, the properties of infinite permutations analogous to those of infinite words show some resemblances and some differences between permutations and…
A construction of product measures is given for an arbitrary sequence of measure spaces via outer measure techniques without imposing any condition on the underlying measure spaces. This approach concludes finally the problem of the…
We prove that the properties of acting metrically properly on some space with walls or some CAT(0) cube complex are closed by taking the wreath product with \Z. We also give a lower bound for the (equivariant) Hilbert space compression of…
We study Polish spaces for which a set of possible distances $A \subseteq \mathbb{R}^+$ is fixed in advance. We determine, depending on the properties of $A$, the complexity of the collection of all Polish metric spaces with distances in…
The complexity of a module is the rate of growth of the minimal projective resolution of the module while the $z$-complexity is the rate of growth of the number of indecomposable summands at each step in the resolution. Let…
We construct generalized regular representations of the wreath product of a compact group with the infinite symmetric group. The characters of these representations are determined by probability measures on families of partitions called the…
We construct a metric space whose transfinite asymptotic dimension and complementary-finite asymptotic dimension are both omega+1, where omega is the smallest infinite ordinal number. Therefore, we prove that the omega conjecture is not…
The complexity function of an infinite word $w$ on a finite alphabet $A$ is the sequence counting, for each non-negative $n$, the number of words of length $n$ on the alphabet $A$ that are factors of the infinite word $w$. The goal of this…
The symbolic complexity of an infinite word $W$ is the function $p_W(l)$ counting the number of different subwords in $W$ of length $l$. In this paper our main purpose is to study the complexity for a class of topological dynamical systems,…
The metric complexity (sometimes called Leinster--Cobbold maximum diversity) of a compact metric space is a recently introduced isometry-invariant of compact metric spaces which generalizes the notion of cardinality, and can be thought of…
We consider representing of natural numbers by arithmetical expressions using ones, addition, multiplication and parentheses. The (integer) complexity of n -- denoted by ||n|| -- is defined as the number of ones in the shortest expressions…
An $A$-cellular space is a space built from $A$ and its suspensions, analogously to the way that $CW$-complexes are built from $S^0$ and its suspensions. The $A$-cellular approximation of a space $X$ is an $A$-cellular space $CW_{A}X$ which…
The space of marked commutative rings on n given generators is a compact metrizable space. We compute the Cantor-Bendixson rank of any member of this space. For instance, the Cantor-Bendixson rank of the free commutative ring on n…
The influence of errors on the convergence of infinite products of weak quasi-contraction mappings in $b$-metric spaces is explored. An example demonstrating the necessity of convergence of the sequence of computational errors to zero is…
In this work we study weighted total least squares problems on infinite dimensional spaces. We show that in most cases this problem does not admit a solution (except in the trivial case) and then, we consider a regularization on the…
We define the notion of {\em rational presentation of a complete metric space} in order to study metric spaces from the algorithmic complexity point of view. In this setting, we study some presentations of the space $\czu$ of uniformly…
We conjecture that whenever $M$ is a metric space of density at most continuum, then the space of Lipschitz functions is $w^*$-separable. We prove the conjecture for several classes of metric spaces including all the Banach spaces with a…
We specify the frontier of decidability for fragments of the first-order theory of ordinal multiplication. We give a NEXPTIME lower bound for the complexity of the existential fragment of $\langle \omega^{\omega^\lambda}; \times, \omega,…
We propose the extension of the complex numbers to be the new domain where new concepts, like negative and imaginary probabilities, can be defined. The unit of the new space is defined as the solution of the unsolvable equation in the…
We determine the exact complexity of classifying compact metric spaces up to homeomorphism. More precisely, the homeomorphism relation on compact metric spaces is Borel bi-reducible with the complete orbit equivalence relation of Polish…