English
Related papers

Related papers: The realization of input-output maps using bialgeb…

200 papers

This article surveys results on graded algebras and their Hilbert series. We give simple constructions of finitely generated graded associative algebras $R$ with Hilbert series $H(R,t)$ very close to an arbitrary power series $a(t)$ with…

Rings and Algebras · Mathematics 2020-04-14 Vesselin Drensky

One of the main virtues of trees is to represent formal solutions of various functional equations which can be cast in the form of fixed point problems. Basic examples include differential equations and functional (Lagrange) inversion in…

Combinatorics · Mathematics 2013-02-12 Florent Hivert , Jean-Christophe Novelli , Jean-Yves Thibon

We describe arithmetic computations in terms of operations on some well known free algebras (S1S, S2S and ordered rooted binary trees) while emphasizing the common structure present in all them when seen as isomorphic with the set of…

Mathematical Software · Computer Science 2013-01-03 Paul Tarau

This paper addresses the representation theory of the insertion-elimination Lie algebra, a Lie algebra that can be naturally realized in terms of tree-inserting and tree-eliminating operations on rooted trees. The insertion-elimination…

Representation Theory · Mathematics 2015-10-26 Matthew Ondrus , Emilie Wiesner

Recent advances in stochastic PDEs, Hopf algebras of typed trees and integral equations have inspired the study of algebraic structures with replicating operations. To understand their algebraic and combinatorial nature, we first use rooted…

Rings and Algebras · Mathematics 2022-09-21 Xing Gao , Li Guo , Yi Zhang

The concept of F-algebra and its representation can be extended to an arbitrary bundle. We define operations of fibered F-algebra in fiber. The paper presents the representation theory of of fibered F-algebra as well as a comparison of…

Differential Geometry · Mathematics 2011-11-09 Aleks Kleyn

Non-well-founded trees are used in mathematics and computer science, for modelling non-well-founded sets, as well as non-terminating processes or infinite data-structures. Categorically, they arise as final coalgebras for polynomial…

Category Theory · Mathematics 2007-05-23 Benno van den Berg , Federico de Marchi

We first show that increasing trees are in bijection with set compositions, extending simultaneously a recent result on trees due to Tonks and a classical result on increasing binary trees. We then consider algebraic structures on the…

Combinatorics · Mathematics 2007-05-23 Frederic Patras , Manfred Schocker

We present module theory and linear maps as a powerful generalised and computationally efficient framework for the relational data model, which underpins today's relational database systems. Based on universal constructions of modules we…

Programming Languages · Computer Science 2022-07-05 Fritz Henglein , Robin Kaarsgaard , Mikkel Kragh Mathiesen

We define a class of algebras describing links of binary isolating formulas on a set of realizations for a family of 1-types of a complete theory. We prove that a set of labels for binary isolating formulas on a set of realizations for a…

Logic · Mathematics 2012-05-16 Ilya V. Shulepov , Sergey V. Sudoplatov

Linear systems often involve, as a basic building block, solutions of equations of the form \begin{align*} A_Sx_S&+A_Px_P =0\\ A'_Sx_S & =0, \end{align*} where our primary interest might be in the vector variable $x_P.$ Usually, neither…

General Mathematics · Mathematics 2016-09-27 H. Narayanan

Geometric realizations for the restrictions of GNS representations to unitary groups of $C^*$-algebras are constructed. These geometric realizations use an appropriate concept of reproducing kernels on vector bundles. To build such…

Representation Theory · Mathematics 2016-08-16 Daniel Beltiţă , Tudor S. Ratiu

We review some important algebraic structures which appear in a priori remote areas of Mathematics, such as control theory, numerical methods for solving differential equations, and renormalization in Quantum Field Theory. Starting with…

Classical Analysis and ODEs · Mathematics 2015-01-29 Dominique Manchon

Hopf representation is a module and comodule with a consistency condition that is more general than the consistency condition of Hopf modules. For a Hopf algebra $H$, we construct an induced Hopf representation from a representation of a…

Representation Theory · Mathematics 2014-04-03 Ibrahim Saleh

Isomorphisms of separable Hilbert spaces are analogous to isomorphisms of n-dimensional vector spaces. However, while n-dimensional spaces in applications are always realized as the Euclidean space R^n, Hilbert spaces admit various useful…

Mathematical Physics · Physics 2007-05-23 Alexey A. Kryukov

We consider the creation conditions of diverse hierarchical trees both analytically and numerically. A connection between the probabilities to create hierarchical levels and the probability to associate these levels into a united structure…

Statistical Mechanics · Physics 2011-06-21 A. I. Olemskoi , S. S. Borysov , I. A. Shuda

B-systems are algebras (models) of an essentially algebraic theory that is expected to be constructively equivalent to the essentially algebraic theory of C-systems which is, in turn, constructively equivalent to the theory of contextual…

Logic · Mathematics 2014-10-21 Vladimir Voevodsky

In this article we study algebraic structures of function spaces defined by graphs and state spaces equipped with Gibbs measures by associating evolution algebras. We give a constructive description of associating evolution algebras to the…

Commutative Algebra · Mathematics 2009-03-11 Utkir A. Rozikov , Jianjun Paul Tian

We here give polynomial realizations of various Hopf algebras or bialgebras on Feynman graphs, graphs, posets or quasi-posets, that it to say injections of these objects into polynomial algebras generated by an alphabet. The alphabet here…

Rings and Algebras · Mathematics 2019-05-27 Loïc Foissy

A provably correct bijection between higher-order abstract syntax (HOAS) and the natural numbers enables one to define a "not equals" relationship between terms and also to have an adequate encoding of sets of terms, and maps from one term…

Logic in Computer Science · Computer Science 2010-09-16 John Tang Boyland