Related papers: On the Assouad spectrum of H\"older and Sobolev gr…

Let $d\in\mathbb{N}$ and let $\varphi\colon(0,1)\to[0,d]$. We prove that there exists a set $F\subset\mathbb{R}^d$ such that $\operatorname{dim}_A^\theta F=\varphi(\theta)$ for all $\theta\in(0,1)$ if and only if for every…

We investigate the Assouad spectrum and dimension of graphs of functions lying in certain Banach spaces. We find the typical values in the sense of Baire category, proving that these values are often as large as possible, given the…

This paper gives the pointwise H\"older (or multifractal) spectrum of continuous functions on the interval $[0,1]$ whose graph is the attractor of an iterated function system consisting of $r\geq 2$ affine maps on $\mathbb{R}^2$. These…

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…

Let $\theta \in(0,1)$ and $(\mathcal{M},\tau)$ be a semifinite von Neumann algebra. We consider the function spaces introduced by Sobolev (denoted by $S_{d,\theta}$), showing that there exists a constant $d>0 $ depending on $p$, $0<p\le…

We characterize the removability of H\"older-$\alpha$ graphs with respect to continuous Sobolev $W^{1,2}$ functions. For $\alpha > 2/3$ these graphs are removable, while for $\alpha <2/3$ there exist graphs which are not removable.

For $0<\alpha<1$ let $V(\alpha)$ denote the supremum of the numbers $v$ such that every $\alpha$-H\"older continuous function is of bounded variation on a set of Hausdorff dimension $v$. Kahane and Katznelson (2009) proved the estimate $1/2…

The Hausdorff dimension of the graphs of the functions in H\"older and Besov spaces (in this case with integrability p \geq 1) on fractal d-sets is studied. Denoting by s \in (0,1] the smoothness parameter, the sharp upper bound…

Let $d\in\mathbb{N}$ and $\varphi\colon(0,1)\to[0,d]$. We prove there exists a set $F\subset\mathbb{R}^d$ whose lower spectrum $\operatorname{dim}^{\theta}_{\mathrm{L}} F$ satisfies $(1-\theta)\operatorname{dim}^{\theta}_{\mathrm{L}} F =…

We show that the Hausdorff dimension of any slice of the graph of the Takagi function is bounded above by the Assouad dimension of the graph minus one, and that the bound is sharp. The result is deduced from a statement on more general…

This paper consists of two halves. In the first half of the paper, we consider real-valued functions $f$ whose domain is the vertex set of a graph $G$ and that are Lipschitz with respect to the graph distance. By placing a uniform…

In this article, we investigate the pointwise behaviors of functions on the Heisenberg group. We find wavelet characterizations for the global and local H\"older exponents. Then we prove some a priori upper bounds for the multifractal…

We introduce a novel framework for embedding anisotropic variable exponent Sobolev spaces into spaces of anisotropic variable exponent H\"{o}lder-continuous functions within rectangular domains. We establish a foundational approach to…

For any $\epsilon > 0$, we show that if $G$ is a regular graph on $n \gg_\epsilon 1$ vertices that is $\epsilon$-far (differs by at least $\epsilon n^2$ edges) from any Tur\'{a}n graph, then its second eigenvalue $\lambda_2$ satisfies…

Given a connected graph $R$ on $r$ vertices and a rooted graph $H,$ let $R\{H\}$ be the graph obtained from $r$ copies of $H$ and the graph $R$ by identifying the root of the $i-th$ copy of $H$ with the $i-th$ vertex of $R$. Let…

From the paper of the first author it follows that upper and lower bounds for $\gamma$-vector of a simple polytope imply the bounds for its $g$-,$h$- and $f$-vectors. In the paper of the second author it was obtained unimprovable upper and…

Let G=(V,E) be a graph with f:V\to Z_+ a function assigning degree bounds to vertices. We present the first efficient algebraic algorithm to find an f-factor. The time is \tilde{O}(f(V)^{\omega}). More generally for graphs with integral…

We derive a spectral interpretation of the pivot operation on a graph and generalise this operation to hypergraphs. We establish lower bounds on the number of flat spectra of a Boolean function, depending on internal structures, with…

The spectral theory of graphs provides a bridge between classical signal processing and the nascent field of graph signal processing. In this paper, a spectral graph analogy to Heisenberg's celebrated uncertainty principle is developed.…

Hierarchical graphs often exhibit tree-like branching patterns, a structural property that challenges the design of traditional graph filters. We introduce a boundary-weighted operator that rescales each edge according to how far its…