112 search results - page 17 / 23 » On the Homological Dimension of Lattices |
JSYML
2010
13 years 5 months ago
2010
Let M = M, +, <, 0, S be a linear o-minimal expansion of an ordered group, and G = G, ⊕, eG an n-dimensional group definable in M. We show that if G is definably connected w...
CALC
2001
Springer
13 years 11 months ago
2001
Springer
We show that a positive definite integral ternary form can be reduced with O(M(s) log2 s) bit operations, where s is the binary encoding length of the form and M(s) is the bit-com...
DCG
2007
13 years 6 months ago
2007
In this paper we investigate the Erd¨os/Falconer distance conjecture for a natural class of sets statistically, though not necessarily arithmetically, similar to a lattice. We pr...
SIROCCO
2008
13 years 8 months ago
2008
: A distributed system is scalable if the rate at which it completes its computation and communication tasks does not depend on its size. As an example, the scalability of a peer-t...
CORR
2011
Springer
13 years 1 months ago
2011
Springer
The Helly number of a family of sets with empty intersection is the size of its largest inclusionwise minimal sub-family with empty intersection. Let F be a finite family of open...