Displaying similar documents to “Maximal averages and packing of one dimensional sets.”

Packing Parameters in Graphs

I. Sahul Hamid, S. Saravanakumar (2015)

Discussiones Mathematicae Graph Theory

Similarity:

In a graph G = (V,E), a non-empty set S ⊆ V is said to be an open packing set if no two vertices of S have a common neighbour in G. An open packing set which is not a proper subset of any open packing set is called a maximal open packing set. The minimum and maximum cardinalities of a maximal open packing set are respectively called the lower open packing number and the open packing number and are denoted by ρoL and ρo. In this paper, we present some bounds on these parameters. ...

Universal container for packing rectangles

Janusz Januszewski (2002)

Colloquium Mathematicae

Similarity:

The aim of the paper is to find a rectangle with the least area into which each sequence of rectangles of sides not greater than 1 with total area 1 can be packed.

On weak type inequalities for rare maximal functions in ℝⁿ

A. M. Stokolos (2006)

Colloquium Mathematicae

Similarity:

The study of one-dimensional rare maximal functions was started in [4,5]. The main result in [5] was obtained with the help of some general procedure. The goal of the present article is to adapt the procedure (we call it "dyadic crystallization") to the multidimensional setting and to demonstrate that rare maximal functions have properties not better than the Strong Maximal Function.