English
Related papers

Related papers: Generating functions for compositions with constra…

200 papers

For use in calculating higher-order coherent- and squeezed- state quantities, we derive generalized generating functions for the Hermite polynomials. They are given by $\sum_{n=0}^{\infty}z^{jn+k}H_{jn+k}(x)/(jn+k)!$, for arbitrary integers…

Quantum Physics · Physics 2009-10-28 Michael Martin Nieto , D. Rodney Truax

A set $A$ of integers is called total if there is an algorithm which, given an enumeration of $A$, enumerates the complement of $A$, and called cototal if there is an algorithm which, given an enumeration of the complement of $A$,…

Logic · Mathematics 2017-02-10 Takayuki Kihara

Let $n$ and $t$ be positive integers with $t\geq 2$. Let $R_t(n)$ be the number of $t$-regular partitions of $n$. A class of functions, denoted $\tau_k(n)$, is defined as follows:…

Number Theory · Mathematics 2025-10-01 S. Sriram , A. David Christopher

Integer partitions may be encoded as either ascending or descending compositions for the purposes of systematic generation. Many algorithms exist to generate all descending compositions, yet none have previously been published to generate…

Data Structures and Algorithms · Computer Science 2014-05-05 Jerome Kelleher , Barry O'Sullivan

Let $n$ and $k$ be positive integers, and $f_n(k)$ (resp. $g_n(k)$) be the number of unital subrings (resp. unital irreducible subrings) of $\mathbb{Z}^n$ of index $k$. The numbers $f_n(k)$ are coefficients of certain zeta functions of…

Number Theory · Mathematics 2022-12-01 Hrishabh Mishra , Anwesh Ray

A random composition of $n$ appears when the points of a random closed set $\widetilde{\mathcal{R}}\subset[0,1]$ are used to separate into blocks $n$ points sampled from the uniform distribution. We study the number of parts $K_n$ of this…

Probability · Mathematics 2007-05-23 Alexander Gnedin , Jim Pitman , Marc Yor

QCD equations for generating functionals are solved at coinciding momenta of particles. As a result, the relations for $q$-particle correlation functions at equal momenta are obtained. They are directly connected to previously derived…

High Energy Physics - Phenomenology · Physics 2016-09-01 I. M. DREMIN

The generating function for the number of purely crossing partitions of {1,...,n} is found in terms of the generating function for Bell numbers. Further results about generating functions for asymptotic moments of certain random Vandermonde…

Combinatorics · Mathematics 2016-02-16 Kenneth J. Dykema

In this paper, we are interested in the moments of the characteristic polynomial $Z_n(x)$ of the $n\times n$ permutation matrices with respect to the uniform measure. We use a combinatorial argument to write down the generating function of…

Probability · Mathematics 2010-07-14 Dirk Zeindler

Let V be an infinite matrix with rows and columns indexed by the positive integers, and entries in a field F. Suppose that v_{i,j} only depends on i-j and is 0 for |i-j| large. Then V^n is defined for all n, and one has a "generating…

Combinatorics · Mathematics 2009-06-11 Paul Monsky

In this paper, we study the weighted composition operator on the Fock space $\mf$ of slice regular functions. First, we characterize the boundedness and compactness of the weighted composition operator. Subsequently, we describe all the…

Functional Analysis · Mathematics 2018-03-20 Pan Lian , Yu-Xia Liang

MacMahon showed that the generating function for partitions into at most $k$ parts can be decomposed into a partial fractions-type sum indexed by the partitions of $k$. In this present work, a generalization of MacMahon's result is given,…

Combinatorics · Mathematics 2019-12-23 Andrew V. Sills

We analyze the combinatorics behind the operation of taking the logarithm of the generating function $G_k$ for $k^\text{th}$ generalized Catalan numbers. We provide combinatorial interpretations in terms of lattice paths and in terms of…

Combinatorics · Mathematics 2025-07-02 Sabine Jansen , Leonid Kolesnikov

We show that the compositions of positive integers may be interpreted in terms of powers of some power series, over arbitrary commutative ring. As consequences, several closed formulas for the compositions as well as for the generalized…

Combinatorics · Mathematics 2010-11-03 Milan Janjic

Random matrix products arise in many science and engineering problems. An efficient evaluation of its growth rate is of great interest to researchers in diverse fields. In the current paper, we reformulate this problem with a generating…

Statistical Mechanics · Physics 2019-11-04 Naranmandula Bao , Junbiao Lu , Yueheng Lan

In this paper we study algebraic and asymptotic properties of generating sets of algebras over orders in number fields. Let $A$ be an associative algebra over an order $R$ in an algebraic number field. We assume that $A$ is a free…

Rings and Algebras · Mathematics 2010-01-19 Rostyslav V. Kravchenko , Marcin Mazur , Bogdan V. Petrenko

The understanding of complex quantum many-body systems has been vastly boosted by tensor network (TN) methods. Among others, excitation spectrum and long-range interacting systems can be studied using TNs, where one however confronts the…

Strongly Correlated Electrons · Physics 2021-05-31 Wei-Lin Tu , Huan-Kuang Wu , Norbert Schuch , Naoki Kawashima , Ji-Yao Chen

The subject of this paper are operators represented on a Fock space which act only on the two leading components of the tensor. We unify the constructions from arXiv:math/0702158, arXiv:0709.4334, arXiv:0812.0895, and arXiv:1003.2998, and…

Operator Algebras · Mathematics 2026-01-14 Michael Anshelevich , Jacob Mashburn

We study the existence of the product of two weighted modulation spaces. For this purpose we discuss two different strategies. The more simple one allows transparent proofs in various situations. However, our second method allows a closer…

Functional Analysis · Mathematics 2016-02-02 Maximilian Reich , Winfried Sickel

Given $\pi \in S_n$, let $Z_{n,k}(\pi)=\sum_{1\leq i_1<\dots<i_k\leq n} \mathbf{1}(\{ \pi_{i_1}<\dots<\pi_{i_k}\}$ denote the number of increasing subsequences of length $k$. Consider the "generalized Ulam problem," studying the…

Combinatorics · Mathematics 2025-05-21 Samen Hossein , Shannon Starr