Related papers: Equivariant Euler characteristics of partition pos…

In this paper, we obtain upper and lower bounds for the partition function $p(n)$ by using an elementary geometric inequality in Euclidean space, and we extend the method to generalizations of the partition function.

It is well known that ascents, descents and plateaux are equidistributed over the set of classical Stirling permutations. Their common enumerative polynomials are the second-order Eulerian polynomials, which have been extensively studied by…

By the work of J.Huh, one can interpret binomial coefficients as a solution to an intersection problem on a permutohedral variety $X_E$. Applying Hirzebruch-Riemann-Roch, this intersection problem is equivalent to computing Euler…

In this paper, we give a conjecture, which generalises Euler's partition theorem involving odd parts and different parts for all moduli. We prove this conjecture for two family partitions. We give $q$-difference equations for the related…

Given a unitary representation U of a compact group G and a transitive G-space $\Omega$, we characterize the extremal elements of the convex set of all U-covariant positive operator valued measures.

We use the compression theorem (arxiv:math.GT/9712235) cf section 7, to prove results for equivariant configuration spaces analogous to the well-known non-equivariant results of May, Milgram and Segal.

According to Euler's relation any polytope P has as many faces of even dimension as it has faces of odd dimension. As a generalization of this fact one can compare the number of faces whose dimension is congruent to i modulo m with the…

In this paper, we investigate the notion of partition of a finite partially ordered set (poset, for short). We will define three different notions of partition of a poset, namely, monotone, regular, and open partition. For each of these…

We develop a polynomial analogue of Meinardus' Thoerem for bivariate Euler products and apply it to the study of complex multiplicatively weighted partitions.

Let p(n, k) denote the number of partitions of n into parts less than or equal to k. We show several properties of this function modulo 2. First, we prove that for fixed positive integers k and m, p(n,k) is periodic modulo m. Using this, we…

We consider sequences of integers defined by a system of linear inequalities with integer coefficients. We show that when the constraints are strong enough to guarantee that all the entries are nonnegative, the generating function for the…

We introduce a new type of partitions that consists of partitions whose different parts alternate in parity (e.g., $3+2+2+1+1$). Various properties of this partition function are studied. In particular, we obtain its asymptotic behavior by…

In this article, we show how the finding the number of partitions of same size of a positive integer show up in caching networks. We present a stochastic model for caching where user requests (represented with positive integers) are a…

In this paper we use Euler-Seidel matrices method to find out some properties of exponential and geometric polynomials and numbers. Some known results are reproved and some new results are obtained.

We consider $\mathcal{N}=2$ supersymmetric pure gauge theories on toric K\"ahler manifolds, with particular emphasis on $\mathbb{CP}^2$. By choosing a vector generating a $U(1)$ action inside the torus of the manifold, we construct…

The interval poset of a permutation catalogues the intervals that appear in its one-line notation, according to set inclusion. We study this poset, describing its structural, characterizing, and enumerative properties.

Let $p_n$ be the number of partitions of an integer $n$. For each of the partition statistics of counting their parts, ranks, or cranks, there is a natural family of integer polynomials. We investigate their asymptotics and the limiting…

An equivariant characteristic quasi-polynomial is a quasi-polynomial in $q$ consisting of the permutation character on the mod $q$ complement of the corresponding Coxeter arrangement. This concept is a refinement of the conventional…

A poset $\mathbf{P} = (X,\preceq)$ is {\em $m$-partite} if $X$ has a partition $X = X_1 \cup ... \cup X_m$ such that (1) each $X_i$ forms an antichain in $\mathbf{P}$, and (2) $x\prec y$ implies $x\in X_i$ and $y\in X_j$ where $i<j$. In…

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…