相关论文: On magic squares

We introduce a graph attached to mutually orthogonal Sudoku Latin squares. The spectra of the graphs obtained from finite fields are explicitly determined. As a corollary, we then use the eigenvalues to distinguish non-isomorphic Sudoku…

This is a translation from Latin of E840 'De motu cometarum in orbitis parabolicis, solem in foco habentibus', in which Euler addresses six problems related to comets in heliocentric parabolic orbits. Problem 1: Find the true anomaly of a…

Two Latin squares of order $n$ are $r$-orthogonal if, when superimposed, there are exactly $r$ distinct ordered pairs. The spectrum of all values of $r$ for Latin squares of order $n$ is known. A Latin square $A$ of order $n$ is…

We describe and analyze a new construction that produces new Eulerian lattices from old ones. It specializes to a construction that produces new strongly regular cellular spheres (whose face lattices are Eulerian). The construction does not…

Formulating a Schubert problem as the solutions to a system of equations in either Pl\"ucker space or in the local coordinates of a Schubert cell usually involves more equations than variables. Using reduction to the diagonal, we previously…

We consider the mathematical theory of geographical maps, with an emphasis on the eighteenth century works of Euler, Lagrange and Delisle. This period is characterized by the frequent use of maps that are no more obtained by the…

The magic texture is one of the successful textures of the flavor neutrino mass matrix for the Majorana type neutrinos. The name "magic" is inspired by the nature of the magic square. We estimate the compatibility of the magic square with…

A magic SET square is a 3 by 3 table of SET cards such that each row, column, diagonal, and anti-diagonal is a set. We allow the following transformations of the square: shuffling features, shuffling values within the features, rotations…

We give a variety of magic hexagons of Orders from 3 to 7, many of which are extensions of known results. We also give a theorem that their are an infinite number of magic hexagons of Order $n$ for any fixed positive integer $n$ for any…

Recently, Araci-Acikgoz-Sen derived some interesting identities on weighted q-Euler polynomials and higher-order q-Euler polynomials from the applications of umbral calculus (See [1]). In this paper, we develop the new method of q-umbral…

The aim of this article is to define some new families of the special numbers. These numbers provide some further motivation for computation of combinatorial sums involving binomial coefficients and the Euler kind numbers of negative order.…

Euler starts with a hypergeometric series F(a, b, c, x), and differentiates it to get a functional relation. This relation is today known as Euler's identity. Then he integrates to get another and ends up with something like Legendre…

A \emph{Latin square} is a matrix of symbols such that each symbol occurs exactly once in each row and column. A Latin square $L$ is \emph{row-Hamiltonian} if the permutation induced by each pair of distinct rows of $L$ is a full cycle…

Two $n \times n$ Latin squares $L_1, L_2$ are said to be orthogonal if, for every ordered pair $(x,y)$ of symbols, there are coordinates $(i,j)$ such that $L_1(i,j) = x$ and $L_2(i,j) = y$. A $k$-MOLS is a sequence of $k$…

Unitary error bases have a great number of applications across quantum information and quantum computation, and are fundamentally linked to quantum teleportation, dense coding and quantum error correction. Werner's combinatorial…

An intercalate in a Latin square is a $2\times2$ Latin subsquare. Let $N$ be the number of intercalates in a uniformly random $n\times n$ Latin square. We prove that asymptotically almost surely…

We show that the discrete complex, and numerous hypercomplex, Fourier transforms defined and used so far by a number of researchers can be unified into a single framework based on a matrix exponential version of Euler's formula…

To determine Euler numbers modulo powers of two seems to be a difficult task. In this paper we achieve this and apply the explicit congruence to give a new proof of a classical result due to M. A. Stern.

Back in 1755, Euler explored an interesting array of numbers that now frequently appears in polynomial identities, combinatorial problems, and finite calculus, among other places. These numbers share a strong connection with well-known…

A notion of exotic (ordered) configuration spaces of points on a space $X$ was suggested by Yu.~Baryshnikov. He gave equations for the (exponential) generating series of the Euler characteristics of these spaces. Here we consider un-ordered…