Related papers: Spaces With Complexity One
Let $X$ be a co-$H$-space of $(p-1)$-cell complex with all cells in even dimensions. Then the loop space $\Omega X$ admits a retract $\bar A^{\min}(X)$ that is the evaluation of the functor $\bar A^{\min}$ on $X$. In this paper, we…
Let $p$ be a prime. In this paper, we compute complexities of some simple modules of symmetric groups labelled by two-part partitions. Most of the simple modules considered here are contained in the $p$-blocks with non-abelian defect…
A space Y is called an extension of a space X if Y contains X as a dense subspace. An extension Y of X is called a one-point extension if Y-X is a singleton. Compact extensions are called compactifications and connected extensions are…
We construct embeddings of simplicial complexes into a (surface of a) simplicial ball whose triangulation has bounded degrees and low volume. This construction can be used either to efficiently "simplify a complicated space" by realizing it…
In this paper, we propose an efficient clustering technique to solve the problem of clustering in the presence of obstacles. The proposed algorithm divides the spatial area into rectangular cells. Each cell is associated with statistical…
The moduli space of triangles is a two-dimensional space that records triangle shapes in the plane, considered up to similarity. We study the subset corresponding to \textit{lattice triangles}, which are triangles whose vertices have…
We devise a generalization of tree approximation that generates conforming meshes, i.e., meshes with a particular structure like edge-to-edge triangulations. A key feature of this generalization is that the choices of the cells to be…
Each continuous weak selection for a space $X$ defines a coarser topology on $X$, called a selection topology. Spaces whose topology is determined by a collection of such selection topologies are called continuous weak selection spaces. For…
In this note, we shall generalize the notion of a $P$-space to proximity spaces and investigate the basic properties of these proximities. We therefore define a $P_{\aleph_{1}}$-proximity to be a proximity where if $A_{n}\prec B$ for all…
The modular envelope of a cyclic operad is the smallest modular operad containing it. A modular operad is constructed from moduli spaces of Riemann surfaces with boundary; this modular operad is shown to be the modular envelope of the…
Approximation theory is concerned with the ability to approximate functions by simpler and more easily calculated functions. The first question we ask in approximation theory concerns the {\it possibility of approximation}. Is the given…
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…
Computational feasibility is a widespread concern that guides the framing and modeling of biological and artificial intelligence. The specification of cognitive system capacities is often shaped by unexamined intuitive assumptions about the…
We determine topological complexity of a series of finite spaces which is weakly homotopy equivalent to a circle $S^1$, and give a finite space $X$ satisfying the inequality tc$(X) <$ cat$(X {\times} X)$. This answers two conjectures on…
Given a simplicial idempotent augmented endofunctor $F$ on a simplicial combinatorial model category $M$, under the assumption of Vopenka's principle, we exhibit a set $A$ of cofibrant objects in $M$ such that $F$ is equivalent to $\CW_A$,…
Let $S$ be a complete flat surface, such as the Euclidean plane. We determine the homeomorphism class of the space of all curves on $S$ which start and end at given points in given directions and whose curvatures are constrained to lie in a…
We investigate the $\mathcal F$-Borel complexity of topological spaces in their different compactifcations. We provide a simple proof of the fact that a space can have arbitrarily many different complexities in different compactifications.…
For a set $X$ of integer points in a polyhedron, the smallest number of facets of any polyhedron whose set of integer points coincides with $X$ is called the relaxation complexity $\mathrm{rc}(X)$. This parameter was introduced by Kaibel &…
A class of Cantor-type spaces and related geometric structures are discussed.
We provide space complexity lower bounds for data structures that approximate logistic loss up to $\epsilon$-relative error on a logistic regression problem with data $\mathbf{X} \in \mathbb{R}^{n \times d}$ and labels $\mathbf{y} \in…