Related papers: Fourier Dimension Estimates for Sets of Exact Appr…
In this paper we study the Assouad-like $\Phi$ dimensions of sets and measures that are constructed by a random weighted iterated function system of similarities. These dimensions are distinguished by the depth of the scales considered and…
In this article we study the generalized Fourier dimension of the set of Liouville numbers $\mathbb{L}$. Being a set of zero Hausdorff dimension, the analysis has to be done at the level of functions with a slow decay at infinity acting as…
This is an attempt of a comprehensive survey of the results in which estimates of the norms of linear means of multiple Fourier series, the Lebesgue constants, are obtained by means of estimating the Fourier transform of a function…
A positive definite quadratic form is called perfect, if it is uniquely determined by its arithmetical minimum and the integral vectors attaining it. In this self-contained survey we explain how to enumerate perfect forms in $d$ variables…
The Fourier extension method, also known as the Fourier continuation method, is a method for approximating non-periodic functions on an interval using truncated Fourier series with period larger than the interval on which the function is…
The concepts of spread and spread dimension of a metric space were introduced by Willerton in the context of quantifying biodiversity of ecosystems. In previous work, we developed the theoretical basis for applications of spread dimension…
We show that for large instances the order of magnitude of the expected Frobenius number is (up to a constant depending only on the dimension) given by its lower bound.
We propose an axiomatic approach to the concept of an intrinsic dimension of a dataset, based on a viewpoint of geometry of high-dimensional structures. Our first axiom postulates that high values of dimension be indicative of the presence…
We study dimensions of sumsets and iterated sumsets and provide natural conditions which guarantee that a set $F \subseteq \mathbb{R}$ satisfies $\overline{\dim}_\text{B} F+F > \overline{\dim}_\text{B} F$ or even $\dim_\text{H} n F \to 1$.…
It is natural to expect the following loosely stated approximation principle to hold: a numerical approximation solution should be in some sense as smooth as its target exact solution in order to have optimal convergence. For piecewise…
We prove that for an arbitrary upper semi-continuous function $\phi\colon G(1,2) \to [0,1]$ there exists a compact set $F$ in the plane such that $\dim_{\textrm{A}} \pi F = \phi(\pi)$ for all $\pi \in G(1,2)$, where $\pi F$ is the…
Dimension profiles were introduced in [8,11] to give a formula for the box-counting and packing dimensions of the orthogonal projections of a set $R^n$ onto almost all $m$-dimensional subspaces. However, these definitions of dimension…
We prove uniform estimates for the expected value of averages of order statistics of bivariate functions in terms of their largest values by a direct analysis. As an application, uniform estimates for the expected value of averages of order…
Dimension profiles were introduced by Falconer and Howroyd to provide formulae for the box-counting and packing dimensions of the orthogonal projections of a set E or a measure on Euclidean space onto almost all m-dimensional subspaces. The…
Previously, Erd\H{o}s, Kierstead and Trotter investigated the dimension of random height~$2$ partially ordered sets. Their research was motivated primarily by two goals: (1)~analyzing the relative tightness of the F\"{u}redi-Kahn upper…
We consider the dimensions of finite type of representations of a partially ordered set, i.e. such that there is only finitely many isomorphism classes of representations of this dimension. We give a criterion for a dimension to be of…
An approach is given for estimating the Hausdorff dimension of the univoque set of a self-similar set. This sometimes allows us to get the exact Hausdorff dimensions of the univoque sets.
Dimension is a standard and well-studied measure of complexity of posets. Recent research has provided many new upper bounds on the dimension for various structurally restricted classes of posets. Bounded dimension gives a succinct…
Approximation using Fourier features is a popular technique for scaling kernel methods to large-scale problems, with myriad applications in machine learning and statistics. This method replaces the integral representation of a…
We characterize the downsets of integer partitions (ordered by containment of Ferrers diagrams) and compositions (ordered by the generalized subword order) which have finite dimension in the sense of Dushnik and Miller. In the case of…