Displaying 901 – 920 of 1340

Showing per page

The spt-crank for overpartitions

Frank G. Garvan, Chris Jennings-Shaffer (2014)

Acta Arithmetica

Bringmann, Lovejoy, and Osburn (2009, 2010) showed that the generating functions of the spt-overpartition functions s p t ¯ ( n ) , s p t ¯ 1 ( n ) , s p t ¯ 2 ( n ) , and M2spt(n) are quasimock theta functions, and satisfy a number of simple Ramanujan-like congruences. Andrews, Garvan, and Liang (2012) defined an spt-crank in terms of weighted vector partitions which combinatorially explain simple congruences modulo 5 and 7 for spt(n). Chen, Ji, and Zang (2013) were able to define this spt-crank in terms of ordinary partitions. In this...

The strongly perfect lattices of dimension 10

Gabriele Nebe, Boris Venkov (2000)

Journal de théorie des nombres de Bordeaux

This paper classifies the strongly perfect lattices in dimension 10 . There are up to similarity two such lattices, K 10 ' and its dual lattice.

The structure of digraphs associated with the congruence x k y ( mod n )

Lawrence Somer, Michal Křížek (2011)

Czechoslovak Mathematical Journal

We assign to each pair of positive integers n and k 2 a digraph G ( n , k ) whose set of vertices is H = { 0 , 1 , , n - 1 } and for which there is a directed edge from a H to b H if a k b ( mod n ) . We investigate the structure of G ( n , k ) . In particular, upper bounds are given for the longest cycle in G ( n , k ) . We find subdigraphs of G ( n , k ) , called fundamental constituents of G ( n , k ) , for which all trees attached to cycle vertices are isomorphic.

Currently displaying 901 – 920 of 1340