Related papers: A remark on covering
The aim of this paper is to present a tool used to show that certain Banach spaces can be endowed with $C^k$ smooth equivalent norms. The hypothesis uses particular countable decompositions of certain subsets of $B_{X^*}$, namely…
In this article, we consider the following capacitated covering problem. We are given a set $P$ of $n$ points and a set $\mathcal{B}$ of balls from some metric space, and a positive integer $U$ that represents the capacity of each of the…
We give upper bounds for the density of unit ball packings relative to their outer parallel domains and discuss their connection to contact numbers. Also, packings of soft balls are introduced and upper bounds are given for the fraction of…
In this article, we develop an algorithm suitable for constrained optimization in $\mathbb{R}^n$. The results are developed through standard tools of n-dimensional real analysis and basic concepts of optimization. Indeed, the well known…
The aim of this paper is to present two tools, Theorems 4 and 7, that make the task of finding equivalent polyhedral norms on certain Banach spaces easier and more transparent. The hypotheses of both tools are based on countable…
We provide a few characterizations of a strictly convex Banach space. Using this we improve the main theorem of [Digar, Abhik; Kosuru, G. Sankara Raju; Cyclic uniform Lipschitzian mappings and proximal uniform normal structure. Ann. Funct.…
We describe a new approach to the problem of constructing gluing parameterizations for open neighborhoods of boundary points of moduli spaces of anti-self-dual connections over closed four-dimensional manifolds. Our approach employs general…
The aim of this note is to provide several variants of the diameter two properties for Banach spaces. We study such properties looking for the abundance of diametral points, which holds in the setting of Banach spaces with the Daugavet…
Covering-based rough set theory is an extension to classical rough set. The main purpose of this paper is to study covering rough sets from a topological point of view. The relationship among upper approximations based on topological spaces…
We collect, survey and develop methods of (one-dimensional) stochastic approximation in a framework that seems suitable to handle fairly broad generalizations of Polya urns. To show the applicability of the results we determine the limiting…
We give an attempt to build a classification of planar integral point sets. For two obtained classes, we provide general constructions of upper bounds for minimal diameter of integral point sets in higher dimensions of certain cardinality.…
In this paper, we study nonlinear embeddings between Banach spaces. More specifically, the goal of this paper is to study weaker versions of coarse and uniform embeddability, and to provide suggestive evidences that those weaker embeddings…
A novel mathematical model for fiber-reinforced materials is proposed. It is based on a 1-dimensional beam model for the thin fiber structures, a flexible and general 3-dimensional elasticity model for the matrix and an overlapping domain…
The classical sphere packing problem asks for the best (infinite) arrangement of non-overlapping unit balls which cover as much space as possible. We define a generalized version of the problem, where we allow each ball a limited amount of…
A covering code is a subset $\mathcal{C} \subseteq \{0,1\}^n$ with the property that any $z \in \{0,1\}^n$ is close to some $c \in \mathcal{C}$ in Hamming distance. For every $\epsilon,\delta>0$, we show a construction of a family of codes…
We study properties of representing and absolutely representing systems of subspaces in Banach spaces. We also present sufficient conditions for the system of subspaces to be a representing system of subspaces.
We begin by describing the unit ball of the free $p$-convex Banach lattice over a Banach space $E$ (denoted by ${\mathrm{FBL}}^{(p)}[E]$) as a closed solid convex hull of an appropriate set. Based on it, we show that, if a Banach space $E$…
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…
It is proposed to create materials with a desired refraction coefficient in a bounded domain $D\subset \R^3$ by embedding many small balls with constant refraction coefficients into a given material. The number of small balls per unit…
The main problem considered in this paper is construction and theoretical study of efficient $n$-point coverings of a $d$-dimensional cube $[-1,1]^d$. Targeted values of $d$ are between 5 and 50; $n$ can be in hundreds or thousands and the…