Related papers: A Brief Note on a Recent Claim About NP-Hard Probl…
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…
In this paper, we prove a $p$-Hardy inequality on the discrete half-line with weights $n^{\alpha}$ for all real $p > 1$. Building on the work of Miclo for $p = 2$ and Muckenhoupt in the continuous settings, we develop a quantitative…
In a recent paper, Nagata [1] claims to derive inconsistencies from quantum mechanics. In this paper, we show that the inconsistencies do not come from quantum mechanics, but from extra assumptions about the reality of observables.
We investigate certain optimization problems for Shannon information measures, namely, minimization of joint and conditional entropies $H(X,Y)$, $H(X|Y)$, $H(Y|X)$, and maximization of mutual information $I(X;Y)$, over convex regions. When…
I briefly review some results and open questions in the analysis of CP violation in the B sector.
In this paper we study the long-standing open question regarding the computational complexity of one of the core problems in supply chains management, the periodic joint replenishment problem. This problem has received a lot of attention…
In this small note we ask several questions which are relevant to the construction of the self-consistent neutrino theory of light. The previous confusions in such attempts are explained in the more detailed publication.
Can the computational complexity theory of computer science and mathematics say something new about unresolved problems in quantum physics? Particularly, can the P versus NP question in the computational complexity theory be a factor in the…
Two recent papers (Renou et al., arXiv:2101.10873, and Chen et al., arXiv:2103.08123) have indicated that complex numbers are necessary for quantum theory. This short note is a comment on their result.
This technical note extends recent results on the computational complexity of globally minimizing the error of piecewise-affine models to the related problem of minimizing the error of switching linear regression models. In particular, we…
The complexity of quantum computation remains poorly understood. While physicists attempt to find ways to create quantum computers, we still do not have much evidence one way or the other as to how useful these machines will be. The tools…
We study the (non-uniform) quantified constraint satisfaction problem QCSP(H) as H ranges over partially reflexive cycles. We obtain a complexity-theoretic dichotomy: QCSP(H) is either in NL or is NP-hard. The separating conditions are…
Several physically inspired problems have been proven undecidable; examples are the spectral gap problem and the membership problem for quantum correlations. Most of these results rely on reductions from a handful of undecidable problems,…
We claim to resolve the P=?NP problem via a formal argument for P=NP.
Some interesting heavy-flavor questions are mentioned that may yield to the methods of lattice QCD. Special emphasis is placed on topics which arise in the discussion of CP violation in $B$ decays. Other subjects include quarkonium and…
This paper calls attention to the current state of the probability (P) domain which presents weak points at the mathematical level and more significant flaws at the application level. Popper notices how fundamental issues raised in quantum…
In a recent paper, Brusco, K\"ohn and Steinley [Ann. Oper. Res. 206:611-626 (2013)] conjecture that the 2 bins special case of the one-dimensional minimax bin-packing problem with bin size constraints might be solvable in polynomial time.…
In this note some philosophical thoughts and observations about mathematics are expressed, arranged as challenges to some common claims.
It has recently been shown (Burer, Math. Program Ser. A 120:479-495, 2009) that a large class of NP-hard nonconvex quadratic programming problems can be modeled as so called completely positive programming problems, which are convex but…
The main purpose of this note is to pose a couple of problems which are easily formulated thought some seem to be not yet solved. These problems are of general interest for discrete mathematics including a new twig of a bough of theory of…