For two dimensional lattices, a Gaussian basis achieves all two successive minima. For dimension larger than two, constructing a pairwise Gaussian basis is useful to compute short vectors of the lattice. For three dimensional lattices, Semaev showed that one can convert a pairwise Gaussian basis to a basis achieving all three successive minima by one simple reduction. A pairwise Gaussian basis can be obtained from a given basis by executing Gauss algorithm for each pair of basis vectors repeatedly until it returns a pairwise Gaussian basis. In this article, we prove a necessary and sufficient condition for a pairwise Gaussian basis to achieve the first k successive minima for three dimensional lattices for each k ∈ {1, 2, 3} by modifying Semaev's condition. Our condition directly checks whether a pairwise Gaussian basis contains the first k shortest independent vectors for three dimensional lattices. LLL is the most basic lattice basis reduction algorithm and we study how to use LLL to compute a pairwise Gaussian basis. For δ ≥ 0.9, we prove that LLL(δ) with an additional simple reduction turns any basis for a three dimensional lattice into a pairwise SV-reduced basis. By using this, we convert an LLL reduced basis to a pairwise Gaussian basis in a few simple reductions. Our result suggests that the LLL algorithm is quite effective to compute a basis with all three successive minima for three dimensional lattices.

This paper presents a new optimal three-step eighth-order family of iterative methods for finding multiple roots of nonlinear equations. Different from the all existing optimal methods of the eighth-order, the new iterative scheme is constructed using one function and three derivative evaluations per iteration, preserving the efficiency and optimality in the sense of Kung-Traub's conjecture. Theoretical results are verified through several standard numerical test examples. The basins of attraction for several polynomials are also given to illustrate the dynamical behaviour and the obtained results show better stability compared to the recently developed optimal methods.

In this paper, we study backward stochastic differential equations (BSDEs shortly) with jumps that have Lipschitz generator in a general filtration supporting a Brownian motion and an independent Poisson random measure. Under just integrability on the data we show that such equations admit a unique solution which belongs to class 𝔻.

Our motivation in this note is to find equal hyperharmonic numbers of different orders. In particular, we deal with the integerness property of the difference of hyperharmonic numbers. Inspired by finiteness results from arithmetic geometry, we see that, under some extra assumption, there are only finitely many pairs of orders for two hyperharmonic numbers of fixed indices to have a certain rational difference. Moreover, using analytic techniques, we get that almost all differences are not integers. On the contrary, we also obtain that there are infinitely many order values where the corresponding differences are integers.

This paper studies the eigenvalues of the G(·)-Laplacian Dirichlet problem $$\{-div\;\(\frac{g(x,\;{\mid}{\nabla}u{\mid})}{{\mid}{\nabla}u{\mid}}{\nabla}u\)={\lambda}\;\(\frac{g(x,{\mid}u{\mid})}{{\mid}u{\mid}}u\)\;in\;{\Omega}, \\u\;=\;0\;on\;{\partial}{\Omega},$$ where Ω is a bounded domain in ℝ^N and g is the density of a generalized Φ-function G(·). Using the Lusternik-Schnirelmann principle, we show the existence of a nondecreasing sequence of nonnegative eigenvalues.

In this paper, we investigate the portfolio optimization problem under the SVCEV model, which is a hybrid model of constant elasticity of variance (CEV) and stochastic volatility, by taking into account of minimum-entropy robustness. The Hamilton-Jacobi-Bellman (HJB) equation is derived and the first two orders of optimal strategies are obtained by utilizing an asymptotic approximation approach. We also derive the first two orders of practical optimal strategies by knowing that the underlying Ornstein-Uhlenbeck process is not observable. Finally, we conduct numerical experiments and sensitivity analysis on the leading optimal strategy and the first correction term with respect to various values of the model parameters.

We study the real-analytic continuation of local real-analytic solutions to the Cauchy problems of quasi-linear partial differential equations of first order for a scalar function. By making use of the first integrals of the characteristic vector field and the implicit function theorem we determine the maximal domain of the analytic extension of a local solution as a single-valued function. We present some examples including the scalar conservation laws that admit global first integrals so that our method is applicable.

Feller introduced an unfair-fair-game in his famous book [3]. In this game, at each trial, player will win 2^k yuan with probability p_k = 1/2^kk(k + 1), k ∈ ℕ, and zero yuan with probability p₀ = 1 - Σ^∞_k=1 p_k. Because the expected gain is 1, player must pay one yuan as the entrance fee for each trial. Although this game seemed "fair", Feller [2] proved that when the total trial number n is large enough, player will loss n yuan with its probability approximate 1. So it's an "unfair" game. In this paper, we study in depth its convergence in probability, almost sure convergence and convergence in distribution. Furthermore, we try to take 2^k = m to reduce the values of random variables and their corresponding probabilities at the same time, thus a new probability model is introduced, which is called as the related model of Feller's unfair-fair-game. We find out that this new model follows a long-tailed distribution. We obtain its weak law of large numbers, strong law of large numbers and central limit theorem. These results show that their probability limit behaviours of these two models are quite different.

In this paper we develop the homological properties of the Gorenstein (𝓛, 𝓐)-flat R-modules 𝓖𝓕_{(𝓕(R),𝓐)} proposed by Gillespie, where the class 𝓐 ⊆ Mod(R^op) sometimes corresponds to a duality pair (𝓛, 𝓐). We study the weak global and finitistic dimensions that come with the class 𝓖𝓕_{(𝓕(R),𝓐)} and show that over a (𝓛, 𝓐)-Gorenstein ring, the functor - ⊗_R - is left balanced over Mod(R^op) × Mod(R) by the classes 𝓖𝓕_{(𝓕(R^op),𝓐)} × 𝓖𝓕_{(𝓕(R),𝓐)}. When the duality pair is (𝓕(R), 𝓕𝓟Inj(R^op)) we recover the G. Yang's result over a Ding-Chen ring, and we see that is new for (Lev(R), AC(R^op)) among others.

In this paper, we introduce the concepts of (quasi-)weakly almost periodic point and minimal center of attraction for ℤ^d₊-actions, explore the connections of levels of the topological structure the orbits of (quasi-)weakly almost periodic points and discuss the relations between (quasi-)weakly almost periodic point and minimal center of attraction. Especially, we investigate the chaotic dynamics near or inside the minimal center of attraction of a point in the cases of S-generic setting and non S-generic setting, respectively. Actually, we show that weakly almost periodic points and quasi-weakly almost periodic points have distinct topological structures of the orbits and we prove that if the minimal center of attraction of a point is non S-generic, then there exist certain Li-Yorke chaotic properties inside the involved minimal center of attraction and sensitivity near the involved minimal center of attraction; if the minimal center of attraction of a point is S-generic, then there exist stronger Li-Yorke chaotic (Auslander-Yorke chaotic) dynamics and sensitivity (ℵ₀-sensitivity) in the involved minimal center of attraction.