相关论文: Particle content of the (k,3)-configurations
We study partitions of complex numbers as sums of non-negative powers of a fixed algebraic number $\beta$. We prove that if $\beta$ is real quadratic, then the number of partitions is always finite if and only if some conjugate of $\beta$…
Raimi's theorem guarantees the existence of a partition of $\mathbb{N}$ into two parts with an unavoidable intersection property: for any finite coloring of $\mathbb{N}$, some color class intersects both parts infinitely many times, after…
The arithmetic properties of the ordinary partition function $p(n)$ have been the topic of intensive study for the past century. Ramanujan proved that there are linear congruences of the form $p(\ell n+\beta)\equiv 0\pmod\ell$ for the…
Explicit expressions for restricted partition function $W(s,{\bf d}^m)$ and its quasiperiodic components $W_j(s,{\bf d}^m)$ (called Sylvester waves) for a set of positive integers ${\bf d}^m = \{d_1, d_2, ..., d_m\}$ are derived. The…
Let $p$ be a prime, $m$ be a positive integer ( $m \geq 1$, and $m \geq 2$ if $p=2$), and $\chi_n$ be a multiplicative complex character on $\mathbb F^*_{p^m}$ with order $n| (p^m-1)$. We show that a partition $\mathcal A_1 \cup \mathcal…
For a polynomial f: {-1, 1}^n --> C, we define the partition function as the average of e^{lambda f(x)} over all points x in {-1, 1}^n, where lambda in C is a parameter. We present a quasi-polynomial algorithm, which, given such f, lambda…
The final (third) part of the theory gives the results of numerical calculations according to the formulas derived in the previous two parts. Also the comparison with the already published theories is given. Some conclusions connected with…
Combinatorial number system represents a non-negative natural numbers as sum of binomial coefficients. This paper presents an induction proof that there exists unique representation of every non-negative natural number $m$ as sum of $r$…
A semiorder is a partially ordered set $P$ with two certain forbidden induced subposets. This paper establishes a bijection between $n$-element semiorders of length $H$ and $(n+1)$-node ordered trees of height $H+1$. This bijection…
Let $k$ be a natural number and let $c=2.134693\ldots$ be the unique real solution of the equation $2c=2+\log (5c-1)$ in $[1,\infty)$. Then, when $s\ge ck+4$, we establish an asymptotic lower bound of the expected order of magnitude for the…
Even though weight multiplicity formulas, such as Kostant's formula, exist their computational use is extremely cumbersome. In fact, even in cases when the multiplicity is well understood, the number of terms considered in Kostant's formula…
Set partitions avoiding $k$-crossing and $k$-nesting have been extensively studied from the aspects of both combinatorics and mathematical biology. By using the generating tree technique, the obstinate kernel method and Zeilberger's…
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 present a self-contained theory for the exact calculation of particle number counting statistics of non-interacting indistinguishable particles in the canonical ensemble. This general framework introduces the concept of auxiliary…
Following the method of combinatorial telescoping for alternating sums given by Chen, Hou and Mu, we present a combinatorial telescoping approach to partition identities on sums of positive terms. By giving a classification of the…
Different ways of representing the group $SU(3)$ within a Geometric Algebra approach are explored. As part of this we consider characteristic multivectors for $SU(3)$, and how these are linked with decomposition of generators into commuting…
In this paper, we use a branch of polyhedral geometry, Ehrhart theory, to expand our combinatorial understanding of congruences for partition functions. Ehrhart theory allows us to give a new decomposition of partitions, which in turn…
Let $\mathfrak{g}$ be a finite-dimensional simple complex Lie algebra. A layer sum is introduced as the sum of formal exponentials of the distinct weights appearing in an irreducible $\mathfrak{g}$-module. It is argued that the character of…
We show that, for all positive integers $n_1, \ldots, n_m$, $n_{m+1}=n_1$, and any non-negative integers $j$ and $r$ with $j\leqslant m$, the expression $$ \frac{1}{[n_1]}{n_1+n_{m}\brack n_1}^{-1}…
We solve the N-body Calogero problem, \ie N particles in 1 dimension subject to a two-body interaction of the form $\half \sum_{i,j}[ (x_i - x_j)^2 + g/ {(x_i - x_j)^2}]$, by constructing annihilation and creation operators of the form $…