A robust scheme based on novel-operational matrices for some classes of time-fractional nonlinear problems arising in mechanics and mathematical physics

In this paper, we present a novel approach based on shifted Gegenbauer wavelets to attain approximate solutions of some classed of time-fractional nonlinear problems. First, we present the approximation of a function of two variables u(x,t) with help of shifted Gegenbauer wavelets and then some novel operational matrices are proposed with the help of piecewise functions to investigate the positive integer derivative ( D _x and D _t), fractional-order derivative ( and ), fractional-order integration ( and ) and delay terms ( and ) of approximated function u(x,t). In order to transform the discussed nonlinear problem into linear problem Picard iterative scheme has been adopt. The current scheme converts the discussed highly nonlinear time-fractional problem into system of linear algebraic equation the help of developed operational matrices and Picard idea. Analysis on the error bound and convergence to authenticate the mathematical formulation of the computational algorithm. We solve various test problems, such as the van der Pol oscillator model, generalized Burger–Huxley, neutral delay parabolic differential equations, sine-Gordon, parabolic integro-differential equation and nonlinear Schrödinger equations to show the efficiency and accuracy of linearized shifted Gegenbauer wavelets method. A comprehensive comparative examination shows the credibility, accuracy, and reliability of the presently proposed computational approach. Also, this scheme can be extended conveniently to other multi-dimensional physical problems of highly nonlinear fractional or variable order of complex nature.     

Numerical analysis for a system coupling curve evolution attached orthogonally to a fixed boundary,to a reaction–diffusion equation on the curve

We consider a semidiscrete finite element approximation for a system consisting of the evolution of a planar curve evolving by forced curve shortening flow inside a given bounded domain , such that the curve meets the boundary orthogonally, and the forcing is a function of the solution of a reaction–diffusion equation that holds on the evolving curve. We prove optimal order error bounds for the resulting approximation and present numerical experiments.     

Superconvergence analysis of an energy stable scheme with three step backward differential formula-finite element method for nonlinear reaction–diffusion equation

A three step backward differential formula scheme is proposed for nonlinear reaction–diffusion equation and superconvergence results are studied with Galerkin finite element method unconditionally. Energy stability is testified for the constructed scheme with an artificial term. Splitting technique is utilized to get rid of the ratio between the time step size and the subdivision parameter . Temporal error estimate in H²-norm is derived, which leads to the boundedness of the solutions of the time-discrete equations. Unconditional spatial error estimate in L²-norm is deduced which help bound the numerical solutions in L^∞-norm. Superconvergent property of in H¹-norm with order is obtained by taking difference between two time levels of the error equations unconditionally. The global superconvergent property is deduced through the above results. Two numerical examples show the validity of the theoretical analysis.     

H1-superconvergence of finite difference method based on Q1-element on quasi-uniform mesh for the 3D Poisson equation

In this paper, the finite difference (FD) method is considered for the 3D Poisson equation by using the Q₁-element on a quasi-uniform mesh. First, under the regularity assumption of , the H¹-superconvergence of the FD solution u_h based on the Q₁-element to the first-order interpolation function is obtained. Next, the H¹-superconvergence of the second-order interpolation postprocessing function based on the FD solution u_h to u is provided. Finally, numerical tests are presented to show the H¹-superconvergence result of the FD postprocessing function to u if .     

Rainbow triangles and the Caccetta-Häggkvist conjecture

A famous conjecture of Caccetta and Häggkvist is that in a digraph on vertices and minimum outdegree at least n/r there is a directed cycle of length or less. We consider the following generalization: in an undirected graph on vertices, any collection of disjoint sets of edges, each of size at least n/r, has a rainbow cycle of length or less. We focus on the case and prove the existence of a rainbow triangle under somewhat stronger conditions than in the conjecture. In our main result, whenever is larger than a suitable polynomial in , we determine the maximum number of edges in an -vertex edge-colored graph where all color classes have size at most and there is no rainbow triangle. Moreover, we characterize the extremal graphs for this problem.     

Ultraconvergence of finite element method by Richardson extrapolation for elliptic problems with inhomogeneous boundary conditions

In this article, Richardson extrapolation technique is employed to investigate the local ultraconvergence properties of Lagrange finite element method using piecewise polynomials of degrees () for the second order elliptic problem with inhomogeneous boundary. A sequence of special graded partition are proposed and a new interpolation operator is introduced to achieve order local ultraconvergence for the displacement and derivative.     

Fast high order difference schemes for the time fractional telegraph equation

