Related papers: Properties of functions with monotone graphs
We study the subsets of metric spaces that are negligible for the infimal length of connecting curves; such sets are called metrically removable. In particular, we show that every totally disconnected set with finite Hausdorff measure of…
We study the metric dimension (strong and weak) of infinite graphs. In particular, our main interest is characterizing infinite graphs with finite dimension. Our main results: (1) graphs with more than one end have infinite strong…
Given a dense countable set in a metric space, the infinite random geometric graph is the random graph with the given vertex set and where any two points at distance less than 1 are connected, independently, with some fixed probability. It…
We prove that the Hausdorff dimension of the graph of a prevalent continuous function is 2. We also indicate how our results can be extended to the space of continuous functions on $[0,1]^d$ for $d \in \mathbb{N}$ and use this to obtain…
We say that a metric graph is uniformly bounded if the degrees of all vertices are uniformly bounded and the lengths of edges are pinched between two positive constants; a metric space is approximable by a uniform graph if there is one…
Consider the configuration spaces of manifolds. An influential theorem of McDuff, Segal and Church shows that the (co)homology of the unordered configuration space is independent of number of points in a range of degree called the stable…
Random geometric graphs result from taking $n$ uniformly distributed points in the unit cube, $[0,1]^d$, and connecting two points if their Euclidean distance is at most $r$, for some prescribed $r$. We show that monotone properties for…
Let $ f:(0,\infty)\rightarrow \Bbb{R} $ be a completely monotonic function. In this paper, we present some properties of this functions and several new classes of completely monotonic functions. We also give some special functions such that…
This paper studies a large class of continuous functions $f:[0,1]\to\mathbb{R}^d$ whose range is the attractor of an iterated function system $\{S_1,\dots,S_{m}\}$ consisting of similitudes. This class includes such classical examples as…
We mainly establish a monotonicity property between some special Riemann sums of a convex function $f$ on $[a,b]$, which in particular yields that $\frac{b-a}{n+1}\sum_{i=0}^n f\left(a+i\frac{b-a}{n}\right)$ is decreasing while…
We consider badly approximable numbers in the case of dyadic diophantine approximation. For the unit circle $\mathbb{S}$ and the smallest distance to an integer $\|\cdot\|$ we give elementary proofs that the set $F(c) = \{x \in \mathbb{S}:…
We examine Bourbaki's function, an easily-constructed continuous but nowhere-differentiable function, and explore properties including functional identities, the antiderivative, and the box and Hausdorff dimensions of the graph.
Given a continuous function from Euclidean space to the real line, we analyze (under some natural assumption on the function), the set of values it takes on translates of lattices. Our results are of the flavor: For almost any translate,…
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…
We consider isomorphism properties of infinite random geometric graphs defined over a variety of metrics. In previous work, it was shown that for $\mathbb{R}^n$ with the $L_{\infty}$-metric, the infinite random geometric graph is, with…
There has been substantial interest in estimating the value of a graph parameter, i.e., of a real-valued function defined on the set of finite graphs, by querying a randomly sampled substructure whose size is independent of the size of the…
Monadically stable and monadically NIP classes of structures were initially studied in the context of model theory and defined in logical terms. They have recently attracted attention in the area of structural graph theory, as they…
It is consistent that there is a partial order (P,<) of size aleph_1 such that every monotone (unary) function from P to P is first order definable in (P,<). The partial order is constructed in an extension obtained by finite support…
We apply the theory of unimodular random rooted graphs to study the metric geometry of large, finite, bounded degree graphs whose diameter is proportional to their volume. We prove that for a positive proportion of the vertices of such a…
We characterize real functions $f$ on an interval $(-\alpha,\alpha)$ for which the entrywise matrix function $[a_{ij}] \mapsto [f(a_{ij})]$ is positive, monotone and convex, respectively, in the positive semidefiniteness order. Fractional…