相关论文: Arithmetic on Balanced Parentheses: The case of Or…
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…
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,…
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…
In this paper, we perform an arithmetization of well-formed parenthesis strings with zeros (Motzkin words) and of corresponding Motzkin paths. The transformations used are reminiscent of G\"odel numbering for mathematical objects of some…
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…
The article deals with a lexicographic order in various sequences. Consider the axiomatic of lexicographic series, based on the properties of the natural numbers. Elements of the set are ordered first the code length; further in each sign…
The sequential structure of language, and the order of words in a sentence specifically, plays a central role in human language processing. Consequently, in designing computational models of language, the de facto approach is to present…
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…
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…
In the past few decades there has been a good deal of papers which are concerned with optimization problems in different areas of mathematics (along 0-1 words, finite or infinite) and which yield - sometimes quite unexpectedly - balanced…
An algebraic linear ordering is a component of the initial solution of a first-order recursion scheme over the continuous categorical algebra of countable linear orderings equipped with the sum operation and the constant 1. Due to a general…
This paper deals with algorithms for producing and ordering lexical and nonlexical sequences of a given degree. The notion of "elementary operations" on positive integral sequences is introduced. Our main theorem answers the question of…
Sorting algorithms are fundamental to computer science, and their correctness criteria are well understood as rearranging elements of a list according to a specified total order on the underlying set of elements. As mathematical functions,…
It is proven that, contrarily to the common belief, the notion of zero is not necessary for having positional representations of numbers. Namely, for any positive integer $k$, a positional representation with the symbols for $1, 2, \ldots,…
A regular language has the zero-one law if its asymptotic density converges to either zero or one. We prove that the class of all zero-one languages is closed under Boolean operations and quotients. Moreover, we prove that a regular…
In this article, we give a precise mathematical meaning to `linear? time' that matches experimental behaviour of the algorithm. The sorting algorithm is not our own, it is a variant of radix sort with counting sort as a subroutine. The true…
Combinatorial objects such as rooted trees that carry a recursive structure have found important applications recently in both mathematics and physics. We put such structures in an algebraic framework of operated semigroups. This framework…
We consider orthogonal polynomials with respect to a linear differential operator $$\mathcal{L}^{(M)}=\sum_{k=0}^{M}\rho_{k}(z)\frac{d^k}{dz^k}, $$ where $\{\rho_k\}_{k=0}^{M}$ are complex polynomials such that $deg[\rho_k]\leq k, 0\leq k…
We introduce a partial order on the set of all reduced words of a given permutation $\omega$, called \emph{directed-braid poset} of $\omega$. This poset enables us to produce two algorithms: One is a sorting algorithm applied on any reduced…
The associative operad is a central structure in operad theory, defined on the linear span of the set of permutations. We build two analogs of the associative operad on the linear span of the set of packed words which turn out to be…