The combinatorics behind number-theoretic sieves

DOI10.1006/AIMA.1998.1748zbMath0915.11046OpenAlexW2045027505MaRDI QIDQ1272794

Timothy Y. Chow

Publication date: 23 June 1999

Published in: Advances in Mathematics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/bc4a074e4f53aeacad9b551b62b9306e6166229c

zbMATH Keywords

latticesieveMoebius functionSelberg's upper bound sieve

Mathematics Subject Classification ID

Combinatorial inequalities (05A20) Sieves (11N35)

Related Items (3)

Sieve methods in random graph theory ⋮ Sieve methods in combinatorics ⋮ The Shifted Turán Sieve Method on Tournaments

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Rook theory and hypergeometric series
• On the Rédei zeta function
• \(q\)-analogs of the inclusion-exclusion principle and permutations with restricted position
• Factorization of the cover polynomial
• On Garsia-Remmel problem of rook equivalence
• Characteristic polynomials of subspace arrangements and finite fields
• Die gruppentheoretischen Zetafunktionen und der Satz von Hajós
• On homogeneous multiplicative hybrid problems in number theory
• Facing up to arrangements: face-count formulas for partitions of space by hyperplanes
• Chessboard Complexes and Matching Complexes
• Rook theory, compositions, and zeta functions
• [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
• Zetafunktionen in der Algebra
• Asymptotic enumeration of Latin rectangles

This page was built for publication: The combinatorics behind number-theoretic sieves