Related papers: A New Version of the Menages Problem
The mean king's problem with maximal mutually unbiased bases (MUB's) in general dimension d is investigated. It is shown that a solution of the problem exists if and only if the maximal number (d+1) of orthogonal Latin squares exists. This…
Two members of a packing are neighbors if they have a common boundary point. A multitude of problems arises in connection with neighbors in a packing. The oldest one concerns a dispute between Newton and Gregory about the maximum number of…
For the telegraph equation with a nonlinear potential given in the first quadrant, we consider the first and the second mixed problem, for which we study issues related to the absence and non-uniqueness of classical solutions.
We discuss time complexity of The Conjugacy Problem in HNN-extensions of groups, in particular, in Miller's groups. We show that for "almost all", in some explicit sense, elements, the Conjugacy Problem is decidable in cubic time. It is…
I introduce an extended configuration space for classical mechanical systems, called pair-space, which is spanned by the relative positions of all the pairs of bodies. To overcome the non-independence of this basis, one adds to the…
The practice of marriage is an understudied phenomenon in behavioural sciences despite being ubiquitous across human cultures. This modelling paper shows that replacing distant direct kin with in-laws increases the interconnectedness of the…
The Stable Roommates problems are characterized by the preferences of agents over other agents as roommates. A solution is a partition of the agents into pairs that are acceptable to each other (i.e., they are in the preference lists of…
Assume that $n = 2k$ potential roommates each have an ordered preference of the $n-1$ others. A stable matching is a perfect matching of the $n$ roommates in which no two unmatched people prefer each other to their matched partners. In…
The Sorites paradox is the name of a class of paradoxes that arise when vague predicates are considered. Vague predicates lack sharp boundaries in extension and is therefore not clear exactly when such predicates apply. Several approaches…
This chapter is divided into two parts. The first part is a survey of some recent results on nests and the orderability problem. The second part consists of results, partial results and open questions, all viewed in the light of nests. From…
The stable marriage problem with ties is a well-studied and interesting problem in game theory. We are given a set of men and a set of women. Each individual has a preference ordering on the opposite group, which can possibly contain ties.…
We provide a list of (mainly unsolved) problems in ordered and orderable groups. These were originally compiled 10 years ago by the last two authors. New problems have been added to the list. Progress on some of these is noted and…
Stable matching in a community consisting of men and women is a classical combinatorial problem that has been the subject of intense theoretical and empirical study since its introduction in 1962 in a seminal paper by Gale and Shapley, who…
Class endogamy is a phenomenon in which nobles only marry other nobles and commoners only marry other commoners. The origin of class endogamy, and of social stratification in general, is a major open question in archaeology. This paper…
Erd\H{o}s first introduced the idea of covering systems in 1950. Since then, much of the work in this area has concentrated on identifying covering systems that meet specific conditions on their moduli. Among the central open problems in…
Given a dataset $S$ of points in $\mathbb{R}^2$, the range closest-pair (RCP) problem aims to preprocess $S$ into a data structure such that when a query range $X$ is specified, the closest-pair in $S \cap X$ can be reported efficiently.…
It is well known that a stable matching in a many-to-one matching market with couples need not exist. We introduce a new matching algorithm for such markets and show that for a general class of large random markets the algorithm will find a…
Following on the King Chicken Theorems originally proved by Maurer, we examine the idea of multiple flocks of chickens by bringing the chickens from tournaments to multipartite tournaments. As Kings have already been studied in multipartite…
In this paper, we address the problem of approximating solutions of ill-posed problems using mollification. We quickly review existing mollification regularization methods and provide two new approximate solutions to a general ill-posed…
In this paper, we study the notion of mending, i.e. given a partial solution to a graph problem, we investigate how much effort is needed to turn it into a proper solution. For example, if we have a partial coloring of a graph, how hard is…