Related papers: A characterization of sets in $\mathbb{R}^2$ with …

In this paper, we mainly focus on the set-valued (stochastic) analysis on the space of convex, closed, but possibly unbounded sets, and try to establish a useful theoretical framework for studying the set-valued stochastic differential…

We introduce a new concept, the APN-defect, which can be thought of as measuring the distance of a given function $G:\mathbb{F}_{2^n} \rightarrow \mathbb{F}_{2^n}$ to the set of almost perfect nonlinear (APN) functions. This concept is…

Let D\subseteq \mathbb{R} be closed and discrete and f:D^n \to \mathbb{R} be such that f(D^n) is somewhere dense. We show that (\mathbb{R},+,\cdot,f) defines the set of integers. As an application, we get that for every a,b \in \mathbb{R}…

It is shown that (1) if a good set has finitely many related components, then they are full, (2) loops correspond one-to-one to extreme points of a convex set. Some other properties of good sets are discussed.

Distance matrices are matrices whose elements are the relative distances between points located on a certain manifold. In all cases considered here all their eigenvalues except one are non-positive. When the points are uncorrelated and…

In this paper, we introduce a new subclass of close-to-convex harmonic functions. We present a sufficient coefficient condition for a function to be a member of this class. Furthermore, we establish a distortion theorem. These results lay…

We study {\it permeable} sets. These are sets \(\Theta \subset \mathbb{R}^d\) which have the property that each two points \(x,y\in \mathbb{R}^d\) can be connected by a short path \(\gamma\) which has small (or even empty, apart from the…

Data consisting of a graph with a function mapping into $\mathbb{R}^d$ arise in many data applications, encompassing structures such as Reeb graphs, geometric graphs, and knot embeddings. As such, the ability to compare and cluster such…

We study properties of strongly separately continuous mappings defined on subsets of products of topological spaces equipped with the topology of pointwise convergence. In particular, we give a necessary and sufficient condition for a…

In this paper, we define a soft somewhat open set using the soft interior operator. We study main properties the class of soft somewhat open sets that is contained in the class soft somewhere dense sets. Then, we introduce the classes of…

For a natural number d and a d-dimensional real vector r let Tau(r) denote the (d-dimensional) shift radix system associated with r. Tau(r) is said to have the finiteness property iff all orbits of Tau(r) end up in the zero vector; the set…

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 set in d dimensional Euclidean space with d larger than 2 having Hausdorff dimension at least d/2 must have distance set with Hausdorff dimension strictly greater than 1/2.

Various characterizations of finite convex geometries are well known. This note provides similar characterizations for possibly infinite convex geometries whose lattice of closed sets is strongly coatomic and lower continuous. Some classes…

Density-corrected density functional theory (DC-DFT) is enjoying substantial success in improving semilocal DFT calculations in a wide variety of chemical problems. This paper provides the formal theoretical framework and assumptions for…

The \emph{metric dimension} of a graph $G$, denoted by $\dim(G)$, is the minimum number of vertices such that each vertex is uniquely determined by its distances to the chosen vertices. Let $G_1$ and $G_2$ be disjoint copies of a graph $G$…

In this paper, we prove that the distance function of an open connected set in $\mathbb R^{n+1}$ with a $C^{2}$ boundary is superharmonic in the distribution sense if and only if the boundary is {\em weakly mean convex}. We then prove that…

The paper deals with the problem of reconstructing the topological structure of a network of dynamical systems. A distance function is defined in order to evaluate the "closeness" of two processes and a few useful mathematical properties…

A closure system with the anti-exchange axiom is called a convex geometry. One geometry is called a sub-geometry of the other if its closed sets form a sublattice in the lattice of closed sets of the other. We prove that convex geometries…

There are several notions of a smooth map from a convex set to a cartesian space. Some of these notions coincide, but not all of them do. We construct a real-valued function on a convex subset of the plane that does not extend to a smooth…