Related papers: (-1)-enumeration of plane partitions with compleme…
Within the framework of unitary easy quantum groups, we study an analogue of Brauer's Schur-Weyl approach to the representation theory of the orthogonal group. We consider concrete combinatorial categories whose morphisms are formed by…
We present a semi-numerical method to compute one-loop corrections to processes involving many particles. We treat in detail cases with up to five external legs and massless internal propagators, although the method is more general.
We give a complete classification of the unique path partitions and study congruence properties of the function which enumerates such partitions.
We consider supersymmetric theories on a space with compact space-like slices. One can count BPS representations weighted by (-1)^F, or, equivalently, study supersymmetric partition functions by compactifying the time direction. A special…
We show how to compute the exact partition function for lattice statistical-mechanical models whose Boltzmann weights obey a special "crossing" symmetry. The crossing symmetry equates partition functions on different trivalent graphs,…
It is shown that the descending plane partitions of Andrews can be geometrically realized as cyclically symmetric rhombus tilings of a certain hexagon where an equilateral triangle of side length 2 has been removed from its centre. Thus,…
We formulate and prove a weighted version of Zariski's hyperplane section theorem on the topological fundamental groups of the complements of hypersurfaces in a projective space. As an application, we calculate fundamental groups of the…
The method of graphical vertex-condensation for enumerating perfect matchings of plane bipartite graph was found by Propp (Theoret. Comput. Sci. 303(2003), 267-301), and was generalized by Kuo (Theoret. Comput. Sci. 319 (2004), 29-57) and…
We introduce a combinatorial characterization of simpliciality for arrangements of hyperplanes. We then give a sharp upper bound for the number of hyperplanes of such an arrangement in the projective plane over a finite field, and present…
The quantum rotor is shown to be supersymmetric. The supercharge $Q$, whose square equals the Hamiltonian, is constructed with reflection operators. The conserved quantities that commute with $Q$ form the algebra $so(3)_{-1}$, an…
We present an infinite family of recursive formulas that count binary integer partitions satisfying natural divisibility conditions and show that these counts are interrelated via partial sums. Moreover, we interpret the partitions we study…
We consider partial sum rules for the homogeneous limit of the solution of the q-deformed Knizhnik--Zamolodchikov equation with reflecting boundaries in the Dyck path representation. We show that these partial sums arise in a solution of…
Enumeration algorithms have been one of recent hot topics in theoretical computer science. Different from other problems, enumeration has many interesting aspects, such as the computation time can be shorter than the total output size, by…
For every linear binary code $C$, we construct a geometric triangular configuration $\Delta$ so that the weight enumerator of $C$ is obtained by a simple formula from the weight enumerator of the cycle space of $\Delta$. The triangular…
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…
Nice formulae for plane partitions with bounded size of parts (or boxed plane partitions), which generalize the norm-trace generating function by Stanley and the trace generating function by Gansner, are exhibited. The derivation of the…
This article presents new enumerative results related to symmetric planar maps. In the first part a new way of enumerating rooted simple quadrangulations and rooted simple triangulations is presented, based on the description of two…
This article examines noncrossing partitions of the unit circle in the complex plane; we call these continuous noncrossing partitions. More precisely, we focus on the degree-$d$ continuous noncrossing partitions where unit complex numbers…
Moser asked whether the collection of rectangles of dimensions 1 x 1/2, 1/2 x 1/3, 1/3 x 1/4, ..., whose total area equals 1, can be packed into the unit square without overlap, and whether the collection of squares of side lengths 1/2,…
Inspired by earlier works on representations of the Temperley-Lieb algebra we introduce a novel family of representations of the algebra. This may be seen as a generalization of the so called asymmetric twin representation. The underlying…