We give the direct method of moving planes for solutions to the conformally invariant fractional power subLaplace equation on the Heisenberg group. The method is based on four maximum principles derived here. Then symmetry and nonexistence of positive cylindrical solutions are proved.

G-VaR, which is a type of worst-case value-at-risk (VaR), is defined as measuring risk incorporating model uncertainty. Compared with most extant notions of worst-case VaR, G-VaR can be computed using an explicit formula, and can be applied to large portfolios of several hundred dimensions with low computational cost. We also apply G-VaR to robust portfolio optimization, thereby providing a tractable

Life data frequently arise in many reliability studies, such as accelerated life tests studies. This paper considers the part of life data where failure and censoring observations may exist. To develop statistical methods and theory for the analysis of these data, a new approach was proposed to obtain the exact lower and upper confidence limits for the mean life of the exponential distribution with

We consider the inverse eigenvalue problems for stationary Dirac systems with differentiable self-adjoint matrix potential. The theorem of Ambarzumyan for a Sturm-Liouville problem is extended to Dirac operators, which are subject to separation boundary conditions or periodic (semi-periodic) boundary conditions, and some analogs of Ambarzumyan’s theorem are obtained. The proof is based on the existence

In this paper, we develop the quantile regression (QR) estimation for the first-order integer-valued autoregressive (INAR(1)) models by defining the smoothing INAR(1) process. Jittering method is used to derive the QR estimators for the autoregressive coefficient and the quantile of innovations. The consistency and asymptotic normality of the proposed estimators are established. The performances of

Let a, b, k be nonnegative integers with 2 ≤ a < 6. A graph G is called a k-Hamiltonian graph if G − U contains a Hamiltonian cycle for any subset U ⊆ V(G) with ∣U∣ = k. An [a, b]-factor F of G is called a Hamiltonian [a, b]-factor if F contains a Hamiltonian cycle. If G − U admits a Hamiltonian [a, b]-factor for any subset U ⊆ V(G) with ∣U∣ = k, then we say that G has a k-Hamiltonian [a, b]-factor

This paper studies the asymptotic behavior of solutions for a nonlinear convection diffusion reaction equation in ℝn. Firstly, the global existence and uniqueness of classical solutions for small initial data are established. Then, we obtain the Lp, 2 ⩽ p ⩽ +℞ decay rate of solutions. The approach is based on detailed analysis of the Green function of the linearized equation with the technique of long

To solve the choice of multi-objective game’s equilibria, we construct general bargaining games called self-bargaining games, and define their individual welfare functions with three appropriate axioms. According to the individual welfare functions, we transform the multi-objective game into a single-objective game and define its bargaining equilibrium, which is a Nash equilibrium of the single-objective

A type of infinite horizon forward-backward doubly stochastic differential equations is studied. Under some monotonicity assumptions, the existence and uniqueness results for measurable solutions are established by means of homotopy method. A probabilistic interpretation for solutions to a class of stochastic partial differential equations combined with algebra equations is given. A significant feature

For the semiparametric regression model: \(Y^{(j)}(x_{in},t_{in})=t_{in}\beta+g(x_{in})+e^{(j)}(x_{in})\), 1 ≤ j ≤ k, 1≤ i ≤ n, where tin ∈ ℝ and xin ∈ ℝp are known to be nonrandom, g is an unknown continuous function on a compact set A in ℝp, ej(xin) are m-extended negatively dependent random errors with mean zero, Y(j)(xin, tin) represent the j-th response variables which are observable at points

Let G be a graph that admits a perfect matching M. A forcing set S for a perfect matching M is a subset of M such that it is contained in no other perfect matchings of G. The cardinality of a forcing set of M with the smallest size is called the forcing number of M, denoted by f(G, M). The forcing spectrum of G is defined as: Spec(G) = {f(G, M)∣ M is a perfect matching of G}. In this paper, by applying

An edge-colored graph G is conflict-free connected if any two of its vertices are connected by a path, which contains a color used on exactly one of its edges. The conflict-free connection number of a connected graph G, denoted by cfc(G), is defined as the minimum number of colors that are required in order to make G conflict-free connected. In this paper, we investigate the relation between the conflict-free

