相关论文: Covering numbers and schlicht functions
Our aim in this article is to obtain the limit of counting function for the Dirichlet eigenvalues involving the m-order logarithmic Laplacian in a bounded Lipschitz domain and to derive also the lower bound.
We investigate orbit spaces of isometric actions on unit spheres and find a universal upper bound for the infimum of their curvatures.
We provide variational estimates for Bloch functions on the unit ball of $\mathbb{R}^d$ extending previous work on the Anderson conjecture for conformal maps on the unit disc.
We consider the problem of taking an opaque forest and determining the regions that are covered by it. We provide a tight upper bound on the complexity of this problem, and an algorithm for computing this area, which is worst-case optimal.
The main aim of this paper is to study multidimensional Bohr radii for holomorphic functions defined in complete Reinhardt domains in $\mathbb{C}^n$ with values in complex Banach spaces. More specifically, for holomorphic functions with…
We introduce a $2$-approximation algorithm for the minimum total covering number problem.
For normalised analytic functions $f$ defined on the open unit disc $\mathbb{D}$ satisfying the condition $\sup_{z\in \mathbb{D}}(1-|z^2|) |f'(z)|\leq 1$, known as Bloch functions, we determine various starlikeness radii.
This article explores a new type of optimal covering of a complete graph by small cliques of different sizes, namely the minimum covering with minimum excess. In particular, the minimum size of a covering by triples and quadruples with…
We improve a lower bound for the smallest area of convex covers for closed unit curves from 0.0975 to 0.1, which makes it substantially closer to the current best upper bound 0.11023. We did this by considering the minimal area of convex…
We study lattice points in d-dimensional spheres, and count their number in thin spherical segments. We found an upper bound depending only on the radius of the sphere and opening angle of the segment. To obtain this bound we slice the…
The chromatic number of a subset of Euclidean space is the minimal number of colors sufficient for coloring all points of this subset in such a way that any two points at the distance 1 have different colors. We give new upper bounds for…
The triangle covering number of a graph is the minimum number of vertices that hit all triangles. Given positive integers $s,t$ and an $n$-vertex graph $G$ with $\lfloor n^2/4 \rfloor +t$ edges and triangle covering number $s$, we determine…
The Vapnik-Chervonenkis dimension provides a notion of complexity for systems of sets. If the VC dimension is small, then knowing this can drastically simplify fundamental computational tasks such as classification, range counting, and…
We give upper and lower bounds on the maximum and minimum number of geometric configurations of various kinds present (as subgraphs) in a triangulation of $n$ points in the plane. Configurations of interest include \emph{convex polygons},…
In this paper we discuss the structure of Orlicz spaces and weak Orlicz spaces on $\mathbb{R}^n$. We obtain some necessary and sufficient conditions for the inclusion property of these spaces. One of the keys is to compute the norm of the…
In this paper we get an explicit lower bound for the radius of a Bergman ball contained in the Dirichlet fundamental polyhedron of a torsion-free discrete group $G\subset PU(n,1)$ acting on complex hyperbolic space. Consequently the volume…
Birch and Tverberg partitions are closely related concepts from discrete geometry. We show two properties for the number of Birch partitions: Evenness, and a lower bound. This implies the first non-trivial lower bound for the number of…
The purpose of this paper is to study the Schwarz-Pick type inequalities for harmonic or pluriharmonic functions. By analogy with the generalized Khavinson conjecture, we first give some sharp estimates of the norm of harmonic functions…
An approximate formula for the partitions of Goldbach's Conjecture is derived using Prime Number Theorem and a heuristic probabilistic approach. A strong form of Goldbach's conjecture follows in the form of a lower bounding function for the…
Given a sphere of any radius $r$ in an $n$-dimensional Euclidean space, we study the coverings of this sphere with solid spheres of radius one. Our goal is to design a covering of the lowest covering density, which defines the average…