On variable step Hermite–Birkhoff solvers combining multistep and 4-stage DIRK methods for stiff ODEs

Variable-step (VS) 4-stage k-step Hermite–Birkhoff (HB) methods of order p = (k + 2), p = 9, 10, denoted by HB (p), are constructed as a combination of linear k-step methods of order (p ? 2) and a diagonally implicit one-step 4-stage Runge–Kutta method of order 3 (DIRK3) for solving stiff ordinary differential equations. Forcing a Taylor expansion of the numerical solution to agree with an expansion of the true solution leads to multistep and Runge–Kutta type order conditions which are reorganized into linear confluent Vandermonde-type systems. This approach allows us to develop L(a)-stable methods of order up to 11 with a > 63°. Fast algorithms are developed for solving these systems in O (p²) operations to obtain HB interpolation polynomials in terms of generalized Lagrange basis functions. The stepsizes of these methods are controlled by a local error estimator. HB(p) of order p = 9 and 10 compare favorably with existing Cash modified extended backward differentiation formulae of order 7 and 8, MEBDF(7-8) and Ebadi et al. hybrid backward differentiation formulae of order 10 and 12, HBDF(10-12) in solving problems often used to test higher order stiff ODE solvers on the basis of CPU time and error at the endpoint of the integration interval.     

Multi-step hybrid methods for special second-order differential equations y″(t) = f(t,y(t))

In this paper, multi-step hybrid methods for solving special second-order differential equations y^″(t) = f(t,y(t)) are presented and studied. The new methods inherit the frameworks of RKN methods and linear multi-step methods and include two-step hybrid methods proposed by Coleman (IMA J. Numer. Anal. 23, 197–220, 8) as special cases. The order conditions of the methods were derived by using the SN-series defined on the set SNT of SN-trees. Based on the order conditions, we construct two explicit four-step hybrid methods, which are convergent of order six and seven, respectively. Numerical results show that our new methods are more efficient in comparison with the well-known high quality methods proposed in the scientific literature.     

A superconvergent local discontinuous Galerkin method for nonlinear two-point boundary-value problems

In this paper, we present and analyze a superconvergent and high order accurate local discontinuous Galerkin (LDG) method for nonlinear two-point boundary-value problems (BVPs) of the form u ^″ = f (t, u), which arise in a wide variety of engineering applications. We prove the L ² stability of the LDG scheme and optimal L ² error estimates for the solution and for the auxiliary variable that approximates the first-order derivative. The order of convergence is proved to be p +?1, when piecewise polynomials of degree at most p are used. Our numerical experiments demonstrate optimal rates of convergence. Moreover, we show that the derivatives of the LDG solutions are superconvergent with order p +?1 toward the derivatives of Gausss-Radau projections of the exact solutions. Finally, we prove that the LDG solutions are superconvergent with order p +?3/2 toward Gauss-Radau projections of the exact solutions. Our computational results indicate that the observed numerical superconvergence rate is p +?2. Our proofs are valid for arbitrary regular meshes using piecewise polynomials of degree p ≥?1 and for the periodic, Dirichlet, and mixed boundary conditions. All proofs are valid under the hypotheses of the existence and uniqueness theorem for BVPs. Several numerical results are presented to validate the theoretical results.     

Most small $${\varvec{}}$$-grous have an automorhism of order 2

Let f(p, n) be the number of pairwise nonisomorphic p-groups of order \(p^n\), and let g(p, n) be the number of groups of order \(p^n\) whose automorphism group is a p-group. We prove that the limit, as p grows to infinity, of the ratio g(p, n) / f(p, n) equals 1/3 for \(n=6,7\).     

A new class of efficient one-step contractivity preserving high-order time discretization methods of order 5 to 14

