Related papers: Counterexamples in Cake-Cutting
In this very short note, we give a counterexample to a recent conjecture of Gilmer which would have implied the union-closed conjecture.
Rejoinder to "Quantifying the Fraction of Missing Information for Hypothesis Testing in Statistical and Genetic Studies" [arXiv:1102.2774]
We study the fair allocation of a cake, which serves as a metaphor for a divisible resource, under the requirement that each agent should receive a contiguous piece of the cake. While it is known that no finite envy-free algorithm exists in…
The paper disproves a basic theorem on quasi-birth-and-death processes given in [M. F. Neuts (1995). Matrix Geometric Solutions in Stochastic Models: An Algorithmic Approach. Dover, New York].
We find it necessary to advise the interested and active instructor of Physics on the wrongness of some computations in the aforementioned article. Surprisingly, the Journal refuses to even publish an erratum on the paper, which naturally…
Evaluation of counterfactual queries (e.g., "If A were true, would C have been true?") is important to fault diagnosis, planning, and determination of liability. In this paper we present methods for computing the probabilities of such…
These notes are based on the lectures given by the author during Winter Braids IX in Reims in March 2019. We discuss slice knots and why they are interesting, as well as some ways to decide if a given knot is or is not slice. We describe…
A cake has to be divided fairly among $n$ agents. When all agents have equal entitlements, it is known that such a division can be implemented with $n-1$ cuts. When agents may have different entitlements, the paper shows that at least $2 n…
In recent paper "Quantifying Inequities and Documenting Elitism in PhD-granting Mathematical Sciences Departments in the United States" (arXiv:2308.13750) by a group of accomplished and/or aspiring mathematicians, the authors use data to…
We examine the history of cake cutting mechanisms and discuss the efficiency of their allocations. In the case of piecewise uniform preferences, we define a game that in the presence of strategic agents has equilibria that are not dominated…
Rejoinder to ``Breakdown and groups'' by P. L. Davies and U. Gather [math.ST/0508497]
This text highlights issues present in the proof of Lemma 6.10 of the Baumgartner (1943 -- 2011) article "Almost disjoint sets, the dense set problem and the partition calculus" of 1976, and intends to present a correction at the same time…
The contents of this 6-page paper have been subsumed into the 13-page paper, "A note on closed 3-braids", arXiv:0802.1072 [math.GT]. This paper is correct, but contains less information than the new one. The topological classification of…
We give a visually appealing counterexample to the proposition that unbiased estimators are better than biased estimators.
We study classic cake-cutting problems, but in discrete models rather than using infinite-precision real values, specifically, focusing on their communication complexity. Using general discrete simulations of classical infinite-precision…
In this paper, we give some further comments to the counterexample and the results of R.~K. Bisht in [R.~K. Bisht. \newblock {Comment on: A new fixed point theorem in the fractal space}. \newblock {\em Indag. Math. (N.S.)}, 29(2):819--823,…
Shake slice generalizes the notion of a slice link, naturally extending the notion of shake slice knots to links. There is also a relative version, shake concordance, that generalizes link concordance. We show that if two links are shake…
In this note, we prove a theorem covering Chartrand, Kaigars, and Lick's theorem in [Proc. Amer. Math. Soc. 32 (1972), 63-68]. As an application, we give a simpler proof of theorem proved by Mader [J. Graph Theory 65 (2010), 61-69. (Theorem…
This paper has been withdrawn by the author due to an error in Lemma 3, making the (bijective) proof of Theorem 4 and Corollary 5 invalid (symmetry of k-nonnesting and k-noncrossing set partitions).
Using a lab experiment, we investigate the real-life performance of envy-free and proportional cake-cutting procedures with respect to fairness and preference manipulation. We find that envy-free procedures, in particular Selfridge-Conway,…