Related papers: On Scottish Book Problem 157
Three variants of Kurt G\"odel's ontological argument, proposed by Dana Scott, C. Anthony Anderson and Melvin Fitting, are encoded and rigorously assessed on the computer. In contrast to Scott's version of G\"odel's argument the two…
Daniel Simon's 1994 discovery of an efficient quantum algorithm for solving the hidden subgroup problem (HSP) over Z_2^n provided one of the first algebraic problems for which quantum computers are exponentially faster than their classical…
Orbit determination (OD) from three position vectors is one of the classical problems in astrodynamics. Early contributions to this problem were made by J. Willard Gibbs in the late 1800s and OD of this type is known today as ``Gibbs…
Simon's problem is an essential example demonstrating the faster speed of quantum computers than classical computers for solving some problems. The optimal separation between exact quantum and classical query complexities for Simon's…
The concept of a covering system was first introduced by Erd\H{o}s in 1950. Since their introduction, a lot of the research regarding covering systems has focused on the existence of covering systems with certain restrictions on the moduli.…
In this book we describe an approach through toric geometry to the following problem: "estimate the number (counted with appropriate multiplicity) of isolated solutions of n polynomial equations in n variables over an algebraically closed…
An archetypal problem discussed in computer science is the problem of searching for a given number in a given set of numbers. Other than sequential search, the classic solution is to sort the list of numbers and then apply binary search.…
This paper intends to survey the vast literature devoted to a problem posed by Wilf in 1978 which, despite the attention it attracted, remains unsolved. As it frequently happens with combinatorial problems, many researchers who got involved…
We find an exact solution to strongly-coupled matrix models with a single-trace monomial potential. Our solution yields closed form expressions for the partition function as well as averages of Schur functions. The results are fully…
Our work is related to problems $73$ and $74$ of Mazur and Orlicz in ``The Scottish Book" (ed. R. D. Mauldin). Let $k_1, \ldots, k_n$ be nonnegative integers such that $\sum_{i=1}^{n} k_{i}=m$, and let $\mathbb{K}(k_1, \ldots, k_n; X)$,…
We introduced a new algebra of stochastic generalized functions which contains to the space of stochastic distributions G, [25]. As an application, we prove existence and uniqueness of the solution of a stochastic Cauchy problem involving…
A well-known problem in computing some matrix functions iteratively is the lack of a clear, commonly accepted residual notion. An important matrix function for which this is the case is the matrix exponential. Suppose the matrix exponential…
In this work, we revisit the study by M. E. Schonbek [11] concerning the problem of existence of global entropic weak solutions for the classical Boussinesq system, as well as the study of the regularity of these solutions by C. J. Amick…
We obtain some approximation results for the weights appearing in the exchangeable partition probability function identifying Gibbs partition models of parameter $\alpha \in (0,1)$, as introduced in Gnedin and Pitman (2006). We rely on…
Let $\sigma(n)$ denote the sum of the positive divisors of $n$. We prove that for any positive integer $k$, there is a number $m$ for which the equation $\sigma(x)=m$ has exactly $k$ solutions, settling a conjecture of Sierpi\'nski from…
Let $A$ be a finite-dimensional (Artinian) Gorenstein algebra, and let $\operatorname{Aut}(A)^{\circ}$ denote the connected component of the identity in the automorphism group of $A$. We introduce a new subclass of Gorenstein algebras and…
K\"othe's classical problem posed by G. K\"othe in 1935 asks to describe the rings $R$ such that every left $R$-module is a direct sum of cyclic modules (these rings are known as left K\"othe rings). K\"othe, Cohen and Kaplansky solved this…
The author advocates two specific mathematical notations from his popular course and joint textbook, "Concrete Mathematics". The first of these, extending an idea of Iverson, is the notation "[P]" for the function which is 1 when the…
Euclidean functions with values in an arbitrary well-ordered set were first considered in a 1949 work of Motzkin and studied in more detail in work of Fletcher, Samuel and Nagata in the 1970's and 1980's. Here these results are revisited,…
Richard G. Swan proved in 1962 that trinomials x^{8k} + x^m + 1 with 8k > m have an even number of irreducible factors, and so cannot be irreducible. In fact, he found the parity of the number of irreducible factors for any square-free…