Related papers: Random necklaces require fewer cuts
We show that for an infinitely many natural numbers $k$ there are $k$-uniform hypergraphs which admit a `rescaling phenomenon' as described in [9]. More precisely, let $\mathcal{A}(k,I, n)$ denote the class of $k$-graphs on $n$ vertices in…
The importance of classifying connections in large graphs has been the motivation for a rich line of work on distributed subgraph finding that has led to exciting recent breakthroughs. A crucial aspect that remained open was whether…
We consider vertex partitions of the binomial random graph $G_{n,p}$. For $np\to\infty$, we observe the following phenomenon: in any partition into asymptotically fewer than $\chi(G_{n,p})$ parts, i.e. $o(np/\log np)$ parts, one part must…
The study of knots and links from a probabilistic viewpoint provides insight into the behavior of "typical" knots, and opens avenues for new constructions of knots and other topological objects with interesting properties. The knotting of…
We show how to find a minimum loop cutset in a Bayesian network with high probability. Finding such a loop cutset is the first step in Pearl's method of conditioning for inference. Our random algorithm for finding a loop cutset, called…
A simple method to produce a random order type is to take the order type of a random point set. We conjecture that many probability distributions on order types defined in this way are heavily concentrated and therefore sample inefficiently…
We consider the probability of knotting in equilateral random polygons in Euclidean 3-dimensional space, which model, for instance, random polymers. Results from an extensive Monte Carlo dataset of random polygons indicate a universal…
It is well-known that the 2-Thief-Necklace-Splitting problem reduces to the discrete Ham Sandwich problem. In fact, this reduction was crucial in the proof of the PPA-completeness of the Ham Sandwich problem [Filos-Ratsikas and Goldberg,…
Suppose $k$ balls are dropped into $n$ boxes independently with uniform probability, where $n, k$ are large with ratio approximately equal to some positive real $\lambda$. The maximum box count has a counterintuitive behavior: first of all,…
Two permutations $s$ and $t$ are $k$-similar if they can be decomposed into subpermutations $s^1, \ldots, s^k$ and $t^1, \ldots, t^k$ such that $s^i$ is order-isomorphic to $t^i$ for all $i$. Recently, Dudek, Grytczuk and Ruci\'nski posed…
The Necklace Splitting problem is a classical problem in combinatorics that has been intensively studied both from a combinatorial and a computational point of view. It is well-known that the Necklace Splitting problem reduces to the…
In thermally fluctuating long linear polymeric chain in solution, the ends come from time to time into a direct contact or a close vicinity of each other. At such an instance, the chain can be regarded as a closed one and thus will form a…
We study nested partitions of $R^d$ obtained by successive cuts using hyperplanes with fixed directions. We establish the number of measures that can be split evenly simultaneously by taking a partition of this kind and then distributing…
A k-wise independent distribution on n bits is a joint distribution of the bits such that each k of them are independent. In this paper we consider k-wise independent distributions with identical marginals, each bit has probability p to be…
A well known generalization of Alon's "splitting nacklace theorem" by Longueville and Zivaljevic states that every k-colored n-dimensional cube can be fairly split using only k cuts in each dimension. Here we prove that for every t there…
We show there is a bijection between the binary necklaces with $n$ black beads and $k$ white beads and certain $(n,k)$-codes when $n$ is prime. The main idea is to come up with a new map on necklaces called slime migration.
Let $X_1, X_2,\ldots, X_n$ be $n$ independent and identically distributed random variables, here $n \geq 2.$ Let $X_{(1)}, X_{(2)}, \ldots, X_{(n)}$ be the order statistics of $X_1, X_2,..., X_n.$ In this note we proved that: (I) If $X_1,…
The problem of non-iterative one-shot and non-destructive correction of unavoidable mistakes arises in all Artificial Intelligence applications in the real world. Its solution requires robust separation of samples with errors from samples…
Consider a bounded-degree graph $G$ that belongs to a minor-closed family (such as planar graphs). Such a graph has a hyperfinite decomposition, wherein, for a sufficiently small $\varepsilon > 0$, one can remove $\varepsilon dn$ edges to…
In the early 1980's Mike Freedman showed that all knots with trivial Alexander polynomial are topologically slice (with fundamental group Z). This paper contains the first new examples of topologically slice knots. In fact, we give a…