A family of one-step, explicit, contractivity preserving, multi-stage, multi-derivative, Hermite–Birkhoff–Taylor methods of order p =?5,6,…,14, that we denote by CPHBT_RK4(d,s,p), with nonnegative coefficients are constructed by casting s-stage Runge–Kutta methods of order 4 with Taylor methods of order d. The constructed CPHBT_RK4 methods are implemented using efficient variable step control and are compared to other well-known methods on a variety of initial value problems. A selected method: CP 6-stages 9-derivative HBT method of order 12, denoted by CPHBTRK412, has larger region of absolute stability than Dormand–Prince DP(8,7)13M and Taylor method T(12) of order 12. It is superior to DP(8,7)13M and T(12) methods on the basis the number of steps, CPU time, and maximum global error on several problems often used to test higher-order ODE solvers. Also, we show that the contractivity preserving property of CPHBTRK412is very efficient in suppressing the effect of the propagation of discretization errors and the new method compares positively with explicit 17 stages Runge-Kutta-Nyström pair of order 12 by Sharp et al. on a long-term integration of a standard N-body problem. The selected CPHBTRK412is listed in the Appendix.     

On finite groups with prime-power order <Emphasis Type="Italic">S</Emphasis>-quasinormally embedded subgroups

A subgroup H of a finite group G is said to be S-quasinormally embedded in G if for each prime p dividing the order of H, a Sylow p-subgroup of H is also a Sylow p-subgroup of some S-quasinormal subgroup of G. In this paper we investigate the structure of finite groups that have some S-quasinormally embedded subgroups of prime-power order, and new criteria for p-nilpotency are obtained.     

A new heuristic approach for the P-median problem

The Euclidean p-median problem is concerned with the decision of the locations for public service centres. Existing methods for the planar Euclidean p-median problems are capable of efficiently solving problems of relatively small scale. This paper proposes two new heuristic algorithms aiming at problems of large scale. Firstly, to reflect the different degrees of proximity to optimality, a new kind of local optimum called level-m optimum is defined. For a level-m optimum of a p-median problem, where m<p, each of its subsets containing m of the p partitions is a global optimum of the corresponding m-median subproblem. Starting from a conventional local optimum, the first new algorithm efficiently improves it to a level-2 optimum by applying an existing exact algorithm for solving the 2-median problem. The second new algorithm further improves it to a level-3 optimum by applying a new exact algorithm for solving the 3-median problem. Comparison based on experimental results confirms that the proposed algorithms are superior to the existing heuristics, especially in terms of solution quality.     

Positive solutions of <Emphasis Type="Italic">p</Emphasis>-th Yamabe type equations on graphs

Let G = (V,E) be a finite connected weighted graph, and assume 1 ? α ? p ? q. In this paper, we consider the p-th Yamabe type equation ―?_pu+hu^q―1 = λfu^α―1 on G, where ?_p is the p-th discrete graph Laplacian, h < 0 and f > 0 are real functions defined on all vertices of G. Instead of H. Ge’s approach [Proc. Amer. Math. Soc., 2018, 146(5): 2219–2224], we adopt a new approach, and prove that the above equation always has a positive solution u > 0 for some constant λ ∈ ?. In particular, when q = p, our result generalizes Ge’s main theorem from the case of α ? p > 1 to the case of 1 ? α ? p, It is interesting that our new approach can also work in the case of α ? p > 1.     

Universal rigidity of bar frameworks via the geometry of spectrahedra

A bar framework (G, p) in dimension r is a graph G whose nodes are points \(p^1,\ldots ,p^n\) in \(\mathbb {R}^r\) and whose edges are line segments between pairs of these points. Two frameworks (G, p) and (G, q) are equivalent if each edge of (G, p) has the same (Euclidean) length as the corresponding edge of (G, q). A pair of non-adjacent vertices i and j of (G, p) is universally linked if \(||p^i-p^j||\) = \(||q^i-q^j||\) in every framework (G, q) that is equivalent to (G, p). Framework (G, p) is universally rigid iff every pair of non-adjacent vertices of (G, p) is universally linked. In this paper, we present a unified treatment of the universal rigidity problem based on the geometry of spectrahedra. A spectrahedron is the intersection of the positive semidefinite cone with an affine space. This treatment makes it possible to tie together some known, yet scattered, results and to derive new ones. Among the new results presented in this paper are: (1) The first sufficient condition for a given pair of non-adjacent vertices of (G, p) to be universally linked. (2) A new, weaker, sufficient condition for a framework (G, p) to be universally rigid thus strengthening the existing known condition. An interpretation of this new condition in terms of the Strong Arnold Property is also presented.     

