Related papers: Currie's Mysterious Pattern and Iterated Functions

We present a natural, combinatorial problem whose solution is given by the meta-Fibonacci recurrence relation $a(n) = \sum_{i=1}^p a(n-i+1 - a(n-i))$, where $p$ is prime. This combinatorial problem is less general than those given in [3]…

We describe a combinatorial approach for investigating properties of rational numbers. The overall approach rests on structural bijections between rational numbers and familiar combinatorial objects, namely rooted trees. We emphasize that…

For a fixed integer N, and fixed numbers b_1,...,b_N, we consider sequences, the nth term (a_n) of which is the sum of the squares of the terms in the expansion of (b_1 + ... + b_N)^n. In the case all b_i=1, we give a formula for a…

Let $(U_n)_{n\geq 0}$ be a fixed linear recurrence sequence of integers with order at least two, and for any positive integer $\ell$, let $\ell \cdot 2^{\ell} + 1$ be a Cullen number. Recently in \cite{bmt}, generalized Cullen numbers in…

We study arithmetical and combinatorial properties of $\beta$-integers for $\beta$ being the root of the equation $x^2=mx-n, m,n \in \mathbb N, m \geq n+2\geq 3$. We determine with the accuracy of $\pm 1$ the maximal number of…

An occurrence of a classical pattern p in a permutation \pi is a subsequence of \pi whose letters are in the same relative order (of size) as those in p. In an occurrence of a generalized pattern, some letters of that subsequence may be…

We study the $k$-Bonacci word over the infinite alphabet $\mathbb{N}$. Since the alphabet is infinite, the usual factor complexity is infinite and does not provide any information. We therefore investigate factor occurrence statistics in…

Non-linear recurrences which generate integers in a surprising way have been studied by many people. Typically people study recurrences that are linear in the highest order term. In this paper I consider what happens when the recurrence is…

The origin of deterministic diffusion is a matter of discussion. We study the asymptotic distributions of the sums $y_n(x)=\sum_{k=0}^{n-1}\psi (x+k\alpha)$, where $\psi$ is a periodic function of bounded variation and $\alpha$ an…

In recent work, we considered the frequencies of patterns of consecutive primes $\pmod{q}$ and numerically found biases toward certain patterns and against others. We made a conjecture explaining these biases, the dominant factor in which…

In this paper, we establish the irrationality of some open problems in mathematics based on using a recursive formula that generate the complete sequence of numbers. see [1] But before getting into that we begin with some Ramanujan notable…

We discuss the frequent pattern mining problem in a general setting. From an analysis of abstract representations, summarization and frequent pattern mining, we arrive at a generalization of the problem. Then, we show how the problem can be…

A positive integer $n$ is called a $\theta$-congruent number if there is a triangle with sides $a,b$ and $c$ for which the angle between $a$ and $b$ is equal to $\theta$ and its area is $n\sqrt{r^2 - s^2}$, where $0 < \theta < \pi$, $\cos…

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…

Through this paper, we study the rings in which every unit's square is an element of the set $1+\sqrt{J(R)}$, and call them $2-\sqrt{J}U$ rings. Here, $\sqrt{J(R)}=\{x \in R: x^m \in J(R)$ for some $m \geq 1 \}$. We show that every…

The word inference problem is to determine languages such that the information on the number of occurrences of those subwords in the language can uniquely identify a word. A considerable amount of work has been done on this problem, but the…

This paper concerns extension of the classical Lagrange theorem, on the eventual periodicity of continued fraction expansions of quadratic surds, and the versions of it found in the literature in the case of complex numbers. In this…

For an infinite word $\mathbf{x}$, Bugeaud and Kim introduced a new complexity function $\text{rep}(\mathbf{x})$ which is called the exponent of repetition of $\mathbf{x}$. They showed $1\le \text{rep}(\mathbf{x}) \le \sqrt{10}-\frac{3}{2}$…

We show that an intuitionistic version of counting propositional logic corresponds, in the sense of Curry and Howard, to an expressive type system for the probabilistic event lambda-calculus, a vehicle calculus in which both call-by-name…

We investigate Bertrand's probabilistic paradox through the lens of discrete geometry and old-fashioned but reliable discrete probability. We approximate the plane unit circle with $1/n$ times $1/n$ boxes and count the pairs of boxes…