This paper is concerned with the study of optimality conditions for minimax optimization problems with an infinite number of constraints, denoted by (MMOP). More precisely, we first establish necessary conditions for optimal solutions to the problem (MMOP) by means of employing some advanced tools of variational analysis and generalized differentiation. Then, sufficient conditions for the existence

Motivated by the connection with the genus of the corresponding link and its application on DNA polyhedral links, in this paper, we introduce a parameter smax(G), which is the maximum number of circles of states of the link diagram D(G) corresponding to a plane (positive) graph G. We show that smax(G) does not depend on the embedding of G and if G is a 4-edge-connected plane graph then smax(G) is equal

Covering arrays (CA) of strength t, mixed level or fixed level, have been applied to software testing to aim for a minimum coverage of all t-way interactions among components. The size of CA increases with the increase of strength interaction t, which increase the cost of software testing. However, it is quite often that some certain components have strong interactions, while others may have fewer

This paper addresses the issue of testing sphericity and identity of high-dimensional population covariance matrix when the data dimension exceeds the sample size. The central limit theorem of the first four moments of eigenvalues of sample covariance matrix is derived using random matrix theory for generally distributed populations. Further, some desirable asymptotic properties of the proposed test

This paper is devoted to the partial regularity of suitable weak solutions to the system of the incompressible shear-thinning flow in a bounded domain Ω ⊂ ℝn, n ≥ 2. It is proved that there exists a suitable weak solution of the shear-thinning fluid in the n-D smooth bounded domain (for n ≥ 2). For 3D model, it is proved that the singular points are concentrated on a closed set whose 1 dimensional

