This article presents very original and relatively brief or very brief proofs about of two famous problems: 1) Are there any odd perfect numbers? and 2) “Fermat’s last theorem: A new proof of theorem and its general...This article presents very original and relatively brief or very brief proofs about of two famous problems: 1) Are there any odd perfect numbers? and 2) “Fermat’s last theorem: A new proof of theorem and its generalization”. They are achieved with elementary mathematics. This is why these proofs can be easily understood by any mathematician or anyone who knows basic mathematics. Note that, in both problems, proof by contradiction was used as a method of proof. The first of the two problems to date has not been resolved. Its proof is completely original and was not based on the work of other researchers. On the contrary, it was based on a simple observation that all natural divisors of a positive integer appear in pairs. The aim of the first work is to solve one of the unsolved, for many years, problems of the mathematics which belong to the field of number theory. I believe that if the present proof is recognized by the mathematical community, it may signal a different way of solving unsolved problems. For the second problem, it is very important the fact that it is generalized to an arbitrarily large number of variables. This generalization is essentially a new theorem in the field of the number theory. To the classical problem, two solutions are given, which are presented in the chronological order in which they were achieved. <em>Note that the second solution is very short and does not exceed one and a half pages</em>. This leads me to believe that Fermat, as a great mathematician was not lying and that he had probably solved the problem, as he stated in his historic its letter, with a correspondingly brief solution. <em>To win the bet on the question of whether Fermat was telling truth or lying, go immediately to the end of this article before the General Conclusions.</em>展开更多
Enumeration of perfect matchings on graphs has a longstanding interest in combinatorial mathematics. In this paper, we obtain some explicit expressions of the number of perfect matchings for a type of Archimedean latt...Enumeration of perfect matchings on graphs has a longstanding interest in combinatorial mathematics. In this paper, we obtain some explicit expressions of the number of perfect matchings for a type of Archimedean lattices with toroidal boundary by applying Tesler's crossing orientations to obtain some Pfaffan orientations and enumerating their Pfaffans.展开更多
In 2012, Gutman and Wagner proposed the concept of the matching energy of a graph and pointed out that its chemical applications can go back to the 1970s. The matching energy of a graph is defined as the sum of the ab...In 2012, Gutman and Wagner proposed the concept of the matching energy of a graph and pointed out that its chemical applications can go back to the 1970s. The matching energy of a graph is defined as the sum of the absolute values of the zeros of its matching polynomial. Let u and v be the non-isolated vertices of the graphs G and H with the same order, respectively. Let wi?be a non-isolated vertex of graph Gi?where i=1, 2, …, k. We use Gu(k)?(respectively, Hv(k)) to denote the graph which is the coalescence of G (respectively, H) and G1, G2,…, Gk?by identifying the vertices u (respectively, v) and w1, w2,…, wk. In this paper, we first present a new technique of directly comparing the matching energies of Gu(k)?and Hv(k), which can tackle some quasi-order incomparable problems. As the applications of the technique, then we can determine the unicyclic graphs with perfect matchings of order 2n with the first to the ninth smallest matching energies for all n≥211.展开更多
Let Γd2n be the set of trees with a given diameter d having a perfect matching,where 2n is the number of vertex.For a tree T in Γd2n,let Pd+1be a diameter of T and q = d m,where m is the number of the edges of perfe...Let Γd2n be the set of trees with a given diameter d having a perfect matching,where 2n is the number of vertex.For a tree T in Γd2n,let Pd+1be a diameter of T and q = d m,where m is the number of the edges of perfect matching inPd+1.It can be found that the trees with minimal energy in Γd2nfor four cases q = d 2,d 3,d 4,[d2],and two remarks aregiven about the trees with minimal energy in Γd2nfor2d 33q d 5 and [d2] + 1 q2d 33 1.展开更多
An induced matching M in a graph G is a matching such that V(M) induces a1-regular subgraph of G. The induced matching number of a graph G, denoted by IM(G), isthe maximum number r such that G has an induced matching ...An induced matching M in a graph G is a matching such that V(M) induces a1-regular subgraph of G. The induced matching number of a graph G, denoted by IM(G), isthe maximum number r such that G has an induced matching of r edges. Induced matchingnumber of Prn x Pn is investigated in this paper. The main results are as follows:展开更多
Let G be an outerplane graph with maximum degree Δ and the entire chro-matic number χvef (G). This paper proves that if Δ ≥ 6, then Δ + 1 ≤ χvef (G) ≤ Δ+ 2,and χvef (G) = Δ + 1 if and only if G has a matchi...Let G be an outerplane graph with maximum degree Δ and the entire chro-matic number χvef (G). This paper proves that if Δ ≥ 6, then Δ + 1 ≤ χvef (G) ≤ Δ+ 2,and χvef (G) = Δ + 1 if and only if G has a matching M consisting of some inner edgeswhich covers all its vertices of maximum degree.展开更多
In numerical simulation of wave propagation,both viscoelastic materials and perfectly matched layers(PMLs)attenuate waves.The wave equations for both the viscoelastic model and the PML contain convolution operators.Ho...In numerical simulation of wave propagation,both viscoelastic materials and perfectly matched layers(PMLs)attenuate waves.The wave equations for both the viscoelastic model and the PML contain convolution operators.However,convolution operator is intractable in finite-difference time-domain(FDTD)method.A great deal of progress has been made in using time stepping instead of convolution in FDTD.To incorporate PML into viscoelastic media,more memory variables need to be introduced,which increases the code complexity and computation costs.By modifying the nonsplitting PML formulation,I propose a viscoelastic model,which can be used as a viscoelastic material and/or a PML just by adjusting the parameters.The proposed viscoelastic model is essentially equivalent to a Maxwell model.Compared with existing PML methods,the proposed method requires less memory and its implementation in existing finite-difference codes is much easier.The attenuation and phase velocity of P-and S-waves are frequency independent in the viscoelastic model if the related quality factors(Q)are greater than 10.The numerical examples show that the method is stable for materials with high absorption(Q=1),and for heterogeneous media with large contrast of acoustic impedance and large contrast of viscosity.展开更多
It is an important issue to numerically solve the time fractional Schrödinger equation on unbounded domains, which models the dynamics of optical solitons propagating via optical fibers. The perfectly matched lay...It is an important issue to numerically solve the time fractional Schrödinger equation on unbounded domains, which models the dynamics of optical solitons propagating via optical fibers. The perfectly matched layer approach is applied to truncate the unbounded physical domain, and obtain an initial boundary value problem on a bounded computational domain, which can be efficiently solved by the finite difference method. The stability of the reduced initial boundary value problem is rigorously analyzed. Some numerical results are presented to illustrate the accuracy and feasibility of the perfectly matched layer approach. According to these examples, the absorption parameters and the width of the absorption layer will affect the absorption effect. The larger the absorption width, the better the absorption effect. There is an optimal absorption parameter, the absorption effect is the best.展开更多
Large calculation error can be formed by directly employing the conventional Yee’s grid to curve surfaces.In order to alleviate such condition,unconditionally stable CrankNicolson Douglas-Gunn(CNDG)algorithm with is ...Large calculation error can be formed by directly employing the conventional Yee’s grid to curve surfaces.In order to alleviate such condition,unconditionally stable CrankNicolson Douglas-Gunn(CNDG)algorithm with is proposed for rotationally symmetric multi-scale problems in anisotropic magnetized plasma.Within the CNDG algorithm,an alternative scheme for the simulation of anisotropic plasma is proposed in body-of-revolution domains.Convolutional perfectly matched layer(CPML)formulation is proposed to efficiently solve the open region problems.Numerical example is carried out for the illustration of effectiveness including the efficiency,resources,and absorption.Through the results,it can be concluded that the proposed scheme shows considerable performance during the simulation.展开更多
Let G be a simple graph with 2n vertices and a perfect matching.The forcing number f(G,M) of a perfect matching M of G is the smallest cardinality of a subset of M that is contained in no other perfect matching of G.A...Let G be a simple graph with 2n vertices and a perfect matching.The forcing number f(G,M) of a perfect matching M of G is the smallest cardinality of a subset of M that is contained in no other perfect matching of G.Among all perfect matchings M of G,the minimum and maximum values of f(G,M) are called the minimum and maximum forcing numbers of G,denoted by f(G) and F(G),respectively.Then f(G)≤F(G) ≤n-1.Che and Chen(2011) proposed an open problem:how to characterize the graphs G with f(G)=n-1.Later they showed that for a bipartite graph G,f(G)=n-1 if and only if G is complete bipartite graph K_(n,n).In this paper,we completely solve the problem of Che and Chen,and show that f(G)=n-1 if and only if G is a complete multipartite graph or a graph obtained from complete bipartite graph K_(n,n) by adding arbitrary edges in one partite set.For all graphs G with F(G)=n-1,we prove that the forcing spectrum of each such graph G forms an integer interval by matching 2-switches and the minimum forcing numbers of all such graphs G form an integer interval from [n/2] to n-1.展开更多
A(3,6)-fullerene is a connected cubic plane graph whose faces are only triangles and hexagons,and has the connectivity 2 or 3.The(3,6)-fullerenes with connectivity 2 are the tubes consisting of l concentric hexagonal ...A(3,6)-fullerene is a connected cubic plane graph whose faces are only triangles and hexagons,and has the connectivity 2 or 3.The(3,6)-fullerenes with connectivity 2 are the tubes consisting of l concentric hexagonal layers such that each layer consists of two hexangons,capped on each end by two adjacent triangles,denoted by T_(l)(l≥1).A(3,6)-fullerene Tl with n vertices has exactly 2n/4+1 perfect matchings.The structure of a(3,6)-fullerene G with connectivity 3 can be determined by only three parameters r,s and t,thus we denote it by G=(r,s,t),where r is the radius(number of rings),s is the size(number of spokes in each layer,s(≥4,s is even),and t is the torsion(0≤t<s,t≡r mod 2).In this paper,the counting formula of the perfect matchings in G=n+1,4,t)is given,and the number of perfect matchpings is obtained.Therefore,the correctness of the conclusion that every bridgeless cubic graph with p vertices has at least 2p/3656perfect matchings proposed by Esperet et al is verified for(3,6)-fullerene G=(n+1,4,t).展开更多
The perfectly matched layer(PML) is an effective technique for truncating unbounded domains with minimal spurious reflections. A fluid parabolic equation(PE) model applying PML technique was previously used to analyze...The perfectly matched layer(PML) is an effective technique for truncating unbounded domains with minimal spurious reflections. A fluid parabolic equation(PE) model applying PML technique was previously used to analyze the sound propagation problem in a range-dependent waveguide(Lu and Zhu, 2007). However, Lu and Zhu only considered a standard fluid PE to demonstrate the capability of the PML and did not take improved one-way models into consideration. They applied a [1/1] Padé approximant to the parabolic equation. The higher-order PEs are more accurate than standard ones when a very large angle propagation is considered. As for range-dependent problems, the techniques to handle the vertical interface between adjacent regions are mainly energy conserving and single-scattering. In this paper, the PML technique is generalized to the higher order elastic PE, as is to the higher order fluid PE. The correction of energy conserving is used in range-dependent waveguides. Simulation is made in both acoustic cases and seismo-acoustic cases. Range-independent and range-dependent waveguides are both adopted to test the accuracy and efficiency of this method. The numerical results illustrate that a PML is much more effective than an artificial absorbing layer(ABL) both in acoustic and seismo-acoustic sound propagation modeling.展开更多
A convolution perfectly matched layer(CPML)can efficiently absorb boundary reflection in numerical simulation.However,the CPML is suitable for the first-order elastic wave equation and is difficult to apply directly t...A convolution perfectly matched layer(CPML)can efficiently absorb boundary reflection in numerical simulation.However,the CPML is suitable for the first-order elastic wave equation and is difficult to apply directly to the second-order elastic wave equation.In view of this,based on the first-order CPML absorbing boundary condition,we propose a new CPML(NCPML)boundary which can be directly applied to the second-order wave equation.We first systematically extend the first-order CPML technique into second-order wave equations,neglecting the space-varying characteristics of the partial damping coefficient in the complex-frequency domain,avoiding the generation of convolution in the time domain.We then transform the technique back to the time domain through the inverse Fourier transform.Numerical simulation indicates that the space-varying characteristics of the attenuation factor have little influence on the absorption effect and increase the memory at the same time.A number of numerical examples show that the NCPML proposed in this study is effective in simulating elastic wave propagation,and this algorithm is more efficient and requires less memory allocation than the conventional PML absorbing boundary.展开更多
文摘This article presents very original and relatively brief or very brief proofs about of two famous problems: 1) Are there any odd perfect numbers? and 2) “Fermat’s last theorem: A new proof of theorem and its generalization”. They are achieved with elementary mathematics. This is why these proofs can be easily understood by any mathematician or anyone who knows basic mathematics. Note that, in both problems, proof by contradiction was used as a method of proof. The first of the two problems to date has not been resolved. Its proof is completely original and was not based on the work of other researchers. On the contrary, it was based on a simple observation that all natural divisors of a positive integer appear in pairs. The aim of the first work is to solve one of the unsolved, for many years, problems of the mathematics which belong to the field of number theory. I believe that if the present proof is recognized by the mathematical community, it may signal a different way of solving unsolved problems. For the second problem, it is very important the fact that it is generalized to an arbitrarily large number of variables. This generalization is essentially a new theorem in the field of the number theory. To the classical problem, two solutions are given, which are presented in the chronological order in which they were achieved. <em>Note that the second solution is very short and does not exceed one and a half pages</em>. This leads me to believe that Fermat, as a great mathematician was not lying and that he had probably solved the problem, as he stated in his historic its letter, with a correspondingly brief solution. <em>To win the bet on the question of whether Fermat was telling truth or lying, go immediately to the end of this article before the General Conclusions.</em>
基金Supported by the National Natural Science Foundation of China(Grant No.11471273 11671186)
文摘Enumeration of perfect matchings on graphs has a longstanding interest in combinatorial mathematics. In this paper, we obtain some explicit expressions of the number of perfect matchings for a type of Archimedean lattices with toroidal boundary by applying Tesler's crossing orientations to obtain some Pfaffan orientations and enumerating their Pfaffans.
文摘In 2012, Gutman and Wagner proposed the concept of the matching energy of a graph and pointed out that its chemical applications can go back to the 1970s. The matching energy of a graph is defined as the sum of the absolute values of the zeros of its matching polynomial. Let u and v be the non-isolated vertices of the graphs G and H with the same order, respectively. Let wi?be a non-isolated vertex of graph Gi?where i=1, 2, …, k. We use Gu(k)?(respectively, Hv(k)) to denote the graph which is the coalescence of G (respectively, H) and G1, G2,…, Gk?by identifying the vertices u (respectively, v) and w1, w2,…, wk. In this paper, we first present a new technique of directly comparing the matching energies of Gu(k)?and Hv(k), which can tackle some quasi-order incomparable problems. As the applications of the technique, then we can determine the unicyclic graphs with perfect matchings of order 2n with the first to the ninth smallest matching energies for all n≥211.
基金Project supported by the National Natural Science Foundation of China (Grant Nos.11001166,10971131)the Shanghai Leading Academic Discipline Project (Grant No.S30104)
文摘Let Γd2n be the set of trees with a given diameter d having a perfect matching,where 2n is the number of vertex.For a tree T in Γd2n,let Pd+1be a diameter of T and q = d m,where m is the number of the edges of perfect matching inPd+1.It can be found that the trees with minimal energy in Γd2nfor four cases q = d 2,d 3,d 4,[d2],and two remarks aregiven about the trees with minimal energy in Γd2nfor2d 33q d 5 and [d2] + 1 q2d 33 1.
文摘An induced matching M in a graph G is a matching such that V(M) induces a1-regular subgraph of G. The induced matching number of a graph G, denoted by IM(G), isthe maximum number r such that G has an induced matching of r edges. Induced matchingnumber of Prn x Pn is investigated in this paper. The main results are as follows:
文摘Let G be an outerplane graph with maximum degree Δ and the entire chro-matic number χvef (G). This paper proves that if Δ ≥ 6, then Δ + 1 ≤ χvef (G) ≤ Δ+ 2,and χvef (G) = Δ + 1 if and only if G has a matching M consisting of some inner edgeswhich covers all its vertices of maximum degree.
文摘In numerical simulation of wave propagation,both viscoelastic materials and perfectly matched layers(PMLs)attenuate waves.The wave equations for both the viscoelastic model and the PML contain convolution operators.However,convolution operator is intractable in finite-difference time-domain(FDTD)method.A great deal of progress has been made in using time stepping instead of convolution in FDTD.To incorporate PML into viscoelastic media,more memory variables need to be introduced,which increases the code complexity and computation costs.By modifying the nonsplitting PML formulation,I propose a viscoelastic model,which can be used as a viscoelastic material and/or a PML just by adjusting the parameters.The proposed viscoelastic model is essentially equivalent to a Maxwell model.Compared with existing PML methods,the proposed method requires less memory and its implementation in existing finite-difference codes is much easier.The attenuation and phase velocity of P-and S-waves are frequency independent in the viscoelastic model if the related quality factors(Q)are greater than 10.The numerical examples show that the method is stable for materials with high absorption(Q=1),and for heterogeneous media with large contrast of acoustic impedance and large contrast of viscosity.
文摘It is an important issue to numerically solve the time fractional Schrödinger equation on unbounded domains, which models the dynamics of optical solitons propagating via optical fibers. The perfectly matched layer approach is applied to truncate the unbounded physical domain, and obtain an initial boundary value problem on a bounded computational domain, which can be efficiently solved by the finite difference method. The stability of the reduced initial boundary value problem is rigorously analyzed. Some numerical results are presented to illustrate the accuracy and feasibility of the perfectly matched layer approach. According to these examples, the absorption parameters and the width of the absorption layer will affect the absorption effect. The larger the absorption width, the better the absorption effect. There is an optimal absorption parameter, the absorption effect is the best.
文摘Large calculation error can be formed by directly employing the conventional Yee’s grid to curve surfaces.In order to alleviate such condition,unconditionally stable CrankNicolson Douglas-Gunn(CNDG)algorithm with is proposed for rotationally symmetric multi-scale problems in anisotropic magnetized plasma.Within the CNDG algorithm,an alternative scheme for the simulation of anisotropic plasma is proposed in body-of-revolution domains.Convolutional perfectly matched layer(CPML)formulation is proposed to efficiently solve the open region problems.Numerical example is carried out for the illustration of effectiveness including the efficiency,resources,and absorption.Through the results,it can be concluded that the proposed scheme shows considerable performance during the simulation.
基金Supported by National Natural Science Foundation of China (Grant No. 12271229)Gansu Provincial Department of Education:Youth Doctoral fund project (Grant No. 2021QB-090)。
文摘Let G be a simple graph with 2n vertices and a perfect matching.The forcing number f(G,M) of a perfect matching M of G is the smallest cardinality of a subset of M that is contained in no other perfect matching of G.Among all perfect matchings M of G,the minimum and maximum values of f(G,M) are called the minimum and maximum forcing numbers of G,denoted by f(G) and F(G),respectively.Then f(G)≤F(G) ≤n-1.Che and Chen(2011) proposed an open problem:how to characterize the graphs G with f(G)=n-1.Later they showed that for a bipartite graph G,f(G)=n-1 if and only if G is complete bipartite graph K_(n,n).In this paper,we completely solve the problem of Che and Chen,and show that f(G)=n-1 if and only if G is a complete multipartite graph or a graph obtained from complete bipartite graph K_(n,n) by adding arbitrary edges in one partite set.For all graphs G with F(G)=n-1,we prove that the forcing spectrum of each such graph G forms an integer interval by matching 2-switches and the minimum forcing numbers of all such graphs G form an integer interval from [n/2] to n-1.
基金Supported by National Natural Science Foundation of China(11801148,11801149 and 11626089)the Foundation for the Doctor of Henan Polytechnic University(B2014-060)
文摘A(3,6)-fullerene is a connected cubic plane graph whose faces are only triangles and hexagons,and has the connectivity 2 or 3.The(3,6)-fullerenes with connectivity 2 are the tubes consisting of l concentric hexagonal layers such that each layer consists of two hexangons,capped on each end by two adjacent triangles,denoted by T_(l)(l≥1).A(3,6)-fullerene Tl with n vertices has exactly 2n/4+1 perfect matchings.The structure of a(3,6)-fullerene G with connectivity 3 can be determined by only three parameters r,s and t,thus we denote it by G=(r,s,t),where r is the radius(number of rings),s is the size(number of spokes in each layer,s(≥4,s is even),and t is the torsion(0≤t<s,t≡r mod 2).In this paper,the counting formula of the perfect matchings in G=n+1,4,t)is given,and the number of perfect matchpings is obtained.Therefore,the correctness of the conclusion that every bridgeless cubic graph with p vertices has at least 2p/3656perfect matchings proposed by Esperet et al is verified for(3,6)-fullerene G=(n+1,4,t).
基金supported by the Foundation of State Key Laboratory of Acoustics,Institute of Acoustics,Chinese Academy of Sciences(No.SKLA201303)the National Natural Science Foundation of China(Nos.11104044,11234002,and 11474073)
文摘The perfectly matched layer(PML) is an effective technique for truncating unbounded domains with minimal spurious reflections. A fluid parabolic equation(PE) model applying PML technique was previously used to analyze the sound propagation problem in a range-dependent waveguide(Lu and Zhu, 2007). However, Lu and Zhu only considered a standard fluid PE to demonstrate the capability of the PML and did not take improved one-way models into consideration. They applied a [1/1] Padé approximant to the parabolic equation. The higher-order PEs are more accurate than standard ones when a very large angle propagation is considered. As for range-dependent problems, the techniques to handle the vertical interface between adjacent regions are mainly energy conserving and single-scattering. In this paper, the PML technique is generalized to the higher order elastic PE, as is to the higher order fluid PE. The correction of energy conserving is used in range-dependent waveguides. Simulation is made in both acoustic cases and seismo-acoustic cases. Range-independent and range-dependent waveguides are both adopted to test the accuracy and efficiency of this method. The numerical results illustrate that a PML is much more effective than an artificial absorbing layer(ABL) both in acoustic and seismo-acoustic sound propagation modeling.
基金supported by the National Science and Technology Major Special Sub-project of China(No.2016ZX05024-001-008)the National Natural Science Foundation Joint Fund Prcject of China(No.U1562215).
文摘A convolution perfectly matched layer(CPML)can efficiently absorb boundary reflection in numerical simulation.However,the CPML is suitable for the first-order elastic wave equation and is difficult to apply directly to the second-order elastic wave equation.In view of this,based on the first-order CPML absorbing boundary condition,we propose a new CPML(NCPML)boundary which can be directly applied to the second-order wave equation.We first systematically extend the first-order CPML technique into second-order wave equations,neglecting the space-varying characteristics of the partial damping coefficient in the complex-frequency domain,avoiding the generation of convolution in the time domain.We then transform the technique back to the time domain through the inverse Fourier transform.Numerical simulation indicates that the space-varying characteristics of the attenuation factor have little influence on the absorption effect and increase the memory at the same time.A number of numerical examples show that the NCPML proposed in this study is effective in simulating elastic wave propagation,and this algorithm is more efficient and requires less memory allocation than the conventional PML absorbing boundary.
