Related papers: Asymptotic enumeration of magic series
A Universal Cycle for t-multisets of [n]={1,...,n} is a cyclic sequence of $\binom{n+t-1}{t}$ integers from [n] with the property that each t-multiset of [n] appears exactly once consecutively in the sequence. For such a sequence to exist…
One of the most popular and studied recursive series is the Fibonacci sequence. It is challenging to see how Fibonacci numbers can be used to generate other recursive sequences. In our article, we describe some families of integer…
For a set of distances $D$, a graph $G$ of order $n$ is said to be $D-$magic if there exists a bijection $f:V\rightarrow \{1,2, \ldots, n\}$ and a constant $k$ such that for any vertex $x$, $\sum_{y\in N_D(x)} f(y) =k$, where…
In this paper, we first investigate the relationship between the number of primitive representations of $n$ by quadratic forms and the number of non-primitive ones. We hence obtain a theorem to deal with the Eisenstein series part with…
Let $q$ be a power of a prime $p$, $G$ be a finite abelian group, where $p$ does not divide $|G|$,and let $n$ be a positive integer. In this paper we find a formula for the number of irreducible representations of $G$ of a given dimension…
We establish that, for almost all natural numbers $N$, there is a sum of two positive integral cubes lying in the interval $[N-N^{7/18+\epsilon},N]$. Here, the exponent $7/18$ lies half way between the trivial exponent $4/9$ stemming from…
In this paper we study the rotation and spatial inversion symmetry of regular tetrahedron. We obtain the representation matrix, multiplication table,the order of all group elements, all possible combinations of generator elements, the…
A {\em signed magic rectangle} $SMR(m,n;k, s)$ is an $m \times n$ array with entries from $X$, where $X=\{0,\pm1,\pm2,\ldots, $ $\pm (mk-1)/2\}$ if $mk$ is odd and $X = \{\pm1,\pm2,\ldots,\pm mk/2\}$ if $mk$ is even, such that precisely $k$…
The method of brackets is an efficient method for the evaluation of a large class of definite integrals on the half-line. It is based on a small collection of rules, some of which are heuristic. The extension discussed here is based on the…
For a given odd integer $n>1$, we provide some families of imaginary quadratic number fields of the form $\mathbb{Q}(\sqrt{x^2-t^n})$ whose ideal class group has a subgroup isomorphic to $\mathbb{Z}/n\mathbb{Z}$.
We present a novel conjecture concerning the additive representation of natural numbers using prime powers. Based on extensive computational verification, we conjecture that every integer n > 23 can be expressed as a sum of at most five…
Due to instanton effects, gauge-theoretic large N expansions yield asymptotic series, in powers of 1/N^2. The present work shows how to generically make such expansions meaningful via their completion into resurgent transseries, encoding…
We consider the problem of enumerating integer tetrahedra of fixed perimeter (sum of side-lengths) and/or diameter (maximum side-length), up to congruence. As we will see, this problem is considerably more difficult than the corresponding…
An $integral$ of a group $G$ is a group $H$ whose derived group (commutator subgroup) is isomorphic to $G$. This paper discusses integrals of groups, and in particular questions about which groups have integrals and how big or small those…
Sequences diverge either because they head off to infinity or because they oscillate. Part 1 constructs a non-Archimedean framework of infinite numbers that is large enough to contain asymptotic limit points for non-oscillating sequences…
The Tribonacci sequence $\mathbb{T}$ is the fixed point of the substitution $\sigma(a)=ab$, $\sigma(b)=ac$, $\sigma(c)=a$. The prefix of $\mathbb{T}$ of length $n$ is denoted by $\mathbb{T}[1,n]$. The main result is threefold, we give: (1)…
We put forward a new method of constructing the complete ordered field of real numbers from the ordered field of rational numbers. Our method is a generalization of that of A. Knopfmacher and J. Knopfmacher. Our result implies that there…
Which integers can be written as a quotient of sums of distinct powers of three? We outline our first steps toward an answer to this question, beginning with a necessary and almost sufficient condition. Then we discuss an algorithm that…
We call a set of positive integers closed under taking unitary divisors a unitary ideal. It can be regarded as a simplicial complex. Moreover, a multiplicative arithmetical function on such a set corresponds to a function on the simplicial…
We enumerate total cyclic orders on $\left\{1,\ldots,n\right\}$ where we prescribe the relative cyclic order of consecutive triples $(i,{i+1},{i+2})$, these integers being taken modulo $n$. In some cases, the problem reduces to the…