Related papers: Algorithmic Counting of Zero-Dimensional Finite To…
Zero-dimensional structural numbers $Z_0^{\mathrm{ind}}$ and $Z_0^{\mathrm{dim}}$ w.r.t. dimensions $\mathrm{ind}$ and $\mathrm{dim}$ were introduced by Georgiou, Hattori, Megaritis, and Sereti. Somewhat similarly, we define structural…
We begin to study classical dimension theory from the computable analysis (TTE) point of view. For computable metric spaces, several effectivisations of zero-dimensionality are shown to be equivalent. The part of this characterisation that…
Using information about the rational cohomology ring of the space of oriented isometry classes of planar n-gons with specified side lengths, we obtain bounds for the zero-divisor-cup-length (zcl) of these spaces, which provide lower bounds…
A `whole-part' theory is developed for a set of finite quantum systems $\Sigma (n)$ with variables in ${\mathbb Z}(n)$. The partial order `subsystem' is defined, by embedding various attributes of the system $\Sigma (m)$ (quantum states,…
Theorem: Let X and Y be two Banach spaces, Phi: X to Y a continuous, linear, surjective operator, and Psi: X to Y a completely continuous operator with bounded range. Then, one has dim{x in X : Phi(x)=Psi(x)} >= dim(Phi^{-1}(0)). Here dim…
In many areas of applied geometric/numeric computational mathematics, including geo-mapping, computer vision, computer graphics, finite element analysis, medical imaging, geometric design, and solid modeling, one has to compute incidences,…
Enclosing depth is a recently introduced depth measure which gives a lower bound to many depth measures studied in the literature. So far, enclosing depth has only been studied from a combinatorial perspective. In this work, we give the…
Based on previous results of digital topology, this paper focuses on algorithms of topological invariants of objects in 2D and 3D Digital Spaces. We specifically interest in solving hole counting of 2D objects and genus of closed surface in…
We describe an algorithm to count the number of distinct real zeros of a polynomial (square) system f. The algorithm performs O(n D kappa(f)) iterations where n is the number of polynomials (as well as the dimension of the ambient space), D…
This paper presents a general framework for calculating the dimension of spline spaces over arbitrary rectilinear partitions using the smoothing cofactor method. The approach extends existing dimension theory for polynomial splines over…
In this paper we develop some combinatorial models for continuous spaces. In this spirit we study the approximations of continuous spaces by graphs, molecular spaces and coordinate matrices. We define the dimension on a discrete space by…
An $n$-dimensional chair consists of an $n$-dimensional box from which a smaller $n$-dimensional box is removed. A tiling of an $n$-dimensional chair has two nice applications in coding for write-once memories. The first one is in the…
We prove several results of the following type: given finite dimensional normed space V there exists another space X with log (dim X) = O(log (dim V)) and such that every subspace (or quotient) of X, whose dimension is not "too small,"…
A covering code is a set of codewords with the property that the union of balls, suitably defined, around these codewords covers an entire space. Generally, the goal is to find the covering code with the minimum size codebook. While most…
The width measure treedepth, also known as vertex ranking, centered coloring and elimination tree height, is a well-established notion which has recently seen a resurgence of interest. Since graphs of bounded treedepth are more restricted…
The winding number has been widely used as an invariant for diagnosing topological phases in one-dimensional chiral-symmetric systems. We put forward a real-space representation for the winding number. Remarkably, our method reproduces an…
Let $S$ be a set of $n$ points in the plane. We present several different algorithms for finding a pair of points in $S$ such that any disk that contains that pair must contain at least $cn$ points of $S$, for some constant $c>0$. The first…
We consider the problem of encoding two-dimensional arrays, whose elements come from a total order, for answering \topk{} queries. The aim is to obtain encodings that use space close to the information-theoretic lower bound, which can be…
A strongly zero-dimensional topological group containing a closed subgroup of positive covering dimension is constructed.
Dimensionality reduction techniques map values from a high dimensional space to one with a lower dimension. The result is a space which requires less physical memory and has a faster distance calculation. These techniques are widely used…