Related papers: Some aspects of calculus on non-smooth sets
The sets used to construct other mathematical objects are pure sets, which means that all of their elements are sets, which are themselves pure. One set may therefore be within another, not as an element, but as an element of an element, or…
A planar integral point set is a set of non-collinear points in plane such that for any pair of the points the Euclidean distance between the points is integral. We discuss the classification of planar integral point sets and provide…
We review some basic results of convex analysis and geometry in $\mathbb{R}^n$ in the context of formulating a differential equation to track the distance between an observer flying outside a convex set $K$ and $K$ itself.
A new method of connecting two wavelet sets with a continuous path of wavelet sets is given. The method is based on a pure set theoretic fact known as the Schroder-Cantor-Bernstein theorem and on a characterization of wavelet sets in terms…
We classify compact manifolds of dimension three equipped with a path structure and a fixed contact form (which we refer to as a strict path structure) under the hypothesis that their automorphism group is non-compact. We use a Cartan…
This paper presents a distance function between sets based on an average of distances between their elements. The distance function is a metric if the sets are non-empty finite subsets of a metric space. It can be applied to produce various…
There are the longstanding differences in the continuity of continuum among mathematicians. Starting from studies on a mathematical model of contact, we construct a set that is in contact everywhere by using the original idea of Dedekind's…
We point out that the total number of trails and the total number of paths of given length, between two vertices of a simple undirected graph, are obtained as expectation values of specifically engineered quantum mechanical observables.…
The invisibility graph $I(X)$ of a set $X \subseteq \mathbb{R}^d$ is a (possibly infinite) graph whose vertices are the points of $X$ and two vertices are connected by an edge if and only if the straight-line segment connecting the two…
The Frechet distance is often used to measure distances between paths, with applications in areas ranging from map matching to GPS trajectory analysis to handwriting recognition. More recently, the Frechet distance has been generalized to a…
For a pair of spaces $X$ and $Y$ such that $Y \subseteq X$, we define the relative topological complexity of the pair $(X,Y)$ as a new variant of relative topological complexity. Intuitively, this corresponds to counting the smallest number…
A set $X$ endowed with a coarse structure is called ballean or coarse space. For a ballean $(X, \mathcal{E})$, we say that two subsets $A$, $B$ of $X$ are close (linked) if there exists an entourage $E\in \mathcal{E}$ such that $A\subseteq…
The erosion of a set in Euclidean space by a radius r>0 is the subset of X consisting of points at distance >/-r from the complement of X. A set is resilient to erosion if it is similar to its erosion by some positive radius. We give a…
The set of distances of a monoid or of a domain is the set of all $d \in \mathbb N$ with the following property: there are irreducible elements $u_1, \ldots, u_k, v_1, \ldots, v_{k+d}$ such that $u_1 \cdot \ldots \cdot u_k = v_1 \cdot…
Let $P$ be a set of $n$ points in general position in the plane. Let $R$ be a set of $n$ points disjoint from $P$ such that for every $x,y \in P$ the line through $x$ and $y$ contains a point in $R$ outside of the segment delimited by $x$…
Properties of two classes of generally convex sets in the n-dimentional real Euclidean space, called m-semiconvex and weakly m-semiconvex, 1<=m<n, are investigated in the present work. In particular, it is established that an open set with…
This paper makes a deep study of regular two-distance sets. A set of unit vectors $X$ in Euclidean space $\RR^n$ is said to be regular two-distance set if the inner product of any pair of its vectors is either $\alpha$ or $\beta$, and the…
Semi-algebraic set is a subset of the real space defined by polynomial equations and inequalities. In this paper, we consider the problem of deciding whether two given points in a semi-algebraic set are connected. We restrict to the case…
We consider discrete metric spaces and we look for non-constant contractions. We introduce the notion of contractive map and we characterize the spaces with non-constant contractive maps. We provide some examples to discussion the possible…
Paths are important structural elements in complex networks because they are finite (unlike walks), related to effective node coverage (minimum spanning trees), and can be understood as being dual to star connectivity. This article…