Related papers: Particle content of the (k,3)-configurations
Number partitioning is an NP-complete problem of combinatorial optimization. A statistical mechanics analysis reveals the existence of a phase transition that separates the easy from the hard to solve instances and that reflects the…
The discrete acyclic convolution computes the 2n-1 sums sum_{i+j=k; (i,j) in [0,1,2,...,n-1]^2} (a_i b_j) in O(n log n) time. By using suitable offsets and setting some of the variables to zero, this method provides a tool to calculate all…
Given an integer partition $\la=(\la_1, ..., \la_\ell)$ and an integer k, denote by $\la^{(k)}$ the sequence of length $\ell$ obtained by reordering the values $|\la_i-k|$ in non-increasing order. If $\la$ dominates $\mu$ and has the same…
The M(3,p) minimal models are reconsidered from the point of view of the extended algebra whose generators are the energy-momentum tensor and the primary field \phi_{2,1} of dimension $(p-2)/4$. Within this framework, we provide a…
Let $\alpha_k(\lambda)$ denote the number of $k$-hooks in a partition $\lambda$ and let $b(n,k)$ be the maximum value of $\alpha_k(\lambda)$ among partitions of $n$. Amdeberhan posed a conjecture on the generating function of $b(n,1)$. We…
A quantum mechanics representation based on position ($\vec{r}$), linear momentum($\vec{p}$) and energy($E$) eigenvalues is presented here. A set of equations, explicitly independent on wave function, was derived relating these observables.…
A $\Bbbk$-configuration is a set of points $\mathbb{X}$ in $\mathbb{P}^2$ that satisfies a number of geometric conditions. Associated to a $\Bbbk$-configuration is a sequence $(d_1,\ldots,d_s)$ of positive integers, called its type, which…
Define a "nuclear partition" to be an integer partition with no part equal to one. In this study we prove a simple formula to compute the partition function $p(n)$ by counting only the nuclear partitions of $n$, a vanishingly small subset…
In current simulations of fission, the number of protons and neutrons in a given fission fragment is almost always obtained by integrating the total density of particles in the sector of space that contains the fragment. Because of the…
In this paper, we connect two types of representations of a permutation $\sigma$ of the finite field $\F_q$. One type is algebraic, in which the permutation is represented as the composition of degree-one polynomials and $k$ copies of…
Let $a_1,a_2,\dots,a_k$ be positive integers with $\gcd(a_1,a_2,\dots,a_k)=1$. Frobenius number is the largest positive integer that is NOT representable in terms of $a_1,a_2,\dots,a_k$. When $k\ge 3$, there is no explicit formula in…
In this paper, we give a purely bijective proof that two different partition classes that are both combinatorial interpretations of the partition function $p_\nu(n)$, a partition function related to the third order mock theta function…
Complete energy spectrum is obtained for the quantum mechanical problem of N one dimensional equal mass particles interacting via potential $$V(x_1,x_2,...,x_N) = g\sum^N_{i < j}{1\over (x_i-x_j)^2} - {\alpha\over \sqrt{\sum_{i < j}…
We study a model of quantum mechanical fermions with matrix-like index structure (with indices $N$ and $L$) and quartic interactions, recently introduced by Anninos and Silva. We compute the partition function exactly with $q$-deformed…
In the model every quark or lepton is identified with a quartet of four "more elementary" particles. One particle in a quartet is a massive spin-0 boson and other three particles are massless spin-1/2 fermions.
The partition functions $P(n,m,p)$, the number of integer partitions of $n$ into exactly $m$ parts with each part at most $p$, and $Q(n,m,p)$, the number of integer partitons of $n$ into exactly $m$ distinct parts with each part at most…
The plethysm coefficient $p(\nu, \mu, \lambda)$ is the multiplicity of the Schur function $s_\lambda$ in the plethysm product $s_\nu \circ s_\mu$. In this paper we use Schur--Weyl duality between wreath products of symmetric groups and the…
In this note, we consider ordered partitions of integers such that each entry is no more than a fixed portion of the sum. We give a method for constructing all such compositions as well as both an explicit formula and a generating function…
A bijective proof is given for the following theorem: the number of compositions of n into odd parts equals the number of compositions of n + 1 into parts greater than one. Some commentary about the history of partitions and compositions is…
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…