Corpus ID: 119320925

Discreet Coin Weighings and the Sorting Strategy

@article{Khovanova2016DiscreetCW,
  title={Discreet Coin Weighings and the Sorting Strategy},
  author={Tanya Khovanova and Rafael M. Saavedra},
  journal={arXiv: Combinatorics},
  year={2016}
}
  • Tanya Khovanova, Rafael M. Saavedra
  • Published 2016
  • Mathematics
  • arXiv: Combinatorics
  • In 2007, Alexander Shapovalov posed an old twist on the classical coin weighing problem by asking for strategies that manage to conceal the identities of specific coins while providing general information on the number of fake coins. In 2015, Diaco and Khovanova studied various cases of these "discreet strategies" and introduced the revealing factor, a measure of the information that is revealed. In this paper we discuss a natural coin weighing strategy which we call the sorting strategy… CONTINUE READING

    Figures and Tables from this paper.

    References

    Publications referenced by this paper.
    SHOWING 1-7 OF 7 REFERENCES

    Weighing Coins and Keeping Secrets

    VIEW 11 EXCERPTS

    Counting Counterfeit Coins: A New Coin Weighing Problem

    VIEW 4 EXCERPTS
    HIGHLY INFLUENTIAL

    A problem in partitions

    VIEW 1 EXCERPT

    Ramı́rez Alfonśın, The Diophantine Frobenius Problem

    • J L.
    • 2005
    VIEW 2 EXCERPTS

    The mystery of fake coins

    • K. Knop
    • Matematika, N8, 29–31,
    • 2008
    VIEW 1 EXCERPT