Related papers: A Unification of Two Refinements of Euler's Partit…
In this paper, we investigate the combinatorial properties of three classes of integer partitions: (1) $s$-modular partitions, a class consisting of partitions into parts with a number of occurrences (i.e., multiplicity) congruent to $0$ or…
The G\"ollnitz-Gordon-Andrews identities generalize the partition identities discovered independently by H. G\"ollnitz and B. Gordon. In this article, we present a commutative algebra proof of the G\"ollnitz-Gordon-Andrews identities. More…
In this paper, a new expression for the partition function of the generalized Penner model given by Goulden, Harer and Jackson is derived. The Penner and the orthogonal Penner partition functions are special cases of this formula. The…
Partition of unities appear in many places in analysis. Typically they are generated by compactly supported functions with a certain regularity. In this paper we consider partition of unities obtained as integer-translates of entire…
In this paper, we generalize a few important results in Integer Partitions; namely the results known as Stanley's theorem and Elder's theorem, and the congruence results proposed by Ramanujan for the partition function. We generalize the…
We extend the notion of generalized unitarity cuts to accommodate loop integrals with higher powers of propagators. Such integrals frequently arise in for example integration-by-parts identities, Schwinger parametrizations and Mellin-Barnes…
We prove an optimal version of Wigner's unitary-antiunitary theorem. The main tool in our proof is Gleason's theorem.
A recurrent formula is presented, for the enumeration of the compositions of positive integers as sums over multisets of positive integers, that closely resembles Euler's recurrence based on the pentagonal numbers, but where the…
In the present paper we generalize the Eulerian numbers (also of the second and third orders). The generalization is connected with an autonomous first-order differential equation, solutions of which are used to obtain integral…
In two papers, Little and Sellers introduced an exciting new combinatorial method for proving partition identities which is not directly bijective. Instead, they consider various sets of weighted tilings of a $1 \times \infty$ board with…
Viewing optimization methods as numerical integrators for ordinary differential equations (ODEs) provides a thought-provoking modern framework for studying accelerated first-order optimizers. In this literature, acceleration is often…
In a very recent work, G. E. Andrews defined the combinatorial objects which he called {\it singular overpartitions} with the goal of presenting a general theorem for overpartitions which is analogous to theorems of Rogers--Ramanujan type…
Let $P$ be the set of integer partitions and $D$ the subset of those with distinct parts. We extend a correspondence of Burge between partitions and binary words to give encodings of both $D$ and $D$ as words over a $k$-ary alphabet, for…
An algorithm for unification modulo one-sided distributivity is an early result by Tid\'en and Arnborg. More recently this theory has been of interest in cryptographic protocol analysis due to the fact that many cryptographic operators…
We developed a procedure to enumerate complete sets of higher-order unifiers based on work by Jensen and Pietrzykowski. Our procedure removes many redundant unifiers by carefully restricting the search space and tightly integrating decision…
Explicit expressions for restricted partition function $W(s,{\bf d}^m)$ and its quasiperiodic components $W_j(s,{\bf d}^m)$ (called {\em Sylvester waves}) for a set of positive integers ${\bf d}^m = \{d_1, d_2, ..., d_m\}$ are derived. The…
Recently Andrews and Bachraoui proved identities relating certain restricted partitions into distinct even parts with restricted 4-regular partitions by the theory of basic hypergeometric series. They also posed a question regarding…
We start by presenting a generalization of a discrete wave equation that is particularly satisfied by the entries of the matrix coefficients of the refinement equation corresponding to the multiresolution analysis of Alpert. The entries are…
Franklin's identity generalizes Euler's identity and states that the number of partitions of $n$ with $j$ different parts divisible by $r$ equals the number of partitions of $n$ with $j$ repeated parts. In this article, we give a refinement…
A numerical algorithm that computes the decomposition of any finite-dimen\-sio\-nal unitary reducible representation of a compact Lie group is presented. The algorithm, which does not rely on an algebraic insight on the group structure, is…