Related papers: On Euler's magic matrices of sizes $3$ and $8$
We present a formal version of the numbers of vertices, edges, and faces for infinite planar regular triangular meshes of degree r>6. These numbers are defined via Euler summation of sequences obtained from iterated expansions of a convex…
An $n\times n$ complex matrix $A$ is called coninvolutory if $\bar AA=I_n$ and skew-coninvolutory if $\bar AA=-I_n$ (which implies that $n$ is even). We prove that each matrix of size $n\times n$ with $n>1$ is a sum of 5 coninvolutory…
Already in 1734 Euler found a short explicit formula for the value of Riemann zeta function Zeta(s) when the argument s equals a positive integer 2n where n=1,2,3,. No such formula exists for odd positive integer arguments of Zeta. The…
We introduce a natural definition for sums of the form \[ \sum_{\nu=1}^x f(\nu) \] when the number of terms x is a rather arbitrary real or even complex number. The resulting theory includes the known interpolation of the factorial by the…
In this paper, vacuum and singularity formation are considered for compressible Euler equations with time-dependent damping. For $1<\gamma\leq 3$, by constructing some new control functions ingeniously, we obtain the lower bounds estimates…
(Below, \Box means "perfect square") Let $P$ and $Q$ be non-zero integers. The Lucas sequence $\{U_n(P,Q)\}$ is defined by $U_0=0$, $U_1=1$, $U_n=P U_{n-1}-Q U_{n-2}$, $(n \geq 2)$. Historically, there has been much interest in when the…
This article studies a generalization of magic squares to $k$-uniform hypergraphs. In traditional magic squares the entries come from the natural numbers. A magic labeling of the vertices in a graph or hypergraph has since been generalized…
We construct real and complex matrices in terms of Kronecker products of a Witt basis of 2n null vectors in the geometric algebra over the real and complex numbers. In this basis, every matrix is represented by a unique sum of products of…
Cartan's magic formula L_X = i_X d + d i_X = (d+i_X)^2=D_X^2 relates the exterior derivative d, an interior derivative i_X and its Lie derivative L_X. We use this formula to define a finite dimensional vector space of vector fields X on a…
A tight Heffter array H(m,n) is an m x n matrix with nonzero entries from Z_{2mn+1} such that i) the sum of the elements in each row and each column is 0, and ii) no element from {x,-x\ appears twice. We prove that H(m,n) exist if and only…
We give an approximate formula for the distribution of the largest eigenvalue of real Wishart matrices by the expected Euler characteristic method for the general dimension. The formula is expressed in terms of a definite integral with…
This is an English translation of the Latin original "De summa seriei ex numeris primis formatae ${1/3}-{1/5}+{1/7}+{1/11}-{1/13}-{1/17}+{1/19}+{1/23}-{1/29}+{1/31}-$ etc. ubi numeri primi formae $4n-1$ habent signum positivum formae autem…
An even unimodular 72-dimensional lattice $\Gamma $ having minimum 8 is constructed as a tensor product of the Barnes lattice and the Leech lattice over the ring of integers in the imaginary quadratic number field with discriminant $-7$.…
Gerstenhaber's theorem states that the dimension of the unital algebra generated by two commuting $n\times n$ matrices is at most $n$. We study the analog of this question for positive matrices with a positive commutator. We show that the…
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm to exactly sample a random ET of the given generalized…
Given a matrix $M = (a_{i,j})$ a square is a $2 \times 2$ submatrix with entries $a_{i,j}$, $a_{i, j+s}$, $a_{i+s, j}$, $a_{i+s, j +s}$ for some $s \geq 1$, and a zero-sum square is a square where the entries sum to $0$. Recently,…
The Schur product of two complex m x n matrices is their entry wise product. We show that an extremal element X in the convex set of m x n complex matrices of Schur multiplier norm at most 1 satisfies the inequality rank(X) =< (m +n)^(1/2)…
Euler wants to find rational numbers (integers) x and y such that x+y is a square and x^2+y^2 is a fourth power. He parametrizes these with two other variables that satisfy certain equations.
Inspired by the bad scientist who keeps repeating an experiment 20 times to get a single outcome with $p < 0.05$, we consider matrices $A \in \mathbb{R}^{n \times n}$ whose rows are normalized in $\ell^2$ and for which $2^{-n}\sum_{x \in…
Euler states without proof statements about the form of prime divisors of numbers of the form aa+Nbb. See Ed Sandifer's How Euler Did It, ``Factors of Forms'', December 2005 at http://www.maa.org/news/howeulerdidit.html for a summary of the…