Related papers: Arithmetization of well-formed parenthesis strings…
It is known that the core of mathematics is natural numbers. And everything related to the natural number is interesting to mathematicians. In this paper, we draw parallels between natural numbers and elements of a non-numeric lexicographic…
The paper considers the sequence of the Motzkin words, which is constructed according to formal features of natural numbers. We investigate the decomposition of well-formed parentheses into the matched pairs of parentheses (analogous to…
We continue to consider the ordered lexicographic sequence, which is constructed according to the formal characteristics of a series of natural numbers. For analysis, we selected balanced parentheses with zeros, Motzkin words. As you know,…
We establish a total lexicographical order on the set of Motzkin words. Elements are ordered similarly to Natural Numbers in accordance with known rules (axioms). As a result, we were able to obtain arithmetic and logical operations on the…
The Motzkin numbers can be derived as coefficients of hybrid polynomials. Such an identification allows the derivation of new identities for this family of numbers and offers a tool to investigate previously unnoticed links with the theory…
We show that the generating function $\sum_{n\ge0}M_n\,z^n$ for Motzkin numbers $M_n$, when coefficients are reduced modulo a given power of $2$, can be expressed as a polynomial in the basic series $\sum _{e\ge0} ^{} {z^{4^e}}/(…
We provide an efficient encoding of the natural numbers {0,1,2,3,...} as strings of nested parentheses {(),(()),(()()),((())),...}, or considered inversely, an efficient enumeration of such strings. The technique is based on the recursive…
Clones are specializations of operads forming powerful instruments to describe varieties of algebras wherein repeating variables are allowed in their equations. They allow us in this way to realize and study a large range of algebraic…
The Motzkin numbers $M_n=\sum_{k=0}^n\binom n{2k}\binom{2k}k/(k+1)$ $(n=0,1,2,\ldots)$ and the central trinomial coefficients $T_n$ ($n=0,1,2,\ldots)$ given by the constant term of $(1+x+x^{-1})^n$, have many combinatorial interpretations.…
The use of monoids in the study of word languages recognized by finite-state automata has been quite fruitful. In this work, we look at the same idea of "recognizability by finite monoids" for other monoids. In particular, we attempt to…
The generating function and an explicit expression is derived for the (colored) Motzkin numbers of higher rank introduced recently. Considering the special case of rank one yields the corresponding results for the conventional colored…
A word $w=w_1\cdots w_n$ over the set of positive integers is a Motzkin word whenever $w_1=\texttt{1}$, $1\leq w_k\leq w_{k-1}+1$, and $w_{k-1}\neq w_{k}$ for $k=2, \dots, n$. It can be associated to a $n$-column Motzkin polyomino whose…
We show NP-completeness for various problems about the existence of arithmetic expression trees. When given a set of operations, inputs, and a target value does there exist an expression tree with those inputs and operations that evaluates…
When can $n$ given numbers be combined using arithmetic operators from a given subset of $\{+, -, \times, \div\}$ to obtain a given target number? We study three variations of this problem of Arithmetic Expression Construction: when the…
In this paper we consider two problems concerning string factorisation. Specifically given a string $w$ and an integer $k$ find a factorisation of $w$ where each factor has length bounded by $k$ and has the minimum (the FmD problem) or the…
Bracketed words are basic structures both in mathematics (such as Rota-Baxter algebras) and mathematical physics (such as rooted trees) where the locations of the substructures are important. In this paper we give the classification of the…
In this paper we construct a cover {a_s(mod n_s)}_{s=1}^k of Z with odd moduli such that there are distinct primes p_1,...,p_k dividing 2^{n_1}-1,...,2^{n_k}-1 respectively. Using this cover we show that for any positive integer m divisible…
To cater to the needs of (Zero Knowledge) proofs for (mathematical) proofs, we describe a method to transform formal sentences in 2x2-matrices over multivariate polynomials with integer coefficients, such that usual proof-steps like…
We present three Lagrangian algebras in the modular 2-category associated to the 3+1D $\mathbb{Z}_2$ topological order and discuss their physical interpretations, connecting algebras with gapped boundary conditions, and interestingly, maps…
We define a new congruence relation on the set of integers, leading to a group similar to the multiplicative group of integers modulo $n$. It makes use of a symmetry almost omnipresent in modular multiplications and halves the number of…