scholarly journals Exceptional Set for Sums of Symmetric Mixed Powers of Primes

Symmetry ◽  
2020 ◽  
Vol 12 (3) ◽  
pp. 367
Author(s):  
Jinjiang Li ◽  
Chao Liu ◽  
Zhuo Zhang ◽  
Min Zhang
Keyword(s):  
Upper Bound ◽  
Exceptional Set ◽  
Upper Bound Estimate ◽  
Hardy Littlewood Method

The main purpose of this paper is to use the Hardy–Littlewood method to study the solvability of mixed powers of primes. To be specific, we consider the even integers represented as the sum of one prime, one square of prime, one cube of prime, and one biquadrate of prime. However, this representation can not be realized for all even integers. In this paper, we establish the exceptional set of this kind of representation and give an upper bound estimate.

scholarly journals Second Hankel determinant for certain class of bi-univalent functions defined by Chebyshev polynomials

2019 ◽  
Vol 12 (02) ◽  
pp. 1950017
Author(s):  
H. Orhan ◽  
N. Magesh ◽  
V. K. Balaji
Keyword(s):  
Unit Disk ◽  
Upper Bound ◽  
Chebyshev Polynomials ◽  
Univalent Functions ◽  
Function Class ◽  
Open Unit ◽  
Open Unit Disk ◽  
Hankel Determinant ◽  
Second Hankel Determinant ◽  
Upper Bound Estimate

In this work, we obtain an upper bound estimate for the second Hankel determinant of a subclass [Formula: see text] of analytic bi-univalent function class [Formula: see text] which is associated with Chebyshev polynomials in the open unit disk.

On the speed of convergence to limit distributions for Hecke L-functions associated with ideal class characters

Analysis ◽  
2006 ◽  
Vol 26 (3) ◽  
Author(s):  
Kohji Matsumoto
Keyword(s):  
Upper Bound ◽  
Ideal Class ◽  
Speed Of Convergence ◽  
Limit Distributions ◽  
Upper Bound Estimate

We prove an upper bound estimate of the speed of convergence to limit distributions

Fixed time synchronization of a class of chaotic systems based via the saturation control

2021 ◽  
Vol 67 (4 Jul-Aug) ◽  
pp. 041401
Author(s):  
Jiaojiao Fu ◽  
Runzi Luo ◽  
Meichun Huang ◽  
Haipeng Su
Keyword(s):  
Upper Bound ◽  
Chaotic Systems ◽  
Time Synchronization ◽  
Fixed Time ◽  
Stability Theorem ◽  
Backstepping Method ◽  
Time Stability ◽  
Saturation Control ◽  
New Chaotic System ◽  
Upper Bound Estimate

In this paper, we discuss the fixed time synchronization of a class of chaotic systems based on the backstepping control with disturbances. A new and important fixed time stability theorem is presented. The upper bound estimate formulas of the settling time are also given which are different from the existing results in the literature. Based on the new fixed time stability theorem, a novel saturation controller for the fixed time synchronization a class of chaotic systems is proposed via the backstepping method. Finally, the new chaotic system is taken as an example to illustrate the applicability of the obtained theory.

Hardy–Orlicz Spaces of Dirichlet Series: An Interpolation Problem on Abscissae of Convergence

2019 ◽  
Author(s):  
Maxime Bailleul ◽  
Pascal Lefèvre ◽  
Luis Rodríguez-Piazza
Keyword(s):  
Dirichlet Series ◽  
Hardy Spaces ◽  
Upper Bound ◽  
Interpolation Problem ◽  
Orlicz Spaces ◽  
Elementary Method ◽  
Abscissa Of Convergence ◽  
Upper Bound Estimate

Abstract The study of Hardy spaces of Dirichlet series denoted by $\mathscr{H}^p$ ($p\geq 1$) was initiated in [7] when $p=2$ and $p=\infty $, and in [2] for the general case. In this paper we introduce the Orlicz version of spaces of Dirichlet series $\mathscr{H}^\psi $. We focus on the case $\psi =\psi _q(t)=\exp (t^q)-1,$ and we compute the abscissa of convergence for these spaces. It turns out that its value is $\min \{1/q\,,1/2\}$ filling the gap between the case $\mathscr{H}^\infty $, where the abscissa is equal to $0$, and the case $\mathscr{H}^p$ for $p$ finite, where the abscissa is equal to $1/2$. The upper-bound estimate relies on an elementary method that applies to many spaces of Dirichlet series. This answers a question raised by Hedenmalm in [6].

scholarly journals An upper-bound estimate for the accuracy of volume-area scaling

2013 ◽  
Vol 7 (3) ◽  
pp. 2293-2331 ◽  
Author(s):  
D. Farinotti ◽  
M. Huss
Keyword(s):  
Volume Change ◽  
Upper Bound ◽  
Synthetic Data ◽  
Volume Changes ◽  
Real World Data ◽  
Secondary Importance ◽  
Ice Volume ◽  
Volume Measurements ◽  
Upper Bound Estimate ◽  
The Impact

Abstract. Volume-area scaling is the most popular method for estimating the ice volume of large glacier samples. Here, a series of resampling experiments based on different sets of synthetic data are presented in order to derive an upper-bound estimate (i.e. a level achieved only with ideal conditions) for the accuracy of its application. We also quantify the maximum accuracy expected when scaling is used for determining the glacier volume change, and area change of a given glacier population. A comprehensive set of measured glacier areas, volumes, area and volume changes is evaluated to investigate the impact of real-world data quality on the so assessed accuracies. For populations larger than a few thousand glaciers, the total ice volume can be recovered within 30% if all measurements available worldwide are used for estimating the scaling coefficients. Assuming no systematic biases in ice volume measurements, their uncertainty is of secondary importance. Knowing the individual areas of a glacier sample for two points in time allows recovering the corresponding ice volume change within 40% for populations larger than a few hundred glaciers, both for steady-state and transient geometries. If ice volume changes can be estimated without bias, glacier area changes derived from volume-area scaling show similar uncertainties as for the volume changes. This paper does not aim at making a final judgement about the suitability of volume-area scaling, but provides the means for assessing the accuracy expected from its application.

Estimating the Critical Parameter in Almost Stochastic Dominance from Insurance Deductibles

2020 ◽  
Author(s):  
Yi-Chieh Huang ◽  
Kamhon Kan ◽  
Larry Y. Tzeng ◽  
Kili C. Wang
Keyword(s):  
Real World ◽  
Upper Bound ◽  
Stochastic Dominance ◽  
Critical Parameter ◽  
Experimental Studies ◽  
Decision Makers ◽  
The Other ◽  
Real World Data ◽  
Upper Bound Estimate ◽  
Almost Stochastic Dominance

Knowing how small a violation of stochastic dominance rules would be accepted by most individuals is a prerequisite to applying almost stochastic dominance criteria. Unlike previous laboratory-experimental studies, this paper estimates an acceptable violation of stochastic dominance rules with 939,690 real world data observations on a choice of deductibles in automobile theft insurance. We find that, for all policyholders in the sample who optimally chose a low deductible, the upper bound estimate of the acceptable violation ratio is 0.0014, which is close to zero. On the other hand, considering that most decision makers, such as 99% (95%) of the policyholders in the sample, optimally chose the low deductible, the upper bound estimate of the acceptable violation ratio is 0.0405 (0.0732). Our results provide reference values for the acceptable violation ratio for applying almost stochastic dominance rules. This paper was accepted by Manel Baucells, decision analysis.

Sign in / Sign up

Export Citation Format

Share Document