Trigonometrical fitting conditions for two derivative Runge-Kutta methods

Two derivative Runge-Kutta methods are Runge-Kutta methods for problems of the form y^′ = f(y) that include the second derivative y^″ = g(y) = f^′(y)f(y) and were developed in the work of Chan and Tsai (Numer. Alg. 53, 171–194 2010). Explicit methods were considered and attention was given to the construction of methods that involve one evaluation of f and many evaluations of g per step. In this work, we consider trigonometrically fitted two derivative explicit Runge-Kutta methods of the general case that use several evaluations of f and g per step; trigonometrically fitting conditions for this general case are given. Attention is given to the construction of methods that involve several evaluations of f and one evaluation of g per step. We modify methods with stages up to four, with three f and one g evaluation and with four f and one g, evaluation based on the fourth and fifth order methods presented in Chan and Tsai (Numer. Alg. 53, 171–194 2010). We provide numerical results to demonstrate the efficiency of the new methods using four test problems.     

Conditions for the existence of a classical solution of a cauchy type problem for the diffusion equation with a Riemann-Liouville partial derivative

We study a Cauchy type problem for a differential equation containing a fractional Riemann-Liouville partial derivative of order α, 0 < α < 2. Conditions under which the solution of the problem tends to zero as |x| → ∞ are obtained. We prove an existence theorem for a classical solution of the Cauchy type problem and show that the solution has a singularity as t → 0 of order 1 ? α if 0 < α ≤ 1 and of order 2 ? α if 1 < α < 2.     

The existence of semiclassical states for some <Emphasis Type="Italic">p</Emphasis>-Laplacian equation with critical exponent

In this paper, we study the existence of semiclassical states for some p-Laplacian equation. Under given conditions and minimax methods, we show that this problem has at least one positive solution provided that ε ≤ E; for any m ∈ ?, it has m pairs solutions if ε ≤ E _m , where E, E_m are sufficiently small positive numbers. Moreover, these solutions are closed to zero in W^1,p(? ^N ) as ε → 0.     

Optimal Linear Bernoulli Factories for Small Mean Problems

Suppose a coin with unknown probability p of heads can be flipped as often as desired. A Bernoulli factory for a function f is an algorithm that uses flips of the coin together with auxiliary randomness to flip a single coin with probability f(p) of heads. Applications include perfect sampling from the stationary distribution of certain regenerative processes. When f is analytic, the problem can be reduced to a Bernoulli factory of the form f(p) = C p for constant C. Presented here is a new algorithm that for small values of C p, requires roughly only C coin flips. From information theoretic considerations, this is also conjectured to be (to first order) the minimum number of flips needed by any such algorithm. For large values of C p, the new algorithm can also be used to build a new Bernoulli factory that uses only 80 % of the expected coin flips of the older method. In addition, the new method also applies to the more general problem of a linear multivariate Bernoulli factory, where there are k coins, the kth coin has unknown probability p _k of heads, and the goal is to simulate a coin flip with probability C ₁ p ₁+? + C _k p _k of heads.     

Exponentially and Trigonometrically Fitted Methods for the Solution of the Schrödinger Equation

In the present paper we compare the two methodologies for the development of exponentially and trigonometrically fitted methods. One is based on the exact integration of the functions of the form: {1,x,x ²,…,x ^p ,exp?(±wx),xexp?(±wx),…,x ^m exp?(±w x)} and the second is based on the exact integration of the functions of the form: {1,x,x ²,…,x ^p ,exp?(±wx),exp?(±2wx),…,exp?(±mwx)}. The above functions are used in order to improve the efficiency of the classical methods of any kind (i.e. the method (5) with constant coefficients) for the numerical solution of ordinary differential equations of the form of the Schrödinger equation. We mention here that the above sets of exponential functions are the two most common sets of exponential functions for the development of the special methods for the efficient solution of the Schrödinger equation. It is first time in the literature in which the efficiency of the above sets of functions are studied and compared together for the approximate solution of the Schrödinger equation. We present the error analysis of the above two approaches for the numerical solution of the one-dimensional Schrödinger equation. Finally, numerical results for the resonance problem of the radial Schrödinger equation are presented.     

