Related papers: Mathematics of a Sudo-Kurve
We study the problem of arithmetic billiards from a new perspective. We first raise a similar problem about reflecting lights inside grids. For the solution to this problem, we will give three proofs. Next, we consider a similar problem in…
We study the famous mathematical puzzle of prisoners and hats. We introduce a framework in which various variants of the problem can be formalized. We examine three particular versions of the problem (each one in fact a class of problems)…
We determine the maximal number of smooth rational degree d curves on a complex K3-surface of degree 2n provided n is sufficiently large as compared to d>1. We obtain precise characterization of configurations of rational degree d curves…
We consider systems of simple closed curves on surfaces and their total number of intersection points, their so-called crossing number. For a fixed number of curves, we aim to minimise the crossing number. We determine the minimal crossing…
Kok et.al. [3] introduced Jaco Graphs \emph{(order 1)}. It is hoped that as a special case, a closed formula can be found for the number of edges of a finite Jaco Graph $J_n(1)$. However, the algorithms discussed in Ahlbach et.al. [1]…
Sumplete is a logic puzzle famous for being developed by ChatGPT. The puzzle consists of a rectangular grid, with each cell containing a number. The player has to cross out some numbers such that the sum of uncrossed numbers in each row and…
The Decodoku project seeks to let users get hands-on with cutting-edge quantum research through a set of simple puzzle games. The design of these games is explicitly based on the problem of decoding qudit variants of surface codes. This…
A cube is an 8-rep-tile: it is the union of eight smaller copies of itself. Is there a set with a hole which has this property? The computer found an interesting and complicated solution, which then could be simplified. We discuss some…
We look for elliptic curves featuring rational points whose coordinates form two arithmetic progressions, one for each coordinate. A constructive method for creating such curves is shown, for lengths up to 5.
While logic puzzles have engaged individuals through problem-solving and critical thinking, the creation of new puzzle rules has largely relied on ad-hoc processes. Pencil puzzles, such as Slitherlink and Sudoku, represent a prominent…
Using continuation methods, we study the global solution structure of periodic solutions for a class of periodically forced equations, generalizing the case of relativistic pendulum. We obtain results on the existence and multiplicity of…
This article is dedicated to domino tilings of square grids. In each of these grids domino tilings are represented using linear-recurrent sequences. For different grids are determined new dependencies.
We combine the newly discovered technique, which computes explicit formulas for the image of an algebraic curve under rational transformation, with techniques that enable to compute braid monodromies of such curves. We use this combination…
Shikaku is a pencil puzzle consisting of a rectangular grid, with some cells containing a number. The player has to partition the grid into rectangles such that each rectangle contains exactly one number equal to the area of that rectangle.…
We study a popular puzzle game known variously as Clickomania and Same Game. Basically, a rectangular grid of blocks is initially colored with some number of colors, and the player repeatedly removes a chosen connected monochromatic group…
We review the stamp folding problem, the number of ways to fold a strip of $n$ stamps, and the related problem of enumerating meander configurations. The study of equivalence classes of foldings and meanders under symmetries allows to…
We describe a method that allows, under some hypotheses, to compute all the rational points of some genus 5 curves defined over a number field. This method is used to solve some arithmetic problems that remained open.
A magic SET square is a 3 by 3 table of SET cards such that each row, column, diagonal, and anti-diagonal is a set. We allow the following transformations of the square: shuffling features, shuffling values within the features, rotations…
In this article, we compute the braid monodromy of two algebraic curves defined over R. These two curves are of complex level not bigger than 6, and they are unions of lines and conics. We use two different techniques for computing their…
This is a survey paper dealing with moduli aspects of curves over finite fields. It discusses counting points of moduli spaces, relations with modular forms and stratifications on moduli spaces.