Related papers: Baron Munchhausen's Sequence
Unbounded SubsetSum is a classical textbook problem: given integers $w_1,w_2,\cdots,w_n\in [1,u],~c,u$, we need to find if there exists $m_1,m_2,\cdots,m_n\in \mathbb{N}$ satisfying $c=\sum_{i=1}^n w_im_i$. In its all-target version, $t\in…
The properties of precessing, coalescing binary black holes are presently inferred through comparison with two approximate models of compact binary coalescence. In this work we show these two models often disagree substantially when…
If the product of two monic polynomials with real nonnegative coefficients has all coefficients equal to 0 or 1, does it follow that all the coefficients of the two factors are also equal to 0 or 1? Here is an equivalent formulation of this…
Let $X$ be a finite sequence of length $m\geq 1$ in $\mathbb{Z}/n\mathbb{Z}$. The \textit{derived sequence} $\partial X$ of $X$ is the sequence of length $m-1$ obtained by pairwise adding consecutive terms of $X$. The collection of iterated…
In this paper, the construction of finite-length binary sequences whose nonlinear complexity is not less than half of the length is investigated. By characterizing the structure of the sequences, an algorithm is proposed to generate all…
We give explicit formulas for ruin probabilities in a multidimensional Generalized Gambler's ruin problem. The generalization is best interpreted as a game of one player against $d$ other players, allowing arbitrary winning and losing…
For $n$-body problem with arbitrary positive masses, we prove there are regularizable collinear periodic solutions for any ordering of the masses, going from a simultaneous binary collision to another in half of a period with half of the…
Assume that letters (from a finite alphabet) in a text form a Markov chain. We track two distinct words, $U$ and $D$. A gambler gains 1 point for each occurrence of $U$ (including overlapping occurrences) and loses 1 point for each…
A problem faced by many instructors is that of designing exams that accurately assess the abilities of the students. Typically these exams are prepared several days in advance, and generic question scores are used based on rough…
Monograph "B. Grechuk, Polynomial Diophantine equations. A systematic approach" suggests solving Diophantine equations systematically in certain order. Many hundreds of the equations are left to the reader. Here, we provide complete…
We study the power of classical and quantum algorithms equipped with nonuniform advice, in the form of a coin whose bias encodes useful information. This question takes on particular importance in the quantum case, due to a surprising…
In this paper, we study sequential auctions with two budget constrained bidders and any number of identical items. All prior results on such auctions consider only two items. We construct a canonical outcome of the auction that is the only…
In the article "The Tale of Two Queens and Two Towering Figures" published in CNJ in 2012 (CNJ vol. 57 No. 5, pp. 304-315), we discussed the contributions of Copernicus and Newton to coin minting and monetary reforms, as well as the…
We evaluate the nested sum $\sum_{a_{n - 1} = c}^{a_n } {\sum_{a_{n - 2} = c}^{a_{n - 1} } { \cdots \sum_{a_0 = c}^{a_1 } {x^{a_0 } } } }$ where $a_n$ and $c$ are any integers and $x$ is a real or complex variable. Consequently, we evaluate…
In this paper we give a mathematical model for a game that we call picture cube puzzle and investigate its properties. The central question is the number of moves required to solve the puzzle. A mathematical discussion is followed by the…
We generalize the notion of a de Bruijn sequence to a "multi de Bruijn sequence": a cyclic or linear sequence that contains every k-mer over an alphabet of size q exactly m times. For example, over the binary alphabet {0,1}, the cyclic…
We consider the problem of sequencing a set of positive numbers. We try to find the optimal sequence to maximize the variance of its partial sums. The optimal sequence is shown to have a beautiful structure. It is interesting to note that…
Pairwise comparison matrices are widely used in Multicriteria Decision Making. This article applies incomplete pairwise comparison matrices in the area of sport tournaments, namely proposing alternative rankings for the 2010 Chess Olympiad…
Parrondo's paradox is ubiquitous in games, ratchets and random walks.The apparent paradox, devised by J.~M.~R.~Parrondo, that two losing games $A$ and $B$ can produce an winning outcome has been adapted in many physical and biological…
In this note we study a quantitative version of Bernstein's approximation problem when the polynomials are dense in weighted spaces on the real line completing a result of S.~N.~Mergelyan (1960). We estimate in the logarithmic scale the…