Related papers: Spaces With Complexity One

Topological complexity $\TC{B}$ of a space $B$ is introduced by M. Farber to measure how much complex the space is, which is first considered on a configuration space of a motion planning of a robot arm. We also consider a stronger version…

Let TC$_n$(X) denote the n-th topological complexity of a topological space X. It is known that TC$_n$(X) does not exceed n-1 for non-contractible X, and so it makes sense to describe spaces X with TC$_n$(X) =n-1. Grant--Lupton--Oprea…

Let $X$ be the prime spectrum of a ring. In [arXiv:0707.1525] the authors define a topology on $X$ by using ultrafilters and they show that this topology is precisely the constructible topology. In this paper we generalize the construction…

We give a survey of the known connections between regularity conditions and amenability conditions in the setting of uniform algebras. For a uniform algebra $A$ we consider the set, $A_{lc}$, of functions in $A$ which are locally constant…

Let $\mathcal{A}$ be the subdivision of $\mathbb{R}^d$ induced by $m$ convex polyhedra having $n$ facets in total. We prove that $\mathcal{A}$ has combinatorial complexity $O(m^{\lceil d/2 \rceil} n^{\lfloor d/2 \rfloor})$ and that this…

Given a metrizable space $X$, let $AM(X)$ be the space of continuous bounded admissible metrics on $X$, which is endowed with the sup-metric. In this paper, we shall investigate the Borel complexity and the complete metrizability of $AM(X)$…

A well calibrated method to describe the environment of galaxies at all redshifts is essential for the study of structure formation. Such a calibration should include well understood correlations with halo mass, and the possibility to…

This paper addresses some questions about dimension theory for P-minimal structures. We show that, for any definable set A, the dimension of the frontier of A is strictly smaller than the dimension of A itself, and that A has a…

The space of orientation-compatible almost complex structures on the six-dimensional sphere naturally contains a copy of seven-dimensional real projective space. We show that the inclusion induces an isomorphism on fundamental groups and…

The self-closeness number $N\mathcal{E}(X)$ of a space $X$ is the least integer $k$ such that any self-map is a homotopy equivalence whenever it is an isomorphism in the $n$-th homotopy group for each $n\le k$. We discuss the self-closeness…

This paper is dedicated to new methods of constructing weight structures and weight-exact localizations; our arguments generalize their bounded versions considered in previous papers of the authors. We start from a class of objects $P$ of…

This is a study of localised structures in one-dimensional cellular automata, with the elementary cellular automaton Rule 54 as a guiding example. A formalism for particles on a periodic background is derived, applicable to all…

At present the possible existence of planets around the stars of a close binary system is still matter of debate. Can planetary bodies form in spite of the strong gravitational perturbations of the companion star? We study in this paper via…

An S-approximation space is a novel approach to study systems with uncertainty that are not expressible in terms of inclusion relations. In this work, we further examined these spaces, mostly from a topological point of view by a…

In this paper we generalize cellular algebras by allowing different partial orderings relative to fixed idempotents. For these relative cellular algebras we classify and construct simple modules, and we obtain other characterizations in…

The relaxation complexity $\mathrm{rc}(X)$ of the set of integer points $X$ contained in a polyhedron is the smallest number of facets of any polyhedron $P$ such that the integer points in $P$ coincide with $X$. It is a useful tool to…

$\alpha$ Centauri A is the closest solar-type star to the Sun and offers the best opportunity to find and ultimately to characterize an Earth-sized planet located in its Habitable Zone (HZ). Here we describe initial results from an ALMA…

This paper deals with the CREP (Configuration REachability Problem) for non-uniform cellular automata (CAs). The cells of non-uniform CAs, we have considered here, can use different Wolfram's rules to generate their next states. We report…

A central problem of geometry is the tiling of space with simple structures. The classical solutions, such as triangles, squares, and hexagons in the plane and cubes and other polyhedra in three-dimensional space are built with sharp…

Let $S(A)$ denote the orbit of a complex or real matrix $A$ under a certain equivalence relation such as unitary similarity, unitary equivalence, unitary congruences etc. Efficient gradient-flow algorithms are constructed to determine the…