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 .     

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.     

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.     

Complete graphs with no rainbow tree

We study colorings of the edges of the complete graph . For some graph , we say that a coloring contains a rainbow , if there is an embedding of into , such that all edges of the embedded copy have pairwise distinct colors. The main emphasis of this paper is a classification of those forbidden rainbow graphs that force a low number of vertices of a high color degree, along with some specifications and more general information in certain cases. Those graphs turn out to be of two special types of trees of small diameter.     

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.     

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.     

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.     

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.     

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.     

Numerical method for generalized time fractional KdV-type equation

In this article, an efficient numerical method for linearized and nonlinear generalized time-fractional KdV-type equations is proposed by combining the finite difference scheme and Petrov–Galerkin spectral method. The scale and weight functions involved in generalized fractional derivative cause too much difficulty in discretization and numerical analysis. Fortunately, motivated by finite difference method for fractional differential equation on graded mesh, the stability and convergence of the constructed method are established rigorously. It is proved that the full discretization schemes of generalized time-fractional KdV-type equation is unconditionally stable in linear case. While for nonlinear case, it is stable under a CFL condition and for not small ϵ, coefficient of the high-order spatial differential term. In addition, the full discretization schemes with respect to linear and nonlinear cases respectively converge to the associated exact solutions with orders and , where τ, α, N and m accordingly indicate the time step size, the order of the fractional derivative, polynomial degree, and regularity of the exact solution. Numerical experiments are carried out to support the theoretical results.     

Highly edge-connected factors using given lists on degrees

Let G be a 2k-edge-connected graph with and let for every . A spanning subgraph F of G is called an L-factor, if for every . In this article, we show that if for every , then G has a k-edge-connected L-factor. We also show that if and for every , then G has a k-edge-connected L-factor.     

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.     

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.     

Perfect divisibility and 2-divisibility

A graph G is said to be 2-divisible if for all (nonempty) induced subgraphs H of G, can be partitioned into two sets such that and . (Here denotes the clique number of G, the number of vertices in a largest clique of G). A graph G is said to be perfectly divisible if for all induced subgraphs H of G, can be partitioned into two sets such that is perfect and . We prove that if a graph is -free, then it is 2-divisible. We also prove that if a graph is bull-free and either odd-hole-free or P₅-free, then it is perfectly divisible.     

Uniformly convergent scheme for two‐parameter singularly perturbed problems with non‐smooth data

A numerical scheme is constructed for the problems in which the diffusion and convection parameters (?₁ and ?₂ , respectively) both are small, and the convection and source terms have a jump discontinuity in the domain of consideration. Depending on the magnitude of the ratios , and two different cases have been considered separately. Through rigorous analysis, the theoretical error bounds on the singular and regular components of the solution are obtained separately, which shows that in both cases the method is convergent uniformly irrespective of the size of the parameters ?₁, ?₂ . Two test problems are included to validate the theoretical results.     

Reconstruction from the deck of -vertex induced subgraphs

The - deck of a graph is its multiset of subgraphs induced by vertices; we study what can be deduced about a graph from its -deck. We strengthen a result of Manvel by proving for that when is large enough ( suffices), the -deck determines whether an -vertex graph is connected ( suffices when , and cannot suffice). The reconstructibility of a graph with vertices is the largest such that is determined by its -deck. We generalize a result of Bollobás by showing for almost all graphs. As an upper bound on , we have . More generally, we compute whenever , which involves extending a result of Stanley. Finally, we show that a complete -partite graph is reconstructible from its -deck.     

Fractal graphs

The lexicographic sum of graphs is defined as follows. Let be a graph. With each associate a graph . The lexicographic sum of the graphs over is obtained from by substituting each by . Given distinct , we have all the possible edges in the lexicographic sum between and if , and none otherwise. When all the graphs are isomorphic to some graph , the lexicographic sum of the graphs over is called the lexicographic product of by and is denoted by . We say that a graph is fractal if there exists a graph , with at least two vertices, such that . There is a simple way to construct fractal graphs. Let be a graph with at least two vertices. The graph is defined on the set of functions from to as follows. Given distinct is an edge of if is an edge of , where is the smallest integer such that . The graph is fractal because . We prove that a fractal graph is isomorphic to a lexicographic sum over an induced subgraph of , which is itself fractal.     

Online Ramsey theory for a triangle on -free graphs

Given a class of graphs and a fixed graph , the online Ramsey game for H on is a game between two players Builder and Painter as follows: an unbounded set of vertices is given as an initial state, and on each turn Builder introduces a new edge with the constraint that the resulting graph must be in , and Painter colors the new edge either red or blue. Builder wins the game if Painter is forced to make a monochromatic copy of at some point in the game. Otherwise, Painter can avoid creating a monochromatic copy of forever, and we say Painter wins the game. We initiate the study of characterizing the graphs such that for a given graph , Painter wins the online Ramsey game for on -free graphs. We characterize all graphs such that Painter wins the online Ramsey game for on the class of -free graphs, except when is one particular graph. We also show that Painter wins the online Ramsey game for on the class of -minor-free graphs, extending a result by Grytczuk, Hałuszczak, and Kierstead [Electron. J. Combin. 11 (2004), p. 60].     

Unique Continuation at the Boundary for Harmonic Functions in C1 Domains and Lipschitz Domains with Small Constant

Let be a domain, or more generally, a Lipschitz domain with small local Lipschitz constant. In this paper it is shown that if u is a function harmonic in and continuous in , which vanishes in a relatively open subset ; moreover, the normal derivative vanishes in a subset of with positive surface measure; then u is identically zero. © 2021 The Authors. Communications on Pure and Applied Mathematics published by Wiley Periodicals LLC.     

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.