We study packing densities for set partitions, which is a generalization of packing words. We use results from the literature about packing densities for permutations and words to provide packing densities for set partitions. These results give us most of the packing densities for partitions of the set {1, 2, 3}. In the final section we determine the packing density of the set partition {{1, 3}...

It has been shown that univalent circle packings filling in the complex plane C are unique up to similarities of C. Here we prove that bounded degree branched circle packings properly covering C are uniquely determined, up to similarities of C, by their branch sets. In particular, when branch sets of the packings considered are empty we obtain the earlier result. We also establish a circle pack...

Orey and Taylor (1974) introduced sets of “fast points” where Brownian increments are exceptionally large, F(λ) := {t ∈ [0, 1] : lim suph→0 |X(t+ h) −X(t)|/ √ 2h| log h|>λ}. They proved that for λ ∈ (0, 1], the Hausdorff dimension of F(λ) is 1 − λ2 a.s. We prove that for any analytic set E ⊂ [0, 1], the supremum of all λ’s for which E intersects F(λ) a.s. equals √ dimP E, where dimP E is the pa...

We survey recent advances obtained for the two-dimensional bin packing problem, with special emphasis on exact algorithms and e1ective heuristic and metaheuristic approaches. ? 2002 Elsevier Science B.V. All rights reserved.

We use Andreev-Thurston's theorem on the existence of circle packings to construct approximating solutions to the Beltrami equations on Riemann surfaces. The convergence of the approximating solutions on compact subsets will be shown. This gives a constructive proof of the existence theorem for Beltrami equations.

We study the 2-dimensional vector packing problem, which is a generalization of the classical bin packing problem where each item has 2 distinct weights and each bin has 2 corresponding capacities. The goal is to group items into minimum number of bins, without violating the bin capacity constraints. We propose an Θ(n)-time approximation algorithm that is inspired by the O(n) algorithm proposed...

Online Bin Stretching is a semi-online variant of bin packing in which the algorithm has to use the same number of bins as the optimal packing, but is allowed to slightly overpack the bins. The goal is to minimize the amount of overpacking, i.e., the maximum size packed into any bin. We give an algorithm for Online Bin Stretching with a stretching factor of 1.5 for any number of bins. We also s...

the search for new stationary phases has been one of the predominant concerns in high performance liquid chromatography (hplc) in order to achieve better resolutions, longer column lives, and reduce the time of analysis. a chromatographic packing for separation of underivatized amino acids (aas) were prepared by dynamically coating 2-amino tetraphenyl prophyrin (atpp) on a c-18 reversed-phase p...

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 ...