We show that the identity bounded Turing degrees of computably enumerable sets are not dense.

We provide a few natural applications of the analytic newvectors, initiated in \cite{JN} arXiv:1911.01880, to some questions automorphic forms for $\mathrm{PGL}_n(\mathbb{Z})$ with $n\ge 2$, archimedean conductor aspect. prove an orthogonality result Fourier coefficients, density estimate non-tempered forms, equidistribution Satake parameters respect Sato--Tate measure, and second moment centra...

fractional calculus has been used to model physical and engineering processes that are found to be best described by fractional differential equations. therefore, a reliable and efficient technique as a solution is regarded.this paper develops approximate solutions for boundary value problems ofdifferential equations with non-integer order by using the shannon waveletbases. wavelet bases have d...

We introduce and characterize angular right symmetric approximate points of the algebra all bounded linear operators defined on either real or complex Hilbert spaces.

Let V be a Hilbert space, a(·, ·) : V × V → lR a bounded, V-elliptic bilinear form and : V → lR a bounded linear functional. We want to approximate the variational equation: Find u ∈ V such that (3.1) a(u, v) = (v) , v ∈ V. We recall that the Lax-Milgram Lemma ensures the existence and uniqueness of a solution of (3.1). Now, given a finite-dimensional subspace V h ⊂ V , dim V h = n h , the Ritz...

Some versions of the maximum common subgraph problem are studied and approximation algorithms are given. The maximum bounded common induced subgraph problem is shown to be Max SNP-hard and the maximum unbounded common induced subgraph problem is shown to be as hard to approximate as the maximum independent set problem. The maximum common induced connected subgraph problem is still harder to app...

Approximate solutions for optimization problems become of interest if the ‘true’ optimum cannot be found: this may happen for the simple reason that an optimum does not exist or because of the ‘bounded rationality’ (or bounded accuracy) of the optimizer. This paper characterizes several approximate solutions by means of consistency and additional requirements. In particular we consider invarian...