Related papers: High Dimensional Consistent Digital Segments
Constant dimension codes are used for error control in random linear network coding, so that constructions for these codes with large cardinality have achieved wide attention in the last decade. Here, we improve the so-called linkage…
We study graph spanners for point-set in the high-dimensional Euclidean space. On the one hand, we prove that spanners with stretch <\sqrt{2} and subquadratic size are not possible, even if we add Steiner points. On the other hand, if we…
We develop a new class of distances for objects including lines, hyperplanes, and trajectories, based on the distance to a set of landmarks. These distances easily and interpretably map objects to a Euclidean space, are simple to compute,…
A graph is called (generically) rigid in $\mathbb{R}^d$ if, for any choice of sufficiently generic edge lengths, it can be embedded in $\mathbb{R}^d$ in a finite number of distinct ways, modulo rigid transformations. Here we deal with the…
Given a measurable set $A\subset \mathbb R^d$ we consider the "large-distance graph" $\mathcal{G}_A$, on the ground set $A$, in which each pair of points from $A$ whose distance is bigger than 2 forms an edge. We consider the problems of…
This paper proposes a simple and effective method for constructing higher-order three-dimensional (3D) signal constellations, aiming to enhance the reliability of digital communication systems. The approach systematically extends the…
The Johnson-Lindenstrauss transform is a fundamental method for dimension reduction in Euclidean spaces, that can map any dataset of $n$ points into dimension $O(\log n)$ with low distortion of their distances. This dimension bound is tight…
We study infinite Euclidean distance discriminants of algebraic varieties, defined as the loci of data points whose fibers under the second projection from the Euclidean distance correspondence are positive-dimensional. In particular, these…
We study the family of vertical projections whose fibers are right cosets of horizontal planes in the Heisenberg group, $\mathbb{H}^n$. We prove lower bounds for Hausdorff dimension distortion of sets under these mappings, with respect to…
A basic problem for constant dimension codes is to determine the maximum possible size $A_q(n,d;k)$ of a set of $k$-dimensional subspaces in $\mathbb{F}_q^n$, called codewords, such that the subspace distance satisfies…
Persistence diagrams (PD)s play a central role in topological data analysis, and are used in an ever increasing variety of applications. The comparison of PD data requires computing comparison metrics among large sets of PDs, with metrics…
In [Computer Aided Geometric Design 27 (2010), 212-231] the authors present an algorithm to parametrize approximately $\epsilon$-rational curves, and they show in 2 examples that the Hausdorff distance, w.r.t. to the Euclidean distance,…
The high harmonic generation from atoms in the combination of chirped laser pulse and static field is theoretically investigated. For the first time, we explore a further physical mechanism of the significant extension of high harmonic…
Many real networks are embedded in space, where in some of them the links length decay as a power law distribution with distance. Indications that such systems can be characterized by the concept of dimension were found recently. Here, we…
A $q$-ary maximum distance separable (MDS) code $C$ with length $n$, dimension $k$ over an alphabet $\mathcal{A}$ of size $q$ is a set of $q^k$ codewords that are elements of $\mathcal{A}^n$, such that the Hamming distance between two…
In this paper, we analyze $m$-dimensional ($m$D) convolutional codes with finite support, viewed as a natural generalization of one-dimensional (1D) convolutional codes to higher dimensions. An $m$D convolutional code with finite support…
This paper investigates several distinct attempts to generalize in higher dimension the standard 2-dimensional phyllotaxy set construction. We first recall known contructions for these sets on $2D$ manifolds of constant curvature (the…
In recent years, the generation of rigorously provable chaos in finite precision digital domain has made a lot of progress in theory and practice, this article is a part of it. It aims to improve and expand the theoretical and application…
Comparing with the conventional semiconductors, the choice of the two dimensional semiconductor (2DSC) materials is very limited. Based on proper electron counting, we propose a large family of 2DSCs, all adopting the same structure and…
For an integer $q\ge 2$ and an even integer $d$, consider the graph obtained from a large complete $q$-ary tree by connecting with an edge any two vertices at distance exactly $d$ in the tree. This graph has clique number $q+1$, and the…