In this paper, a fast high order difference scheme is first proposed to solve the time fractional telegraph equation based on the ℱℒ 2-1_σ formula for the Caputo fractional derivative, which reduces the storage and computational cost for calculation. A compact scheme is then presented to improve the convergence order in space. The unconditional stability and convergence in maximum norm are proved for both schemes, with the accuracy order and , respectively. Difficulty arising from the two Caputo fractional derivatives is overcome by some detailed analysis. Finally, we carry out numerical experiments to show the efficiency and accuracy, by comparing with the ℒ 2-1_σ method.     

On the numerical approximation of p‐biharmonic and ∞‐biharmonic functions

The ∞ ‐Bilaplacian is a third‐order fully nonlinear PDE given by (1) In this work, we build a numerical method aimed at quantifying the nature of solutions to this problem, which we call ∞ ‐biharmonic functions. For fixed p we design a mixed finite element scheme for the prelimiting equation, the p‐Bilaplacian (2) We prove convergence of the numerical solution to the weak solution of and show that we are able to pass to the limit p → ∞ . We perform various tests aimed at understanding the nature of solutions of and we prove convergence of our discretization to an appropriate weak solution concept of this problem that of ‐solutions.     

Superconvergence analysis of a nonconforming finite element method for monotone semilinear elliptic optimal control problems

A nonconforming finite element method (FEM) is proposed for optimal control problems (OCPs) governed by monotone semilinear elliptic equations. The state and adjoint state are approximated by the nonconforming elements, and the control is approximated by the orthogonal projection of the adjoint state, respectively. Some global supercloseness and superconvergence estimates are achieved by making full use of the distinguish characters of this element, such as the interpolation equals to its Ritz projection, and the consistency error is 1 − ε ( is small enough) order higher than its interpolation error in the broken energy norm when the exact solution belongs to H^{3 − ε}(Ω). Finally, some numerical results are presented to verify the theoretical analysis.     

The size-Ramsey number of powers of paths

Given graphs and and a positive integer , say that is -Ramsey for , denoted , if every -coloring of the edges of contains a monochromatic copy of . The size-Ramsey number of a graph is defined to be . Answering a question of Conlon, we prove that, for every fixed , we have , where is the th power of the -vertex path (ie, the graph with vertex set and all edges such that the distance between and in is at most ). Our proof is probabilistic, but can also be made constructive.     

Additive Schwarz preconditioners for C0 interior penalty methods for the obstacle problem of clamped Kirchhoff plates

The discrete variational inequalities resulting from interior penalty methods for the obstacle problem of clamped Kirchhoff plates can be solved by the primal-dual active set algorithm. We develop and analyze additive Schwarz preconditioners for the auxiliary systems that appear in each iteration of the primal-dual active set algorithm. Numerical results corroborate our theoretical estimates.     

Half‐inverse problems for the quadratic pencil of the Sturm–Liouville equations with impulse

In this paper, we consider the inverse spectral problem for the impulsive Sturm–Liouville differential pencils on [0, π] with the Robin boundary conditions and the jump conditions at the point . We prove that two potentials functions on the whole interval and the parameters in the boundary and jump conditions can be determined from a set of eigenvalues for two cases: (i) the potentials given on and (ii) the potentials given on , where 0 < α < 1 , respectively. Inverse spectral problems, Sturm–Liouville operator, spectrum, uniqueness.     

Liouville-type theorem for nonlinear elliptic equations involving p-Laplace–type Grushin operators

In this article, we prove the Liouville-type theorem for stable solutions of weighted p-Laplace–type Grushin equations (1) and (2) where p ≥ 2, q>0 and are nonnegative functions satisfying and as ‖z‖_G ≥ R₀ with p−N_γ<b<θ+p, R₀,C_i(i=1,2) are some positive constants. ∇_G=(∇_x,(1+γ)|x|^γ∇_y),γ ≥ 0, and The results hold true for N_γ<μ₀(p,b,θ) in 1 and q>q_c(p,N_γ,b,θ) in 2 . Here, μ₀ and q_c are new exponents, which are always larger than the classical critical ones and depend on the parameters p,b and θ. N_γ=N₁+(1+γ)N₂ is the homogeneous dimension of      

Tetravalent half-arc-transitive bi-p-metacirculants

