Related papers: Examples of distance magic labelings of the $6$-di…
An equidistant code is a code in the Hamming space such that two distinct codewords have the same Hamming distance. This paper investigates the bounds for equidistant codes in Hamming spaces.
We consider the problem of distinguishing convex subsets of $n$-cyclotomic model sets $\varLambda$ by (discrete parallel) X-rays in prescribed $\varLambda$-directions. In this context, a `magic number' $m_{\varLambda}$ has the property that…
Let $k \in \mathbb{N}$ and $c \in \mathbb{Z}_k$, where $\mathbb{Z}_1=\mathbb{Z}$. A graph $G=(V(G),E(G))$ is said to be $c$-sum $k$-magic if there is a labeling $\ell:E(G) \rightarrow \mathbb{Z}_k \setminus \{0\}$ such that $\sum_{u \in…
A subgraph of the $n$-dimensional hypercube is called 'layered' if it is a subgraph of a layer of some hypercube. In this paper we show that there exist subgraphs of the cube of arbitrarily large girth that are not layered. This answers a…
Magical supergravities are a very special class of supergravity theories whose symmetries and matter content in various dimensions correspond to symmetries and underlying algebraic structures of the remarkable geometries of the Magic Square…
A graph is called a sum graph if its vertices can be labelled by distinct positive integers such that there is an edge between two vertices if and only if the sum of their labels is the label of another vertex of the graph. Most papers on…
We describe a uniformly fast algorithm for generating points \vec{x} uniformly in a hypercube with the restriction that the difference between each pair of coordinates is bounded. We discuss the quality of the algorithm in the sense of its…
Recent diffraction experiments on metallic glasses have unveiled an unexpected non-cubic scaling law between density and average interatomic distance, which lead to the speculations on the presence of fractal glass order. Using X-ray…
Numerous research topics rely on an improved cosmic distance scale (e.g., cosmology, gravitational waves), and the NASA/IPAC Extragalactic Database of Distances (NED-D) supports those efforts by tabulating multiple redshift-independent…
Traditional text classifiers are limited to predicting over a fixed set of labels. However, in many real-world applications the label set is frequently changing. For example, in intent classification, new intents may be added over time…
Given an integer $1\leq j <n$, define the $(j)$-coloring of a $n$-dimensional hypercube $H_{n}$ to be the $2$-coloring of the edges of $H_{n}$ in which all edges in dimension $i$, $1\leq i \leq j$, have color $1$ and all other edges have…
Suppose each of $n$ men and $n$ women is located at a point in a metric space. A woman ranks the men in order of their distance to her from closest to farthest, breaking ties at random. The men rank the women similarly. An interesting…
We give a characterization of distance--preserving subgraphs of Johnson graphs, i.e. of graphs which are isometrically embeddable into Johnson graphs (the Johnson graph $J(m,\Lambda)$ has the subsets of cardinality $m$ of a set $\Lambda$ as…
Metric Learning for visual similarity has mostly adopted binary supervision indicating whether a pair of images are of the same class or not. Such a binary indicator covers only a limited subset of image relations, and is not sufficient to…
In this article, the distance magic index of certain important classes of partite graphs are determined.
A {\em resolving set} for a graph $\Gamma$ is a collection of vertices $S$, chosen so that for each vertex $v$, the list of distances from $v$ to the members of $S$ uniquely specifies $v$. The {\em metric dimension} of $\Gamma$ is the…
Answering exact shortest path distance queries is a fundamental task in graph theory. Despite a tremendous amount of research on the subject, there is still no satisfactory solution that can scale to billion-scale complex networks.…
In a graph A, for each two arbitrary vertices g, h with d(g,h)=2,|MAg2h|=mAg2h is introduced the number of edges of A that are closer to g than to h. We say A is a 2-edge distance-balanced graph if we have mAg2h=mAh2g. In this article, we…
The effects of near neighbors on the galaxy-galaxy lensing signal are investigated using a suite of Monte Carlo simulations. The redshifts, luminosities, and relative coordinates for the simulated lenses were obtained from a set of galaxies…
A sum graph is a finite simple graph whose vertex set is labeled with distinct positive integers such that two vertices are adjacent if and only if the sum of their labels is itself another label. The spum of a graph $G$ is the minimum…