Related papers: Fractal-Dimensional Properties of Subordinators
In this article, we construct the multivariate fractal interpolation functions for a given data points and explore the existence of $\alpha$-fractal function corresponding to the multivariate continuous function defined on $[0,1]\times…
We prove a Hurewicz-type theorem for the dynamic asymptotic dimension originally introduced by Guentner, Willett, and Yu. Calculations of (or simply upper bounds on) this dimension are known to have implications related to cohomology of…
An estimate is derived for the volume fraction of a subset $C_{\epsilon}^{P} = \{U : ||grad J(U)|\leq {\epsilon}\}\subset\mathrm{U}(N)$ in the neighborhood of the critical set $C^{P}\simeq\mathrm{U}(\mathbf{n})P\mathrm{U}(\mathbf{m})$ of…
This paper presents a new Lie theoretic approach to fractal calculus, which in turn yields such new results as a Fractal Noether's Theorem, a setting for fractal differential forms, for vector fields, and Lie derivatives, as well as…
In this article we introduce a finite difference approximation for integro-differential operators of L\'evy type. We approximate solutions of integro-differential equations, where the second order operator is allowed to degenerate. In the…
In this paper we obtain new lower bounds for the upper box dimension of $\alpha\beta$ sets. As a corollary of our main result, we show that if $\alpha$ is not a Liouville number and $\beta$ is a Liouville number, then the upper box…
High dimensional central limit theorems (the CLTs) have been extensively studied in recent years under a variety of sufficient moment conditions connecting the dimension growth rate with the tail decay rate. In this article, we investigate…
Performing $n$ steps of $\beta$-reduction to a given term in the $\lambda$-calculus can lead to an increase in the size of the resulting term that is exponential in $n$. The same is true for the possible depth increase of terms along a…
We refine the bound on the packing number, originally shown by Haussler, for shallow geometric set systems. Specifically, let $\V$ be a finite set system defined over an $n$-point set $X$; we view $\V$ as a set of indicator vectors over the…
We study an approximate version of $q$-query LDCs (Locally Decodable Codes) over the real numbers and prove lower bounds on the encoding length of such codes. A $q$-query $(\alpha,\delta)$-approximate LDC is a set $V$ of $n$ points in…
We investigate the box-counting dimension of the image of a set $E \subset \mathbb{R}$ under a random multiplicative cascade function $f$. The corresponding result for Hausdorff dimension was established by Benjamini and Schramm in the…
In this paper, employing the weak convergence method, based on a variational representation for expected values of positive functionals of a Brownian motion, we investigate moderate deviation %(CLT for abbreviation) for a class of…
We determine the scaling dimension $\Delta_n$ for the class of composite operators $\phi^n$ in the $\lambda \phi^4$ theory in $d=4-\epsilon$ taking the double scaling limit $n\rightarrow \infty$ and $\lambda \rightarrow 0$ with fixed…
Supersymmetric partition function of $\mathcal N=1$ superconformal theories on $S^1_{\beta} \times S^3$ is related to the superconformal index receiving contributions from short representations. The leading coefficients in the small $\beta$…
The goal of this paper is to present a lower bound for the Mahler volume of at least 4-dimensional symmetric convex bodies. We define a computable dimension dependent constant through a 2-dimensional variational (max-min) procedure and…
We provide new insights on eluder dimension, a complexity measure that has been extensively used to bound the regret of algorithms for online bandits and reinforcement learning with function approximation. First, we study the relationship…
We consider the problem of estimating the support size of a distribution $D$. Our investigations are pursued through the lens of distribution testing and seek to understand the power of conditional sampling (denoted as COND), wherein one is…
In this article, we present a novel box-covering algorithm for analyzing the fractal properties of complex networks. Unlike traditional algorithms that impose a predetermined box size, our approach assigns nodes to boxes identified by their…
Motivated by complexity questions in integer programming, this paper aims to contribute to the understanding of combinatorial properties of integer matrices of row rank $r$ and with bounded subdeterminants. In particular, we study the…
We start by defining a subordinator by means of the lower-incomplete gamma function. It can be considered as an approximation of the stable subordinator, easier to be handled thank to its finite activity. A tempered version is also…