Related papers: A problem of Stanislaw Saks
In this paper we give a solution to Zariski's problem of analytic classification of plane branches.
This is an English translation of the following paper, published several years ago: Nikonorov Yu.G., Nikonorova Yu.V. Generalized Popoviciu's problem (Russian), Tr. Rubtsovsk. Ind. Inst., 7, 229-232 (2000), Zbl. 0958.51021. All inserted…
In this paper we prove that the condition one-to-one of continuous open-resolvable mapping is necessary in the Ostrovsky's Theorem. Also we get that the Ostrovsky's Problem (Is every open-LCn function between Polish spaces piecewise open…
We present and discuss a number of known results and open problems abelian squares in words on small alphabets.
The aim of the paper is to present a solution of the problem 32 posed by K. Denecke, S.L. Wismath in: {\it Hyperidentities and clones}, Logic and Applications Vol. 14, Gordon and Breach Science Publishers, 2000.
We claim to resolve the P=?NP problem via a formal argument for P=NP.
Given $k$ collections of 2SAT clauses on the same set of variables $V$, can we find one assignment that satisfies a large fraction of clauses from each collection? We consider such simultaneous constraint satisfaction problems, and design…
In this article we use the variational method developed by Szulkin \cite{szulkin} to prove the existence of a positive solution for the following logarithmic Schr\"{o}dinger equation $$ \left\{ \begin{array}{lc} -{\epsilon}^2\Delta u+…
This work is a continuation of what was done in a previous paper and strongly connected to the recent work of U. Abel and I. Rasa [arXiv:1707.00127]
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…
We present various analytic and number theoretic results concerning the #SAT problem as reflected when reduced into a #PART problem. As an application we propose a heuristic to probabilistically estimate the solution of #SAT problems.
In this paper, the author gives a solution to an open problem about the famous Mathieu series, that is, he obtains a sharp double inequality for bounding this series.
We study the usual notion of Scott rank but in the setting of Polish metric spaces. The signature consists of distance relations: for each rational $q > 0$, there is a relation $R_{<q}(x,y)$ stating that the distance of $x$ and $y $ is less…
This is a historical introduction to the theory of Stirling numbers of the second kind S(n,k) from the point of view of analysis. We tell the story of their birth in the book of James Stirling (1730) and show how they mature in the works of…
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…
Pattern-Based Constraint Satisfaction and Logic Puzzles develops a pure logic, pattern-based perspective of solving the finite Constraint Satisfaction Problem (CSP), with emphasis on finding the "simplest" solution. Different ways of…
This paper presents fifteen problems about mapping class groups. It is an expanded and updated version of the author's preprint "Ten problems on the mapping class groups". The paper will appear in the book "Problems on Mapping Class Groups…
We study the famous mathematical puzzle of prisoners and hats. We introduce a framework in which various variants of the problem can be formalized. We examine three particular versions of the problem (each one in fact a class of problems)…
We solve multiple conjectures by Byszewski and Ulas about the sum of base $b$ digits function. In order to do this, we develop general results about summations over the sum of digits function. As a corollary, we describe an unexpected new…
A classical probabilistic explanation for Hardy's quantum paradox is demonstrated.