How Small Can the Mean Shadow of a Set Be?

DOI10.2307/2975782MaRDI QIDQ3676149zbMATH OpenOpenAlexFDO

Authors Allen J. Schwenk, J. Ian Munro

Publication date 1983

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2975782

Mathematics Subject Classification ID

Enumerative combinatorics (05A99)

Recommendations

• scientific article; zbMATH DE number 3904618
• Counting k-projections of a point set
• scientific article; zbMATH DE number 846112
• Generalized convex envelopes of sets and the problem of shadow
• Can you cover your shadows?

Cited in

(7)

• Mixed norms and rearrangements: Sobolev's inequality and Littlewood's inequality
• Minimising the sum of projections of a finite set
• Bounds on the lattice point enumerator via slices and projections
• Inequalities for the ranks of multipartite quantum states
• scientific article; zbMATH DE number 3904618 (Why is no real title available?)
• scientific article; zbMATH DE number 846112 (Why is no real title available?)
• HOW LARGE IS THE SHADOW OF A SYMPLECTIC BALL?

This page was built for publication: How Small Can the Mean Shadow of a Set Be?

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