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

We consider graphs on monomials in $n$ variables of a fixed degree $d$ where two monomials are adjacent if and only if their least common multiple has degree $d+1$. We prove that when $n = 3$ and $d$ is divisible by $3$ as well as when…

This study investigates the suitability of the annealed approximation in high-dimensional systems characterized by dense networks with quenched link disorder, employing models of coupled oscillators. We demonstrate that dynamic equations…

For any metric $d$ on $\mathbb{R}^2$, an ($\mathbb{R}^2,d$)-geometric graph is a graph whose vertices are points in $\mathbb{R}^2$, and two vertices are adjacent if and only if their distance is at most 1. If $d=\|.\|_{\infty}$, the metric…

Symmetry groups allow to transform solutions of differential equations continuously into other solutions. This property can be used for the observability analysis of infinite-dimensional systems with input and output. In this contribution,…

The length of the geodesic between two data points along a Riemannian manifold, induced by a deep generative model, yields a principled measure of similarity. Current approaches are limited to low-dimensional latent spaces, due to the…

With every matching in a graph we associate a group called the matching group. We study this group using the theory of non-positively curved cubed complexes. Our approach is formulated in terms of so-called gliding systems.

For a self-similar set in $\mathbb{R}^d$ that is the attractor of an iterated function system that does not verify the weak separation property, Fraser, Henderson, Olson and Robinson showed that its Assouad dimension is at least $1$. In…

A typical problem in optimal design theory is finding an experimental design that is optimal with respect to some criteria in a class of designs. The most popular criteria include the A- and D-criteria. Regular graph designs occur in many…

Combinatorial optimization is a fertile testing ground for statistical physics methods developed in the context of disordered systems, allowing one to confront theoretical mean field predictions with actual properties of finite dimensional…

A grid poset -- or grid for short -- is a product of chains. We ask, what does a random linear extension of a grid look like? In particular, we show that the average "jump number," i.e., the number of times that two consecutive elements in…

In this paper, we prove a sharp Mei's Lemma with assuming the bases of the underlying general dyadic grids are different. As a byproduct, we specify all the possible cases of adjacent general dyadic systems with different bases. The proofs…

We show the optimal coherence of $2d$ lines in $\mathbb{C}^{d}$ is given by the Welch bound whenever a skew Hadamard of order $d+1$ exists. Our proof uses a variant of Hadamard doubling that converts any equiangular tight frame of size…

Consider the d-dimensional lattice Z^d where each vertex is ``open'' or ``closed'' with probability p or 1-p, respectively. An open vertex v is connected by an edge to the closest open vertex w such that the dth co-ordinates of v and w…

This article is devoted to the study of classical and new results concerning equidistant sets, both from the topological and metric point of view. We start with a review of the most interesting known facts about these sets in the euclidean…

A $d$-dimensional framework is a pair $(G,p)$, where $G$ is a graph and $p$ maps the vertices of $G$ to points in $\mathbb{R}^d$. The edges of $G$ are mapped to the corresponding line segments. A graph $G$ is said to be globally rigid in…

In this article, a new construction of derived equivalences is given. It relates different endomorphism rings and more generally cohomological endomorphism rings - including higher extensions - of objects in triangulated categories. These…

In this paper, we propose a new way to approach qudit systems using toric geometry and related topics including the local mirror symmetry used in the string theory compactification. We refer to such systems as (n,d) quantum systems where…

The non-linear evolution of one-dimensional perturbations in a three-dimensional expanding Universe is considered. A general Lagrangian scheme is derived, and compared to two previously introduced approximate models. These models are…

For an ordered point set in a Euclidean space or, more generally, in an abstract metric space, the ordered Nearest Neighbor Graph is obtained by connecting each of the points to its closest predecessor by a directed edge. We show that for…

This paper is motivated by two problems in the theory of Diophantine approximation, namely, Davenport's problem regarding badly approximable points on submanifolds of a Euclidean space and Schmidt's problem regarding the intersections of…