Skip to main content
SpringerLink
Log in

On Combinatorial Cubes

  • Published:
The Ramanujan Journal Aims and scope Submit manuscript

Abstract

A sequence of positive integers with positive lower density contains a Hilbert (or combinatorial) cube size c log log n up to n. We prove this bound is sharp for some thinner sequence.

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

Author information

Authors and Affiliations

  1. ELTE TFK, Department of Mathematics, University Eötvös L., Budapest, Pázmány, P. st. 1./C, P.O. Box 120, H-1518, Hungary

    Norbert Hegyvári

Authors
  1. Norbert Hegyvári
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Norbert Hegyvári.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hegyvári, N. On Combinatorial Cubes. Ramanujan J 8, 303–307 (2004). https://doi.org/10.1007/s11139-004-0140-6

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11139-004-0140-6

Search

Navigation