Related papers: Cutting Cakes Correctly

We show that the celebrated 1956 Lax-Richtmyer linear theorem in Numerical Analysis - often called the Fundamental Theorem of Numerical Analysis - is in fact wrong. Here "wrong" does not mean that its statement is false mathematically, but…

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…

Consider $n$ players having preferences over the connected pieces of a cake, identified with the interval $[0,1]$. A classical theorem, found independently by Stromquist and by Woodall in 1980, ensures that, under mild conditions, it is…

Two kinds of approximation algorithms exist for the k-BALANCED PARTITIONING problem: those that are fast but compute unsatisfying approximation ratios, and those that guarantee high quality ratios but are slow. In this paper we prove that…

We consider the classic cake-cutting problem of producing fair allocations for $n$ agents, in the Robertson-Webb query model. In this model, it is known that: (i) proportional allocations can be computed using $O(n \log n)$ queries, and…

We prove several versions of N. Alon's "necklace-splitting theorem", subject to additional constraints, as illustrated by the following results. (1) The "almost equicardinal necklace-splitting theorem" claims that, without increasing the…

I make some critical comments on the article "An experimental test of non-local realism", by S. Groblacher, T. Paterek, R. Kaltenbaek, C. Brukner, M. Zukowski, M. Aspelmeyer, & A. Zeilinger, Nature 446, p. 871-875 (2007). This article makes…

In this paper, we devise non-distributive relatives of Exactly True Logic (ETL) by Pietz and Riveccio and its dual (NFL) Non-Falsity Logic by Shramko, Zaitsev and Belikov. We consider two pre-orders which are algebraic counterparts of the…

All priors are not created equal. There are right and there are wrong priors. That is the main conclusion of this contribution. I use, a cooked-up example designed to create drama, and a typical textbook example to show the pervasiveness of…

It has been pointed out by counterexamples in a 2013 paper in the IEEE Transactions on Computers [1], that there is an error in the previously ibid.\ in 2005 published paper [2] on the construction of valid digit selection tables for SRT…

Motivated by an open problem from graph drawing, we study several partitioning problems for line and hyperplane arrangements. We prove a ham-sandwich cut theorem: given two sets of n lines in R^2, there is a line l such that in both line…

This is an erratum to math.AG/9803126, Tohoku 51 (1999) 489-537. This erratum describes: 1. the failure of the algorithm in [AMR] and [Morelli1] for the strong factorization pointed out by Kalle Karu, 2. the statement of a refined weak…

We propose an online form of the cake cutting problem. This models situations where players arrive and depart during the process of dividing a resource. We show that well known fair division procedures like cut-and-choose and the…

In this article we propose a probabilistic framework in order to study the fair division of a divisible good, e.g., a cake, between n players. Our framework follows the same idea than the ''Full independence model'' used in the study of…

In the paper [Hong-Shi Zong, Wei-Min Sun, Phys. Lett. B 640 (2006) 196], the authors claim that our proof of the inconsistency of the ladder approximation to QCD [Phys. Lett. B 611 (2005) 129] was incorrect. However, their claim is based on…

Function optimisation is a major challenge in computer science. The No Free Lunch theorems state that if all functions with the same histogram are assumed to be equally probable then no algorithm outperforms any other in expectation. We…

This paper has been withdrawn by the authors due to an error.

This paper presents a new Lie theoretic approach to fractal calculus, which in turn yields such new results as a Fractal Noether's Theorem, a setting for fractal differential forms, for vector fields, and Lie derivatives, as well as…

The normal form theorem, proved in R. Laver, On the left distributive law and the freeness of an algebra of elementary embeddings, Advances in Mathematics 91 (1992), 209-231, for the free algebra $\Cal A$ on one generator $x$ satisfying the…

We study the query complexity of cake cutting and give lower and upper bounds for computing approximately envy-free, perfect, and equitable allocations with the minimum number of cuts. The lower bounds are tight for computing connected…