相关论文: A New Version of the Menages Problem
We report the results of a computer investigation of sets of mutually orthogonal latin squares (MOLS) of small order. For $n\le9$ we 1. Determine the number of orthogonal mates for each species of latin square of order $n$. 2. Calculate the…
Some aspects of the problem of stable marriage are discussed. There are two distinguished marriage plans: the fully transferable case, where money can be transferred between the participants, and the fully non transferable case where each…
Entangled linear orders were first introduced by Abraham and Shelah. Todor\v{c}evi\'c showed that these linear orders exist under $\mathsf{CH}$. We prove the following results: (1) If $\mathsf{CH}$ holds, then, for every $n > 0$, there is…
In this paper, I develop an integrated approach to collective models and matching models of the marriage market. In the collective framework, both household formation and the intra-household allocation of bargaining power are taken as…
The stable matching problem is a prototype model in economics and social sciences where agents act selfishly to optimize their own satisfaction, subject to mutually conflicting constraints. A stable matching is a pairing of adjacent…
The word inference problem is to determine languages such that the information on the number of occurrences of those subwords in the language can uniquely identify a word. A considerable amount of work has been done on this problem, but the…
In 1966, Claude Berge proposed the following sorting problem. Given a string of $n$ alternating white and black pegs on a one-dimensional board consisting of an unlimited number of empty holes, rearrange the pegs into a string consisting of…
We discuss problems of simultaneous tiling. This means that we have an object (set, function) which tiles space with two or more different sets of translations. The most famous problem of this type is the Steinhaus problem which asks for a…
We present a new algorithm that, given two matrices in $GL(n,Q)$, decides if they are conjugate in $GL(n,Z)$ and, if so, determines a conjugating matrix. We also give an algorithm to construct a generating set for the centraliser in…
This paper examines the behaviour of closed `lattice universes' wherein masses are distributed in a regular lattice on the Cauchy surfaces of closed vacuum universes. Such universes are approximated using a form of Regge calculus originally…
The parameterisation of rotations in three dimensional Euclidean space is an area of applied mathematics that has long been studied, dating back to the original works of Euler in the 18th century. As such, many ways of parameterising a…
This paper examines the classical matching distribution arising in the "problem of coincidences". We generalise the classical matching distribution with a preliminary round of allocation where items are correctly matched with some fixed…
The Stable Roommates problem involves matching a set of agents into pairs based on the agents' strict ordinal preference lists. The matching must be stable, meaning that no two agents strictly prefer each other to their assigned partners. A…
This article has been written for an educational magazine whose target audience consists of students and teachers of mathematics in universities, colleges and schools. It concerns a notion of duality between rectangles. A proof is given…
The concept of correlation appears straightforward: measurement outcomes coincide, and patterns emerge. For any record of events, the coefficients are uniquely determined. Thus, if correlations change spontaneously, as seen in quantum…
In stable matching, one must find a matching between two sets of agents, commonly men and women, or job applicants and job positions. Each agent has a preference ordering over who they want to be matched with. Moreover a matching is said to…
In [1] the authors studied the closed tour problem on the $8\times 8$ chessboard of a chess piece, called $k$-prince, leaving open the existence of such a tour when $k=7$. In this note we find a solution to this open case.
$n$ people are seated randomly at a rectangular table with $\lfloor n/2\rfloor$ and $\lceil n/2\rceil$ seats along the two opposite sides for two dinners. What's the probability that neighbors at the first dinner are no more neighbors at…
We consider the parity problem in one-dimensional, binary, circular cellular automata: if the initial configuration contains an odd number of 1s, the lattice should converge to all 1s; otherwise, it should converge to all 0s. It is easy to…
Recently, a new geometric approach which is called the fixed-circle problem has been gained to fixed-point theory. The problem is introduced and studied using different techniques on metric spaces. In this paper, we consider the…