Related papers: On Scottish Book Problem 157

We present a novel, yet rather simple construction within the traditional framework of Scott domains to provide semantics to probabilistic programming, thus obtaining a solution to a long-standing open problem in this area. Unlike current…

Waring's classical problem deals with expressing every natural number as a sum of g(k) k-th powers. Recently there has been considerable interest in similar questions for nonabelian groups, and simple groups in particular. Here the k-th…

This paper presents a novel approach to automatically solving arithmetic word problems. This is the first algorithmic approach that can handle arithmetic problems with multiple steps and operations, without depending on additional…

The unbounded knapsack problem can be considered as a particular case of the double partition problem that asks for a number of nonnegative integer solutions to a system of two linear Diophantine equations with integer coefficients. In the…

This paper is motivated by the results and questions of Jason P. Bell and Kevin G. Hare in the paper "On $\mathbb{Z}$-modules of algebraic integers" (Canad. J. Math. Vol. 61, 2009). Let $\mathcal{O}$ be a finitely generated…

In a recent paper, Carrell and Goulden found a combinatorial identity of the Bernstein operators that they then used to prove Bernstein's Theorem. We show that this identity is a straightforward consequence of the classical result. We also…

The classical pattern matching paradigm is that of seeking occurrences of one string - the pattern, in another - the text, where both strings are drawn from an alphabet set $\Sigma$. Assuming the text length is $n$ and the pattern length is…

The main objective of this paper is to identify principal solutions associated with Sturm-Liouville operators on arbitrary open intervals $(a,b) \subseteq \mathbb{R}$, as introduced by Leighton and Morse in the scalar context in 1936 and by…

In 1989 Manin and Schechtman defined the discriminantal arrangement $\mathcal{B}(n, k,\mathcal{A})$ associated to a generic arrangement $\mathcal{A}$ of $n$ hyperplanes in a $k$-dimensional space. An equivalent notion was already introduced…

We discuss the possibility of constructing a function that validates the definition or not definition of the partial recursive functions of one variable. This is a topic in computability theory, which was first approached by Alan M. Turing…

In 1655, John Wallis whilst at the University of Oxford discovered the famous and beautiful formula for pi, now known as Wallis' Product. Since then, several analogous formulae have been discovered generalising the original. One more modern…

In 1963, Rapha\"el Salem concluded his highly influential book ``Algebraic Numbers and Fourier Analysis'' with a list of four unsolved problems. The first two problems remain wide open while the last problem on the absolute continuity of…

The $2$-fold Bailey lemma is a special case of the $s$-fold Bailey lemma introduced by Andrews in 2000. We examine this special case and its applications to partitions and recently discovered $q$-series identities. Our work provides a…

A set-theoretic property called Property S is introduced as a generalization of the well-known Property B. Property S is named for A.Schrijver who first used it to formulate an equivalent of the boolean prime ideal theorem. It was…

Odd numbers can be indexed by the map k(n)=(n-3)/2, n belonging to 2N+3. We first propose a basic primality test using this index function that was first introduced in article (8). Input size of operations is reduced which improves…

This work is to provide a comprehensive treatment of the relationship between the theory of the generalized (palindromic) eigenvalue problem and the theory of the Sylvester-type equations. Under a regularity assumption for a specific matrix…

We show that the Skolem Problem is decidable in finitely generated commutative rings of positive characteristic. More precisely, we show that there exists an algorithm which, given a finite presentation of a (unitary) commutative ring…

In 1975, G. P\'olya suggested that if two proofreaders found $a$ and $b$ errors in a text, of which $c$ errors were found by both of them, then a reasonable approximation of the unknown number $e$ of all errors is $e\approx ab/c$. We…

Simon in his FOCS'94 paper was the first to show an exponential gap between classical and quantum computation. The problem he dealt with is now part of a well-studied class of problems, the hidden subgroup problems. We study Simon's problem…

In 1934, Whitney raised the question of how to recognize whether a function f defined on a closed subset X of Euclidean space is the restriction of a function that is continuously differentiable to order p. A necessary and sufficient…