Related papers: Enumeration of Rota-Baxter Words
Every rational number p/q defines a rational base numeration system in which every integer has a unique finite representation, up to leading zeroes. This work is a contribution to the study of the set of the representations of integers.…
Most popular word embedding techniques involve implicit or explicit factorization of a word co-occurrence based matrix into low rank factors. In this paper, we aim to generalize this trend by using numerical methods to factor higher-order…
A relative Rota-Baxter operator on Lie 2-groups is introduced as a pair of relative Rota-Baxter operators on the underlying Lie groups which is also a Lie groupoid morphism. Such an operator induces a factorization theorem for Lie 2-groups…
Combining the representations of the words that make up a sentence into a cohesive whole is difficult, since it needs to account for the order of words, and to establish how the words present relate to each other. The solution we propose…
Given a presentation for a rack $\mathcal R$, we define a process which systematically enumerates the elements of $\mathcal R$. The process is modeled on the systematic enumeration of cosets first given by Todd and Coxeter. This generalizes…
The multiplicative theory of a set of numbers (which could be natural, integer, rational, real or complex numbers) is the first-order theory of the structure of that set with (solely) the multiplication operation (that set is taken to be…
The Rota-Baxter algebra and the shuffle product are both algebraic structures arising from integral operators and integral equations. Free commutative Rota-Baxter algebras provide an algebraic framework for integral equations with the…
We introduce bud generating systems, which are used for combinatorial generation. They specify sets of various kinds of combinatorial objects, called languages. They can emulate context-free grammars, regular tree grammars, and synchronous…
In this paper we address the problem of generating all elements obtained by the saturation of an initial set by some operations. More precisely, we prove that we can generate the closure of a boolean relation (a set of boolean vectors) by…
In this work we propose a multi-valued extension of logic programs under the stable models semantics where each true atom in a model is associated with a set of justifications, in a similar spirit than a set of proof trees. The main…
We use erasers-like basic operations on words to construct a set that is both Borel and above Delta^0_omega, built as a set V^\omega where V is a language of finite words accepted by a pushdown automaton. In particular, this gives a first…
We prove that outer commutator words are uniformly concise, i.e. if an outer commutator word w takes m different values in a group G, then the order of the verbal subgroup w(G) is bounded by a function depending only on m and not on w or G.…
This paper establishes a uniform procedure to split the operations in any algebraic operad, generalizing previous known notions of splitting algebraic structures from the dendriform algebra of Loday that splits the associative operation to…
A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…
In this paper, first we revisit the formal integration of Lie algebras, which give rise to braces in some special cases. Then we establish the formal integration theory for complete Rota-Baxter Lie algebras, that is, we show that there is a…
The algebraic formulation of the derivation and integration related by the First Fundamental Theorem of Calculus (FFTC) gives rise to the notion of differential Rota-Baxter algebra. The notion has a remarkable list of categorical…
In the paper we study homogeneous Rota-Baxter operators with weight zero on the infinite dimensional simple $3$-Lie algebra $A_{\omega}$ over a field $F$ ( $ch F=0$ ) which is realized by an associative commutative algebra $A$ and a…
We introduce homing vector automata, which are finite automata augmented by a vector that is multiplied at each step by a matrix determined by the current transition, and have to return the vector to its original setting in order to accept…
In this paper, our main focus is expressing real numbers on the non-integer bases. We denote those bases as $\beta$'s, which is also a real number and $\beta \in (1,2)$. This project has 3 main parts. The study of expansions of real numbers…
In this chapter we discuss the problem of enumerating distinct regular expressions by size and the regular languages they represent. We discuss various notions of the size of a regular expression that appear in the literature and their…