Related papers: Miscellaneous problems about packing and covering
In this paper we apply a geometric covering method to study the number of ends on shrinkers. On one hand, we prove that the number of ends on any complete non-compact shrinker is at most polynomial growth with fixed degree. On the other…
We prove compactness and hence existence for solutions to a class of non linear transport equations. The corresponding models combine the features of linear transport equations and scalar conservation laws. We introduce a new method which…
We consider problems concerning the partial order structure of the set of spreading models of Banach spaces. We construct examples of spaces showing that the possible structure of these sets include certain classes of finite semi-lattices…
Given a set $P$ of $n$ points in the plane, its unit-disk graph $G(P)$ is a graph with $P$ as its vertex set such that two points of $P$ are connected by an edge if their (Euclidean) distance is at most $1$. We consider several classical…
This paper is motivated by recent developments in group stability, high dimensional expansion, local testability of error correcting codes and topological property testing. In Part I, we formulate and motivate three stability problems: 1.…
We review the stamp folding problem, the number of ways to fold a strip of $n$ stamps, and the related problem of enumerating meander configurations. The study of equivalence classes of foldings and meanders under symmetries allows to…
The problem of packing a set of circles into the smallest surrounding container is considered. This problem arises in different application areas such as automobile, textile, food, and chemical industries. The so-called circle packing…
An extremal $k$-packing is a collection of $k$ mutually disjoint metric discs, embedded in a surface, whose radius is maximal for the given topology. We study compact non-orientable surfaces of genus $g\ge 3$ containing extremal…
Given a collection $L$ of line segments, we consider its arrangement and study the problem of covering all cells with line segments of $L$. That is, we want to find a minimum-size set $L'$ of line segments such that every cell in the…
The divergence minimization problem plays an important role in various fields. In this note, we focus on differentiable and strictly convex divergences. For some minimization problems, we show the minimizer conditions and the uniqueness of…
We study the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…
We introduce and study a novel generalization of the classical Knapsack Problem (KP), called the Colored Knapsack Problem (CKP). In this problem, the items are partitioned into classes of colors and the packed items need to be ordered such…
This is a problem list in the theory of foliations and laminations of 3-manifolds. The focus is on the relationship of foliations and laminations with other aspects of 3-manifold topology, especially with the Thurston theory of geometric…
We use computational experiments to find the rectangles of minimum perimeter into which a given number n of non-overlapping congruent circles can be packed. No assumption is made on the shape of the rectangles. In many of the packings…
The composition problem for shortest paths asks the following: given shortest paths on weighted graphs M and N which share a common boundary, find the shortest paths on their union. This problem is a crucial step in any algorithm which uses…
A mechanism to derive non-repetitive coverage path solutions with a proven minimal number of discontinuities is proposed in this work, with the aim to avoid unnecessary, costly end effector lift-offs for manipulators. The problem is…
We present some recent results in Fibrewise General Topology with special regard to the theory of Tychonoff compactifications of mappings. Several open problems are also proposed.
This article provides an overview of the performance and the theoretical complexity of approximate and exact methods for various versions of the shortest path problem. The proposed study aims to improve the resolution of a more general…
We introduce the concept of a sum-rank saturating system and outline its correspondence to a covering properties of a sum-rank metric code. We consider the problem of determining the shortest sum-rank-$\rho$-saturating systems of a fixed…
The knapsack problem (KP) is a very famous NP-hard problem in combinatorial optimization. Also its generalization to multiple dimensions named d-dimensional knapsack problem (d-KP) and to multiple knapsacks named multiple knapsack problem…