Related papers: High Dimensional Consistent Digital Segments
We give two low-complexity algorithms, one for dimensionality reduction and one for dimensionality increase, which are applicable to any dataset, regardless of whether the set has an intrinsic dimension or not. The corresponding methods…
Many real objects are modeled as discrete sets of points, such as corners or other salient features. For our main applications in chemistry, points represent atomic centers in a molecule or a solid material. We study the problem of…
This paper considers conditions, which allow to preserve important topological and geometric properties in the process of digitization. For this purpose, we introduce a triplet {C,M,D} consisting of a continuous object C, an intermediate…
Contour map has contour lines that are significant in building a Digital Elevation Model (DEM). During the digitization and pre-processing of contour maps, the contour line intersects with each other or break apart resulting in broken…
Calculating the effects of Coherent Synchrotron Radiation (CSR) is one of the most computationally expensive tasks in accelerator physics. Here, we use convolutional neural networks (CNN's), along with a latent conditional diffusion (LCD)…
Recently, the construction of new MDS Euclidean self-dual codes has been widely investigated. In this paper, for square q, we utilize generalized Reed-Solomon (GRS) codes and their extended codes to provide four generic families of q-ary…
Motivated by a $2$-dimensional (unsupervised) image segmentation task whereby local regions of pixels are clustered via edge detection methods, a more general probabilistic mathematical framework is devised. Critical thresholds are…
Dimension-varying linear systems are investigated. First, a dimension-free state space is proposed. A cross dimensional distance is constructed to glue vectors of different dimensions together to form a cross-dimensional topological space.…
Applying dimensionality reduction (DR) to large, high-dimensional data sets can be challenging when distinguishing the underlying high-dimensional data clusters in a 2D projection for exploratory analysis. We address this problem by first…
We prove that if the Hausdorff dimension of a compact subset of ${\mathbb R}^d$ is greater than $\frac{d+1}{2}$, then the set of angles determined by triples of points from this set has positive Lebesgue measure. Sobolev bounds for…
The hull of a linear code is the intersection of itself with its dual code with respect to certain inner product. Both Euclidean and Hermitian hulls are of theorical and practical significance. In this paper, we construct several new…
The introduction of geometry has proven instrumental in the efforts towards more realistic models for real-world networks. In Geometric Inhomogeneous Random Graphs (GIRGs), Euclidean Geometry induces clustering of the vertices, which is…
We extend Yosida's 1941 version of Stone-Gelfand duality to metrically complete unital lattice-ordered groups that are no longer required to be real vector spaces. This calls for a generalised notion of compact Hausdorff space whose points…
The failure of the Euclidean norm to reliably distinguish between nearby and distant points in high dimensional space is well-known. This phenomenon of distance concentration manifests in a variety of data distributions, with iid or…
In this paper, we carry out an assessment of cosmic distance duality relation (CDDR) based on the latest observations of HII galaxies acting as standard candles and ultra-compact structure in radio quasars acting as standard rulers.…
The known Complex Step Derivative (CSD) method allows easy and accurate differentiation up to machine precision of real analytic functions by evaluating them a small imaginary step next to the real number line. The current paper proposes…
In this thesis we investigate proposed duals to QCD. Duals to QCD fall into two categories: `top-down' and `bottom-up'. We take inspiration from both by truncating a consistent solution to the type IIB supergravity equations of motion…
We investigate a graph-theoretic problem motivated by questions in quantum computing concerning the propagation of information in quantum circuits. A graph $G$ is said to be a bounded extension of its subgraph $L$ if they share the same…
We present a new construction of high dimensional expanders based on covering spaces of simplicial complexes. High dimensional expanders (HDXs) are hypergraph analogues of expander graphs. They have many uses in theoretical computer…
In metric theories of gravity with photon number conservation, the luminosity and angular diameter distances are related via the Etherington relation, also known as the distance-duality relation (DDR). A violation of this relation would…