Related papers: Analytic aspects of the shuffle product
To factorize and to decompose the graphs of representative functions on the free monoid X * (generated by the alphabet X ) with values in the ring A containing Q, we examine various products of series (as concatenation, shuffle and its…
In this paper, we begin a systematic study of modified Rota-Baxter algebras, as an associative analogue of the modified classical Yang-Baxter equation. We construct free commutative modified Rota-Baxter algebras by a variation of the…
We determine all composition-closed equational classes of Boolean functions. These classes provide a natural generalization of clones and iterative algebras: they are closed under composition, permutation and identification…
Let $A \cong k\langle X \rangle / I$ be an associative algebra. A finite word over alphabet $X$ is $I${\it-reducible} if its image in $A$ is a $k$-linear combination of length-lexicographically lesser words. An {\it obstruction} in a…
As part of the study of correspondence functors, the present paper investigates their tensor product and proves some of its main properties. In particular, the correspondence functor associated to a finite lattice has the structure of a…
We propose a novel constructive framework for approaching the Hodge Conjecture via explicit degenerations. Building on limiting mixed Hodge structures (LMHS), we formulate a criterion under which a rational class of type (p, p) on a smooth…
We develop a nonstandard approach to exploring polynomials associated with peaks and runs of permutations. With the aid of a context-free grammar, or a set of substitution rules, one can perform a symbolic calculus, and the computation…
We show that a decomposition of a complex Lie group $G$ into a semidirect product generates that of the algebra of analytic functional, ${\mathscr A}(G)$, into an analytic smash product in the sense of Pirkovskii. Also we find sufficient…
Rational word languages can be defined by several equivalent means: finite state automata, rational expressions, finite congruences, or monadic second-order (MSO) logic. The robust subclass of aperiodic languages is defined by: counter-free…
We introduce a subclass of the commutative regular languages that is characterized by the property that the state set of the minimal deterministic automaton can be written as a certain Cartesian product. This class behaves much better with…
Motivated by q-shuffle products determined by Singer from q-analogues of multiple zeta values, we build in this article a generalisation of the shuffle and stuffle products in terms of weak shuffle and stuffle products. Then, we…
The commutative trigonometric shuffle algebra ${\mathrm A}$ is a space of symmetric rational functions satisfying certain wheel conditions. We describe a ring isomorphism between ${\mathrm A}$ and the center of the Hecke algebra using a…
This article introduces an algebra of functions in one variable $c$ defined by iterated integrals of two specific differential forms depending on $c$, where the product is the shuffle product. This algebra can be seen as a common…
We describe generating functions for several important families of classical symmetric functions and shifted Schur functions. The approach is originated from vertex operator realization of symmetric functions and offers a unified method to…
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 purpose of this paper is to introduce the notion of Nash functions in the context of slice regular functions of one quaternionic or octonionic variable. We begin with a detailed analysis of the possible definitions of Nash slice regular…
Programs written in dynamic languages make heavy use of features --- run-time type tests, value-indexed dictionaries, polymorphism, and higher-order functions --- that are beyond the reach of type systems that employ either purely syntactic…
The evolution of grammatical systems of syntactic and semantic composition is modeled here with a novel application of reinforcement learning theory. To test the functionalist thesis that speakers' expressive purposes shape their language,…
Many applications of denotational semantics, such as higher-order model checking or the complexity of normalization, rely on finite semantics for monomorphic type systems. We exhibit such a finite semantics for a polymorphic purely linear…
A new calculus of planar diagrams involving diagrammatics for biadjoint functors and degenerate affine Hecke algebras is introduced. The calculus leads to an additive monoidal category whose Grothendieck ring contains an integral form of…