Forniamo un calcolo esplicito della funzione di partizione di Kostant per algebre di Lie complesse di rango . La tecnica principale consiste nella riduzione a casi più semplici ed all'uso di funzioni generatrici.
We find an improvement to Huxley and Konyagin’s current lower bound for the number of circles passing through five integer points. We conjecture that the improved lower bound is the asymptotic formula for the number of circles passing through five integer points. We generalise the result to circles passing through more than five integer points, giving the main theorem in terms of cyclic polygons with m integer point vertices. Theorem. Let m ≥ 4 be a fixed integer. Let be the number of cyclic polygons...
We provide combinatorial interpretations for three new classes of partitions, the so-called chromatic partitions. Using only combinatorial arguments, we show that these partition identities resemble well-know ordinary partition identities.