Related papers: Shift-Plethystic Trees and Rogers-Ramanujan Identi…
In this work, we start an investigation of asymmetric Rogers--Ramanujan type identities. The first object is the following unexpected relation $$\sum_{n\ge 0} \frac{(-1)^n q^{3\binom{n}{2}+4n}(q;q^3)_n}{(q^9;q^9)_n} =…
For a derived stack obtained as a quotient of a derived affine scheme by a reductive group, we show that shifted symplectic structures can be characterized by the Cartan-de Rham complex. For non-reductive groups, we also show the analogous…
It is observed that the conjugacy growth series of the infinite finitary symmetric group with respect to the generating set of transpositions is the generating series of the partition function. Other conjugacy growth series are computed,…
Recently much effort has been made towards the introduction of non-Hermitian random matrix models respecting $PT$-symmetry. Here we show that there is a one-to-one correspondence between complex $PT$-symmetric matrices and split-complex and…
In this paper, we establish a connection between the formalism of $\mathcal{R}$-transforms for non-Hermitian random matrices and the framework of spherical integrals, using the replica method. This connection was previously proved in the…
We provide the missing member of a family of four $q$-series identities related to the modulus 36, the other members having been found by Ramanujan and Slater. We examine combinatorial implications of the identities in this family, and of…
A non-Hermitean random matrix model proposed a few years ago has a remarkably intricate spectrum. Various attempts have been made to understand the spectrum, but even its dimension is not known. Using the Dyson-Schmidt equation, we show…
We propose a novel automata model over the alphabet of rational numbers, which we call register automata over the rationals (RA-Q). It reads a sequence of rational numbers and outputs another rational number. RA-Q is an extension of the…
Tree-based models are often robust to uninformative features and can accurately capture non-smooth, complex decision boundaries. Consequently, they often outperform neural network-based models on tabular datasets at a significantly lower…
The concept of pseudo q-factorization graphs was recently introduced by the last two authors as a combinatorial language which is suited for capturing certain properties of Drinfeld polynomials. Using certain known representation theoretic…
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…
We consider expansions of products of theta-functions associated with arbitrary root systems in terms of nonsymmetric Macdonald polynomials at $t=\infty$ divided by their norms. The latter are identified with the graded characters of…
We study a fragmentation of the $\mathbf p$-trees of Camarri and Pitman [Elect. J. Probab., vol. 5, pp. 1--18, 2000]. We give exact correspondences between the $\mathbf p$-trees and trees which encode the fragmentation. We then use these…
So far, a very large amount of work in Natural Language Processing (NLP) rely on trees as the core mathematical structure to represent linguistic informations (e.g. in Chomsky's work). However, some linguistic phenomena do not cope properly…
We study varieties that contain unranked tree languages over all alphabets. Trees are labeled with symbols from two alphabets, an unranked operator alphabet and an alphabet used for leaves only. Syntactic algebras of unranked tree languages…
Refined versions, analytic and combinatorial, are given for classical integer partition theorems. The examples include the Rogers-Ramanujan identities, the Gollnitz-Gordon identities, Euler's odd=distinct theorem, and the Andrews-Gordon…
We report on findings of a variant of ${\texttt{IdentityFinder}}$ - a Maple program that was used by two of the authors to conjecture several new identities of Rogers-Ramanujan kind. In the present search, we modify the parametrization of…
This article investigates combinatorial properties of non-ambiguous trees. These objects we define may be seen either as binary trees drawn on a grid with some constraints, or as a subset of the tree-like tableaux previously defined by…
We consider the task of learning Ising models when the signs of different random variables are flipped independently with possibly unequal, unknown probabilities. In this paper, we focus on the problem of robust estimation of…
We propose a new formalism for quantum field theory which is neither based on functional integrals, nor on Feynman graphs, but on marked trees. This formalism is constructive, i.e. it computes correlation functions through convergent rather…