A representation of large integers from combinatorial sieves

DOI10.1006/JNTH.1995.1119MaRDI QIDQ1900884zbMATH OpenOpenAlexFDO

Authors John L. Blanchard

Publication date 25 October 1995

Published in Journal of Number Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jnth.1995.1119

zbMATH Keywords

combinatorial sievesconstruction of orthogonal arraysMDS codesrepresentation of large integers

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Representation problems (11D85) Applications of sieve methods (11N36) Theory of error-correcting codes and error-detecting codes (94B99)

Review text

By using sieve arguments the author proves the following statement. Let \(k\) and \(m\) be positive integers, let \(l\) be an integer with \(0\leq l< m\). Then there are positive numbers \(\beta= \beta (k,m)\) and \(n_2= n_2 (k, m)\) such that any integer \(x\geq n_2\) can be represented as \[ x= f_1 \dots f_k+ rm+ l \] where \(f_1, \dots, f_k\), and \(r\) are nonnegative integers with \(rm+l\leq x^\beta\) and \(f_i\geq x^\beta\) \((i=1, \dots, k)\). The author announces applications to the construction of orthogonal arrays and MDS codes (to appear).

Recommendations

• The combinatorics behind number-theoretic sieves
• Sieving by large integers and covering systems of congruences
• Combinatorial sieves of dimension exceeding one
• On the representation of large integers as sums of distinct summands taken from a fixed set
• scientific article; zbMATH DE number 903695
• Sieving the positive integers by large primes
• scientific article; zbMATH DE number 3906589
• THE 'LARGE SIEVE' METHOD AND ITS APPLICATIONS IN THE THEORY OF NUMBERS
• scientific article; zbMATH DE number 566012
• scientific article; zbMATH DE number 1305369

Cited in

(2)

• An existence theorem for group divisible 3-designs of large order
• The asymptotic existence of group divisible t-designs of large order with index one

This page was built for publication: A representation of large integers from combinatorial sieves

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