English
Related papers

Related papers: Exotic Bailey-Slater SPT-Functions I: Group A

200 papers

We propose a non-standard separation of variables for the classical integrable XXX and XXZ spin chains with degenerate twist matrix. We show that for the case of such twist matrices one can interchange the role of classical separating…

Mathematical Physics · Physics 2020-06-03 Guido Magnano , Taras Skrypnyk

A generalized Bailey pair, which contains several special cases considered by Bailey (\emph{Proc. London Math. Soc. (2)}, 50 (1949), 421--435), is derived and used to find a number of new Rogers-Ramanujan type identities. Consideration of…

Combinatorics · Mathematics 2018-11-29 Andrew V. Sills

Recently, Amdeberhan and Merca proved some arithmetic properties of the crank parity function $C(n)$ defined as the difference between the number of partitions of $n$ with even cranks and those with odd cranks and the sequence $a(n)$ whose…

Number Theory · Mathematics 2025-09-23 Russelle Guadalupe

In this work we introduce new combinatorial objects called $d$--fold partition diamonds, which generalize both the classical partition function and the partition diamonds of Andrews, Paule and Riese, and we set $r_d(n)$ to be their counting…

Number Theory · Mathematics 2024-05-10 Dalen Dockery , Marie Jameson , James A. Sellers , Samuel Wilson

We study the number $p(n,t)$ of partitions of $n$ with difference $t$ between largest and smallest parts. Our main result is an explicit formula for the generating function $P_t(q) := \sum_{n \ge 1} p(n,t) \, q^n$. Somewhat surprisingly,…

Number Theory · Mathematics 2016-05-10 George E. Andrews , Matthias Beck , Neville Robbins

In Combinatorics Stirling numbers may be defined in several ways. One such definition is given in [1], where an extensive consideration of Stirling numbers is presented. In this paper an alternative definition of Stirling numbers of both…

Combinatorics · Mathematics 2008-06-17 Milan Janjic

We use a q-series identity by Ramanujan to give a combinatorial interpretation of Ramanujan's tau function which involves t-cores and a new class of partitions which we call (m,k)-capsids. The same method can be applied in conjunction with…

Combinatorics · Mathematics 2019-02-22 Frank Garvan , Michael J. Schlosser

We consider a partially asymmetric exclusion process (PASEP) on a finite number of sites with open and directed boundary conditions. Its partition function was calculated by Blythe, Evans, Colaiori, and Essler. It is known to be a…

Combinatorics · Mathematics 2011-01-20 Matthieu Josuat-Vergès

We use the celebrated circle method of Hardy and Ramanujan to develop convergent formulae for counting a restricted class of partitions that arise from the G\"ollnitz--Gordon identities.

Number Theory · Mathematics 2020-05-20 Nicolas Allen Smoot

This paper is concerned with a class of partition functions $a(n)$ introduced by Radu and defined in terms of eta-quotients. By utilizing the transformation laws of Newman, Schoeneberg and Robins, and Radu's algorithms, we present an…

Number Theory · Mathematics 2019-11-19 William Y. C. Chen , Julia Q. D. Du , Jack C. D. Zhao

The study of Ramanujan-type congruences for functions specific to additive number theory has a long and rich history. Motivated by recent connections between divisor sums and overpartitions via congruences in arithmetic progressions, we…

Number Theory · Mathematics 2022-05-12 William Craig , Mircea Merca

Splint of root system for simple Lie algebra appears naturally in studies of (regular) embeddings of reductive subalgebras. Splint can be used to construct branching rules. We demonstrate that splint properties implementation drastically…

Representation Theory · Mathematics 2012-08-09 Vladimir Laykhovsky , Anton Nazarov

We obtain a finite analogue of a recent generalization of an identity in Ramanujan's Notebooks. Differentiating it with respect to one of the parameters leads to a result whose limiting case gives a finite analogue of Andrews' famous…

Number Theory · Mathematics 2018-12-05 Atul Dixit , Pramod Eyyunni , Bibekananda Maji , Garima Sood

A new combinatorial object is introduced, the part-frequency matrix sequence of a partition, which is elementary to describe and is naturally motivated by Glaisher's bijection. We prove results that suggest surprising usefulness for such a…

Combinatorics · Mathematics 2016-01-06 William J. Keith

In this paper, by virtue of a determinantal formula for derivatives of the ratio between two differentiable functions, in view of the Fa\`a di Bruno formula, and with the help of several identities and closed-form formulas for the partial…

Combinatorics · Mathematics 2025-04-25 Feng Qi

One of the main purposes of this article is to give functional equations and differential equations between Bernstein basis functions and generating functions of B-spline curves. Using these equations, very useful formulas containing the…

Classical Analysis and ODEs · Mathematics 2024-01-09 Yilmaz Simsek

We present a construction of partial spread bent functions using subspaces generated by linear recurring sequences (LRS). We first show that the kernels of the linear mappings defined by two LRS have a trivial intersection if and only if…

Cryptography and Security · Computer Science 2021-12-17 Maximilien Gadouleau , Luca Mariot , Stjepan Picek

We prove formulas for the generating functions for M_2-rank differences for partitions without repeated odd parts. These formulas are in terms of modular forms and generalized Lambert series.

Number Theory · Mathematics 2021-02-03 Jeremy Lovejoy , Robert Osburn

While examples of Ramanujan-type congruences are amply available via their relation to Hecke operators, it remains unclear which of them should be considered of combinatorial origin and which of them are mere artifacts of the connection…

Number Theory · Mathematics 2024-04-04 Martin Raum

Partition functions of certain classes of "spin glass" models in statistical physics show strong connections to combinatorial graph invariants. Also known as homomorphism functions they allow for the representation of many such invariants,…

Computational Complexity · Computer Science 2010-04-08 Marc Thurley
‹ Prev 1 3 4 5 6 7 10 Next ›