Results 31 to 40 of about 126,431 (269)

Coproximinality in the Space of Bounded Functions [PDF]

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2014
As a counterpart to best approximation in Banach spaces, the best coapproximation was introduced by Franchetti and Furi (1972). In this paper, we shall consider the relation between coproximinality of a nonempty subsetMof a Banach spaceXand ofC(S, M)inC(S, X).
Eyad Abu-Sirhan, Zuhier Altawallbeh
openaire   +3 more sources

Error Bounds for Fractional Integral Inequalities with Applications

open access: yesFractal and Fractional
Fractional calculus has been a concept used to obtain new variants of some well-known integral inequalities. In this study, our main goal is to establish the new fractional Hermite–Hadamard, and Simpson’s type estimates by employing a differentiable ...
Nouf Abdulrahman Alqahtani   +4 more
doaj   +1 more source

BOUNDING BY CANONICAL FUNCTIONS, WITH CH [PDF]

open access: yesJournal of Mathematical Logic, 2003
We show that the members of a certain class of semi-proper iterations do not add countable sets of ordinals. As a result, starting from suitable large cardinals one can obtain a model in which the Continuum Hypothesis holds and every function from ω1 to ω1 is bounded on a club by a canonical function for an ordinal less than ω2.
Paul B. Larson, Saharon Shelah
openaire   +3 more sources

An inequality for bounded functions [PDF]

open access: yesMathematical Inequalities & Applications, 2014
In this note we prove optimal inequalities for bounded functions in terms of their deviation from their mean. These results extend and generalize some known inequalities due to Thong (2011) and Perfetti (2011)
openaire   +2 more sources

Research on Bounded Rationality of Fuzzy Choice Functions

open access: yesThe Scientific World Journal, 2014
The rationality of a fuzzy choice function is a hot research topic in the study of fuzzy choice functions. In this paper, two common fuzzy sets are studied and analyzed in the framework of the Banerjee choice function.
Xinlin Wu, Yong Zhao
doaj   +1 more source

Approximation Algorithms for Complex-Valued Ising Models on Bounded Degree Graphs [PDF]

open access: yesQuantum, 2019
We study the problem of approximating the Ising model partition function with complex parameters on bounded degree graphs. We establish a deterministic polynomial-time approximation scheme for the partition function when the interactions and external ...
Ryan L. Mann, Michael J. Bremner
doaj   +1 more source

Sociodemographic Factors Associated With Later Stage at Diagnosis of Pediatric Germ Cell Tumors: A Report From Children's Oncology Group Registries ACCRN07 and APEC14B1

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Germ cell tumors (GCTs) often arise in the ovaries and testes (extracranial) but can also develop in the brain (intracranial). We examined the relationship of individual, family, and community‐level socioeconomic status (SES) with stage of disease at diagnosis in a cohort of pediatric patients with GCT from Children's Oncology Group
Heydon K. Kaddas   +7 more
wiley   +1 more source

Matrix Inequalities Based Robust Model Predictive Control for Vehicle Considering Model Uncertainties, External Disturbances, and Time-Varying Delay

open access: yesFrontiers in Neurorobotics, 2021
In this paper, we design a robust model predictive control (MPC) controller for vehicle subjected to bounded model uncertainties, norm-bounded external disturbances and bounded time-varying delay. A Lyapunov-Razumikhin function (LRF) is adopted to ensure
Wenjun Liu   +3 more
doaj   +1 more source

Fractional Certificates for Bounded Functions.

open access: yesElectron. Colloquium Comput. Complex., 2022
A folklore conjecture in quantum computing is that the acceptance probability of a quantum query algorithm can be approximated by a classical decision tree, with only a polynomial increase in the number of queries. Motivated by this conjecture, Aaronson and Ambainis (Theory of Computing, 2014) conjectured that this should hold more generally for any ...
Shachar Lovett, Jiapeng Zhang
openaire   +5 more sources

An upper bound on Jacobsthal’s function [PDF]

open access: yesMathematics of Computation, 2014
Let \(p_i\) be the \(i\)-th prime number and \(P_k\) be the product of all primes up to \(p_k\). Let Jacobsthal's function \(h(k)\) denote the smallest number \(m\) such that every sequence of \(m\) consecutive integers contains an integer coprime to \(P_k\).
Fintan J. Costello, Paul Watts
openaire   +4 more sources

Home - About - Disclaimer - Privacy