Related papers: Integers represented by binary recursive sequences
Consider an irreducible bilinear form $f(x_1,x_2;y_1,y_2)$ with integer coefficients. We derive an upper bound for the number of integer points $(\mathbf{x},\mathbf{y})\in\mathbb{P}^1\times\mathbb{P}^1$ inside a box satisfying the equation…
We consider the question of which nonconvex sets can be represented exactly as the feasible sets of mixed-integer convex optimization problems. We state the first complete characterization for the case when the number of possible integer…
The sequence starts with a(1) = 1; to extend it one writes the sequence so far as XY^k, where X and Y are strings of integers, Y is nonempty and k is as large as possible: then the next term is k. The sequence begins 1, 1, 2, 1, 1, 2, 2, 2,…
Sequential data such as time series, video, or text can be challenging to analyse as the ordered structure gives rise to complex dependencies. At the heart of this is non-commutativity, in the sense that reordering the elements of a…
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…
Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…
We describe various properties of continued fraction expansions of complex numbers in terms of Gaussian integers. Numerous distinct such expansions are possible for a complex number. They can be arrived at through various algorithms, as…
We describe the set of prime numbers splitting completely in the non-abelian splitting field of certain monic irreducible polynomials of degree three. As an application we establish some divisibility properties of the associated ternary…
We show that essentially the Fibonacci sequence is the unique binary recurrence which contains infinitely many three-term arithmetic progressions. A criterion for general linear recurrences having infinitely many three-term arithmetic…
For relatively prime positive integers $u_0$ and $r$ and for $0\le k\le n$, define $u_k:=u_0+kr$. Let $L_n:={\rm lcm}(u_0, u_1, ..., u_n)$ and let $a, l\ge 2$ be any integers. In this paper, we show that, for integers $\alpha \geq a$ and…
Infinite hyperplane arrangements whose vertices form a lattice are studied from the point of view of commutative algebra. The quotient of such an arrangement modulo the lattice action represents the minimal free resolution of the associated…
We report on work in progress on 'nested term graphs' for formalizing higher-order terms (e.g. finite or infinite lambda-terms), including those expressing recursion (e.g. terms in the lambda-calculus with letrec). The idea is to represent…
We show that the binary representation of the integers has a role to play in many aspects of Clifford algebras.
We describe new, simple, recursive methods of construction for orientable sequences over an arbitrary finite alphabet, i.e. periodic sequences in which any sub-sequence of n consecutive elements occurs at most once in a period in either…
We explore a physical model of ordered sums of integers as trains of rods. The trains for a fixed, possibly infinite, set of rod lengths naturally correspond to nodes in a tree; relations among finite linear recursions encoded in the…
In this paper we discuss near-perfect numbers of various forms. In particular, we study the existence of near-perfect numbers in the Fibonacci and Lucas sequences, near-perfect values taken by integer polynomials and repdigit near-perfect…
We provide a computational definition of the notions of vector space and bilinear functions. We use this result to introduce a minimal language combining higher-order computation and linear algebra. This language extends the Lambda-calculus…
Program equivalence is the fulcrum for reasoning about and proving properties of programs. For noninterference, for example, program equivalence up to the secrecy level of an observer is shown. A powerful enabler for such proofs are logical…
Let \pi be a unitary cuspidal automorphic representation for GL(n) over a number field. We establish upper bounds on the number of Hecke eigenvalues of \pi equal to a fixed complex number. For GL(2), we also determine upper bounds on the…
Analogously to de Bruijn sequences, Orientable sequences have application in automatic position-location applications and, until recently, studies of these sequences focused on the binary case. In recent work by Alhakim et al., recursive…