Related papers: Tiered trees and Theta operators

Extending the symmetric framework of D'Adderio and Mellit, we establish a nonsymmetric generalization of the compositional Delta theorem. Building on Blasiak et al.'s theory of flagged LLT polynomials, we derive signed and unsigned…

In light of the grammar given by Ji for the $(\alpha,\beta)$-Eulerian polynomials introduced by Carlitz and Scoville, we provide a labeling scheme for increasing binary trees. In this setting, we obtain a combinatorial interpretation of the…

We provide the covariant superspace equations that are sufficient to determine the complete $\theta$ expansion of the vertex operator of the open string massive states with $(mass)^2=1/\alpha'$ in pure spinor formalism of superstring…

We formulate quantum mechanics in the two-dimensional torus without using position operators. We define an algebra with only momentum operators and shift operators and construct irreducible representation of the algebra. We show that it…

Working with generating functions, the combinatorics of a recurrence relation can be expressed in a way that allows for more efficient calculation of the quantity. This is true of the Catalan numbers for an ordered binary tree…

Let $X$ be a locally compact Hausdorff space with $n$ proper continuous self maps $\tau_i:X \to X$ for $1 \le i \le n$. To this we associate two topological conjugacy algebras which emerge as the natural candidates for the universal algebra…

We develop basic cluster theory from an elementary point of view using a variation of binary trees which we call mixed cobinary trees. We show that the number of isomorphism classes of such trees is given by the Catalan number Cn where n is…

We discuss a generalization of Clifford algebras known as generalized Clifford algebras (in particular, ternary Clifford algebras). In these objects, we have a fixed higher-degree form (in particular, a ternary form) instead of a quadratic…

We propose a new arithmetic for non-empty rooted unordered trees simply called trees. After discussing tree representation and enumeration, we define the operations of tree addition, multiplication and stretch, prove their properties, and…

The computational complexity of time-dependent perturbation theory is well-known to be largely combinatorial whatever the chosen expansion method and family of parameters (combinatorial sequences, Goldstone and other Feynman-type…

Tate objects have been studied by many authors. They allow us to deal with infinite dimensional spaces by identifying some more structure. In this article, we set up the theory of Tate objects in stable $(\infty,1)$-categories, while the…

This thesis proposes a combinatorial generalization of a nilpotent operator on a vector space. The resulting object is highly natural, with basic connections to a variety of fields in pure mathematics, engineering, and the sciences. For the…

We present a generic tree-interpolation algorithm in the SMT context with quantifiers. The algorithm takes a proof of unsatisfiability using resolution and quantifier instantiation and computes interpolants (which may contain quantifiers).…

We introduce a new operad-like structure that we call a reconnectad; the ``input'' of an element of a reconnectad is a finite simple graph, rather than a finite set, and ``compositions'' of elements are performed according to the notion of…

We present some general theorems about operator algebras that are algebras of functions on sets, including theories of local algebras, residually finite dimensional operator algebras and algebras that can be represented as the scalar…

We provide a novel mathematical implementation of tree-adjoining grammars using two combinatorial definitions of graphs. With this lens, we demonstrate that the adjoining operation defines a pre-Lie operation and subsequently forms a Lie…

We introduce bud generating systems, which are used for combinatorial generation. They specify sets of various kinds of combinatorial objects, called languages. They can emulate context-free grammars, regular tree grammars, and synchronous…

We study $N$-ary non-commutative notions of independence, which are given by trees and which generalize free, Boolean, and monotone independence. For every rooted subtree $\mathcal{T}$ of the $N$-regular tree, we define the…

We study the homogeneous coordinate rings of real multiplication noncommutative tori as defined by A. Polishchuk. Our aim is to understand how these rings give rise to an arithmetic structure on the noncommutative torus. We start by giving…

We say that an operator $T \in B(H)$ is complex symmetric if there exists a conjugate-linear, isometric involution $C:H\to H$ so that $T = CT^*C$. We prove that binormal operators, operators that are algebraic of degree two (including all…