Related papers: The Structure of a Bernoulli Process Variation of …
We discuss a general method to construct correlated binomial distributions by imposing several consistent relations on the joint probability function. We obtain self-consistency relations for the conditional correlations and conditional…
Based on the structure of Fibonacci sequence, we give a new proof for the irrationality exponents of the Fibonacci real numbers. Moreover, we obtain all the irrationality exponents of the real numbers corresponding to the differences of…
Our central observation is that unbounded additive recurrence establishes a homomorphism between $\mathbb{N}$ and Modus Ponens in a constructive sense. By finding sums of nonconsecutive Fibonacci indices, each inference step corresponds to…
In this paper we consider the sequence whose n^{th} term is the number of h-vectors of length n. We show that the n^{th} term of this sequence is bounded above by the n^{th} Fibonacci number and bounded below by the number if integer…
Morphic sequences form a natural class of infinite sequences, typically defined as the coding of a fixed point of a morphism. Different morphisms and codings may yield the same morphic sequence. This paper investigates how to prove that two…
Labeled infinite trees provide combinatorial interpretations for many integer sequences generated by nested recurrence relations. Typically, such sequences are monotone increasing. Several of these sequences also have straightforward…
The tree based representation described in this paper, hereditarily binary numbers, applies recursively a run-length compression mechanism that enables computations limited by the structural complexity of their operands rather than by their…
We consider a sequence of sums of powers of the the roots of the cubic equation characterizing the Tribonacci sequences and derive its relationship with a particular Tribonacci sequence. Then we make a conjecture on the possible…
We discuss a notion of convergence for binary trees that is based on subtree sizes. In analogy to recent developments in the theory of graphs, posets and permutations we investigate some general aspects of the topology, such as a…
The Fibonacci numbers are familiar to all of us. They appear unexpectedly often in mathematics, so much there is an entire journal and a sequence of conferences dedicated to their study. However, there is also another sequence of numbers…
The in-order traversal provides a natural correspondence between binary trees with a decreasing vertex labeling and endofunctions on a finite set. By suitably restricting the vertex labeling we arrive at a class of trees that we call…
Stern's diatomic sequence is a well-studied and simply defined sequence with many fascinating characteristics. The binary signed-digit representation of integers is an alternative representation of integers with much use in efficient…
We establish some identities relating two sequences that are, as explained, related to the Tribonacci sequence. One of these sequences bears the same resemblance to the Tribonacci sequence as the Lucas sequence does to the Fibonacci…
In this paper, we define a variant of Fibonacci-like sequences that we call prime Fibonacci sequences, where one takes the sum of the previous two terms and returns the smallest odd prime divisor of that sum as the next term. We prove that…
One possible data encryption scheme is related to stream ciphers, which use a sufficiently long pseudo-random sequence. To increase the cryptographic strength of the cipher, linear shift algorithms (generated by linear recurrent sequences…
This paper considers the properties of Tribonacci numbers on identities, matrices, and determinants. In the first front part, we obtain several symmetric identities of Tribonacci numbers by a matrix-based approach and binomial inversion…
This paper introduces a new combinatorial framework for modeling the growth of binary trees through a discrete evolution process that incorporates a growing rule and an extinction rule. Building upon the theory of increasingly labeled…
We analyze the connection between the autocorrelation of a binary sequence and its run structure given by the run length encoding. We show that both the periodic and the aperiodic autocorrelation of a binary sequence can be formulated in…
We consider hierarchical structures such as Fibonacci sequences and Penrose tilings, and examine the consequences of different choices for the definition of isomorphism. In particular we discuss the role such a choice plays with regard to…
We define the beta diffusion tree, a random tree structure with a set of leaves that defines a collection of overlapping subsets of objects, known as a feature allocation. A generative process for the tree structure is defined in terms of…