Related papers: Simple proofs and expressions for the restricted p…
Presented are polynomial identities which imply generalizations of Euler and Rogers--Ramanujan identities. Both sides of the identities can be interpreted as generating functions of certain restricted partitions. We prove the identities by…
We determine the structure of the partition algebra $P_n(Q)$ (a generalized Temperley-Lieb algebra) for specific values of $Q \in \C$, focusing on the quotient which gives rise to the partition function of $n$ site $Q$-state Potts models…
We show that, for any fixed genus $g$, the ordinary generating function for the genus $g$ partitions of an $n$-element set into $k$ blocks is algebraic. The proof involves showing that each such partition may be reduced in a unique way to a…
Partition functions of a canonical ensemble of non-interacting bound electrons are a key ingredient of the super-transition-array approach to the computation of radiative opacity. A few years ago, we published a robust and stable recursion…
In this paper, we derive some formulae involving coefficients of polynomials which occur quite naturally in the study of restricted partitions. Our method involves a recently discovered sieve technique by Li and Wan (Sci. China. Math.…
We prove lower bounds on the length of regular expressions for finite languages by methods from arithmetic circuit complexity. First, we show a reduction: the length of a regular expression for a language $L\subseteq \{0,1\}^n$ is bounded…
A formula for calculating Extensions of (mainly integral) Polynomial Functors is established, based upon projective resolutions. Sample computations are performed, which, in particular, exhibit a surprising non-trivial extension of Divided…
This paper studies the restriction multiplicities of half-diagram modules for the partition algebra and their geometric interpretations. By specializing the Bowman-De Visscher-Orellana formula [BVC, Theorem 4.3] for restriction…
In this paper we show how to construct a regular, non commutative Cauchy kernel for slice regular quaternionic functions. We prove an (algebraic) representation formula for such functions, which leads to a new Cauchy formula. We find the…
How to handle division in systems that compute with logical formulas involving what would otherwise be polynomial constraints over the real numbers is a surprisingly difficult question. This paper argues that existing approaches from both…
We obtain recurrences for smallest parts functions which resemble Euler's recurrence for the ordinary partition function. The proofs involve the holomorphic projection of non-holomorphic modular forms of weight 2.
For a subset $\mathcal A\subset \mathbb N$, let $p_{\mathcal A}(n)$ denote the restricted partition function which counts partitions of $n$ with all parts lying in $\mathcal A$. In this paper, we use a variation of the Hardy-Littlewood…
A slice decomposition is an expression of a homogeneous polynomial as a sum of forms with a linear factor. A strength decomposition is an expression of a homogeneous polynomial as a sum of reducible forms. The slice rank and strength of a…
We present some Euler-type recurrences for the partition function $p(n)$.
We obtain formulas for the coefficients of positive and negative powers of a partial theta function.
The number of parts in the partitions (resp. distinct partitions) of $n$ with parts from a set were considered. Its generating functions were obtained. Consequently, we derive several recurrence identities for the following functions: the…
Probabilistic argumentation allows reasoning about argumentation problems in a way that is well-founded by probability theory. However, in practice, this approach can be severely limited by the fact that probabilities are defined by adding…
For a class of random partitions of an infinite set a de Finetti-type representation is derived, and in one special case a central limit theorem for the number of blocks is shown.
We prove some distribution results for the $k$-fold divisor function in arithmetic progressions to moduli that exceed the square-root of length $X$ of the sum, with appropriate constrains and averaging on the moduli, saving a power of $X$…
We give a short direct proof of Agler's factorization theorem that uses the abstract characterization of operator algebras. the key ingredient of this proof is an operator algebra factorization theorem. Our proof provides some additional…