Related papers: Asymptotic enumeration of magic series

We define a multiplication on the surreal numbers as higher inductive-inductive types.

Let $\mathcal{R}$ denote the set of integers $n$ that can be represented as the sum $n = x^2 + y^2$ with $(x,y) = 1$. Let $a$ and $b$ be integers with $a>0$, $a \nmid b$. We show that for sufficiently large positive integer $N$ there are…

Infinite dimensional representations of the real form U_q(u_{n,1}) of the Drinfeld--Jimbo algebra U_q(gl_{n+1}) are defined. The principal series of representations of U_q(u_{n,1}) is studied. Intertwining operators for pairs of the…

This paper focuses on the equivalent expression of fractional integrals/derivatives with an infinite series. A universal framework for fractional Taylor series is developed by expanding an analytic function at the initial instant or the…

Let $G=(V,E)$ be a graph of order $n$. A distance magic labeling of $G$ is a bijection $\ell \colon V\rightarrow {1,...,n}$ for which there exists a positive integer $k$ such that $\sum_{x\in N(v)}\ell (x)=k$ for all $v\in V $, where $N(v)$…

Magic is a property of quantum states that enables universal fault-tolerant quantum computing using simple sets of gate operations. Understanding the mechanisms by which magic is created or destroyed is, therefore, a crucial step towards…

A simple integration by parts and telescopic cancellation leads to a rigorous derivation of the first 2 terms for the error in Ramanujan's asymptotic series for the nth partial sum of the harmonic series. Then Kummer's transformation gives…

We present an exact method for counting semi-magic squares of order 6. Some theoretical investigations about the number of them and a probabilistic method are presented. Our calculations show that there are exactly…

Let $m\neq n$. An $m\times n\times p$ {\it proper array} is a three-dimensional rectangular array composed of directed cubes that obeys certain constraints. Because of these constraints, the $m\times n\times p$ proper arrays may be…

Two square matrices of (arbitrary) order N are introduced. They are defined in terms of N arbitrary numbers z_{n}, and of an arbitrary additional parameter (a respectively q), and provide finite-dimensional representations of the two…

Natural numbers from 0 to 11111 are written in terms of 1 to 9 in two different ways. The first one in increasing order of 1 to 9, and the second one in decreasing order. This is done by using the operations of addition, multiplication,…

We consider the problem of distinguishing convex subsets of $n$-cyclotomic model sets $\varLambda$ by (discrete parallel) X-rays in prescribed $\varLambda$-directions. In this context, a `magic number' $m_{\varLambda}$ has the property that…

We use the spectral theory of Hilbert-Maass forms for real quadratic fields to obtain the asymptotics of some sums involving the number of representations as a sum of two squares in the ring of integers.

For non-negative integers $a,b,$ and $n$, let $N(a, b; n)$ be the number of representations of $n$ as a sum of squares with coefficients $1$ or $3$ ($a$ of ones and $b$ of threes). Let $N^*(a,b; n)$ be the number of representations of $n$…

By defining the dimension of natural numbers as the number of prime factors, all natural numbers smaller than 2^(n+1) (n is a natural number) can be classified by their dimensions, and the count of numbers of each dimension gives a…

We propose new algorithms for the computation of the first N terms of a vector (resp. a basis) of power series solutions of a linear system of differential equations at an ordinary point, using a number of arithmetic operations which is…

An 'arithmetic circuit' is a labeled, acyclic directed graph specifying a sequence of arithmetic and logical operations to be performed on sets of natural numbers. Arithmetic circuits can also be viewed as the elements of the smallest…

A signed magic rectangle $SMR(m,n;r, s)$ is an $m \times n$ array with entries from $X$, where $X=\{0,\pm1,\pm2,\ldots, $ $\pm (ms-1)/2\}$ if $mr$ is odd and $X = \{\pm1,\pm2,\ldots,\pm mr/2\}$ if $mr$ is even, such that precisely $r$ cells…

We give a deterministic algorithm that very quickly proves the primality or compositeness of the integers N in a certain sequence, using an elliptic curve E/Q with complex multiplication by the ring of integers of Q(sqrt(-7)). The algorithm…

The Binary Two-Up Sequence is the lexicographically earliest sequence of distinct nonnegative integers with the property that the binary expansion of the n-th term has no 1-bits in common with any of the previous floor(n/2) terms. We show…