A short note on Lq theory for Stokes problem with a pressure-dependent viscosity

We study higher local integrability of a weak solution to the steady Stokes problem. We consider the case of a pressure- and shear-rate-dependent viscosity, i.e., the elliptic part of the Stokes problem is assumed to be nonlinear and it depends on p and on the symmetric part of a gradient of u, namely, it is represented by a stress tensor T (Du, p):= v(p, |D|²)D which satisfies r-growth condition with r ∈ (1, 2]. In order to get the main result, we use Calderón-Zygmund theory and the method which was presented for example in the paper Caffarelli, Peral (1998).     

Approximation by (<Emphasis Type="Italic">p</Emphasis>, <Emphasis Type="Italic">q</Emphasis>)-Lorentz Polynomials on a Compact Disk

The (p, q)-factors were introduced in order to generalize or unify several forms of q-oscillator algebras well known in the physics literature related to the representation theory of single parameter quantum algebras. This notion has been recently used in approximation by positive linear operators via (p, q)-calculus which has emerged a very active area of research. In this paper, we introduce a new analogue of Lorentz polynomials based on (p, q)-integers. We obtain quantitative estimate in the Voronovskaja’s type theorem and exact orders in simultaneous approximation by the complex (p, q)-Lorentz polynomials of degree \(n\in \mathbb {N}\) (\(q>p>1)\), attached to analytic functions on compact disks of the complex plane. In this way, we put in evidence the overconvergence phenomenon for the (p, q)-Lorentz polynomial, namely the extensions of approximation properties (with quantitative estimates) from real intervals to compact disks in the complex plane.     

On finite simple images of triangle groups

For a simple algebraic group G in characteristic p, a triple (a, b, c) of positive integers is said to be rigid for G if the dimensions of the subvarieties of G of elements of order dividing a, b, c sum to 2 dim G. In this paper we complete the proof of a conjecture of the third author, that for a rigid triple (a, b, c) for G with p > 0, the triangle group T_a,b,c has only finitely many simple images of the form G(p^r). We also obtain further results on the more general form of the conjecture, where the images G(p^r) can be arbitrary quasisimple groups of type G.     

On Lander’s conjecture for difference sets whose order is a power of 2 or 3

Let p be a prime and let b be a positive integer. If a (v, k, λ, n) difference set D of order n = p ^b exists in an abelian group with cyclic Sylow p-subgroup S, then \({p\in\{2,3\}}\) and |S| = p. Furthermore, either p = 2 and v ≡ λ ≡ 2 (mod 4) or the parameters of D belong to one of four families explicitly determined in our main theorem.     

Drift perturbation of subordinate Brownian motions with Gaussian component

Let d ≥ 1 and Z be a subordinate Brownian motion on R~d with infinitesimal generator ? + ψ(?),where ψ is the Laplace exponent of a one-dimensional non-decreasing L′evy process(called subordinator). We establish the existence and uniqueness of fundamental solution(also called heat kernel) pb(t, x, y) for non-local operator L~b= ? + ψ(?) + b ?, where Rb is an Rd-valued function in Kato class K_(d,1). We show that p~b(t, x, y)is jointly continuous and derive its sharp two-sided estimates. The kernel pb(t, x, y) determines a conservative Feller process X. We further show that the law of X is the unique solution of the martingale problem for(L~b, C_c~∞(R~d)) and X is a weak solution of Xt = X0+ Zt + integral from n=0 to t(b(Xs)ds, t ≥ 0).Moreover, we prove that the above stochastic differential equation has a unique weak solution.     

Decomposition theorems for<Emphasis Type="Italic">Q</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript> spaces

We study the Möbius invariant spacesQ _p andQ _{p, 0} of analytic functions. These scales of spaces include BMOA=Q₁, VMOA=Q_{1, 0} and the Dirichlet space=Q₀. Using the Bergman metric, we establish decomposition theorems for these spaces. We obtain also a fractional derivative characterization for bothQ _p andQ _{p, 0} .