Related papers: Pick Up Sticks
In this short paper we will show, via elementary arguments, the equivalence of the Twin Prime Conjecture to a problem which might be simpler to prove. Some conclusions are drawn, and it is shown that proving the Twin Prime Conjecture is…
A short and simple proof of necessity in the McCullough-Quiggin characterization of positive semi-definite kernels with the complete Pick property is presented.
This paper is aimed to prove the strong duality theorem for continuous-time linear programming problems in which the coefficients are assumed to be piecewise continuous functions. The previous paper proved the strong duality theorem for the…
The paper is concerned with sticky weak solutions to the equations of pressureless gases in two or more space dimensions. Various initial data are constructed, showing that the Cauchy problem can have (i) two distinct sticky solutions, or…
How can a stack of identical blocks be arranged to extend beyond the edge of a table as far as possible? We consider a generalization of this classic puzzle to blocks that differ in width and mass. Despite the seemingly simple premise, we…
The statistical physics approach to the number partioning problem, a classical NP-hard problem, is both simple and rewarding. Very basic notions and methods from statistical mechanics are enough to obtain analytical results for the phase…
In this short note we prove a result that is an extension of an old Olympiad problem and is a very simple variant of the question of finding an approximation for $k$, where it is a nonzero constant and it satisfies the equation $a^k+b^k=c$,…
We prove some results on the existence and compactness of solutions of a fractional Nirenberg problem.
Quantum advantage is notoriously hard to find and even harder to prove. For example the class of functions computable with classical physics actually exactly coincides with the class computable quantum-mechanically. It is strongly believed,…
We prove that for a so-called sticky process $S$ there exists an equivalent probability $Q$ and a $Q$-martingale $\tilde{S}$ that is arbitrarily close to $S$ in $L^p(Q)$ norm. For continuous $S$, $\tilde{S}$ can be chosen arbitrarily close…
We derive an interesting congruence relation motivated by an Indian Olympiad problem. We give three different proofs of the theorem and mention a few interesting related results.
Our goal is to prove existence results for classical solutions to some general nondegenerate Cauchy problems which are natural generalizations of Isaacs equations. For the latter we are able to extend our results by admitting local…
CSPTRQ is an interesting problem and its has attracted much attention. The CSPTRQ is a variant of the traditional PTRQ. As objects moving in a constrained-space are common, clearly, it can also find many applications. At the first sight,…
In the Stable Roommates problem, we seek a stable matching of the agents into pairs, in which no two agents have an incentive to deviate from their assignment. It is well known that a stable matching is unlikely to exist, but a stable…
A very simple but useful almost sure convergence theorem of probability is given.
We prove that if a continuous piecewise-smooth map on $\mathbb{R}^n$ is comprised of two linear functions, has a bounded orbit, and satisfies a certain non-degeneracy condition, then it has a fixed point. The result has important…
The complexity of a computational problem is traditionally quantified based on the hardness of its worst case. This approach has many advantages and has led to a deep and beautiful theory. However, from the practical perspective, this…
Probabilistic argumentation allows reasoning about argumentation problems in a way that is well-founded by probability theory. However, in practice, this approach can be severely limited by the fact that probabilities are defined by adding…
Proving the chaoticity of some dynamical systems is equivalent to solving the hardest problems in mathematics. Conversely, one argues that it is not unconceivable that classical physical systems may "compute the hard or even the…
We describe a statistical hypothesis test for the presence of a signal. The test allows the researcher to fix the signal location and/or width a priori, or perform a search to find the signal region that maximizes the signal. The background…