Related papers: Computer-aided solution to the $k$-bonacci pick-up…
I present a variant of the Buffon Needle method for determination of the value of the mathematical constant, pi. The original method is based on the random casting of a needle of length l onto a planked floor of plank width L. The described…
Underwater robotics addresses the problem of object detection apparatus. Offers a probabilistic formulation of the problem, which uses the reduction of the detection task to a classical task of Buffon. This formulation arises naturally in…
The aim of this paper is to derive explicit formulas for two distinct values. The first is the total number of symmetric peaks in a set partition of $[n]$ with exactly $k$ blocks, and the second one is the total number of non-symmetric…
An assignment problem is the optimization problem of finding, in an m by n matrix of nonnegative real numbers, k entries, no two in the same row or column, such that their sum is minimal. Such an optimization problem is called a random…
We consider the urn setting with two different objects, ``good'' and ``bad'', and analyze the number of draws without replacement until a good object is picked. Although the expected number of draws for this setting is a standard textbook…
A generalization of the well--known Fibonacci sequence is the $k$--Fibonacci sequence with some fixed integer $k\ge 2$. The first $k$ terms of this sequence are $0,\ldots,0,1$, and each term afterwards is the sum of the preceding $k$ terms.…
The $k$-of-$n$ testing problem involves performing $n$ independent tests sequentially, in order to determine whether/not at least $k$ tests pass. The objective is to minimize the expected cost of testing. This is a fundamental and…
The solution of the classical Coupon Collector's Problem is based on the assumptions that all stickers are independently and uniformly distributed. We can prove statistically as well as analytically that in particular the assumption of…
Previously the author has demonstrated that a representative polynomial search partition is required to solve a NP-complete problem in deterministic polynomial time. It has also been demonstrated that finding such a partition can only be…
This article describes a model and an exact solution method for facility location problems with decision-dependent uncertainties. The model allows characterizing the probability distribution of the random elements as a function of the…
We study the k-core of a random (multi)graph on n vertices with a given degree sequence. We let n tend to infinity. Then, under some regularity conditions on the degree sequences, we give conditions on the asymptotic shape of the degree…
Let $G_{k,n}$ be a group of permutations of $kn$ objects which permutes things independently in disjoint blocks of size $k$ and then permutes the blocks. We investigate the probabilistic and/or enumerative aspects of random elements of…
In this paper we first show a blow-up criterion for solutions to the Navier-Stokes equations with a time-independent force by using the profile decomposition method. Based on the orthogonal properties related to the profiles, we give some…
In this paper, we introduce polynomial time algorithms that generate random $k$-noncrossing partitions and 2-regular, $k$-noncrossing partitions with uniform probability. A $k$-noncrossing partition does not contain any $k$ mutually…
We provide a spectrum of results for the Universal Guard Problem, in which one is to obtain a small set of points ("guards") that are "universal" in their ability to guard any of a set of possible polygonal domains in the plane. We give…
In this paper we give a formula for the probability that $n$ random points chosen under the uniform distribution in a disk are in convex position. While close, the formula is recursive and is totally explicit only for the first values of…
The no-(k+1)-in line problem seeks the maximum number of points that can be selected from an $n \times n$ square lattice such that no $k+1$ of them are collinear. The problem was first posed more than $100$ years ago for the special case…
Let $\pi_n$ be a uniformly chosen random permutation on $[n]$. Using an analysis of the probability that two overlapping consecutive $k$-permutations are order isomorphic, the authors of a recent paper showed that the expected number of…
We present a new complex non-stationary particle-like solution of the non-linear Klein-Gordon equation with several spatial variables. The construction is based on reduction to an ordinary differential equation.
We present a conclusive answer to Bertrand's paradox, a long standing open issue in the basic physical interpretation of probability. The paradox deals with the existence of mutually inconsistent results when looking for the probability…