Related papers: Tiered trees and Theta operators
Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…
In this paper we obtain precise asymptotics for certain families of graphs, namely circulant graphs and degenerating discrete tori. The asymptotics contain interesting constants from number theory among which some can be interpreted as…
This paper constructs (with challenging obstacles) on the three torus with its cubical decomposition: Firstly, a combinatorial graded intersection algebra (graded by the codimension) which is commutative and associative defined by…
The theory of Ihara zeta functions is extended to non-compact arithmetic quotients of Bruhat-Tits trees. This new zeta function turns out to be a rational function, despite the infinite-dimensional setting. In general it has zeros and…
An explicit vertex operator algebra construction is given of a class of irreducible modules for toroidal Lie algebras.
We introduce unbounded strongly irreducible operators and transitive operators. These operators are related to a certain class of indecomposable Hilbert representations of quivers on infinite-dimensional Hilbert spaces. We regard the theory…
Inspired by the definition of tense operators on distributive lattices presented by Chajda and Paseka in 2015, in this paper, we introduce and study the variety of tense distributive lattices with implication and we prove that these are…
We prove a new formula for the generating function of multitype Cayley trees counted according to their degree distribution. Using this formula we recover and extend several enumerative results about trees. In particular, we extend some…
We introduce a notion of ternary $F$-manifold algebras which is a generalization of $F$-manifold algebras. We study representation theory of ternary $F$-manifold algebras. In particular, we introduce a notion of dual representation which…
We introduce a functorial construction which, from a monoid, produces a set-operad. We obtain new (symmetric or not) operads as suboperads or quotients of the operads obtained from usual monoids such as the additive and multiplicative…
We present in this paper a first-order axiomatization of an extended theory $T$ of finite or infinite trees, built on a signature containing an infinite set of function symbols and a relation $\fini(t)$ which enables to distinguish between…
We consider the number of spanning trees in circulant graphs of $\beta n$ vertices with generators depending linearly on $n$. The matrix tree theorem gives a closed formula of $\beta n$ factors, while we derive a formula of $\beta-1$…
A combinatorial category Disks was introduced by Andr\'e Joyal to play a role in his definition of weak omega-category. He defined the category Theta to be dual to Disks. In the ensuing literature, a more concrete description of Theta was…
As a fundamental and ubiquitous combinatorial notion, species has attracted sustained interest, generalizing from set-theoretical combinatorial to algebraic combinatorial and beyond. The Rota-Baxter algebra is one of the algebraic…
The first-order theory of finite and infinite trees has been studied since the eighties, especially by the logic programming community. Following Djelloul, Dao and Fr\"uhwirth, we consider an extension of this theory with an additional…
We conjecture two combinatorial interpretations for the symmetric function $\Delta_{e_k} e_n$, where $\Delta_f$ is an eigenoperator for the modified Macdonald polynomials defined by Bergeron, Garsia, Haiman, and Tesler. Both interpretations…
We construct a new class of symmetric algebras of tame representation type that are also the endomorphism algebras of cluster tilting objects in 2-Calabi-Yau triangulated categories, hence all their non-projective indecomposable modules are…
We build on recent work of Yeats, Courtiel, and others involving connected chord diagrams. We first derive from a Hopf-algebraic foundation a class of tree-like functional equations and prove that they are solved by weighted generating…
We develop a purely set-theoretic formalism for binary trees and binary graphs. We define a category of binary automata, and display it as a fibred category over the category of binary graphs. We also relate the notion of binary graphs to…
We provide an operator algebraic interpretation of discrete measurable groupoids in the course of re-proving (and slightly generalizing) a result on treeability due to Adams and Spatzier. Then, we reconstruct Gaboriau's beautiful work on…