In this paper, we concern the Klein-Gordon-Maxwell system with steep potential well $$\left\{{\matrix{{- {\rm{\Delta u +}}\left({\lambda a\left(x \right) + 1} \right)u - \left({2\omega + \phi} \right)\phi u = f\left({x,u} \right),} \hfill & {{\rm{in}}\,{\mathbb{R}^3},} \hfill \cr {- {\rm{\Delta}}\phi {\rm{=}} - \left({\omega + \phi} \right){u^2},} \hfill & {{\rm{in}}\,{\mathbb{R}^3}.} \hfill \cr}}

Stochastic gradient descent (SGD) is one of the most common optimization algorithms used in pattern recognition and machine learning. This algorithm and its variants are the preferred algorithm while optimizing parameters of deep neural network for their advantages of low storage space requirement and fast computation speed. Previous studies on convergence of these algorithms were based on some traditional

In this paper, we propose a new nonmonotone trust region Barzilai-Borwein (BB for short) method for solving unconstrained optimization problems. The proposed method is given by a novel combination of a modified Metropolis criterion, BB-stepsize and trust region method. The new method uses the reciprocal of BB-stepsize to approximate the Hessian matrix of the objective function in the trust region subproblems

A matching M of a graph G is an induced matching if no two edges in M are joined by an edge of G . Let iz ( G ) denote the total number of induced matchings of G , named iz -index. It is well known that the Hosoya index of a graph is the total number of matchings and the Hosoya index of a path can be calculated by the Fibonacci sequence. In this paper, we investigate the iz -index of graphs by using

for graphs F and G , let F → ( G, G ) denote that any red/blue edge coloring of F contains a monochromatic G . De ne Folkman number f ( G; t ) to be the smallest order of a graph F such that F → ( G, G ) and ω ( F ) ≤ t . It is shown that f ( G; t ) ≤ cn for p -arrangeable graphs with n vertices, where p ≥ 1, c = c ( p ) and t = t ( p ) are positive constants.

In epidemiological and clinical studies, the restricted mean lifetime is often of direct interest quantity. The differences of this quantity can be used as a basis of comparing several treatment groups with respect to their survival times. When the factor of interest is not randomized and lifetimes are subject to both dependent and independent censoring, the imbalances in confounding factors need to

The admissibility of the initial-boundary data, which characterizes the existence of solution for the initial-boundary value problem, is important. Based on the Fokas method and the inverse scattering transformation, an approach is developed to solve the initial-boundary value problem of the nonlinear Schrödinger equation on a finite interval. A necessary and sufficient condition for the admissibility

We investigate a hyperbolic system of one-dimensional isothermal fluid with liquid-vapor phase transition. The refraction-reflection phenomena are intensively analyzed when elementary waves travel across the two-phase interface. We apply the characteristic method and hodograph transform of Riemann to reduce the nonlinear PDEs to a concise form. Specially for the case of incident rarefaction wave, reduced

Cost effective sampling design is a problem of major concern in some experiments especially when the measurement of the characteristic of interest is costly or painful or time consuming. In the current paper, a modification of ranked set sampling (RSS) called moving extremes RSS (MERSS) is considered for the estimation of the location parameter for location family. A maximum likelihood estimator (MLE)

The paper is devoted to the homogenization of elliptic systems in divergence form. We obtain uniform interior as well as boundary Lipschitz estimates in a bounded C 1, γ domain when the coefficients are Dini continuous, inhomogeneous terms are divergence of Dini continuous functions and the boundary functions have Dini continuous derivatives. The results extend Avellaneda and Lin’s work [Comm. Pure

Identity by descent (IBD) sharing is a very important genomic feature in population genetics which can be used to reconstruct recent demographic history. In this paper we provide a framework to estimate IBD sharing for a demographic model called two-population model with migration. We adopt the structured coalescent theory and use a continuous-time Markov jump process { X ( t ), t ≥ 0} to describe

In this paper, we assume that the pest population is divided into susceptible pests and infected pests, and only susceptible pests do harm to crops. Considering the two methods of spraying pesticides and releasing infected pests and natural enemies to control susceptible pests (the former is applied more frequently), and assuming that only susceptible pests develop resistance to pesticides, a pest

An m × k matrix is said to be a d -row (column) antimagic matrix if its row-sums (column-sums) form an arithmetic progression with a difference d . The goal of this paper is to obtain the existence theorems and construction methods of some d -row (column) antimagic matrices. Using these results we give the necessary and sufficient condition for the existence of an ( m, d )-partition of [1, mk ].

This paper deals with an initial boundary value problem for a class of nonlinear wave equation with nonlinear damping and source terms whose solution may blow up in finite time. An explicit lower bound for blow up time is determined by means of a differential inequality argument if blow up occurs.

In this paper, we explore two conjectures about Rademacher sequences. Let ( ε i ) be a Rademacher sequence, i.e., a sequence of independent {−1, 1}-valued symmetric random variables. Set S n = a 1 ε 1 + … + a n ε n for a = ( a 1 , …, a n ) ∈ ℝ n . The rst conjecture says that P (| Sn | ≤ ‖ a ‖) ≥ $${\mathbb{R}^n}$$ ℝ n for all a ∈ ℝ n and n ∈ $$\mathbb{N}$$ ℕ . The second conjecture says that P (|

A nonincreasing sequence π = ( d 1 , …,d n ) of nonnegative integers is a graphic sequence if it is realizable by a simple graph G on n vertices. In this case, G is referred to as a realization of π . Given a graph H , a graphic sequence π is potentially H-graphic if π has a realization containing H as a subgraph. For graphs G 1 and G 2 , the potential-Ramsey number r pot ( G 1 , G 2 ) is the smallest

We consider a nonlocal boundary value problem for a viscoelastic equation with a Bessel operator and a weighted integral condition and we prove a general decay result. We also give an example to show that our general result gives the optimal decay rate for ceratin polynomially decaying relaxation functions. This result improves some other results in the literature.

An orbit code is a special constant dimension subspace code, which is an orbit of a subgroup of a general linear group acting on the set of all subspaces in the given ambient space. This paper presents some methods of constructing new orbit codes from known orbit codes. Firstly, we introduce the sum operation, intersection operation and union operation of subspace codes, and then we give some methods

The paper gives a new method to identify significant effects in two-level factorial experiments, and compares the new method with the exiting methods using Monte Carlo simulation. The existing methods only perform well under the assumption of effect sparsity, but the new method performs well without effect sparsity.

In this paper, we consider the existence and uniqueness of the mild solutions for a class of fractional non-autonomous evolution equations with delay and Caputo’s fractional derivatives. By using the measure of noncompactness, β-resolvent family, fixed point theorems and Banach contraction mapping principle, we improve and generalizes some related results on this topic. At last, we give an example

An n × n matrix A consisting of nonnegative integers is a general magic square of order n if the sum of elements in each row, column, and main diagonal is the same. A general magic square A of order n is called a magic square, denoted by MS(n), if the entries of A are distinct. A magic square A of order n is normal if the entries of A are n2 consecutive integers. Let A*d denote the matrix obtained

In this paper, we study a nonlinear Petrovsky type equation with nonlinear weak damping, a superlinear source and time-dependent coefficients $${u_{tt}} + {{\rm{\Delta }}^2}u + {k_1}\left(t \right){\left| {{u_t}} \right|^{m - 2}}{u_t} = {k_2}\left(t \right){\left| u \right|^{p - 2}}u,\,\,\,\,\,\,\,\,\,\,x \in {\rm{\Omega,}}\,\,\,{\rm{t > 0,}}$$ where Ω is a bounded domain in Rn. Under certain conditions

A new kind of tangent derivative, M-derivative, for set-valued function is introduced with help of a modified Dubovitskij-Miljutin cone. Several generalized pseudoconvex set-valued functions are introduced. When both the objective function and constraint function are M-derivative, under the assumption of near conesubconvexlikeness, by applying properties of the set of strictly efficient points and

In this paper we investigate the existence of the periodic solutions of a nonlinear differential equation with a general piecewise constant argument, in short DEPCAG, that is, the argument is a general step function. We consider the critical case, when associated linear homogeneous system admits nontrivial periodic solutions. Criteria of existence of periodic solutions of such equations are obtained

In this paper, we give a Gröbner-Shirshov basis of quantum group of type ℂ3 by using the Ringel-Hall algebra approach. For this, first we compute all skew-commutator relations between the isoclasses of indecomposable reprersentations of Ringel-Hall algebras of type ℂ3 by using an “inductive” method. Precisely, we do not use the traditional way of computing the skew-commutative relations, that is first

In the paper, we establish some exponential inequalities for non-identically distributed negatively orthant dependent (NOD, for short) random variables. In addition, we also establish some exponential inequalities for the partial sum and the maximal partial sum of identically distributed NOD random variables. As an application, the Kolmogorov strong law of large numbers for identically distributed

The frequentist model averaging (FMA) and the focus information criterion (FIC) under a local framework have been extensively studied in the likelihood and regression setting since the seminal work of Hjort and Claeskens in 2003. One inconvenience, however, of the existing works is that they usually require the involved criterion function to be twice differentiable which thus prevents a direct application

This paper considers a competing risks model for right-censored and length-biased survival data from prevalent sampling. We propose a nonparametric quantile inference procedure for cause-specific residual life distribution with competing risks data. We also derive the asymptotic properties of the proposed estimators of this quantile function. Simulation studies and the unemployment data demonstrate

In recent years, there has been a large amount of literature on missing data. Most of them focus on situations where there is only missingness in response or covariate. In this paper, we consider the adequacy check for the linear regression model with the response and covariates missing simultaneously. We apply model adjustment and inverse probability weighting methods to deal with the missingness

In the paper, we characterize a necessary and sufficient condition which ensures the continuities of the non-centered Hardy-Littlewood maximal function Mf and the centered Hardy-Littlewood maximal function M c f on ℝ n . As two applications, we can easily deduce that M c f and Mf are continuous if f is continuous, and Mf is continuous if f is of local bounded variation on ℝ.

In present note, we apply the Leibniz formula with the nabla operator in discrete fractional calculus (DFC) due to obtain the discrete fractional solutions of a class of associated Bessel equations (ABEs) and a class of associated Legendre equations (ALEs), respectively. Thus, we exhibit a new solution method for such second order linear ordinary differential equations with singular points.

A path in an edge-colored graph $G$ is called a rainbow path if no two edges of the path are colored the same. The minimum number of colors required to color the edges of $G$ such that every pair of vertices are connected by at least $k$ internally vertex-disjoint rainbow paths is called the rainbow $k$-connectivity of the graph $G$, denoted by $rc_k(G)$. For the random graph $G(n,p)$, He and Liang

In this paper we prove that every compact invariant subset $$\mathscr{A}$$ associated with the semigroup S n,k ( t ) t ≥0 generated by wave equations with variable damping, either in the interior or on the boundary of the domain where Ω ⊂ ℝ 3 is a smooth bounded domain, in H 0 1 (Ω) × L 2 (Ω) is in fact bounded in D ( B 0 ) × H 0 1 (Ω). As an application of our results, we obtain the upper-semicontinuity

In survival analysis, data are frequently collected by some complex sampling schemes, e.g., length biased sampling, case-cohort sampling and so on. In this paper, we consider the additive hazards model for the general biased survival data. A simple and unified estimating equation method is developed to estimate the regression parameters and baseline hazard function. The asymptotic properties of the

A proper edge coloring of a graph G is acyclic if there is no 2-colored cycle in G. The acyclic chromatic index of G is the least number of colors such that G has an acyclic edge coloring and denoted by Χ′a(G). An IC-plane graph is a topological graph where every edge is crossed at most once and no two crossed edges share a vertex. In this paper, it is proved that Χ′a(G) ≤ Δ(G) + 10, if G is an IC-planar

Let a, b and k be nonnegative integers with a ≥ 2 and b ≥ a(k + 1) + 2. A graph G is called a k-Hamiltonian graph if after deleting any k vertices of G the remaining graph of G has a Hamiltonian cycle. A graph G is said to have a k-Hamiltonian [a, b]-factor if after deleting any k vertices of G the remaining graph of G admits a Hamiltonian [a, b]-factor. Let G is a k-Hamiltonian graph of order n with

In this paper, we deduced an iteration formula for the computation of central composite discrepancy. By using the iteration formula, the computational complexity of uniform design construction in flexible region can be greatly reduced. And we also made a refinement to threshold accepting algorithm to accelerate the algorithm’s convergence rate. Examples show that the refined algorithm can converge

This paper evaluates the performance of the FW-test for testing part of p-regression coefficients in linear panel data model when p is divergent. The asymptotic power of the FW-statistic is obtained under some regular conditions. The theoretical development are challenging since the number of covariates increases as the sample size increases. It is worth noting that the inference approach does not

Two interesting sequences arose in the study of the series expansions of the complete elliptic integrals, which are called the Catalan-Larcombe-French sequence $\{P_n\}_{n\geq 0}$ and the Fennessey-Larcombe-French sequence $\{V_n\}_{n\geq 0}$ respectively. In this paper, we prove the log-convexity of $\{V_n^2-V_{n-1}V_{n+1}\}_{n\geq 2}$ and $\{n!V_n\}_{n\geq 1}$, the ratio log-concavity of $\{P_n\}_{n\geq

Under the framework of sub-linear expectation initiated by Peng, motivated by the concept of extended negative dependence, we establish a law of logarithm for arrays of row-wise extended negatively dependent random variables under weak conditions. Besides, the law of logarithm for independent and identically distributed arrays is derived more precisely and the sufficient and necessary conditions for

A graph is outer-1-planar if it can be drawn in the plane so that all vertices are on the outer face and each edge is crossed at most once. It is known that the list edge chromatic number Χ′ l ( G ) of any outer-1-planar graph G with maximum degree Δ( G ) ≥ 5 is exactly its maximum degree. In this paper, we prove Χ′ l ( G ) = Δ( G ) for outer-1-planar graphs G with Δ( G ) = 4 and with the crossing

In this paper, we present a QP-free algorithm without a penalty function or a filter for nonlinear semideflnite programming. At each iteration, two systems of linear equations with the same coefficient matrix are solved to determine search direction; the nonmonotone line search ensures that the objective function or constraint violation function is sufficiently reduced. There is no feasibility restoration

Published auxiliary information can be helpful in conducting statistical inference in a new study. In this paper, we synthesize the auxiliary information with semiparametric likelihood-based inference for censoring data with the total sample size is available. We express the auxiliary information as constraints on the regression coefficients and the covariate distribution, then use empirical likelihood