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

We initiate a unified, axiomatic study of noncommutative algebras R whose prime spectra are, in a natural way, finite unions of commutative noetherian spectra. Our results illustrate how these commutative spectra can be functorially ``sewn…

We revisit old conjectures of Fermat and Euler regarding representation of integers by binary quadratic form x^2+5y^2. Making use of Ramanujan's_1\psi_1 summation formula we establish a new Lambert series identity for…

Tree-child networks are a recently-described class of directed acyclic graphs that have risen to prominence in phylogenetics (the study of evolutionary trees and networks). Although these networks have a number of attractive mathematical…

A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…

We consider the problem of discriminatively learning restricted Boltzmann machines in the presence of relational data. Unlike previous approaches that employ a rule learner (for structure learning) and a weight learner (for parameter…

We present several non-commutative extensions of the MacMahon Master Theorem, further extending the results of Cartier-Foata and Garoufalidis-Le-Zeilberger. The proofs are combinatorial and new even in the classical cases. We also give…

The $(q,r)$-Whitney numbers were recently defined in terms of the $q$-Boson operators, and several combinatorial properties which appear to be $q$-analogues of similar properties were studied. In this paper, we obtain elementary and…

We extend classical results on simple varieties of trees (asymptotic enumeration, average behavior of tree parameters) to trees counted by their number of leaves. Motivated by genome comparison of related species, we then apply these…

In this paper, we investigate several infinite products with vanishing Taylor coefficients in arihmetic progressions. These infinite products are closely related to the Rogers--Ramanujan continued fraction. Moreover, a handful of new…

The Rogers-Ramanujan identities and various analogous identities (Gordon, Andrews-Bressoud, Capparelli, etc.) form a family of very deep identities concerned with integer partitions. These identities (written in generating function form)…

Integrable theory is formulated for correlation functions of characteristic polynomials associated with invariant non-Gaussian ensembles of Hermitean random matrices. By embedding the correlation functions of interest into a more general…

Using a new graphical representation for partitions, the author obtains a family of partition identities associated with partitions into distinct parts of an arithmetic progression, or, more generally, with partitions into distinct parts of…

This paper considers a higher-dimensional generalization of the notion of Ramanujan graphs, defined by Lubotzky, Phillips, and Sarnak. Specifically the Ramanujan property is studied for cubical complexes which are uniformized by an ordered…

In this paper, we present a new Rogers--Ramanujan type identity for overpartitions by extending the asymmetrical version of Schur's theorem due to Lovejoy to a broader class of infinite products. More precisely, we provide a combinatorial…

Due to the works of S. Bozapalidis and A. Alexandrakis, there is a well-known characterization of recognizable weighted tree languages over fields in terms of finite-dimensionality of syntactic vector spaces. Here we prove a…

The Fibonomial coefficients are well-known analogues of the classical binomial coefficients. In 2009, Sagan and Savage introduced a combinatorial interpretation for these coefficients, based on tiling a rectangular grid. More recently,…

In the first part of this article, we consider a Groebner basis of the differential ideal {x_1^2} with respect to "the" weighted lexicographical monomial order and show that its computation is related with an identity involving the…

We define the generalized Golomb triangular recursion by g_{j,s,lambda}(n) = g_{j,s,lambda}(n - s - g_{j,s,lambda}(n-j)) + \lambda j. For particular choices of the initial conditions, we show that the solution of the recursion is a non-slow…

We present an axiomatic framework for analyzing the algorithmic properties of decision trees. This framework supports the classification of decision tree problems through structural and ancestral constraints within a rigorous mathematical…

Inspired by distributed algorithms, we introduce a new class of finite graph automata that recognize precisely the graph languages definable in monadic second-order logic. For the cases of words and trees, it has been long known that the…