Related papers: A Brief Note on a Recent Claim About NP-Hard Probl…
We obtain simple proofs of certain inequalites for bivariate means.
We prove limit equalities between the sharp constants in weighted Nikolskii-type inequalities for multivariate polynomials on an $m$-dimensional cube and ball and the corresponding constants for entire functions of exponential type.
In this short note is on the equivalence between non-Newtonian metric (particularly multiplicative metric) and metric. We present a different proof the fact that the notion of a non-Newtonian metric space is not more general than that of a…
This article is a snap-shot of a web site, which has been collecting open problems in quantum information for several years, and documenting the progress made on these problems. By posting it we make the complete collection available in one…
We review some aspects of neutrino physics and CP violation both in the quark and lepton sectors.
We show that given a satisfiable instance of the 2-to-1 Label Cover problem, it is NP-hard to find a $(23/24 + \eps)$-satisfying assignment.
The states accepted by a quantum circuit are known as the witnesses for the quantum circuit's satisfiability. The assumption BQP does not equal QMA implies that no efficient algorithm exists for constructing a witness for a quantum circuit…
We show that the problem of determining the feasibility of quadratic systems over $\mathbb{C}$, $\mathbb{R}$, and $\mathbb{Z}$ requires exponential time. This separates P and NP over these fields/rings in the BCSS model of computation.
In this paper we provide an application to the Neumann problem of a recent three critical points theorem.
The main purpose of this article is to obtain (weighted) fractional Hardy inequalities with a remainder and fractional Hardy-Sobolev-Maz'ya inequalities valid for $1<p<2$.
In this note we show that the only result of [Rocky Mountain J. Math. 54 (2024), no. 4, 995--1004] is nothing more than a misformulated version of an exercise from classical texts, presented with a flawed proof. To place the matter on…
The paper is withdrawn by the authors and replaced be an improved and extended version arxiv: 0812.2968
We prove invariance theorems for general inequalities of different metrics and apply them to limit relations between the sharp constants in the multivariate Markov-Bernstein-Nikolskii type inequalities with the polyharmonic operator for…
In 2009, using the $\textsf{Fourier Checking}$ problem, Aaronson claimed to construct the relativized worlds such that $\textsf{BQP} \not\subset \mathsf{BPP_{path}}$ and $\textsf{BQP} \not\subset \textsf{SZK}$. However, there are subtle…
In this paper we discuss various special problems on packing and covering. Among others we survey the problems and results concerning finite arrangements, Minkowskian, saturated, compact, and totally separable packings. We discuss shortest…
We discuss how CP violation originating in the right-handed neutrino sector can feed into the quark sector, in an otherwise CP invariant theory. The dominant effects are superweak, and we suggest that this may yield a natural resolution of…
This is a philosophical paper. It claims that there is a gap to be filled in the relationship between complexity theory (CT) and quantum theory (QT). This gap concerns two very distinct understandings of time. The paper provides the ground…
In this paper we study Hardy and Poincar\'e inequalities and their weak versions for quadratic forms satisfying the first Beurling-Deny criterion. We employ these inequalities to establish a criticality theory for such forms.
The central conjecture of parameterized complexity states that FPT is not equal to W[1], and is generally regarded as the parameterized counterpart to P != NP. We revisit the issue of the plausibility of FPT != W[1], focusing on two…
Cs\'{a}ji, Jungers, and Blondel prove that while a PageRank optimization problem with edge selection constraints is NP-hard, it can be solved optimally in polynomial time for the unconstrained case. This theoretical result is accompanied by…