======================================================================
Título: No Few Grid-Points in Spaces of Small Dimension
Palestrante: Hanno Lefmann (TU Chemnitz - Alemanha)
Data: sexta, 5 de setembro de 2008, 14:00
Local: Anfiteatro do NUMEC
======================================================================
Resumo:
Motivated by a question raised by Pór and Wood in connection with
compact embeddings of graphs in Z^d, we investigate generalizations
of the no-three-in-line-problem. For several triples (d,k,l) we give
algorithmic or probabilistic lower, and upper bounds on the largest
sizes of subsets S of grid-points in the d-dimensional
(T x ... x T)-grid, where T is large and no l distinct grid-points
of S are contained in a k-dimensional affine or linear subspace.
======================================================================
Seminário de Teoria da Computação e Combinatória (05/SET)
por José Coelho de Pina -
Número de respostas: 0