Related papers: Unicity Concepts for Sudoku
We consider turn-based game arenas for which we investigate uniformity properties of strategies. These properties involve bundles of plays, that arise from some semantical motive. Typically, we can represent constraints on allowed…
Permutation matrices play an important role in understand the structure of magic squares. In this work, we use a class of symmetric permutation matrices than can be used to categorize magic squares. Many magic squares with a high degree of…
We explore systems of polynomial equations where we seek complex solutions with absolute value 1. Geometrically, this amounts to understanding intersections of algebraic varieties with tori -- Cartesian powers of the unit circle. We study…
A cryptarithm (or alphametic) is a mathematical puzzle in which numbers are represented with words in such a way that identical letters stand for equal digits and distinct letters for unequal digits. An alphametic puzzle is usually given in…
In the framework of certain general probability theories of single systems, we identify various nonclassical features such as incompatibility, multiple pure-state decomposability, measurement disturbance, no-cloning and the impossibility of…
The game of SET is one of the best mathematical games ever. It is no wonder that people have tried to generalize it. We discuss existing generalizations of the game of SET to different groups. We concentrate on two types of generalization:…
The aim of this article is to promote the use of probabilistic methods in the study of problems in mathematical general relativity. Two new and simple singularity theorems, whose features are different from the classical singularity…
It is unknown at present whether a magic square of squared integers exists. Such an object is defined to be a 3 by 3 grid of 9 distinct integer squares, such that the entries of each row, column, and two main diagonals sum to the same…
The notion of a k-automatic set of integers is well-studied. We develop a new notion - the k-automatic set of rational numbers - and prove basic properties of these sets, including closure properties and decidability.
A binary matrix satisfies the consecutive ones property (COP) if its columns can be permuted such that the ones in each row of the resulting matrix are consecutive. Equivalently, a family of sets F = {Q_1,..,Q_m}, where Q_i is subset of R…
We study geometric properties of linear strata of uni-singular curves. The singularities of closures of the strata are resolved and the resolutions are represent as projective bundles. This enables to study their geometry. In particular we…
The concepts of symmetry and its breakdown are investigated in two different terms according to whether the resulting asymmetry is universal or only obtained for a special configuration: we shall illustrate this by considering in the first…
Based on Lyndon words, a new Sudoku-like puzzle is presented and some relative theoretical questions are proposed.
In this paper, we define an ordering relation for a set of complex numbers, and research the properties and theorems of the ordering, solve some simple complex inequalities with the ordering.
The complexity of a system, in general, makes it difficult to determine some or almost all matrix elements of its operators. The lack of accuracy acts as a source of randomness for the matrix elements which are also subjected to an external…
Matching logic is a logical framework for specifying and reasoning about programs using pattern matching semantics. A pattern is made up of a number of structural components and constraints. Structural components are syntactically matched,…
We study the complexity of symmetric assembly puzzles: given a collection of simple polygons, can we translate, rotate, and possibly flip them so that their interior-disjoint union is line symmetric? On the negative side, we show that the…
Riddles are concise linguistic puzzles that describe an object or idea through indirect, figurative, or playful clues. They are a longstanding form of creative expression, requiring the solver to interpret hints, recognize patterns, and…
We introduce the concept of monodromy coordinates for representing solutions to large polynomial systems. Representing solutions this way provides a time-memory trade-off in a monodromy solving algorithm. We describe an algorithm, which…
In this paper we analyze the geometric structure and properties of a certain class of subsets of $\Bbb R^d$, known in the literature as 1-multicones, and here simply called multicones, which are quite natural generalizations of the…