Related papers: Further results on bent partitions
Let \pi be a partition. In [2] we defined BG-rank(\pi) as an alternating sum of parities of parts. This statistic was employed to generalize and refine the famous Ramanujan modulo 5 partition congruence. Let p_j(n)(a_{t,j}(n)) denote a…
A conjecture by Sun states that the partition function $p(n)$, for $n>1$, is never a perfect power. Recent work by Merca et al. proposes generalizations of perfect-power repulsion for $p(n)$. In this note, we prove these generalizations for…
Let $V$ be a representation of the modular group $\Gamma$ of dimension $p$. We show that the $\mathbb{Z}$-graded space $\mathcal{H}(V)$ of holomorphic vector-valued modular forms associated to $V$ is a free module of rank $p$ over the…
We develop the theory of weighted P-partitions, which generalises the theory of P-partitions from labelled posets to weighted labelled posets. We define the related generating functions in the natural way and compute their product,…
Tent spaces of vector-valued functions were recently studied by Hyt\"onen, van Neerven and Portal with an eye on applications to H^\infty-functional calculi. This paper extends their results to the endpoint cases p = 1 and p = \infty along…
To construct a BPS algebra with representations furnished by n-dimensional partitions, the first step is to find the eigenvalues of the Cartan operators acting on them. The generating function of the eigenvalues is called the charge…
Let $h^\infty_v$ be the class of harmonic functions in the unit disk which admit a two-sided radial majorant $v(r)$. We consider functions $v $ that fulfill a doubling condition. We characterize functions in $h^\infty_v$ that are…
The conventional definition of a depth function is vector-based. In this paper, a novel projection depth (PD) technique directly based on tensors, such as matrices, is instead proposed. Tensor projection depth (TPD) is still an ideal depth…
Bernoulli-$p$ thinning has been well-studied for point processes. Here we consider three other cases: (1) sequences $(X_1,X_2,...)$; (2) gaps of such sequences $(X_{n+1}-X_1)_{n\in\mathbb{N}}$; (3) partition structures. For the first case…
The partition function $ p_{[1^c11^d]}(n)$ can be defined using the generating function, \[\sum_{n=0}^{\infty}p_{[1^c{11}^d]}(n)q^n=\prod_{n=1}^{\infty}\dfrac{1}{(1-q^n)^c(1-q^{11 n})^d}.\] In this paper, we prove infinite families of…
The Fibonacci cube $\Gamma_n$ is the subgraph of the hypercube $Q_n$ induced by vertices with no consecutive 1s. We study a one parameter generalization, p-th order Fibonacci cubes $\Gamma^{(p)}_n$, which are subgraphs of $Q_n$ induced by…
Recent results by Andrews and Merca on the number of even parts in all partitions of n into distinct parts, a(n), were derived via generating functions. This paper extends these results to the number of parts divisible by k in all the…
The partition algebras are algebras of diagrams (which contain the group algebra of the symmetric group and the Brauer algebra) such that the multiplication is given by a combinatorial rule and such that the structure constants of the…
For every finite simple connected graph $G = (V,E)$, we introduce an invariant, its blowup-polynomial $p_G(\{ n_v : v \in V \})$. This is obtained by dividing the determinant of the distance matrix of its blowup graph $G[{\bf n}]$…
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…
The discrete logarithm is a problem that surfaces frequently in the field of cryptography as a result of using the transformation g^a mod n. This paper focuses on a prime modulus, p, for which it is shown that the basic structure of the…
The diagonalization of Hermitian supermatrices is studied. Such a change of coordinates is inevitable to find certain structures in random matrix theory. However it still poses serious problems since up to now the calculation of all…
An internal partition of an $n$-vertex graph $G=(V,E)$ is a partition of $V$ such that every vertex has at least as many neighbors in its own part as in the other part. It has been conjectured that every $d$-regular graph with $n>N(d)$…
The $p$-ary function $f(x)$ mapping $\mathrm{GF}(p^{4k})$ to $\mathrm{GF}(p)$ given by $f(x)={\rm Tr}_{4k}\big(x^{p^{3k}+p^{2k}-p^k+1}+x^2\big)$ is proven to be a weakly regular bent function and the exact values of its Walsh transform…
We introduce a rigorous arithmetic--spectral construction associating planar geometric objects with additive prime factor statistics. Let $\mathrm{sopfr}(n)$ denote the sum of prime factors of $n$, counted with multiplicity, and define the…