Related papers: The Chung-Graham Expansion
We investigate here the representability of integers as sums of triangular numbers, where the $n$-th triangular number is given by $T_n = n(n + 1)/2$. In particular, we show that $f(x_1,x_2,..., x_k) = b_1 T_{x_1} +...+ b_k T_{x_k}$, for…
For a congruence subgroup $\Gamma$, we define the notion of $\Gamma$-equivalence on binary quadratic forms which is the same as proper equivalence if $\Gamma = \mathrm{SL}_2(\mathbb Z)$. We develop a theory on $\Gamma$-equivalence such as…
We introduce Trans-gram, a simple and computationally-efficient method to simultaneously learn and align wordembeddings for a variety of languages, using only monolingual data and a smaller set of sentence-aligned data. We use our new…
We show that, if an integer sequence is given by a linear recurrence of constant rational coefficients, then it can be represented as the difference of two arithmetic terms with exponentiation, which do not contain any irrational constant.…
We prove a {\Gamma}-equivariant version of the algebraic index theorem, where {\Gamma} is a discrete group of automorphisms of a formal deformation of a symplectic manifold. The particular cases of this result are the algebraic version of…
A beautiful theorem of Zeckendorf states that every integer can be written uniquely as a sum of non-consecutive Fibonacci numbers $\{F_n\}_{n=1}^{\infty}$; Lekkerkerker proved that the average number of summands for integers in $[F_n,…
Freiman and Scourfield proved that any large enough integer can be written as a sum of a certain number of ascending even powers. We use the circle method to provide the first explicit bound on this number, and show that any large enough…
A universal cycle for permutations is a word of length n! such that each of the n! possible relative orders of n distinct integers occurs as a cyclic interval of the word. We show how to construct such a universal cycle in which only n+1…
We study growth rates of generalised Fibonacci sequences of a particular structure. These sequences are constructed from choosing two real numbers for the first two terms and always having the next term be either the sum or the difference…
In this paper, we consider representations of integers as sums of at most four distinct $m$-gonal numbers (allowing a fixed number of repeats of each polygonal number occurring in the sum). We show that the number of such representations…
The Fibonacci number is the residue of a rational function, from which follows that Fibonacci number summation identities can be derived with the integral representation method, a method also used to derive combinatorial identities. A…
A targeted exponentiation algorithm computes a group exponentiation operation $a^k$ with a reversible circuit in such a way that the initial state of the circuit consists of only the base $a$ and fixed values, and the final state consists…
We derive closed form expressions for finite and infinite Fibonacci-Lucas sums having products of Fibonacci or Lucas numbers in the denominator of the summand. Our results generalize and extend those obtained by pioneer Brother Alfred…
This paper introduces a variation on an identity by Bruckman and Good. Using this identity, we are able to derive various well-known sums involving reciprocals of Fibonacci and Lucas numbers, including the case when the indices form an…
A numerical index is introduced for semigroups of completely positive maps of $\Cal B(H)$ which generalizes the index of E_0-semigroups. It is shown that the index of a unital completely positive semigroup agrees with the index of its…
Wu, Lou, Lai and Chang proposed a multi-exponentiation algorithm using binary complements and the non-adjacent form. The purpose of this paper is to show that neither the analysis of the algorithm given by its original proposers nor that by…
This paper presents new identities expressing the terms of Fibonacci, Lucas, and generalized Fibonacci sequences with multiple indices through powers of Lucas numbers and binomial coefficients. The obtained formulas rely on the application…
For every positive integer k, it is shown that there exists a positive definite diagonal quaternary integral quadratic form that represents all positive integers except for precisely those which lie in k arithmetic progressions. For k=1,…
Kim, Kim, and Oh gave a minimal criterion for the 2-universality of positive-definite integer-matrix quadratic forms. We show that this 2-universality criterion is unique in the sense of the uniqueness of the Conway-Schneeberger Fifteen…
A positive definite even Hermitian lattice is called \emph{even universal} if it represents all even positive integers. We introduce a method to get all even universal binary Hermitian lattices over imaginary quadratic fields $\Q{-m}$ for…