Related papers: Cutting Cakes Correctly
We correct the statements of two theorems and two corollaries in our paper [On subgroup perfect codes in Cayley graphs, European J. Combin. 91 (2021) 103228]. Proofs of these theorems and three other results are given as well.
We study the problem of fairly allocating a divisible resource in the form of a graph, also known as graphical cake cutting. Unlike for the canonical interval cake, a connected envy-free allocation is not guaranteed to exist for a graphical…
A serious error has been found in the paper, specifically, Lemma 8 is incorrect.
Alon, Seymour and Thomas [1990] proved that every $n$-vertex graph excluding $K_t$ as a minor has treewidth less than $t^{3/2}\sqrt{n}$. Illingworth, Scott and Wood [2022] recently refined this result by showing that every such graph is a…
We derive some consequences of the Liouville theorem for plurisubharmonic functions of L.-F. Tam and the author. The first result provides a nonlinear version of the complex splitting theorem (which splits off a factor of $\mathbb{C}$…
In this Comment, we refute conclusions made in Phys. Rev. Lett. 112, 233601 (2014) by L.-G. Wang, L. Wang, M. Al-Amri, S.-Y. Zhu, and M. S. Zubairy. These conclusions stem from the use of the linear theory, which is not applicable to…
Let $\Theta$ denote the supremum of the real parts of the zeros of the Riemann zeta function. We demonstrate that $\Theta=1$, which entails the existence of infinitely many Riemann zeros off the critical line (thus disproving the Riemann…
To determine whether a number is congruent or not is an old and difficult topic and progress is slow. The paper presents a new theorem when a prime number is a congruent number or not. The proof is not necessarily any simpler or shorter…
The Tree Decomposition Conjecture by Bar\'at and Thomassen states that for every tree $T$ there exists a natural number $k(T)$ such that the following holds: If $G$ is a $k(T)$-edge-connected simple graph with size divisible by the size of…
This is a 20-year old review on singularities and singularity theorems. The main reason to submit it now is -apart from increasing its availability- to correct a very strange error that appears in the journal's online version: it contains…
Due to a significant error in the main result (pointed out by J. Wahl), the paper has been withdrawn by the authors. A corrected and expanded version is 'Rational blow-downs and smoothings of surface singularities' by A. Stipsicz, Z. Szabo…
The concept of kurtosis is used to describe and compare theoretical and empirical distributions in a multitude of applications. In this connection, it is commonly applied to asymmetric distributions. However, there is no rigorous…
This paper studies fair division of divisible and indivisible items among agents whose cardinal preferences are not necessarily monotone. We establish the existence of fair divisions and develop approximation algorithms to compute them. We…
We study the fair division of divisible bad resources with strategic agents who can manipulate their private information to get a better allocation. Within certain constraints, we are particularly interested in whether truthful envy-free…
We point out some major technical and conceptual mistakes which invalidate the conclusion drawn in "Anyonic braiding in optical lattices" by C. Zhang, V. W. Scarola, S. Tewari, and S. Das Sarma published in PNAS 104, 18415 (2007).
This paper is divided to two parts. In the first part, we provide elementary proofs for some important results in multi-objective optimization. The given proofs are so simple and short in compared to the existing ones. Also, a Pareto…
We show that, for any prime power n and any convex body K (i.e., a compact convex set with interior) in Rd, there exists a partition of K into n convex sets with equal volumes and equal surface areas. Similar results regarding…
A pizza is a pair of planar convex bodies $A\subseteq B$,where $B$ represents the dough and $A$ the topping of the pizza. A partition of a pizza by straight lines is a succession of double operations:a cut by a full straight line, followed…
We study the classic problem of fairly dividing a heterogeneous and divisible resource -- represented by a cake, $[0,1]$ -- among $n$ agents. This work considers an interesting variant of the problem where agents are embedded on a graph.…
In this paper a version of Knaster-Kuratowski-Mazurkiewicz theorem for products of simplices is formulated. Some corollaries for measure partition in the plane and cutting families of sets in the plane by lines are given.