Related papers: Bachet's Problem: as few weights to weigh them all
Given a set $P$ of $n$ weighted points and a set $H$ of $n$ half-planes in the plane, the hitting set problem is to compute a subset $P'$ of points from $P$ such that each half-plane contains at least one point from $P'$ and the total…
We collect several open questions in Banach spaces, mostly related to measure theoretic aspects of the theory. The problems are divided into five categories: miscellaneous problems in Banach spaces (non-separable $L^p$ spaces, compactness…
We give a formulation of the single particle occupation probabilities for a system of identical particles obeying fractional exclusion statistics of Haldane. We first derive a set of constraints using an exactly solvable model which…
The number of solid partitions of a positive integer is an unsolved problem in combinatorial number theory. In this paper, solid partitions are studied numerically by the method of exact enumeration for integers up to 50 and by Monte Carlo…
In 2007, a new variety of the well-known problem of identifying a counterfeit coin using a balance scale was introduced in the sixth International Kolmogorov Math Tournament. This paper offers a comprehensive overview of this new problem by…
Dedekind's problem, dating back to 1897, asks for the total number $\psi(n)$ of antichains contained in the Boolean lattice $B_n$ on $n$ elements. We study Dedekind's problem using a recently developed method based on the cluster expansion…
Mass partition problems describe the partitions we can induce on a family of measures or finite sets of points in Euclidean spaces by dividing the ambient space into pieces. In this survey we describe recent progress in the area in addition…
The weight enumerators (quant-ph/9610040) of a quantum code are quite powerful tools for exploring its structure. As the weight enumerators are quadratic invariants of the code, this suggests the consideration of higher-degree polynomial…
Two-Bar Charts Packing Problem is to pack $n$ two-bar charts (2-BCs) in a minimal number of unit-capacity bins. This problem generalizes the strongly NP-hard Bin Packing Problem. We prove that the problem remains strongly NP-hard even if…
Partial multivariate Bell polynomials have been defined by E.T. Bell in 1934. These polynomials have numerous applications in Combinatorics, Analysis, Algebra, Probabilities, etc. Many of the formulae on Bell polynomials involve…
For any partition of a positive integer we consider the chess (or draughts) colouring of its associated Ferrers graph. Let b denote the total number of black unit squares, and w the number of white squares. In this note we characterize all…
We propose a class of two person perfect information games based on weighted graphs. One of these games can be described in terms of a round pizza which is cut radially into pieces of varying size. The two players alternately take pieces…
In this paper, we introduce and develop the circle embedding method. This method hinges essentially on a combinatorial-geometric structure which we choose to call circles of partition. We provide applications in the context of problems that…
In this paper, we investigate the parametric weight knapsack problem, in which the item weights are affine functions of the form $w_i(\lambda) = a_i + \lambda \cdot b_i$ for $i \in \{1,\ldots,n\}$ depending on a real-valued parameter…
We consider three problems about cities from Alcuin's_Propositiones ad acuendos juvenes_. These problems can be considered as the earliest packing problems difficult also for modern state-of-the-art packing algorithms. We discuss the…
Consider the Maximum Weight Independent Set problem for rectangles: given a family of weighted axis-parallel rectangles in the plane, find a maximum-weight subset of non-overlapping rectangles. The problem is notoriously hard both in the…
This paper presents an integer decomposition method. The method first writes an integer as a polynomial with 2 as variable that its coefficients are zero or one. Then, suppose that an integer is decomposed into product of such two…
In 1963, Graham proved that all integers greater than 77 (but not 77 itself) can be partitioned into distinct positive integers whose reciprocals sum to 1. He further conjectured that for any sufficiently large integer, it can be…
Let $P$ be a set of $n$ points in the plane. We consider the problem of partitioning $P$ into two subsets $P_1$ and $P_2$ such that the sum of the perimeters of $\text{CH}(P_1)$ and $\text{CH}(P_2)$ is minimized, where $\text{CH}(P_i)$…
In this paper, we study the so-called 'Mathematical part' of Plato's Theaetetus. Its subject concerns the incommensurability of certain magnitudes, in modern terms the question of the rationality or irrationality of the square roots of…