Related papers: Spaces With Complexity One
We analyze the complexity of fitting a variety, coming from a class of varieties, to a configuration of points in $\Bbb C^n$. The complexity measure, called the algebraic complexity, computes the Euclidean Distance Degree (EDdegree) of a…
We say that two classes of topological spaces are equivalent if each member of one class has a homeomorphic copy in the other class and vice versa. Usually when the Borel complexity of a class of metrizable compacta is considered, the class…
A topological space ${\mathcal X}$ is reversible iff each continuous bijection (condensation) $f: {\mathcal X} \rightarrow {\mathcal X}$ is a homeomorphism; weakly reversible iff whenever ${\mathcal Y}$ is a space and there are…
We develop a notion of cell decomposition suitable for studying weak p- adic structures (reducts of p-adic fields where addition and multiplication are not (everywhere) definable). As an example, we apply this to a language with restricted…
We consider causal 3-dimensional triangulations with the topology of $S^2\times [0,1]$ or $D^2\times [0,1]$ where $S^2$ and $D^2$ are the two-dimensional sphere and disc, respectively. These triangulations consist of slices and we show that…
A cellular automaton is a deterministic and exactly computable dynamical system which mimics certain fundamental aspects of physical dynamics such as spatial locality and finite entropy. CA systems can be constructed which have additional…
As an introduction to the concept of "moduli space" we consider the moduli space of similarity classes of acute and right triangles in the plane. This has a map to the moduli space of elliptic curves which is onto and generically…
Sharply o-minimal structures (denoted \so-minimal) are a strict subclass of the o-minimal structures, aimed at capturing some finer features of structures arising from algebraic geometry and Hodge theory. Sharp o-minimality associates to…
One measure of the complexity of a 3-manifold is its triangulation complexity: the minimal number of tetrahedra in a triangulation of it. A natural question is whether we can relate this quantity to its topology. We determine the…
We introduce higher simplicial complexity of a simplicial complex $K$ and higher combinatorial complexity of a finite space $P$ (i.e. $P$ is a finite poset). We relate higher simplicial complexity with higher topological complexity of $|K|$…
Generic polyhedra are interesting mathematical objects to study in their own right. In this paper, we initialize a systematic study of two-dimensional generic polyhedra with an eye towards applications to low-dimensional topology,…
This article introduces proximal cell complexes in a hyperconnected space. Hyperconnectedness encodes how collections of path-connected sub-complexes in a Alexandroff-Hopf-Whitehead CW space are near to or far from each other. Several main…
Hypersphere classification is a classical and foundational method that can provide easy-to-process explanations for the classification of real-valued and binary data. However, obtaining an (ideally concise) explanation via hypersphere…
Approximation/interpolation from spaces of positive definite or conditionally positive definite kernels is an increasingly popular tool for the analysis and synthesis of scattered data, and is central to many meshless methods. For a set of…
We determine the topological complexity of unordered configuration spaces on almost all punctured surfaces (both orientable and non-orientable). We also give improved bounds for the topological complexity of unordered configuration spaces…
For a collection of subcategories satisfying a fixed set of conditions, for example thick subcategories of a triangulated category, we define a topological space called classifying space of subcategories. We show that this space classifies…
We develop a general theory for estimating the probability that a galaxy cluster of a given shape exists. The theory is based on the observed result that the distribution of galaxies is very close to quasi-equilibrium, in both its linear…
Let A = (A,V) be a complex hyperplane arrangement and let L(A) denote its intersection lattice. The arrangement A is called supersolvable, provided its lattice L(A) is supersolvable. For X in L(A), it is known that the restriction A^X is…
V.I. Arnold has recently defined the complexity of a sequence of $n$ zeros and ones with the help of the operator of finite differences. In this paper we describe the results obtained for almost most complicated sequences of elements of a…
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…