Related papers: The Classification of Magic SET Squares
Consider a randomly shuffled deck of $2n$ cards with $n$ red cards and $n$ black cards. We study the average number of moves it takes to go from a randomly shuffled deck to a deck that alternates in color by performing the following move:…
Tree convex sets refer to a collection of sets such that each set in the collection is a subtree of a tree whose nodes are the elements of these sets. They extend the concept of row convex sets each of which is an interval over a total…
This article studies a generalization of magic squares to finite projective planes. In traditional magic squares the entries come from the natural numbers. This does not work for finite projective planes, so we instead use Abelian groups.…
This article presents a new development of magic squares with a simple set up.
We show that the sets of periods of multidimensional shifts of finite type (SFTs) are exactly the sets of integers of the complexity class $\NE$. We also show that the functions counting their number are the functions of #E. We also give…
Mathematics has been used in the exploration and enumeration of juggling patterns. In the case when we catch and throw one ball at a time the number of possible juggling patterns is well-known. When we are allowed to catch and throw any…
The squircle is an intermediate shape between the square and the circle. In this paper, we examine and discuss equations for different types of squircles. We then build upon these 2D shapes to come-up with various 3D surfaces based on…
We introduce SudoQ, a quantum version of the classical game Sudoku. Allowing the entries of the grid to be (non-commutative) projections instead of integers, the solution set of SudoQ puzzles can be much larger than in the classical…
The card-cyclic-to-random shuffle is the card shuffle where the $n$ cards are labeled $1,\ldots,n$ according to their starting positions. Then the cards are mixed by first picking card $1$ from the deck and reinserting it at a uniformly…
Automatic chess problem or puzzle composition typically involves generating and testing various different positions, sometimes using particular piece sets. Once a position has been generated, it is then usually tested for positional…
The ``overlapping-cycles shuffle'' mixes a deck of $n$ cards by moving either the $n$th card or the $(n-k)$th card to the top of the deck, with probability half each. We determine the spectral gap for the location of a single card, which,…
We propose the representation principle to study physical systems with a given symmetry. In the context of symmetry enriched topological orders, we give the appropriate representation category, the category of SET orders, which include SPT…
We associate an square to any two dimensional evolution algebra. This geometric object is uniquely determined, does not depend on the basis and describes the structure and the behaviour of the algebra. We determine the identities of degrees…
It is known that every complex square matrix with nonnegative determinant is the product of positive semi-definite matrices. There are characterizations of matrices that require two or five positive semi-definite matrices in the product.…
In this paper we study random orderings of the integers with a certain invariance property. We describe all such orders in a simple way. We define and represent random shuffles of a countable set of labels and then give an interpretation of…
Orthostochastic matrices are the entrywise squares of orthogonal matrices, and naturally arise in various contexts, including notably definite symmetric determinantal representations of real polynomials. However, defining equations for the…
The Rubik's cube is a famous puzzle in which faces can be moved and the corresponding movement operations define a group. We consider here a generalization to any $3$-valent map. We prove an upper bound on the size of the corresponding…
A spatial surface is a compact surface embedded in the 3-sphere. In this paper, we provide several typical examples of spatial surfaces and construct a coloring invariant to distinguish them. The coloring is defined by using a multiple…
For the family of complex rational functions known as "Generalized McMullen maps", F(z) = z^n + a/z^n+b, for complex parameters a and b, with a nonzero, and any integer n at least 3 fixed, we reveal, and provide a combinatorial model for,…
Recently, the classical Freudenthal Magic Square has been extended over fields of characteristic 3 with two more rows and columns filled with (mostly simple) Lie superalgebras specific of this characteristic. This Supermagic Square will be…