Related papers: Enumeration of Rota-Baxter Words
Generating series are crucial in enumerative combinatorics, analytic combinatorics, and combinatorics on words. Though it might seem at first view that generating Dirichlet series are less used in these fields than ordinary and exponential…
A vocabulary is a list of words designating subsets from a grand set X. We model a vocabulary as a partition of X and study the aggregation of individual vocabularies into a collective one. We characterize aggregation rules when X is…
We present a base class of automata that induce a numeration system and we give an algorithm to give the n-th word in the language of the automaton when the expansion of n in the induced numeration system is feeded to the automaton.…
In this article, we study two combinatorial problems concerning the set of reflections of a Coxeter system. The first problem asks whether the language of palindromic reduced words for reflections is regular, and the second is about finding…
In this report, we summarize the set partition enumeration problems and thoroughly explain the algorithms used to solve them. These algorithms iterate through the partitions in lexicographic order and are easy to understand and implement in…
For a commutative finite $\mathbb{Z}$-algebra, i.e., for a commutative ring $R$ whose additive group is finitely generated, it is known that the group of units of $R$ is finitely generated, as well. Our main results are algorithms to…
A generalisation of the notion of a Rota-Baxter operator is proposed. This generalisation consists of two operators acting on an associative algebra and satisfying equations similar to the Rota-Baxter equation. Rota-Baxter operators of any…
We study the free (associative, non-commutative) Baxter algebra on one generator. The first explicit description of this object is due to Ebrahimi-Fard and Guo. We provide an alternative description in terms of a certain class of trees,…
Let p/q be a rational number. Numeration in base p/q is defined by a function that evaluates each finite word over A_p={0,1,...,p-1} to some rational number. We let N_p/q denote the image of this evaluation function. In particular, N_p/q…
Purpose: This study extends the structural theory of finite commutative ternary $\Gamma$-semirings into a computational and categorical framework for explicit classification and constructive reasoning. Methods: Constraint-driven enumeration…
We consider ideals and Boolean combinations of ideals. For the regular languages within these classes we give expressively complete automaton models. In addition, we consider general properties of regular ideals and their Boolean…
We study the $k$-Bonacci word over the infinite alphabet $\mathbb{N}$. Since the alphabet is infinite, the usual factor complexity is infinite and does not provide any information. We therefore investigate factor occurrence statistics in…
We study arithmetical and combinatorial properties of $\beta$-integers for $\beta$ being the root of the equation $x^2=mx-n, m,n \in \mathbb N, m \geq n+2\geq 3$. We determine with the accuracy of $\pm 1$ the maximal number of…
Theory of Rota-Baxter operators on rings and algebras has been developed since 1960. Recently, L. Guo, H. Lang, Y. Sheng [arXiv:2009.03492] have defined the notion of Rota-Baxter operator on a group. We provide some general constructions of…
We develop the connection between Rota-Baxter operators arisen from algebra and mathematical physics and Bernoulli polynomials. We state that a trivial property of Rota-Baxter operators implies the symmetry of the power sum polynomials and…
In this paper, we introduce the concept of a Rota-Baxter paired module to study Rota-Baxter modules without necessarily a Rota-Baxter operator. We obtain two characterizations of Rota-Baxter paired modules, and give some basic properties of…
Generalizations of linear numeration systems in which the set of natural numbers is recognizable by finite automata are obtained by describing an arbitrary infinite regular language following the lexicographic ordering. For these systems of…
In this paper, we establish the Composition-Diamond lemma for associative nonunitary Rota-Baxter algebras with weight $\lambda$. As applications, we obtain a linear basis of a free commutative Rota-Baxter algebra without unity and show that…
We construct a free Poisson algebra endowed with a Rota-Baxter operator. The same construction works for a free Poisson algebra endowed with a Nijenhuis operator.
We address generating theorems from a given set of axioms, without proof goal, aiming at value from a mathematical point of view or as lemmas for automated proving. As benchmark, we convert a fragment of the Metamath database set.mm. Our…