Related papers: Pandiagonal and Knut Vik Sudoku Squares

A construction of the magic square, and hence of exceptional Lie algebras, is carried out using trialities rather than division algebras. By way of preparation, a comprehensive discussion of trialities is given, incorporating a number of…

It is shown that there exists a dihedral acute triangulation of the three-dimensional cube. The method of constructing the acute triangulation is described, and symmetries of the triangulation are discussed.

We construct and classify all possible Magic Squares (MS's) related to Euclidean or Lorentzian rank-3 simple Jordan algebras, both on normed division algebras and split composition algebras. Besides the known Freudenthal-Rozenfeld-Tits MS,…

We show that the vector of period ratios of a cubic surface is rational over $Q(\omega)$, where $\omega = \exp(2\pi i/3)$ if and only if the associate abelian variety is isogeneous to a product of Fermat elliptic curves. We also show how to…

Using a quartic surface and its rational curves we can give an infinite number of integer hexahedra; these are 6 sided 3d solids, each face a trapezoid, with all sides and diagonals having intger lengths.

Benjamin Franklin constructed three squares which have amazing properties, and his method of construction has been a mystery to date. In this article, we divulge his secret and show how to construct such squares for any order.

Spectral triples (of compact type) are constructed on arbitrary separable quasidiagonal C*-algebras. On the other hand an example of a spectral triple on a non-quasidiagonal algebra is presented.

This paper deals with a generalized Sudoku problem and investigates the unicity of a given solution. We introduce constraint sets, which is a generalization of the rows, columns and blocks of a classical Sudoku puzzle. The unicity property…

We use a triple-point version of the Whitney trick to show that ornaments of three orientable $(2k-1)$-manifolds in $\mathbb R^{3k-1}$, $k>2$, are classified by the $\mu$-invariant. A very similar (but not identical) construction was found…

Let $K$ denote an algebraically closed field with characteristic 0 and let $V$ denote a vector space over $K$ with finite positive dimension. Let $A,A^*$ denote a tridiagonal pair on $V$ with diameter $d$. We say that $A,A^*$ has Krawtchouk…

A method is developed here for building differentiable three-dimensional manifolds on multicube structures. This method constructs a sequence of reference metrics that determine differentiable structures on the cubic regions that serve as…

We construct explicitly an infinite family of Ramanujan graphs which are bipartite and biregular. Our construction starts with the Bruhat-Tits building of an inner form of $SU_3(\mathbb Q_p)$. To make the graphs finite, we take successive…

Which surfaces can be realized with two-dimensional faces of the five-dimensional cube (the penteract)? How can we visualize them? In recent work, Aveni, Govc, and Roldan, show that there exist 2690 connected closed cubical surfaces up to…

A finite transitive permutation group is elusive if it contains no derangements of prime order. These groups are closely related to a longstanding open problem in algebraic graph theory known as the Polycirculant Conjecture, which asserts…

The split version of the Freudenthal-Tits magic square stems from Lie theory and constructs a Lie algebra starting from two split composition algebras [3, 17, 18]. The geometries appearing in the second row are Severi-Brauer varieties [20].…

We compute the genus of a rational quadratic form in terms of the K-theory of a C*-algebra attached to the adelic orthogonal group of the form. As a corollary, one gets a higher composition law for the rational quadratic forms. As an…

Let $S_{g}$ denote the genus $g$ closed orientable surface. For $k\in \mathbb{N}$, a $k$-system is a collection of pairwise non-homotopic simple closed curves such that no two intersect more than $k$ times. Juvan-Malni\v{c}-Mohar…

In Part I of this series we described three algorithms that construct canonical tree-decompositions of graphs which distinguish all their k-blocks and tangles of order k. We now establish bounds on the number of parts in these…

For Tur\'an's (3, 4)-conjecture, in the case of n = 3k+1 vertices, (.5)6^{k-1} non-isomorphic complexes are constructed that attain the conjecture. In the case of n = 3k+2 vertices, 6^{k-1} non-isomorphic complexes are constructed that…

We establish a new lower bound for the number of sides required for the component curves of simple Venn diagrams made from polygons. Specifically, for any n-Venn diagram of convex k-gons, we prove that k >= (2^n - 2 - n) / (n (n-2)). In the…