Related papers: The Generalized Double Pouring Problem: Analysis, …
We introduce $k$-variance, a generalization of variance built on the machinery of random bipartite matchings. $K$-variance measures the expected cost of matching two sets of $k$ samples from a distribution to each other, capturing local…
Consider a dam model, $L^{upper}$ and $L^{lower}$ are upper and, respectively, lower levels, $L = L^{upper}-L^{lower}$ is large and if the level of water is between these bounds, then the dam is said to be in a normal state. Passage across…
The declustering problem is to allocate given data on parallel working storage devices in such a manner that typical requests find their data evenly distributed on the devices. Using deep results from discrepancy theory, we improve previous…
The group draw of a sports tournament requires assigning teams to groups of (almost) the same size. The most important criteria for a draw procedure are balance, randomness, and transparency, which could not be satisfied simultaneously if…
An iterative solution method for fully nonlinear boundary value problems governing self-similar flows with a free boundary is presented. Specifically, the method is developed for application to water entry problems, which can be studied…
Let $\Pi_q$ be an arbitrary finite projective plane of order $q$. A subset $S$ of its points is called saturating if any point outside $S$ is collinear with a pair of points from $S$. Applying probabilistic tools we improve the upper bound…
The Locker Problem is frequently used in introducing some topics in elementary number theory like divisors and multiples. It appears in many curricula ranging from elementary, secondary and up to tertiary level. In this paper, I will…
We consider the number of passes a permutation needs to take through a stack if we only pop the appropriate output values and start over with the remaining entries in their original order. We define a permutation $\pi$ to be $k$-pass…
The $n$-queens puzzle is to place $n$ mutually non-attacking queens on an $n \times n$ chessboard. We present a simple two stage randomized algorithm to construct such configurations. In the first stage, a random greedy algorithm constructs…
Generalized eigenvalue problems involving a singular pencil may be very challenging to solve, both with respect to accuracy and efficiency. While Part I presented a rank-completing addition to a singular pencil, we now develop two…
A new polynomial sieve is presented and used to show that almost all integers have at most one representation as a sum of two values of a given polynomial of degree at least 3.
The goal of the classic football-pool problem is to determine how many lottery tickets are to be bought in order to guarantee at least $n-r$ correct guesses out of a sequence of $n$ games played. We study a generalized (second-order)…
In two space dimensions, we study a general double-free-boundary problem which models a stream flowing through a gravitaional potentiay. ntial-energy terrain. The existence theorem generalizes (by a different proof) a result of A. Beurling.…
The following is shown : Let $S=\{a_1,a_2,..,a_{2n}\}$ be a subset of a totally ordered commutative semi-group $(G,*,\leq)$ with $a_1\leq a_2\leq...\leq a_{2n}$. Provided that a system of $n$ $a_{i_k} * a_{j_k}\ (a_{i_k}, a_{j_k} \in G ;\ 1…
The Kneser graph $K(n,k)$ is defined for integers $n$ and $k$ with $n \geq 2k$ as the graph whose vertices are all the $k$-subsets of $\{1,2,\ldots,n\}$ where two such sets are adjacent if they are disjoint. A classical result of Lov\'asz…
Given a text and a pattern over two types of symbols called constants and variables, the parameterized pattern matching problem is to find all occurrences of substrings of the text that the pattern matches by substituting a variable in the…
In the Flow Edge-Monitor Problem, we are given an undirected graph G=(V,E), an integer k > 0 and some unknown circulation \psi on G. We want to find a set of k edges in G, so that if we place k monitors on those edges to measure the flow…
Let P be a set of n points in the Euclidean plane and let O be the origin point in the plane. In the k-tour cover problem (called frequently the capacitated vehicle routing problem), the goal is to minimize the total length of tours that…
We study a generalization of the Steiner tree problem, where we are given a weighted network $G$ together with a collection of $k$ subsets of its vertices and a root $r$. We wish to construct a minimum cost network such that the network…
We discuss several coin-weighing problems in which coins are known to be of three different weights and only a balance scale can be used. We start with the task of sorting coins when the pans of the scale can fit only one coin. We prove…