Related papers: A new partition identity coming from complex dynam…
We offer several new summation identities involving harmonic numbers, odd harmonic numbers, and Fibonacci numbers. Our results are derived using three different approaches: partial summation, polynomial identities and binomial…
We prove an identity for five arguments, valid in the lattice of natural numbers with gcd and lcm as lattice operations. More generally, this identity characterizes arbitrary distributive lattices. Fixing three of the five arguments, we…
Dynamical systems---by which we mean machines that take time-varying input, change their state, and produce output---can be wired together to form more complex systems. Previous work has shown how to allow collections of machines to…
Two new criteria, that involve the microscopic dynamics of the system, are proposed for the identification of clusters in continuum systems. The first one considers a residence time in the definition of the bond between pairs of particles,…
Some applications of a result, which is proved recently, is considered. We first prove three determinantal identities concerning the binomial coefficient and Stirling numbers of the first and the second kind. We also easily obtain the…
Starting from billiard partitions which arose recently in the description of periodic trajectories of ellipsoidal billiards in $d$-dimensional Euclidean space, we introduce a new type of separable integer partition classes, called type B.…
We give a simple statistical proof of a binomial identity, by evaluating the Laplace transform of the maximum of n independent exponential random variables in two different ways. As a by product, we obtain a simple proof of an interesting…
A partition polynomial is a refinement of the partition number p(n) whose coefficients count some special partition statistic. Just as partition numbers have useful asymptotics so do partition polynomials. In fact, their asymptotics…
Utilizing spectral residues of parameterized, recursively defined sequences, we develop a general method for generating identities of composition sums. Specific results are obtained by focusing on coefficient sequences of solutions of first…
An identity involving symmetric sums of regularized multiple zeta-star values of harmonic type was proved by Hoffman. In this paper, we prove an identity of shuffle type. We use Bell polynomials appearing in the study of set partitions to…
All ten symmetry classes of plane partitions that fit in a given box are known to be enumerated by simple product formulas, but there is still no unified proof for all of them. Progress towards this goal can be made by establishing…
We demonstrate that statistics for several types of set partitions are described by generating functions which appear in the theory of integrable equations.
The commutative semiring $\mathbf{D}$ of finite, discrete-time dynamical systems was introduced in order to study their (de)composition from an algebraic point of view. However, many decision problems related to solving polynomial equations…
Given a family of rational curves depending on a real parameter, defined by its parametric equations, we provide an algorithm to compute a finite partition of the parameter space (${\Bbb R}$, in general) so that the shape of the family…
In this paper, we study various classes of partition functions such as those related to the parity of the number of parts, to differences of partition numbers, and to partitions with a repeated smallest part. We establish identities…
Berkovich-Uncu have recently proved a companion of the well-known Capparelli's identities as well as refinements of Savage-Sills' new little G\"ollnitz identities. Noticing the connection between their results and Boulet's earlier…
In 2008, Lehner, Wettig, Guhr and Wei conjectured a power series identity and showed that it implied a determinantal formula for a Bessel-type integral over the unitary supergroup. The integral is the supersymmetric extension of Bessel-type…
In this short note, we give a new Menon-type identity involving the sum of element orders and the sum of cyclic subgroup orders of a finite group. It is based on applying the weighted form of Burnside's lemma to a natural group action.
We give a direct deduction and proof of two identities in the theory of plane partitions. The first one is known to enumerate the traces of plane partitions. The second one comes without any combinatorial interpretation.
We construct a new family of homomorphisms from Specht modules into Foulkes modules for the symmetric group. These homomorphisms are used to give a combinatorial description of the minimal partitions (in the dominance order) which label…