Related papers: High Dimensional Consistent Digital Segments
For a given connected set $\Gamma$ in $d-$dimensional Euclidean space, we construct a connected set $\tilde\Gamma\supset \Gamma$ such that the two sets have comparable Hausdorff length, and the set $\tilde\Gamma$ has the property that it is…
A Condorcet domain (CD) is a collection of linear orders on a set of candidates satisfying the following property: for any choice of preferences of voters from this collection, a simple majority rule does not yield cycles. We propose a…
Dimensional regularization of Euclidean momentum space integrals is a highly successful technique in renormalization of quantum field theories. While it yields a straightforward algorithmic method, with which to evaluate diagrams beyond…
In his 1990 Inventiones paper, P. Jones characterized subsets of rectifiable curves in the plane via a multiscale sum of $\beta$-numbers. These $\beta$-numbers are geometric quantities measuring how far a given set deviates from a best…
The cardinal direction calculus (CDC) proposed by Goyal and Egenhofer is a very expressive qualitative calculus for directional information of extended objects. Early work has shown that consistency checking of complete networks of basic…
A major research area in discrete geometry is to consider the best way to partition the $d$-dimensional Euclidean space $\mathbb{R}^d$ under various quality criteria. In this paper we introduce a new type of space partitioning that is…
Constructing $C^r$ conforming finite element spaces in any dimension is a long-standing problem. For general triangulations, this problem was recently addressed by Hu-Lin-Wu (2024), under certain conditions on supersmoothness and polynomial…
Linearly repetitive cut and project sets are mathematical models for perfectly ordered quasicrystals. In a previous paper we presented a characterization of linearly repetitive cut and project sets. In this paper we extend the classical…
We discuss diagrammatic modifications to the coupled cluster doubles (CCD) equations, wherein different groups of terms out of rings, ladders, crossed-rings and mosaics can be removed to form approximations to the coupled cluster method, of…
Constant-dimension codes have recently received attention due to their significance to error control in noncoherent random linear network coding. What the maximal cardinality of any constant-dimension code with finite dimension and minimum…
We prove that, for every norm on $\mathbb{R}^d$ and every $E \subseteq \mathbb{R}^d$, the Hausdorff dimension of the distance set of $E$ with respect to that norm is at least $\dim_{\mathrm{H}} E - (d-1)$. An explicit construction follows,…
A class of high-order numerical algorithms for Riesz derivatives are established through constructing new generating functions. Such new high-order formulas can be regarded as the modification of the classical (or shifted) Lubich's…
Pairwise Euclidean distance calculation is a fundamental step in many machine learning and data analysis algorithms. In real-world applications, however, these distances are frequently distorted by heteroskedastic noise$\unicode{x2014}$a…
Finding an optimal match between two different crystal structures underpins many important materials science problems, including describing solid-solid phase transitions, developing models for interface and grain boundary structures. In…
A step towards a successful implementation of timeresolved digital in-line holography with extreme ultraviolet radiation is presented. Ultrashort XUV pulses are produced as high-order harmonics of a femtosecond laser and a Schwarzschild…
Popular clustering algorithms based on usual distance functions (e.g., Euclidean distance) often suffer in high dimension, low sample size (HDLSS) situations, where concentration of pairwise distances has adverse effects on their…
Recently, Stull [18], [17] resolved a long-standing open problem posed by Lutz, on whether the set of effective Hausdorff dimensions of points on a straight line in $\mathbb{R}^2$ -- the effective dimension spectrum of the line -- contains…
We construct, by a procedure involving a dimensional reduction from a Chern-Simons theory with borders, an effective theory for a 1+1 dimensional superconductor. 1That system can be either in an ordinary phase or in a topological one,…
In this paper, we introduce a construction of quantum convolutional codes (QCCs) based on difference triangle sets (DTSs). To construct QCCs, one must determine polynomial stabilizers $X(D)$ and $Z(D)$ that commute (symplectic…
We present a systematic study on a new task called dichotomous image segmentation (DIS) , which aims to segment highly accurate objects from natural images. To this end, we collected the first large-scale DIS dataset, called DIS5K, which…