Related papers: On Arroyo-Figueroa's Proof that $\mathrm{P} \neq \…
The domain of convergence of a Heun function obtained through the Poincar\'{e}--Perron (P--P) theorem is not absolute convergence but conditional one [2]. We show that a uniqueness theorem is not available if we apply the P--P theorem into…
One way of suggesting that an NP problem may not be NP-complete is to show that it is in the class UP. We suggest an analogous new approach---weaker in strength of evidence but more broadly applicable---to suggesting that concrete~NP…
We prove that if conditions I-II (below) hold and there is a sequence of Boolean functions $f_n$ hard to approximate by p-size circuits such that p-size circuit lower bounds for $f_n$ do not have p-size proofs in Extended Frege system EF,…
We examine a proof by Craig Alan Feinstein that P is not equal to NP. We present counterexamples to claims made in his paper and expose a flaw in the methodology he uses to make his assertions. The fault in his argument is the incorrect use…
We prove that the equivalence of two fundamental problems in the theory of computing. For every polynomial $t(n)\geq (1+\varepsilon)n, \varepsilon>0$, the following are equivalent: - One-way functions exists (which in turn is equivalent to…
Property $\mathcal{O}$ for an arbitrary complex, Fano manifold $X$, is a statement about the eigenvalues of the linear operator obtained from the quantum multiplication of the anticanonical class of $X$. Conjecture $\mathcal{O}$ is a…
A conjecture by Sun states that the partition function $p(n)$, for $n>1$, is never a perfect power. Recent work by Merca et al. proposes generalizations of perfect-power repulsion for $p(n)$. In this note, we prove these generalizations for…
The $A$-partition function $p_A(n)$ enumerates those partitions of $n$ whose parts belong to a fixed (finite or infinite) set $A$ of positive integers. On the other hand, the extended $A$-partition function…
The restoration of an additive function defined on P parallelepipeds via its derivative with respect to P parallelepipeds is studied. The obtained theorem is applied to the questions of uniqueness of multiple series with regard to Haar and…
The relationship between the complexity classes P and NP is a question that has not yet been answered by the Theory of Computation. The existence of a language in NP, proven not to belong to P, is sufficient evidence to establish the…
We conclude from Goedel's Theorem VII of his seminal 1931 paper that every recursive function f(x_{1}, x_{2}) is representable in the first-order Peano Arithmetic PA by a formula [F(x_{1}, x_{2}, x_{3})] which is algorithmically verifiable,…
Harvey Friedman, in his remarkable paper Finite functions and the necessary use of large cardinals, Ann. Math. 148:803-893, 1998 and in a technical report, Applications of large cardinals to graph theory, Ohio State University, 1997,…
We provide a simple proof of a result, due to G. Alberti, concerning a rank-one property for the singular part of the derivative of vector-valued functions of bounded variation.
We study the P versus NP problem through properties of functions and monoids, continuing the work of [3]. Here we consider inverse monoids whose properties and relationships determine whether P is different from NP, or whether injective…
A recent breakthrough [Hirahara and Nanashima, STOC'2024] established that if $\mathsf{NP} \not \subseteq \mathsf{ioP/poly}$, the existence of zero-knowledge with negligible errors for $\mathsf{NP}$ implies the existence of one-way…
Rabi and Sherman [RS97] presented novel digital signature and unauthenticated secret-key agreement protocols, developed by themselves and by Rivest and Sherman. These protocols use ``strong,'' total, commutative (in the case of multi-party…
We show that Hofman's claim of a "counter-example" to Diaby's LP formulation of the TSP is invalid.
The Three Gap Theorem, also known as the Steinhaus Conjecture, is a classical result on the combinatorics of the fractional part function, and has since been generalized in many ways. In this paper, we pose a new problem related to these…
In this article, we discuss the question of whether P equals NP, we do not follow the line of research of many researchers, which is to try to find such a problem Q, and the problem Q belongs to the class of NP-complete, if the problem Q is…
A family of polynomial \tau-functions for the NLS-Toda hierarchy is constructed. The hierarchy is associated with the homogeneous vertex operator representation of the affine algebra \g of type A_1^{(1)}. These \tau-functions are given…