English
Related papers

Related papers: The Power-Set Construction for Tree Algebras

200 papers

Considering the wired uniform spanning forest on a nonunimodular transitive graph, we show that almost surely each tree of the wired uniform spanning forest is light. More generally we study the tilted volumes for the trees in the wired…

Probability · Mathematics 2020-12-04 Pengfei Tang

We propose several constructions of commutative or cocommutative Hopf algebras based on various combinatorial structures, and investigate the relations between them. A commutative Hopf algebra of permutations is obtained by a general…

Combinatorics · Mathematics 2013-02-12 F. Hivert , J. -C. Novelli , J. -Y. Thibon

It is shown that for every positive integer $n$ there exists a subnormal weighted shift on a directed tree (with or without root) whose $n$th power is densely defined while its $(n+1)$th power is not. As a consequence, for every positive…

Functional Analysis · Mathematics 2013-09-04 Piotr Budzynski , Piotr Dymek , Zenon Jan Jablonski , Jan Stochel

The operad of moulds is realized in terms of an operational calculus of formal integrals (continuous formal power series). This leads to many simplifications and to the discovery of various suboperads. In particular, we prove a conjecture…

Quantum Algebra · Mathematics 2007-10-18 Frédéric Chapoton , Florent Hivert , Jean-Christophe Novelli , Jean-Yves Thibon

Weighted shifts on directed trees are a decade old generalisation of classical shift operators in the sequence space $\ell^2$. In this paper we introduce the joint backward extension property (JBEP) for classes of weighted shifts on…

Functional Analysis · Mathematics 2022-10-17 Piotr Pikul

A complete description is given of how minimal trees on atoms of the algebra of subsets $\mathfrak{A}_k$ generated by minimal spanning $k$-component forests of a weighted digraph $V$ determine the form of these forests and how forests grow…

Combinatorics · Mathematics 2025-06-24 Vasily Buslov

We explore the relationship between polynomial functors and (rooted) trees. In the first part we use polynomial functors to derive a new convenient formalism for trees, and obtain a natural and conceptual construction of the category…

Category Theory · Mathematics 2014-07-15 Joachim Kock

Models based on preferential attachment have had much success in reproducing the power law degree distributions which seem ubiquitous in both natural and engineered systems. Here, rather than assuming preferential attachment, we give an…

Statistical Mechanics · Physics 2007-05-23 N. Berger , C. Borgs , J. T. Chayes , R. M. D'Souza , R. D. Kleinberg

A staged tree model is a discrete statistical model encoding relationships between events. These models are realised by directed trees with coloured vertices. In algebro-geometric terms, the model consists of points inside a toric variety.…

Commutative Algebra · Mathematics 2022-07-04 Christiane Görgen , Aida Maraj , Lisa Nicklasson

We introduce a monoid structure on the set of binary search trees, by a process very similar to the construction of the plactic monoid, the Robinson-Schensted insertion being replaced by the binary search tree insertion. This leads to a new…

Combinatorics · Mathematics 2013-02-12 F. Hivert , J. -C. Novelli , J. -Y. Thibon

Can we do arithmetic in a completely different way, with a radically different data structure? Could this approach provide practical benefits, like operations on giant numbers while having an average performance similar to traditional…

Programming Languages · Computer Science 2013-01-03 Paul Tarau

We study the action of monads on categories equipped with several monoidal structures. We identify the structure and conditions that guarantee that the higher monoidal structure is inherited by the category of algebras over the monad.…

Category Theory · Mathematics 2017-01-12 Marcelo Aguiar , Mariana Haim , Ignacio Lopez Franco

The theme of this article is the algebraic combinatorics of leaf-labeled rooted binary trees and forests of such trees. The structure of a Hopf operad is defined on the vector spaces spanned by forests of leaf-labeled, rooted, binary trees.…

Combinatorics · Mathematics 2007-05-23 Frederic Chapoton

We introduce the notions of a mutually algebraic structures and theories and prove many equivalents. A theory $T$ is mutually algebraic if and only if it is weakly minimal and trivial if and only if no model $M$ of $T$ has an expansion…

Logic · Mathematics 2012-07-25 Michael C. Laskowski

We examine a discrete random recursive tree growth process that, at each time step, either adds or deletes a node from the tree with probability $p$ and $1-p$, respectively. Node addition follows the usual uniform attachment model. For node…

Probability · Mathematics 2021-08-03 Arnold Saunders

We introduce here the notion of Koszul duality for monoids in the monoidal category of species with respect to the ordinary product. To each Koszul monoid we associate a class of Koszul algebras in the sense of Priddy, by taking the…

Combinatorics · Mathematics 2008-12-31 Miguel A. Mendez

Recent theories suggest that Neural Scaling Laws arise whenever the task is linearly decomposed into power-law distributed units. Alternatively, scaling laws also emerge when data exhibit a hierarchically compositional structure, as is…

Machine Learning · Statistics 2025-05-13 Francesco Cagnetta , Hyunmo Kang , Matthieu Wyart

Given an ideal $I$ in a commutative ring $A$, a divided power structure on $I$ is a collection of maps $\{\gamma_n \colon I \to A\}_{n \in \mathbb{N}}$, subject to axioms that imply that it behaves like the family $\{x \mapsto…

Logic in Computer Science · Computer Science 2025-07-09 Antoine Chambert-Loir , María Inés de Frutos-Fernández

We consider weighted generating functions of trees where the weights are products of functions of the sizes of the subtrees. This work begins with the observation that three different communities, largely independently, found substantially…

Combinatorics · Mathematics 2014-12-19 Bradley R. Jones , Karen Yeats

We describe a completely algebraic axiom system for intertwining operators of vertex algebra modules, using algebraic flat connections, thus formulating the concept of a {\em tree algebra}. Using the Riemann-Hilbert correspondence, we…

Quantum Algebra · Mathematics 2011-02-11 Igor Kriz , Yang Xiu