Related papers: On sets in ${\mathbb R}^d$ with DC distance functi…

Let $E\subset \mathbb R^n$, $n\ge 2$, be a set of finite perimeter with $|E|=|B|$, where $B$ denotes the unit ball. When $n=2$, since convexification decreases perimeter (in the class of open connected sets), it is easy to prove the…

For a finite point set $P \subset \mathbb{R}^d$, denote by $\text{diam}(P)$ the ratio of the largest to the smallest distances between pairs of points in $P$. Let $c_{d, \alpha}(n)$ be the largest integer $c$ such that any $n$-point set $P…

Examples exist of extended-real-valued closed functions on ${\bf R}^n$ whose subdifferentials (in the standard, limiting sense) have large graphs. By contrast, if such a function is semi-algebraic, then its subdifferential graph must have…

A rational function on a real algebraic curve $C$ is called separating if it takes real values only at real points. Such a function defines a covering $\Bbb R C\to\Bbb{RP}^1$. Let $A_1,\dots,A_n$ be connected components of $C$. In a recent…

Let $G$ be a connected graph of order $n$ with diameter $d$. Remoteness $\rho$ of $G$ is the maximum average distance from a vertex to all others and $\partial_1\geq\cdots\geq \partial_n$ are the distance eigenvalues of $G$. In \cite{AH},…

The \emph{difference subgroup graph} $D(G)$ of a finite group $G$ is defined as the graph whose vertices are the non-trivial proper subgroups of $G$, with two distinct vertices $H$ and $K$ adjacent if and only if $\langle H, K \rangle = G$…

Suppose that $G$ is a connected simple graph with the vertex set $V( G ) = \{ v_1,v_2,\cdots ,v_n \} $. Let $d( v_i,v_j ) $ be the distance between $v_i$ and $v_j$. Then the distance matrix of $G$ is $D( G ) =( d_{ij} )_{n\times n}$, where…

In this paper we show the following result: if C is an n-dimensional 0-symmetric convex compact set, $f:C\rightarrow[0,1)$ is concave, and $g:[0,1)\rightarrow[0,1)$ is not identically zero, convex, with g(0)=0, then \[ \frac{1}{|C|}\int_C…

For $E \subset {\Bbb F}_q^d$, $d \ge 2$, where ${\Bbb F}_q$ is the finite field with $q$ elements, we consider the distance graph ${\mathcal G}^{dist}_t(E)$, $t \not=0$, where the vertices are the elements of $E$, and two vertices $x$, $y$…

The Hausdorff distance is a measure of (dis-)similarity between two sets which is widely used in various applications. Most of the applied literature is devoted to the computation for sets consisting of a finite number of points. This has…

It is known that a real function $f$ is convex if and only if the set $$\mathrm{E}(f)=\{(x,y)\in\mathbb{R}\times\mathbb{R};\ f(x)\leq y\},$$ the epigraph of $f$ is a convex set in $\mathbb{R}^2$. We state an extension of this result for…

It is a well-known result by Saks \cite{Saks1934} that there exists a function $f \in L^1(\mathbb{R}^2)$ so that for almost every $(x,y)\in \mathbb{R}^2$ \[ \lim_{\substack{\mathrm{diam} R\rightarrow 0, \\ (x,y) \in R \in…

In this paper functions $f:D\to\mathbb{R}$ satisfying the inequality \[ f\Big(\frac{x+y}{2}\Big)\leq\frac12f(x)+\frac12f(y) +\varphi\Big(\frac{x-y}{2}\Big) \qquad(x,y\in D) \] are studied, where $D$ is a nonempty convex subset of a real…

Nearly convex sets play important roles in convex analysis, optimization and theory of monotone operators. We give a systematic study of nearly convex sets, and construct examples of subdifferentials of lower semicontinuous convex functions…

A versatile method is described for the practical computation of the discrete Fourier transforms (DFT) of a continuous function $g(t)$ given by its values $g_{j}$ at the points of a uniform grid $F_{N}$ generated by conjugacy classes of…

A non-empty set $X$ of vertices of an acyclic digraph is called connected if the underlying undirected graph induced by $X$ is connected and it is called convex if no two vertices of $X$ are connected by a directed path in which some…

We study the singularity (multifractal) spectrum of continuous convex functions defined on $[0,1]^{d}$. Let $E_f({h}) $ be the set of points at which $f$ has a pointwise exponent equal to $h$. We first obtain general upper bounds for the…

We give a necessary and sufficient condition for a difference of convex (DC, for short) functions, defined on a locally convex space, to be Lipschitz continuous. Our criterion relies on the intersections of the "epsilon-subdifferentials of…

The main result of this paper states that for a function $f:\R^2\to Y$ with a closed, connected and locally connected graph, where $Y$ is a locally compact, second-countable metrisable space, the graph over discontinuity points remains…

Let $\ell$ denote a positive integer. A connected graph $\G$ of diameter at least $\ell$ is said to be $\ell${\it -distance-balanced} whenever for any pair of vertices $u,v$ of $\G$ such that $d(u,v)=\ell$, the number of vertices closer to…