Related papers: Chameleon Coins
We show that in a broad class of random counting measures one may identify only three that are rescaled versions of themselves when restricted to a subspace. These are Poisson, binomial and negative binomial random measures. We provide some…
We present a new protocol and two lower bounds for quantum coin flipping. In our protocol, no dishonest party can achieve one outcome with probability more than 0.75. Then, we show that our protocol is optimal for a certain type of quantum…
This paper deals with the application of Approximation Theory type techniques to study a classical problem in Probability: estimating the parameter of a biased coin. For this purpose, a Minimax Estimation problem is considered and the…
An effective weighting scheme for training samples is essential for learning tasks. Numerous weighting schemes have been proposed. Some schemes take the easy-first mode, whereas some others take the hard-first one. Naturally, an interesting…
Most theories that predict time and/or space variation of fundamental constants also predict violations of the Weak Equivalence Principle. In 2004 Khoury and Weltman proposed the so called chameleon field arguing that it could help avoiding…
The Chinos game is a non-cooperative game between players who try to guess the total sum of coins drawn collectively. Semiclassical and quantum versions of this game were proposed by F. Guinea and M. A. Martin-Delgado, in J. Phys. A: Math.…
Light scalar fields coupled to matter are a common consequence of theories of dark energy and attempts to solve the cosmological constant problem. The chameleon screening mechanism is commonly invoked in order to suppress the fifth forces…
Large language models are increasingly used to evaluate other models, yet these judgments typically lack any representation of confidence. This pilot study tests whether framing an evaluation task as a betting game (a fictional prediction…
Suppose that the vertices of the Euclidean lattice Z^d are endowed with a random scenery, obtained by tossing a fair coin at each vertex. A random walker, starting from the origin, replaces the coins along its path by i.i.d. biased coins.…
Can you decide if there is a coincidence in the numbers counting two different combinatorial objects? For example, can you decide if two regions in $\mathbb{R}^3$ have the same number of domino tilings? There are two versions of the…
Parrondo's paradox is ubiquitous in games, ratchets and random walks.The apparent paradox, devised by J.~M.~R.~Parrondo, that two losing games $A$ and $B$ can produce an winning outcome has been adapted in many physical and biological…
A simple computer-based algorithm has been developed to identify pre-modern coins minted from the same dies, intending mainly coins minted by hand-made dies designed to be applicable to images taken from auction websites or catalogs. Though…
Here, we present a variant of the sliding coins game. Two coins are placed on distinct squares of a semi-infinite linear board with squares numbered $0, 1, 2, dots, $. Two players take turns and move a coin to a lower unoccupied square.…
Riddles are concise linguistic puzzles that describe an object or idea through indirect, figurative, or playful clues. They are a longstanding form of creative expression, requiring the solver to interpret hints, recognize patterns, and…
Public verification of quantum money has been one of the central objects in quantum cryptography ever since Wiesner's pioneering idea of using quantum mechanics to construct banknotes against counterfeiting. So far, we do not know any…
Theories of modified gravity where light scalars with non-trivial self-interactions and non-minimal couplings to matter-chameleon and symmetron theories-dynamically suppress deviations from general relativity in the solar system. On other…
An important question arising from the Frobenius Coin Problem is to decide whether or not a given monetary sum S can be obtained from N coin denominations. We develop a new Generating Function G(x), where the coefficient of x^i is equal to…
Recent proposals to test Bell's inequalities with entangled pairs of pseudoscalar mesons are reviewed. This includes pairs of neutral kaons or B-mesons and offers some hope to close both the locality and the detection loopholes. Specific…
Various local hidden variables models for the singlet correlations exploit the detection loophole, or other loopholes connected with post-selection on coincident arrival times. I consider the connection with a probabilistic simulation…
Coin flipping is a cryptographic primitive in which two spatially separated players, who in principle do not trust each other, wish to establish a common random bit. If we limit ourselves to classical communication, this task requires…