Related papers: Enumeration of Rota-Baxter Words
A commutative Rota-Baxter algebra can be regarded as a commutative algebra that carries an abstraction of the integral operator. With the motivation of generalizing the study of algebraic geometry to Rota-Baxter algebra, we extend the…
Deciding formulas mixing arithmetic and uninterpreted predicates is of practical interest, notably for applications in verification. Some decision procedures consist in building by structural induction an automaton that recognizes the set…
We describe a framework for systematic enumeration of families combinatorial structures which possess a certain regularity. More precisely, we describe how to obtain the differential equations satisfied by their generating series. These…
Rota-Baxter operators present a natural generalisation of integration by parts formula for the integral operator. In 2015, Zheng, Guo, and Rosenkranz conjectured that every injective Rota-Baxter operator of weight zero on the polynomial…
In the present article we define and investigate relative Rota--Baxter operators and relative averaging operators on racks and rack algebras. Also, if B is a Rota--Baxter or averaging operator on a rack X, then we can extend B by linearity…
We present several enumeration results holding in sets of words called neutral and which satisfy restrictive conditions on the set of possible extensions of nonempty words. These formulae concern return words and bifix codes. They…
Groups with various types of operators, in particular the recently introduced Rota-Baxter groups, have generated renowned interest with close connections to numerical integrals, Yang-Baxter equation, integrable systems and post-Hopf…
Rota-Baxter groups with weights $\pm 1$ have attracted quite much attention since their recent introduction, thanks to their connections with Rota-Baxter Lie algebras, factorizations of Lie groups, post- and pre-Lie algebras, braces and…
Gian-Carlo Rota suggested in one of his last articles the problem of developing a theory around the notion of integration algebras, complementary to the already existing theory of differential algebras. This idea was mainly motivated by…
This paper argues that mathematical objects are constructions and that constructions introduce a flexibility in the ways that mathematical objects are represented (as sets of binary sequences for example) and presented (in a particular…
The characteristic is a simple yet important invariant of an algebra. In this paper, we study the characteristic of a Rota-Baxter algebra, called the Rota-Baxter characteristic. We introduce an invariant, called the ascent set, of a…
In this paper we discourse basises of representable algebras. This question lead to arithmetic problems. We prove algorithmical solvability of exponential-Diophantine equations in rings represented by matrices over fields of positive…
We present a method for the enumeration of restricted words over a finite alphabet. Restrictions are described through the inclusion or exclusion of suitable building blocks used to construct the words by concatenation. Our approach, which…
We count the number of occurrences of certain patterns in given words. We choose these words to be the set of all finite approximations of a sequence generated by a morphism with certain restrictions. The patterns in our considerations are…
Representing a proof tree by a combinator term that reduces to the tree lets subtle forms of duplication within the tree materialize as duplicated subterms of the combinator term. In a DAG representation of the combinator term these…
We generalize the Umbral Calculus of G-C. Rota by studying not only sequences of polynomials and inverse power series, or even the logarithms studied in, but instead we study sequences of formal expressions involving the iterated logarithms…
We discuss the theory of certain partially ordered sets that capture the structure of commutation classes of words in monoids. As a first application, it follows readily that counting words in commutation classes is #P-complete. We then…
The $n$th term of an automatic sequence is the output of a deterministic finite automaton fed with the representation of $n$ in a suitable numeration system. In this paper, instead of considering automatic sequences built on a numeration…
We develop a theory of vector spaces spanned by orbit-finite sets. Using this theory, we give a decision procedure for equivalence of weighted register automata, which are the common generalization of weighted automata and register automata…
This article studies the expressive power of finite automata recognizing sets of real numbers encoded in positional notation. We consider Muller automata as well as the restricted class of weak deterministic automata, used as symbolic set…