Skip to main content
SpringerLink
Log in

Combinatorial Problems in Infinite Spaces

  • Published:
Designs, Codes and Cryptography Aims and scope Submit manuscript

Abstract

Several combinatorial problems in finite projective spaces which are rather hard to be solved, are unexpectedly easy in infinite spaces. In this paper, we deal with this question and more generally in linear spaces.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. Beutelspacher, Combinatorics in infinite geometries is easy, Abstracts Combinatorics '94, Montesilvano (PE), (1994) p. 25.

  2. G. Tallini, The geometry of the countable dimensional Galois space PG(N, q), Proc.Internat.Conf.on Geometry, (Giessen, October 1990), Journal of Geometry, Birkhauser Verlag, Basel, 39 (1990) pp. 24–25.

    Google Scholar 

  3. G. Tallini, Asymptotic questions in Galois geometries, Atti Convegno "Linear Spaces", Capri, maggio (1991) pp. 1–23.

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Matematica, Universitá di Roma ``La Sapienza,'' Piazzale Aldo Moro 2, 00185-, ROMA, Italy

    Giuseppe Tallini

Authors
  1. Giuseppe Tallini
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tallini, G. Combinatorial Problems in Infinite Spaces. Designs, Codes and Cryptography 9, 247–249 (1996). https://doi.org/10.1023/A:1027372320267

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1027372320267

Keywords

Search

Navigation