Related papers: Counting Nonattacking Chess Piece Placements: Bish…
In this paper, we introduce polynomial time algorithms that generate random $k$-noncrossing partitions and 2-regular, $k$-noncrossing partitions with uniform probability. A $k$-noncrossing partition does not contain any $k$ mutually…
We construct continuous (and even invertible) linear operators acting on Banach (even Hilbert) spaces whose restrictions to their respective closed linear subspaces of chain recurrent vectors are not chain recurrent operators. This…
We prove PSPACE-completeness of two classic types of Chess problems when generalized to n-by-n boards. A "retrograde" problem asks whether it is possible for a position to be reached from a natural starting position, i.e., whether the…
The aim of this work is to enumerate alternating sign matrices (ASM) that are quasi-invariant under a quarter-turn. The enumeration formula (conjectured by Duchon) involves, as a product of three terms, the number of unrestricted ASM's and…
The statistics of meander and related problems are studied as particular realizations of compact polymer chain foldings. This paper presents a general discussion of these topics, with a particular emphasis on three points: (i) the use of a…
We use logistic regression to estimate the value of the pieces in standard chess and several chess variants, namely Chess 960, Atomic chess, Antichess, and Horde chess. We perform our regressions on several years of data from Lichess, the…
We define a variant of the two-dimensional Silver Dollar game. Two coins are placed on a chessboard of unbounded size, and two players take turns choosing one of the coins and moving it. Coins are to be moved to the left or upward…
In this paper, Nash equilibrium seeking among a network of players is considered. Different from many existing works on Nash equilibrium seeking in non-cooperative games, the players considered in this paper cannot directly observe the…
The classical Domino problem asks whether there exists a tiling in which none of the forbidden patterns given as input appear. In this paper, we consider the aperiodic version of the Domino problem: given as input a family of forbidden…
We afford the problem of counting the blocks of a given length made with symbols drawn from an alphabet and relate this number to Fibonacci-like recurrent relations. The recurrence polynomia allows to calculate the limit ratio of two…
We study the distribution of squares in a Piatetski-Shapiro sequence $\left(\lfloor n^c\rfloor\right)_{n\in\mathbb N}$ with $c>1$ and $c\not\in\mathbb N$. We also study more general equations $\lfloor{n^c}\rfloor = sm^2$, $n,m\in \mathbb…
We study chip-firing games on multigraphs whose underlying simple graphs are trees, paths, and stars, denoted as banana trees, paths, and stars respectively. We present a polynomial time algorithm to compute the divisorial gonality of…
We study the dynamics of a piecewise map defined on the set of three pairwise nonparallel, nonconcurrent lines in $\mathbb{R}^2$. The geometric map of study may be analogized to the billiard map with a different reflection rule so that each…
We extend Bishop's one-fourth three-fourths principle for constructing peak functions belonging to a uniform algebra to a situation where the ``approximate barriers'' associated with the Bishop construction are not uniformly bounded.
We investigate two types of query games played on a graph, pair queries and edge queries. We concentrate on investigating the two associated graph parameters for binomial random graphs, and showing that determining any of the two parameters…
The 15 puzzle is a classic reconfiguration puzzle with fifteen uniquely labeled unit squares within a $4 \times 4$ board in which the goal is to slide the squares (without ever overlapping) into a target configuration. By generalizing the…
The system in which a small rigid ball is bouncing repeatedly on a massive at table vibrating vertically, so-called the bouncing ball system, has been widely studied. Under the assumption that the table is vibrating with a piecewise…
The purpose of this paper is to study an implicit scheme for a representation of nonexpansive mappings on a closed convex subset of a smooth and uniformly convex Banach space with respect to a left regular sequence of means defined on an…
The aim of this work is to enumerate alternating sign matrices (ASM) that are quasi-invariant under a quarter-turn. The enumeration formula (conjectured by Duchon) involves, as a product of three terms, the number of unrestricted ASM's and…
Billiards tables - a minimal model for particles moving in a confined region - are known to present classical (and quantum) different features according to their shape, ranging from strongly chaotic to integrable dynamics. Here we consider…