Related papers: Oblivious Stash Shuffle
We present a simple, efficient, and secure data-oblivious randomized shuffle algorithm. This is the first secure data-oblivious shuffle that is not based on sorting. Our method can be used to improve previous oblivious storage solutions for…
This is an appendix to our paper "An update of the Hirsch Conjecture" (arXiv:0907.1186), containing proofs of some of the results and comments that were omitted in it.
The shuffle product has a connection with several useful permutation statistics such as descent and peak, and corresponds to the multiplication operation in the corresponding descent and peak algebras. In their recent work, Gessel and…
We consider Oblivious Shuffling and K-Oblivious Shuffling, a refinement thereof. We provide efficient algorithms for both and discuss their application to the design of Oblivious RAM. The task of K-Oblivious Shuffling is to obliviously…
We first give a combinatorial proof of Stanley's shuffle theorem by using the insertion lemma of Haglund, Loehr and Remmel. Based on this combinatorial construction, we establish several refinements of Stanley's shuffle theorem.
This note gives an informal overview of the proof in our paper "Borel Conjecture and Dual Borel Conjecture", see arXiv:1105.0823.
We provide an alternative proof that Crosscaps are diffeomorphically stable.
A significant mathematical error is identified and corrected in a recent highly-cited paper on oscillatory flows of second-grade fluids [Fetecau & Fetecau (2005). Int. J. Eng. Sci., 43, 781--789]. The corrected solutions are shown to agree…
In their recent paper [Phys. Rev. Lett. 98, 094101 (2007)], A. Porporato et al. studied the irreversibility and fluctuation theorem for stationary time series. In this comment, we point out that the fluctuation theorem is in fact the…
This paper presents stability and accuracy analysis of a high-order explicit time stepping scheme introduced by \cite[Section 2.2]{Buvoli2019}, which exhibits superior stability compared to classical Adams-Bashforth. A conjecture that is…
Although random sequences can be used to generate probability events, they come with the risk of cheating in an unsupervised situation. In such cases, the oblivious transfer protocol may be used and this paper presents a variation to the DH…
This is a collection of variants of Schanuel's conjecture and the known dependencies between them. It was originally written in 2007, and made available for a time on my webpage. I have been asked by a few people to make it available again…
New cases of the multiplicity conjecture are considered.
The paper presents a counterexample to the Hodge conjecture.
Many casinos routinely use mechanical card shuffling machines. We were asked to evaluate a new product, a shelf shuffler. This leads to new probability, new combinatorics and to some practical advice which was adopted by the manufacturer.…
Stacking is an important process within logistics. Some notable examples of items to be stacked are steel bars or steel plates in a steel yard or containers in a container terminal or on a ship. We say that two items are conflicting if…
The fascinating and anomalous behaviour of a chain that instead of falling straight down under gravity, first rises and then falls, acquiring a steady shape in space that resembles a fountain's sprinkle, has recently attracted both popular…
In this note, we have shown special case on Routh stability criterion, which is not discussed, in previous literature. This idea can be useful in computer science applications.
An elementary proof is given for a theorem showing that certain birth-death chains show martingale-like behavior at large stopping times. This is a generalization of and new proof for a theorem from a earlier paper by the author.
This paper has been withdrawn by the authors