Related papers: Counting Nonattacking Chess Piece Placements: Bish…

We develop a new approach for approximating large independent sets when the input graph is a one-sided spectral expander - that is, the uniform random walk matrix of the graph has its second eigenvalue bounded away from 1. Consequently, we…

I present an algorithm that, given a number $n \geq 1$, computes a compact representation of the set of all noncrossing acyclic digraphs with $n$ nodes. This compact representation can be used as the basis for a wide range of dynamic…

A distributed Nash equilibrium seeking algorithm is presented for networked games. We assume an incomplete information available to each player about the other players' actions. The players communicate over a strongly connected digraph to…

We study the recurrence behaviour of random walks on partially oriented honeycomb lattices. The vertical edges are undirected while the orientation of the horizontal edges is random: depending on their distribution, we prove a.s. transience…

Chess championships are often organised as a Swiss-system tournament, causing great challenges in ranking the participants due to the different strength of schedules and possible circular triads. The paper suggests that pairwise comparison…

We give an estimate of the number of geometrically distinct open tours $\G$ for a knight on a chessboard. We use a randomization of Warnsdorff rule to implement importance sampling in a backtracking scheme, correcting the observed bias of…

Choreographies describe possible sequences of interactions among a set of agents. We aim to join two lines of research on choreographies: the use of the shuffle on trajectories operator to design more expressive choreographic languages, and…

A formal n-square is the set of positions in an square matrix of size n. A shuffle of a formal n-square consists of independent rotations of each row and of each column. A key result turns out to be valid at least for n <= 34 and n = 37:…

Probabilistic concurrent/distributed strategies have so far not been investigated thoroughly in the context of imperfect information, where the Player has only partial knowledge of the moves made by the Opponent. In a situation where the…

The $k$-th power of the adjacency matrix of a simple undirected graph represents the number of walks with length $k$ between pairs of nodes. As a walk where no node repeats, a path is a walk where each node is only visited once. The set of…

We consider the problem of placing k queens on an nxn board so that the total number of attacked squares is as small as possible. In particular, we consider the domain where k is small relative to n and derive nearly tight bounds in this…

An infinite game on the set of real numbers appeared in Matthew Baker's work [Math. Mag. 80 (2007), no. 5, pp. 377--380] in which he asks whether it can help characterize countable subsets of the reals. This question is in a similar spirit…

We consider a specific piecewise rotation of the plane that is continuous on two half-planes, as studied by some authors like Boshernitzan, Goetz and Quas. If the angle belongs to the set $\{\frac{\pi}{2},\frac{2\pi}{3},\frac{\pi}{4}\}$, we…

A group of $n$ agents with numerical preferences for each other are to be assigned to the $n$ seats of a dining table. We study two natural topologies:~circular (cycle) tables and panel (path) tables. For a given seating arrangement, an…

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…

N point particles move within a billiard table made of two circular cavities connected by a straight channel. The usual billiard dynamics is modified so that it remains deterministic, phase space volumes preserving and time reversal…

We consider uniformly random set partitions of size $n$ with exactly $k$ blocks, and uniformly random permutations of size $n$ with exactly $k$ cycles, under the regime where $n-k \sim t\sqrt{n}$, $t>0$. In this regime, there is a simple…

Statistical properties for the recurrence of particles in an oval billiard with a hole in the boundary are discussed. The hole is allowed to move in the boundary under two different types of motion: (i) counterclockwise periodic circulation…

We study a type of generalized recursive game introduced by Castronova, Chen, and Zumbrun featuring increasing stakes, with an emphasis on continuous guts poker and $1$ v. $n$ coalitions. Our main results are to develop practical numerical…

Positional games have been introduced by Hales and Jewett in 1963 and have been extensively investigated in the literature since then. These games are played on a hypergraph where two players alternately select an unclaimed vertex of it. In…