n + 1 Segments Beat n

DOI10.1137/0406039MaRDI QIDQ3136619zbMATH OpenOpenAlexFDO

Authors Jenö Töröcsik

Publication date 14 October 1993

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0406039

zbMATH Keywords

lengthsegments

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Inequalities and extremum problems in real or complex geometry (51M16) Length, area and volume in real or complex geometry (51M25) Elementary problems in Euclidean geometries (51M04)

Recommendations

• Partitions into Beatty sequences
• The fractional part of \(n\theta + \phi\) and Beatty sequences
• Initial segments of Δ_2n+1¹-degrees
• Sumsets of finite Beatty sequences
• Finding segmentations of sequences
• scientific article; zbMATH DE number 2124084
• The divisor problem on the Beatty sequence
• Partitioning the positive integers to seven Beatty sequences
• scientific article; zbMATH DE number 6841063
• On the values of Beatty sequence in an arithmetic progression

This page was built for publication: $n + 1$ Segments Beat n

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3136619)