Related papers: Different classes of binary necklaces and a combin…
We give three different computations of the total number of runs of length $i$ in binary $n$-strings, and we discuss the connection of this problem with the compositions of $n$.
Working with generating functions, the combinatorics of a recurrence relation can be expressed in a way that allows for more efficient calculation of the quantity. This is true of the Catalan numbers for an ordered binary tree…
We consider the irreducible representations each of dimension 2 of the necklace braid group $\mathcal{NB}_n$ ($n=2,3,4$). We then consider the tensor product of the representations of $\mathcal{NB}_n$ ($n=2,3,4$) and determine necessary and…
A two-dimensional string is simply a two-dimensional array. We continue the study of the combinatorial properties of repetitions in such strings over the binary alphabet, namely the number of distinct tandems, distinct quartics, and runs.…
In this article we combinatorially describe the triangles that are present in two types of line arrangements, those which have global cyclicity and those which are infinity type line arrangements. A combinatorial nomenclature has been…
The aim of this work is to consider the bicomplex third-order Jacobsthal quaternions and to present some properties involving this sequence, including the Binet-style formulae and the generating functions. Furthermore, Cassini's identity…
We introduce the $k$-bonacci polyominoes, a new family of polyominoes associated with the binary words avoiding $k$ consecutive $1$'s, also called generalized $k$-bonacci words. The polyominoes are very entrancing objects, considered in…
The necklace braid group $\mathcal{NB}_n$ is the motion group of the $n+1$ component necklace link $\mathcal{L}_n$ in Euclidean $\mathbb{R}^3$. Here $\mathcal{L}_n$ consists of $n$ pairwise unlinked Euclidean circles each linked to an…
We prove several versions of N. Alon's "necklace-splitting theorem", subject to additional constraints, as illustrated by the following results. (1) The "almost equicardinal necklace-splitting theorem" claims that, without increasing the…
In a paper entitled Binary lambda calculus and combinatory logic, John Tromp presents a simple way of encoding lambda calculus terms as binary sequences. In what follows, we study the numbers of binary strings of a given size that represent…
The linear complexity and the $k$-error linear complexity of a sequence have been used as important security measures for key stream sequence strength in linear feedback shift register design. By using the sieve method of combinatorics, the…
We consider the tiling of an $n$-board (a board of size $n\times1$) with squares of unit width and $(1,1)$-fence tiles. A $(1,1)$-fence tile is composed of two unit-width square subtiles separated by a gap of unit width. We show that the…
Given a sequence of distinct positive integers $w_0 , w_1, w_2, \ldots$ and any positive integer $n$, we define the discriminator function $\mathcal{D}_{\bf w}(n)$ to be the smallest positive integer $m$ such that $w_0,\ldots, w_{n-1}$ are…
A well known generalization of Alon's "splitting nacklace theorem" by Longueville and Zivaljevic states that every k-colored n-dimensional cube can be fairly split using only k cuts in each dimension. Here we prove that for every t there…
In this note, by counting some colored plane trees we obtain several binomial identities. These identities can be viewed as specific evaluations of certain generalizations of the Narayana polynomials. As consequences, it provides…
A common theme of enumerative combinatorics is formed by counting functions that are polynomials evaluated at positive integers. In this expository paper, we focus on four families of such counting functions connected to hyperplane…
In this paper, the construction of finite-length binary sequences whose nonlinear complexity is not less than half of the length is investigated. By characterizing the structure of the sequences, an algorithm is proposed to generate all…
A new family of sequences is proposed. An example of sequence of this family is more accurately studied. This sequence is composed by the integers $n$ for which the sum of binary digits is equal to the sum of binary digits of $n^2$. Some…
We generalize the notion of a de Bruijn sequence to a "multi de Bruijn sequence": a cyclic or linear sequence that contains every k-mer over an alphabet of size q exactly m times. For example, over the binary alphabet {0,1}, the cyclic…
Let $B(m, n)$ be the number of ways to colour a $2m \times 2n$ grid in black and white so that, in each row and each column, half of the cells are white and half are black. Bhattacharya conjectured that the exponent of $2$ in the prime…