Related papers: Shift-Plethystic Trees and Rogers-Ramanujan Identi…

We study the algebraic properties of plethystic vertex operators, introduced in J. Phys. A: Math. Theor. 43 405202 (2010), underlying the structure of symmetric functions associated with certain generalized universal character rings of…

In this we paper we prove several new identities of the Rogers-Ramanujan-Slater type. These identities were found as the result of computer searches. The proofs involve a variety of techniques, including series-series identities, Bailey…

The Andrews-Bressoud identities are one of many families of $q$-series identities relating an infinite sum to an infinite product. While the original motivation for studying these series relates to partitions, they can also be viewed in…

We define a length function for a perfect crystal. As an application, we derive a variant of the Rogers-Ramanujan identities which involves (a $q$-analog of) the Fibonacci numbers.

We propose Partition Tree, a novel tree-based framework for conditional density estimation over general outcome spaces that supports both continuous and categorical variables within a unified formulation. Our approach models conditional…

Recently, Rosengren utilized an integral method to prove a number of conjectural identities found by Kanade and Russell. Using this integral method, we give new proofs to some double sum identities of Rogers-Ramanujan type. These identities…

Daily internet communication relies heavily on tree-structured graphs, embodied by popular data formats such as XML and JSON. However, many recent generative (probabilistic) models utilize neural networks to learn a probability distribution…

We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…

We utilize the technique of staircases and jagged partitions to provide analytic sum-sides to some old and new partition identities of Rogers-Ramanujan type. Firstly, we conjecture a class of new partition identities related to the…

We define and study noncommutative crossing partitions which are a generalization of non-crossing partitions. By introducing a new cover relation on binary trees, we show that the partially ordered set of noncommutative crossing partitions…

In this paper, we expand on the work of Guo and Zeng from 2007 on a generalization of the Ramanujan polynomials and planar trees. We manage to find combinatorial interpretations of this family of polynomials in terms of Greg trees, Cayley…

In this paper we develop combinatorial techniques for the case of string algebras with the aim to give a characterization of string complexes with infinite minimal projective resolution. These complexes will be called \textit{periodic…

In this paper we give a combinatorial proof and refinement of a Rogers-Ramanujan type partition identity of Siladi\'c arising from the study of Lie algebras. Our proof uses generating functions and $q$-difference equations.

Basil Gordon, in the sixties, and George Andrews, in the seventies, generalized the Rogers-Ramanujan identities to higher moduli. These identities arise in many areas of mathematics and mathematical physics. One of these areas is…

The purpose of this paper is to study the commutative pseudomeadows, the structure which is defined in the same way as commutative meadows, except that the existence of a multiplicative identity is not required. We extend the…

We study a class of algebras with non-Lie commutation relations whose symplectic leaves are surfaces of revolution: a cylinder or a torus. Over each of such surfaces we introduce a family of complex structures and Hilbert spaces of…

We show that the series expansions of certain $q$-products have \textit{matching coefficients} with their reciprocals. Several of the results are associated to Ramanujan's continued fractions. For example, let $R(q)$ denote the…

Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…

Kristiansen and Murwanashyaka recently proved that Robinson arithmetic Q is interpretable in an elementary theory of full binary trees, T. We prove that, conversely, T is interpretable in Q by producing a formal interpretation of T in an…

We address questions of logic and expressibility in the context of random rooted trees. Infiniteness of a rooted tree is not expressible as a first order sentence, but is expressible as an existential monadic second order sentence (EMSO).…