Related papers: A problem of Stanislaw Saks
In this paper, we obtain the existence result of smooth solutions to the Orlicz-Aleksandrov problem from the perspective of geometric flow. Furthermore, a special uniqueness result of solutions to this problem shall be discussed.
We solve problems 85 a(nd 87 from Birkhoff's book "Lattice Theory" (3rd edition)
In this paper we give a closed expression for a multiple factorial series, solving Open Problem 3.137 in a recent book by O. Furdui. The method is based on properties of divided differences. It applies also to similar series and certain…
We present an astonishingly simple and elegant proof of the celebrated Basel problem.
Maslov's class $\overline{\text{K}}$ is an expressive fragment of First-Order Logic known to have decidable satisfiability problem, whose exact complexity, however, has not been established so far. We show that $\overline{\text{K}}$ has the…
Author of this article created for the first time the method for finding solutions of the Minkowski problem for closed surfaces in Riemannian space.
We obtain the sharp estimates on the growth of the uniform norm of orthonormal polynomials for measures satisfying the Steklov condition. This improves the earlier results by Rakhmanov and completely settles a problem by Steklov. The sharp…
In this paper we give a novel solution to a classical completion problem for square matrices. This problem was studied by many authors through time, and it is completely solved in [2, 3]. In this paper we relate this classical problem to a…
The invariant subspace problem is solved correcting my earlier attempts [6]-[12].
A special case of the satisfiability problem, in which the clauses have a hierarchical structure, is shown to be solvable in linear time, assuming that the clauses have been represented in a convenient way.
In this paper, we will present a new iterative construction for the auxiliary equation of Waring's problem, which seems a little simpler than the one of so called "smooth numbers" in papers [4] and [8], and give same upper bounds of G(k) as…
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 prove that a uniformly bounded system of orthonormal functions satisfying the $\psi_2$ condition: (1) must contain a Sidon subsystem of proportional size, (2) must satisfy the Rademacher-Sidon property, and (3) must have its 5-fold…
We present a method for the solution of polynomial equations. We do not intend to present one more method among several others, because today there are many excellent methods. Our main aim is educational. Here we attempt to present a method…
Answering a question of Haugland, we show that the pooling problem with one pool and a bounded number of inputs can be solved in polynomial time by solving a polynomial number of linear programs of polynomial size. We also give an overview…
I revisit an automated proof of Andrews' pentagonal number theorem found by Riese. I uncover a simple polynomial identity hidden behind his proof. I explain how to use this identity to prove Andrews' result along with a variety of new…
We relate the graph isomorphism problem to the solvability of certain systems of linear equations with nonnegative variables. This version replaces the two previous versions of this paper.
In this treatise I present the solutions of the third Clay Millennium problem in the computational complexity and the fourth Clay Millennium problem in classical fluid dynamics.
It is shown that the knapsack problem, which was introduced by Myasnikov et al. for arbitrary finitely generated groups, can be solved in NP for graph groups. This result even holds if the group elements are represented in a compressed form…
This is an update of my problem list.