Related papers: Two-Dimensional Patterns with Distinct Differences…
Constant dimension codes are e.g. used for error correction and detection in random linear network coding, so that constructions for these codes have achieved wide attention. Here, we improve over 150 lower bounds by describing better…
Bimonotone subdivisions in two dimensions are subdivisions all of whose sides are either vertical or have nonnegative slope. They correspond to statistical estimates of probability distributions of strongly positively dependent random…
In multi-phase fluid flow, fluid-structure interaction, and other applications, partial differential equations (PDEs) often arise with discontinuous coefficients and singular sources (e.g., Dirac delta functions). These complexities arise…
The unit distance graph $G_{\mathbb{R}^d}^1$ is the infinite graph whose nodes are points in $\mathbb{R}^d$, with an edge between two points if the Euclidean distance between these points is 1. The 2-dimensional version $G_{\mathbb{R}^2}^1$…
In this paper we construct multidimensional codes with high dimension. The codes can correct high dimensional errors which have the form of either small clusters, or confined to an area with a small radius. We also consider small number of…
The metric dimension of a graph measures how uniquely vertices may be identified using a set of landmark vertices. This concept is frequently used in the study of network architecture, location-based problems and communication. Given a…
The radius and diameter are fundamental graph parameters. They are defined as the minimum and maximum of the eccentricities in a graph, respectively, where the eccentricity of a vertex is the largest distance from the vertex to another…
Finding interesting symmetrical topological structures in high-dimensional systems is an important problem in statistical machine learning. Limited amount of available high-dimensional data and its sensitivity to noise pose computational…
Fixed point networks are dynamic networks that encode stimuli via distinct output patterns. Although such networks are omnipresent in neural systems, their structures are typically unknown or poorly characterized. It is therefore valuable…
The Erd\H{o}s distinct distance problem is a ubiquitous problem in discrete geometry. Less well known is Erd\H{o}s' distinct angle problem, the problem of finding the minimum number of distinct angles between $n$ non-collinear points in the…
Maximum distance separable (MDS) are constructed to required specifications. The codes are explicitly given over finite fields with efficient encoding and decoding algorithms. Series of such codes over finite fields with ratio of distance…
A set of unit vectors in $\mathbb{R}^d$ is a called a spherical two-distance set if the inner products of distinct vectors only take two values. In this paper, we give explicit correspondence between spherical two-distance sets and graphs…
It is known that maximum distance separable and maximum distance profile convolutional codes exist over large enough finite fields of any characteristic for all parameters $(n,k,\delta)$. It has been conjectured that the same is true for…
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 study thresholds for the appearance of a 2-core in random hypergraphs that are a mixture of a constant number of random uniform hypergraphs each with a linear number of edges but with different edge sizes. For the case of two overlapping…
This report presents a new, algorithmic approach to the distributions of the distance between two points distributed uniformly at random in various polygons, based on the extended Kinematic Measure (KM) from integral geometry. We first…
The photonic band structures in certain two- and three-dimensional periodic networks made of one-dimensional waveguides are studied by using the Floquet-Bloch theorem. We find that photonic band gaps exist only in those structures where the…
Lifted maximum rank distance (MRD) codes, which are constant dimension codes, are considered. It is shown that a lifted MRD code can be represented in such a way that it forms a block design known as a transversal design. A slightly…
Metric networks are network-shaped, one-dimensional structures on which one can solve differential equations to simulate a wide range of physical systems including conjugated molecules, photonic crystals, quantum mechanics in waveguide…
Erd\H{o}s and Fishburn studied the maximum number of points in the plane that span $k$ distances and classified these configurations, as an inverse problem of the Erd\H{o}s distinct distances problem. We consider the analogous problem for…