A graph is half-arc-transitive if its full automorphism group acts transitively on its vertex set and edge set, but not arc set. A graph is said to be a bi-Cayley graph over a group if it admits as a group of automorphisms acting semiregularly and with two orbits on the vertex set. In this paper, a classification is given of tetravalent half-arc-transitive bi-Cayley graphs over metacyclic -groups for each odd prime , and this is then used to give a classification of tetravalent half-arc-transitive graphs of order twice a prime cube.     

On the local density problem for graphs of given odd-girth

Erdős conjectured that every n-vertex triangle-free graph contains a subset of vertices that spans at most edges. Extending a recent result of Norin and Yepremyan, we confirm this conjecture for graphs homomorphic to so-called Andrásfai graphs. As a consequence, Erdős' conjecture holds for every triangle-free graph G with minimum degree and if the degree condition can be relaxed to . In fact, we obtain a more general result for graphs of higher odd-girth.     

Analysis and efficient implementation of alternating direction implicit finite volume method for Riesz space‐fractional diffusion equations in two space dimensions

In this article, we develop a Crank–Nicolson alternating direction implicit finite volume method for time‐dependent Riesz space‐fractional diffusion equation in two space dimensions. Norm‐based stability and convergence analysis are given to show that the developed method is unconditionally stable and of second‐order accuracy both in space and time. Furthermore, we develop a lossless matrix‐free fast conjugate gradient method for the implementation of the numerical scheme, which only has memory requirement and computational complexity per iteration with N being the total number of spatial unknowns. Several numerical experiments are presented to demonstrate the effectiveness and efficiency of the proposed scheme for large‐scale modeling and simulations.     

A Liouville Theorem for the Complex Monge-Ampère Equation on Product Manifolds

Let Y be a closed Calabi-Yau manifold. Let ω be the Kähler form of a Ricci-flat Kähler metric on . We prove that if ω is uniformly bounded above and below by constant multiples of , where is the standard flat Kähler form on and ω_Y is any Kähler form on Y, then ω is a product Kähler form up to a certain automorphism of . © 2018 Wiley Periodicals, Inc.     

A note on immersion intertwines of infinite graphs

We present a construction of two infinite graphs and , and of an infinite set of graphs such that is an antichain with respect to the immersion relation and, for each graph in , both and are subgraphs of , but no graph properly immersed in admits an immersion of and of . This shows that the class of infinite graphs ordered by the immersion relation does not have the finite intertwine property.     

Staggered Taylor–Hood and Fortin elements for Stokes equations of pressure boundary conditions in Lipschitz domain

The purpose of this paper is to develop a general theory on how the inf-sup stable and convergent elements of the velocity Dirichlet boundary (VDB)-Stokes problem with no-slip VDB are still inf-sup stable and convergent for the pressure Dirichlet boundary (PDB)-Stokes problem with PDB in Lipschitz domain. The PDB-Stokes problem in a Lipschitz domain usually only has a singular velocity solution which does not belong to (H¹(Ω))², sharply in contrast to the VDB-Stokes problem whose velocity solution still belongs to (H¹(Ω))², and unexpectedly, some well-known inf-sup stable and convergent VDB-Stokes elements may or may no longer correctly converge. It turns out that the inf-sup condition of the PDB-Stokes problem in Lipschitz domain relies on an unusual variational problem and requires adequate degrees of freedom on the domain boundary. In this paper we propose two families of staggered elements: staggered Taylor–Hood elements with ℓ ≥ 1 (continuous in both velocity and pressure) and staggered Fortin elements with m ≥ 1 (continuous in velocity and discontinuous in pressure) on triangles, for solving the PDB-Stokes problem in Lipschitz domain. We show that the two families are inf-sup stable and are correctly convergent for the non-H¹ singular velocity. Numerical results illustrate the proposed elements and the theoretical results.     

Upper Tail Large Deviations of Regular Subgraph Counts in Erdős-Rényi Graphs in the Full Localized Regime

For a -regular connected graph H the problem of determining the upper tail large deviation for the number of copies of H in , an Erdős-Rényi graph on n vertices with edge probability p, has generated significant interest. For and , where is the number of vertices in H, the upper tail large deviation event is believed to occur due to the presence of localized structures. In this regime the large deviation event that the number of copies of H in exceeds its expectation by a constant factor is predicted to hold at a speed , and the rate function is conjectured to be given by the solution of a mean-field variational problem. After a series of developments in recent years, covering progressively broader ranges of p, the upper tail large deviations for cliques of fixed size were proved by Harel, Mousset, and Samotij in the entire localized regime. This paper establishes the conjecture for all connected regular graphs in the whole localized regime. © 2021 Wiley Periodicals LLC.