Related papers: On the general dyadic grids in $\mathbb{R}^d$

Given $A$ and $B$ two nonempty subsets in a metric space, a mapping $T : A \cup B \rightarrow A \cup B$ is relatively nonexpansive if $d(Tx,Ty) \leq d(x,y) \text{for every} x\in A, y\in B.$ A best proximity point for such a mapping is a…

A set in $\mathbb R^d$ is called almost-equidistant if for any three distinct points in the set, some two are at unit distance apart. First, we give a short proof of the result of Bezdek and L\'angi claiming that an almost-equidistant set…

Let A be an expansive linear map from R^d to R^d. The notion of A-approximate continuity was recently used to give a characterization of scaling functions in a multiresolution analysis (MRA). The definition of A-approximate continuity at a…

We call a set of points $Z\subset{\mathbb P}^{3}_{\mathbb C}$ an $(a,b)$-geproci set (for GEneral PROjection is a Complete Intersection) if its projection from a general point $P$ to a plane is a complete intersection of curves of degrees…

A normally regular digraph with parameters $(v,k,\lambda,\mu)$ is a directed graph on $v$ vertices whose adjacency matrix $A$ satisfies the equation $AA^t=k I+\lambda (A+A^t)+\mu(J-I-A-A^t)$. This means that every vertex has out-degree $k$,…

Fiol has characterized quotient-polynomial graphs as precisely the connected graphs whose adjacency matrix generates the adjacency algebra of a symmetric association scheme. We show that a collection of non-negative integer parameters of…

In this paper, we study the distance problem in the setting of finite p-adic rings. In odd dimensions, our results are essentially sharp. In even dimensions, we clarify the conjecture and provide examples to support it. Surprisingly,…

The metric dimension (MD) of a graph is a combinatorial notion capturing the minimum number of landmark nodes needed to distinguish every pair of nodes in the graph based on graph distance. We study how much the MD can increase if we add a…

A linking system of difference sets is a collection of mutually related group difference sets, whose advantageous properties have been used to extend classical constructions of systems of linked symmetric designs. The central problems are…

We examine the generic local and global rigidity of various graphs in R^d. Bruce Hendrickson showed that some necessary conditions for generic global rigidity are (d+1)-connectedness and generic redundant rigidity and hypothesized that they…

Graph matching aims to establish correspondences between vertices of graphs such that both the node and edge attributes agree. Various learning-based methods were recently proposed for finding correspondences between image key points based…

A novel type of approximants is introduced, being based on the ideas of self-similar approximation theory. The method is illustrated by the examples possessing the structure typical of many problems in applied mathematics. Good numerical…

We study the problem of constructing strong approximate unitary $k$-designs on $D$-dimensional grids (and more generally on Cartesian products of graphs), building on the work of Schuster et al. arXiv:2509.26310 which establishes strong…

In this paper we examine some natural ideal conditions and show how graphs can be defined that give a visualization of these conditions. We examine the interplay between the multiplicative ideal theory and the graph theoretic structure of…

Data processing systems impose multiple views on data as it is processed by the system. These views include spreadsheets, databases, matrices, and graphs. Associative arrays unify and simplify these different approaches into a common…

Line systems passing through the origin of the $d$ dimensional Euclidean space admitting exactly two distinct angles are called biangular. It is shown that the maximum cardinality of biangular lines is at least $2(d-1)(d-2)$, and this…

Let $A$ be a set of finite integers, define $$A+A \ = \ \{a_1+a_2: a_1,a_2 \in A\}, \ \ \ A-A \ = \ \{a_1-a_2: a_1,a_2 \in A\},$$ and for non-negative integers $s$ and $d$ define $$sA-dA\ =\ \underbrace{A+\cdots+A}_{s}…

We define and explicitly construct schemes evinced by generalized additive decompositions (GADs) of a given $d$-homogeneous polynomial $F$. We employ GADs to investigate the regularity of $0$-dimensional schemes apolar to $F$, focusing on…

The adaptive gradient online learning method known as AdaGrad has seen widespread use in the machine learning community in stochastic and adversarial online learning problems and more recently in deep learning methods. The method's…

We prove that subsets of ${\Bbb R}^d$, $d \ge 4$ of large enough Hausdorff dimensions contain vertices of an equilateral triangle. It is known that additional hypotheses are needed to assure the existence of equilateral triangles in two…