On Möbius Functions and a Problem in Combinatorial Number Theory

DOI10.4153/CMB-1971-092-9MaRDI QIDQ5656779zbMATH OpenFDO

Authors Bernt Lindström

Publication date 1971

Published in Canadian Mathematical Bulletin (Search for Journal in Brave)

Mathematics Subject Classification ID

Enumerative combinatorics (05A99) Structure theory of lattices (06B05) Elementary number theory (11A99)

Cited in

(3)

• Toward a deterministic polynomial time algorithm with optimal additive query complexity
• On Parity Check (0,1)-Matrix over $\mathbb{Z}_p$
• On the metric dimension of Cartesian powers of a graph

This page was built for publication: On Möbius Functions and a Problem in Combinatorial Number Theory

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