Related papers: Enumeration of Rota-Baxter Words
In a one-counter automaton (OCA), one can produce a letter from some finite alphabet, increment and decrement the counter by one, or compare it with constants up to some threshold. It is well-known that universality and language inclusion…
We solve two open problems in Coxeter-Catalan combinatorics. First, we introduce a family of rational noncrossing objects for any finite Coxeter group, using the combinatorics of distinguished subwords. Second, we give a type-uniform proof…
Catalan words are particular growth-restricted words counted by the eponymous integer sequence. In this article we consider Catalan words avoiding a pair of patterns of length 3, pursuing the recent initiating work of the first and last…
We summarize some combinatoric problems solved by the higher Catalan numbers. These problems are generalizations of the combinatoric problems solved by the Catalan numbers. The generating function of the higher Catalan numbers appeared…
In this paper, we study averaging operators from an algebraic and combinatorial point of view. We first construct free averaging algebras in terms of a class of bracketed words called averaging words. We next apply this construction to…
Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent calculus involving induction and co-induction. These proof principles…
A finitary automaton group is a group generated by an invertible, deterministic finite-state letter-to-letter transducer whose only cycles are self-loops at an identity state. We show that, for this presentation of finite groups, the…
We generalize the notion of a Rota-Baxter operator on groups and the notion of a Rota-Baxter operator of weight 1 on Lie algebras and define and study the notion of a Rota-Baxter operator on a cocommutative Hopf algebra $H$. If $H=F[G]$ is…
We develop the technique of reduced word manipulation to give a range of results concerning reduced words and permutations more generally. We prove a broad connection between pattern containment and reduced words, which specializes to our…
Starting with the work S.H. Zheng, L. Guo and M. Rosenkranz (2015), Rota-Baxter operators are studied on the polynomial algebra. Injective Rota-Baxter operators of weight zero on $F[x]$ were described in 2021. We classify the following…
In this document we achieve exact and asymptotic enumeration of words, compositions over a finite group, and/or integer compositions characterized by local restrictions and, separately, subsequence pattern avoidance. We also count…
This talk describes how a combination of symbolic computation techniques with first-order theorem proving can be used for solving some challenges of automating program analysis, in particular for generating and proving properties about the…
We introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…
We describe arithmetic algorithms on a canonical number representation based on the Catalan family of combinatorial objects specified as a Haskell type class. Our algorithms work on a {\em generic} representation that we illustrate on…
Under the common theme of splitting of operations, the notions of (tri)dendriform algebras, pre-Lie algebras and post-Lie algebras have attracted sustained attention with broad applications. An important aspect of their studies is as the…
Abstract numeration systems encode natural numbers using radix ordered words of an infinite regular language and linear recurrence sequences play a key role in their valuation. Sequence automata, which are deterministic finite automata with…
Following Inoue et al., we define a word to be a repetition if it is a (fractional) power of exponent at least 2. A word has a repetition factorization if it is the product of repetitions. We study repetition factorizations in several…
The algebraic study of special integral operators led to the notions of Rota-Baxter operators and shuffle products which have found broad applications. This paper carries out an algebraic study of general integral operators and equations,…
This paper first introduces the notion of a Rota-Baxter operator (of weight $1$) on a Lie group so that its differentiation gives a Rota-Baxter operator on the corresponding Lie algebra. Direct products of Lie groups, including the…
Combining the notions of braces and relative Rota-Baxter operators on groups in connection with the Yang-Baxter equation and a factorization theorem of Lie groups from integrable systems, relative Rota-Baxter operators on braces and…