English
Related papers

Related papers: Magic Tours of Knight in 4x4x4 Cube

200 papers

The problem of existence of closed knight's tours in $[n]^d$, where $[n]=\{0, 1, \dots, n-1\}$, was recently solved by Erde, Gol\'{e}nia, and Gol\'{e}nia. They raised the same question for a generalised, $(a, b)$ knight, which is allowed to…

Combinatorics · Mathematics 2016-10-27 Nina Kamčev

It is shown that there exist non-singular cubic surfaces in CP^3 containing 5 twistor lines. This is the maximum number of twistor fibres that a non-singular cubic can contain. Cubic surfaces in CP^3 with 5 twistor lines are classified up…

Differential Geometry · Mathematics 2015-06-23 John Armstrong , Massimiliano Povero , Simon Salamon

A \emph{magic square} is an $n \times n$ array of distinct positive integers whose sum along any row, column, or main diagonal is the same number. We compute the number of such squares for $n=4$, as a function of either the magic sum or an…

Combinatorics · Mathematics 2011-03-08 Matthias Beck , Andrew Van Herick

A system of $m$ nonzero vectors in $\mathbb{Z}^n$ is called an $m$-icube if they are pairwise orthogonal and have the same length. The paper describes $m$-icubes in $\mathbb{Z}^4$ for $2\le m\le 4$ using Hurwitz integral quaternions, counts…

Number Theory · Mathematics 2011-08-17 Emil W. Kiss , Péter Kutas

We consider a non-minimal billiard trajectory inside the cube. We study the language of the associated orbit when the map is coded with three letters associated to three non-parallel faces of the cube.

Dynamical Systems · Mathematics 2026-02-09 Moussa Barro , Nicolas Bédaride , Julien Cassaigne

Let $Q_d$ be the $d$-dimensional hypercube and $N=2^d$. We prove that the number of (proper) 4-colorings of $Q_d$ is asymptotically \[6e2^N,\] as was conjectured by Engbers and Galvin in 2012. The proof uses a combination of information…

Combinatorics · Mathematics 2019-04-30 Jeff Kahn , Jinyoung Park

We present a novel proof that the maximum number of sets with 4 properties for 12 cards is 14 using the geometry of the finite field F_3^4, number theory, combinatorics, and graph theory. We also present several computer algorithms for…

Combinatorics · Mathematics 2025-01-23 Justin Stevens , Duncan Wilson

It is well known that there exist twenty two symmetry type graphs associated to 4-orbit maps. For this ones we give the feasible values taken by the degree of the vertices and the number appropriate of edges in the boundary of each face of…

Combinatorics · Mathematics 2021-01-26 John A. Arredondo , Camilo Ramírez Maluendas , Luz Edith Santos Guerrero

Magic squares are arrangements of natural numbers into square arrays, where the sum of each row, each column, and both diagonals is the same. In this paper, the concept of a magic square with 3 rows and 3 columns is generalized to define…

Combinatorics · Mathematics 2018-01-09 Victoria Jakicic , Rachelle Bouchat

For a knot K the cube number is a knot invariant defined to be the smallest n for which there is a cube diagram of size n for K. We will show that the cube number detects chirality in all cases computed thus far, and distinguishes certain…

Geometric Topology · Mathematics 2010-06-25 Ben McCarty

We classify the configurations of lines and conics in smooth Kummer quartics, assuming that all $16$ Kummer divisors map to conics. We show that the number of conics on such a quartic is at most $800$.

Algebraic Geometry · Mathematics 2024-03-05 Alex Degtyarev

In this paper we study circles tangent to conics. We show there are generically $184$ complex circles tangent to three conics in the plane and we characterize the real discriminant of the corresponding polynomial system. We give an explicit…

Algebraic Geometry · Mathematics 2025-05-07 Paul Breiding , Julia Lindberg , Wern Juin Gabriel Ong , Linus Sommer

We give two graph-theoretic models and a mixed-integer program to calculate the maximum achievable score in the popular board game "Ticket to Ride." In Ticket to Ride, players compete to claim railway routes on a map, with points awarded…

Optimization and Control · Mathematics 2025-11-12 Elizabeth J. Schaefer , Andrew J. Schaefer

If $T$ is an $n$-vertex tournament with a given number of $3$-cycles, what can be said about the number of its $4$-cycles? The most interesting range of this problem is where $T$ is assumed to have $c\cdot n^3$ cyclic triples for some $c>0$…

Combinatorics · Mathematics 2015-08-24 Nati Linial , Avraham Morgenstern

Let $p$ and $q$ be positive integers. The $(p, q)$-leaper $L$ is a generalised knight which leaps $p$ units away along one coordinate axis and $q$ units away along the other. Consider a free $L$, meaning that $p + q$ is odd and $p$ and $q$…

Combinatorics · Mathematics 2022-05-24 Nikolai Beluhov

In this paper we show that the maximum number of rational points possible for a smooth, projective, absolutely irreducible genus 4 curve over a finite field F_7 is 24. It is known that a genus 4 curve over F_7 can have at most 25 points. In…

Number Theory · Mathematics 2010-05-26 Alessandra Rigato

This article presents a new development of magic squares with a simple set up.

General Mathematics · Mathematics 2012-03-06 Victor M. Reyes

Integer cuboids are rectangular Diophantine parallelepipeds It has been discovered that these cuboids come in 3 varieties: Euler or body type, edge type, and face type. In all three cases, one edge or diagonal is irrational, all six others…

Number Theory · Mathematics 2020-07-16 Randall L. Rathbun

This paper deals with surfaces with many lines. It is well-known that a cubic contains 27 of them and that the maximal number for a quartic is 64. In higher degree the question remains open. Here we study classical and new constructions of…

Algebraic Geometry · Mathematics 2007-05-23 Samuel Boissiere , Alessandra Sarti

In this paper we give the first method for constructing n-multimagic squares (and hypercubes) for any n. We give an explicit formula in the case of squares and an effective existence proof in the higher dimensional case. Finally we prove…

Combinatorics · Mathematics 2007-05-23 Harm Derksen , Christian Eggermont , Arno van den Essen