Buscar
Mostrando ítems 21-30 de 518
Almost partitioning 2-edge-colourings of 3-uniform hypergraphs with two monochromatic tight cycles
(Elsevier B.V., 2017)
We show that any 2-colouring of the 3-uniform complete hypergraph Kn (3) on n vertices contains two disjoint monochromatic tight cycles of distinct colours covering all but o(n) vertices of Kn (3). The same result holds ...
A family of partition identities proved combinatorially
(Kluwer Academic PublDordrechtHolanda, 2000)
A new approach and generalizations to some results about mock theta functions
(Elsevier Science BvAmsterdamHolanda, 2011)
THE PARTITION-FUNCTION FOR AN ANYON-LIKE OSCILLATOR
(Iop Publishing Ltd, 1995-01-07)
We compute the partition function of an anyon-like harmonic oscillator. The well known results for both the bosonic and fermionic oscillators are then re-obtained as particular cases of our function. The technique we employ ...
THE PARTITION-FUNCTION FOR AN ANYON-LIKE OSCILLATOR
(Iop Publishing Ltd, 1995-01-07)
We compute the partition function of an anyon-like harmonic oscillator. The well known results for both the bosonic and fermionic oscillators are then re-obtained as particular cases of our function. The technique we employ ...
Formulations and valid inequalities for the node capacitated graph partitioning problem
(SpringerNew YorkEUA, 1996)
A formulation of the wide partition conjecture using the atom problem in discrete tomography
(Elsevier, 2014)
The Wide Partition Conjecture (WPC) was introduced by Chow and Taylor as an attempt to prove inductively Rota's Basis Conjecture, and in the simplest case tries to characterize partitions whose Young diagram admits a "Latin" ...