Related papers: The mathematics of Septoku
We prove a root system uniform, concise combinatorial rule for Schubert calculus of_minuscule_ and_cominuscule_ flag manifolds G/P (the latter are also known as "compact Hermitian symmetric spaces"). We connect this geometry to the poset…
Define a building blocks set to be a collection of n cubes (each with six sides) where each side is assigned one letter and one color from a palette of m colors. We propose a novel problem of assigning letters and colors to each face so as…
We develop and deploy a set of constraints for the purpose of calculating minimal sizes of lottery designs. Specifically, we find the minimum number of tickets of size six which are needed to match at least two balls on any draw of size…
Tilings of a surface of negative Euler characteristic by n-gons with n\ge 7 is a finite problem. One extreme of the finite problem is single tile tilings. We develop the algorithm for finding all the single tile tilings and present the…
Although it is important both in theory as well as in applications, a theory of Birkhoff interpolation with main emphasis on the shape of the set of nodes is still missing. Although we will consider various shapes (e.g. we find all the…
In this short paper we present an algorithm for finding a solution to a generalized Sudoku.
The game of plates and olives was originally formulated by Nicolaescu and encodes the evolution of the topology of the sublevel sets of Morse functions. We consider a random variant of this game. The process starts with an empty table.…
We consider combining the definition of a cardinal invariant and the notion of an infinite game. We focus on the splitting number $\mathfrak{s}$ since the corresponding cardinal invariants behave in an interesting way. We introduce three…
A famous result of D. Walkup states that the only rectangles that may be tiled by the T-tetromino are those in which both sides are a multiple of four. In this paper we examine the rest of the rectangles, asking how many T-tetrominos may be…
The puzzle rules for computing Schubert calculus on $d$-step flag manifolds, proven in [Knutson Tao 2003] for $1$-step, in [Buch Kresch Purbhoo Tamvakis 2016] for $2$-step, and conjectured in [Coskun Vakil 2009] for $3$-step, lead to vector…
In 1978, Allan.Wm.Johnson obtained an example of the representation of 1 by the sum of reciprocals of the product of two distinct prime numbers. His example has 48 terms [1], and we had no examples which have less than 48 terms until now.…
A 5x5 board is the smallest board on which one can set up all kind of chess pieces as a start position. We consider Gardner's minichess variant in which all pieces are set as in a standard chessboard (from Rook to King). This game has…
Adomian decomposition method is used for solving the seventh order boundary value problems. The approximate solutions of the problems are calculated in the form of a rapid convergent series and not at grid points. Two numerical examples…
Hexagonal tortoise problem (HTP), also known as Jisuguimundo or Jisugwimundo, is a magic square variety which was invented by medieval Korean Mathematician and minister Suk-Jung Choi (1646-1715).[1] Choi showed pattern 30 vertices 3 by 3…
In Martin Gardner's October, 1976 Mathematical Games column in Scientific American, he posed the following problem: "What is the smallest number of [queens] you can put on a board of side n such that no [queen] can be added without creating…
We prove the 4-uniform Erd\H{o}s Matching Conjecture for every matching number $s\ge 6961$. The proof has two parts. First, building on ideas from Frankl--R\"odl--Ruci\'nski, we formulate a general finite-board criterion for the $r$-uniform…
We find by applying MacMahon's partition analysis that all magic labellings of the cube are of eight types, each generated by six basis elements. A combinatorial proof of this fact is given. The number of magic labellings of the cube is…
We study a family of sorting match puzzles on grids, which we call permutation match puzzles. In this puzzle, each row and column of a $n \times n$ grid is labeled with an ordering constraint -- ascending (A) or descending (D) -- and the…
In this work we are interested in the central configurations of the spatial seven-body problem where six of them are at vertices of two congruents equilateral triangles belong to parallel planes and one triangle is a rotation by the angle…
We estimate the minimum number of vertices of a cubic graph with given oddness and cyclic connectivity. We prove that a bridgeless cubic graph $G$ with oddness $\omega(G)$ other than the Petersen graph has at least $5.41\cdot\omega(G)$…