Related papers: Pick Up Sticks
We generalize the well-known broken stick problem in several ways, including a discrete "brick" analogue and a sequential "pick-up sticks/bricks" version. The limit behavior of the broken brick problem gives a combinatorial proof of the…
We consider a somehow peculiar Token/Bucket problem which at first sight looks confusing and difficult to solve. The winning approach to solve the problem consists in going back to the simple and traditional methods to solve computer…
Let a stick be broken at random at n-1 points to form n pieces. We consider three problems on forming k-gons with k out of these n pieces, and show how a statistical approach, through a linear transformation of variables, yields simple…
In this paper we present a fast scalable heuristic for bin packing that partitions the given problem into identical sub-problems of constant size and solves these constant size sub-problems by considering only a constant number of bin…
We axiomatize and generalize Markov's approach to the continuity problem for Type 1 computable functions, i.e. the problem of finding sufficient conditions on a computable topological space to obtain a theorem of the form "computable…
The $\textbf{P}$ vs. $\textbf{NP}$ problem is an important problem in contemporary mathematics and theoretical computer science. Many proofs have been proposed to this problem. This paper proposes a theoretic proof for $\textbf{P}$ vs.…
We consider a degenerate stochastic differential equation that has a sticky point in the Markov process sense. We prove that weak existence and weak uniqueness hold, but that pathwise uniqueness does not hold nor does a strong solution…
The broken stick problem is the following classical question. You have a segment $[0,1]$. You choose two points on this segment at random. They divide the segment into three smaller segments. Show that the probability that the three…
In this note we give two proofs of Brooks' Theorem. The first is obtained by modifying an earlier proof and the second by combining two earlier proofs. We believe these proofs are easier to teach in Computer Science courses.
We present a formal proof in Lean of probably approximately correct (PAC) learnability of the concept class of decision stumps. This classic result in machine learning theory derives a bound on error probabilities for a simple type of…
We present a variation of the broken stick problem in which $n$ stick lengths are sampled uniformly at random. We prove that the probability that no three sticks can form a triangle is the reciprocal of the product of the first $n$…
We establish the consistency of a local time approximation of a diffusion at a sticky threshold based on high-frequency observations. First, we prove the result for sticky Brownian motion, and then extend it to It\^o diffusions with a…
While the large majority of theoretical and numerical studies of the jamming transition consider athermal packings of purely repulsive spheres, real complex fluids and soft solids generically display attraction between particles. By…
We consider the dynamics of finite systems of point masses which move along the real line. We suppose the particles interact pairwise and undergo perfectly inelastic collisions when they collide. In particular, once particles collide, they…
We apply verified numerics to the Nirenberg problem, proving that a genuine solution exists near two given computer-generated approximate solutions. This proves existence of a solution for a particular prescribed curvature that was…
We have found some patterns in some triangles.
Proving linearizability of concurrent data structures is crucial for ensuring their correctness, but is challenging especially for implementations that employ sophisticated synchronization techniques. In this paper, we propose a new proof…
We claim to resolve the P=?NP problem via a formal argument for P=NP.
We study a new reconfiguration problem inspired by classic mechanical puzzles: a colored token is placed on each vertex of a given graph; we are also given a set of distinguished cycles on the graph. We are tasked with rearranging the…
Regard the closed interval $[0,1]$ as a stick. Partition $[0,1]$ into $n+1$ different intervals $I_1, \ \dots \ , I_{n+1},$ where $n \geq 2,$ which represent smaller sticks. The classical Broken Stick problem asks to find the probability…