Related papers: How many three-dimensional Hilbert curves are ther…
We examine space-filling curves, which are surjective continuous maps from $[0,1]$ to some higher-dimensional space, usually the unit square $[0,1]^2$. In particular, we define Peano's curve and Lebesgue's curve, and state some of their…
The first part of Hilbert's sixteenth problem deals with the classification of the isotopy types realizable by real plane algebraic curves of a given degree $m$. For $m = 9$, the classification of the $M$-curves is still wide open. Let…
Curves play a fundamental role across computer graphics, physical simulation, and mathematical visualization, yet most tools for curve design do nothing to prevent crossings or self-intersections. This paper develops efficient algorithms…
In this project we examine several different quantum key distribution protocols which we divide into ones utilizing qubits whose Hilbert spaces are two dimensional and ones whose Hilbert space dimension is greater than two, these units of…
The Hilbert metric is a distance function defined for points lying within the interior of a convex body. It arises in the analysis and processing of convex bodies, machine learning, and quantum information theory. In this paper, we show how…
In this paper, we introduce new general frameworks for estimating the maximal dimension of Hilbert cubes contained in finite truncations of arbitrary sets. As applications, we investigate Hilbert cubes in a range of arithmetic sets,…
We prove the existence of locally distance increasing maps with it controllable small curvatures
Pfister and Steenbrink studied punctual Hilbert schemes for irreducible curve singularities. In particular, they investigated the structure of special punctual Hilbert schemes for certain monomial curve singularities. In this paper, we…
The irregularity and permutation invariance of point cloud data pose challenges for effective learning. Conventional methods for addressing this issue involve converting raw point clouds to intermediate representations such as 3D voxel…
Connecting curves have been shown to organize the rotational structure of strange attractors in three-dimensional dynamical systems. We extend the description of connecting curves and their properties to higher dimensions within the special…
The earlier approach is used for description of qubits and geometric phase parameters, the things critical in the area of topological quantum computing. The used tool, Geometric (Clifford) Algebra is the most convenient formalism for that…
In this PhD thesis we propose an algorithmic approach to the study of the Hilbert scheme. Developing algorithmic methods, we also obtain general results about Hilbert schemes. In Chapter 1 we discuss the equations defining the Hilbert…
Space filling curves (SFCs) are widely used in the design of indexes for spatial and temporal data. Clustering is a key metric for an SFC, that measures how well the curve preserves locality in moving from higher dimensions to a single…
We study locally Cohen-Macaulay curves of low degree in the Segre threefold with Picard number three and investigate the irreducible and connected components respectively of the Hilbert scheme of them. We also discuss the irreducibility of…
This is a paper about triangle cubics and conics in classical geometry with elements of projective geometry. In recent years, N.J. Wildberger has actively dealt with this topic using an algebraic perspective. Triangle conics were also…
Firstly, we reduce the long-standing problem of ascertaining the Hilbert-Schmidt probability that a generic pair of qubits is separable to that of determining the specific nature of a one-dimensional (separability) function of the radial…
The Hilbert scheme $X^{[3]}$ of length-$3$ subschemes of a smooth projective variety $X$ is known to be smooth and projective. We investigate whether the property of having a multiplicative Chow-Kuenneth decomposition is stable under taking…
In this paper, we provide a comprehensive rigorous modeling for multidimensional spaces with hierarchically structured dimensions in several layers of abstractions and data cubes that live in such spaces. We model cube queries and their…
We propose a data-driven space-filling curve method for 2D and 3D visualization. Our flexible curve traverses the data elements in the spatial domain in a way that the resulting linearization better preserves features in space compared to…
This paper presents a general coding method where data in a Hilbert space are represented by finite dimensional coding vectors. The method is based on empirical risk minimization within a certain class of linear operators, which map the set…