Infinite families of non‐embeddable quasi‐residual Menon designs

A Menon design of order h² is a symmetric (4h²,2h²‐h,h²‐h)‐design. Quasi‐residual and quasi‐derived designs of a Menon design have parameters 2‐(2h² + h,h²,h²‐h) and 2‐(2h²‐h,h²‐h,h²‐h‐1), respectively. In this article, regular Hadamard matrices are used to construct non‐embeddable quasi‐residual and quasi‐derived Menon designs. As applications, we construct the first two new infinite families of non‐embeddable quasi‐residual and quasi‐derived Menon designs. © 2008 Wiley Periodicals, Inc. J Combin Designs 17: 53–62, 2009     

On the convergence of Fourier series of computable Lebesgue integrable functions

This paper studies how well computable functions can be approximated by their Fourier series. To this end, we equip the space of L^p‐computable functions (computable Lebesgue integrable functions) with a size notion, by introducing L^p‐computable Baire categories. We show that L^p‐computable Baire categories satisfy the following three basic properties. Singleton sets {f } (where f is L^p‐computable) are meager, suitable infinite unions of meager sets are meager, and the whole space of L^p‐computable functions is not meager. We give an alternative characterization of meager sets via Banach‐Mazur games. We study the convergence of Fourier series for L^p‐computable functions and show that whereas for every p > 1, the Fourier series of every L^p‐computable function f converges to f in the L^p norm, the set of L¹‐computable functions whose Fourier series does not diverge almost everywhere is meager (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Stabilized mixed finite element methods for the Navier‐Stokes equations with damping

In this paper, the stabilized mixed finite element methods are presented for the Navier‐Stokes equations with damping. The existence and uniqueness of the weak solutions are proven by use of the Brouwer fixed‐point theorem. Then, optimal error estimates for the H¹‐norm and L²‐norm of the velocity and the L²‐norm of the pressure are derived. Moreover, on the basis of the optimal L²‐norm error estimate of the velocity, a stabilized two‐step method is proposed, which is more efficient than the usual stabilized methods. Finally, two numerical examples are implemented to confirm the theoretical analysis.     

On cubic non‐Cayley vertex‐transitive graphs

In 1983, the second author [D. Maru?i?, Ars Combinatoria 16B (1983), 297–302] asked for which positive integers n there exists a non‐Cayley vertex‐transitive graph on n vertices. (The term non‐Cayley numbers has later been given to such integers.) Motivated by this problem, Feng [Discrete Math 248 (2002), 265–269] asked to determine the smallest valency ?(n) among valencies of non‐Cayley vertex‐transitive graphs of order n. As cycles are clearly Cayley graphs, ?(n)?3 for any non‐Cayley number n. In this paper a goal is set to determine those non‐Cayley numbers n for which ?(n) = 3, and among the latter to determine those for which the generalized Petersen graphs are the only non‐Cayley vertex‐transitive graphs of order n. It is known that for a prime p every vertex‐transitive graph of order p, p² or p³ is a Cayley graph, and that, with the exception of the Coxeter graph, every cubic non‐Cayley vertex‐transitive graph of order 2p, 4p or 2p² is a generalized Petersen graph. In this paper the next natural step is taken by proving that every cubic non‐Cayley vertex‐transitive graph of order 4p², p>7 a prime, is a generalized Petersen graph. In addition, cubic non‐Cayley vertex‐transitive graphs of order 2p^k, where p>7 is a prime and k?p, are characterized. © 2011 Wiley Periodicals, Inc. J Graph Theory 69: 77–95, 2012     

Error estimates for a discontinuous Galerkin method with interior penalties applied to nonlinear Sobolev equations

A Discontinuous Galerkin method with interior penalties is presented for nonlinear Sobolev equations. A semi‐discrete and a family of fully‐discrete time approximate schemes are formulated. These schemes are symmetric. Hp‐version error estimates are analyzed for these schemes. For the semi‐discrete time scheme a priori L^∞(H¹) error estimate is derived and similarly, l^∞(H¹) and l²(H¹) for the fully‐discrete time schemes. These results indicate that spatial rates in H¹ and time truncation errors in L² are optimal. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2008     

Energy conservation and super convergence analysis of the EC‐S‐FDTD schemes for Maxwell equations with periodic boundaries

This paper is concerned with new energy analysis of the two dimensional Maxwell's equations and the symmetric energy‐conserved splitting finite difference time domain (EC‐S‐FDTD) method with the periodic boundary (PB) condition. New energy identities of the Maxwell's equations in terms of H¹ and H² norms are proposed and interpreted by considering the physical meanings of the H¹ and H² semi‐norms in the identities. It is found from these new identities that the first and second curls of the electromagnetic fields are conserved in terms their magnitudes. By the energy methods, the numerical energy identities of the symmetric EC‐S‐FDTD method are derived and shown to converge to the continuous energy identities of the Maxwell's equations. This proves that the symmetric EC‐S‐FDTD scheme is unconditionally stable and energy conserved in the discrete H¹ and H² norms. Also by the energy methods, it is proved that the symmetric EC‐S‐FDTD method with PB condition is of second order (super) convergence in the discrete H¹ and H² norms. Numerical experiments are carried out and confirm the analysis on energy conservation, stability and super convergence.     

Properties of Hadamard product of inverse M‐matrices

This paper concerns with the properties of Hadamard product of inverse M‐matrices. Structures of tridiagonal inverse M‐matrices and Hessenberg inverse M‐matrices are analysed. It is proved that the product A ○ A^T satisfies Willoughby's necessary conditions for being an inverse M‐matrix when A is an irreducible inverse M‐matrix. It is also proved that when A is either a Hessenberg inverse M‐matrix or a tridiagonal inverse M‐matrix then A ○ A^T is an inverse M‐matrix. Based on these results, the conjecture that A ○ A^T is an inverse M‐matrix when A is an inverse M‐matrix is made. Unfortunately, the conjecture is not true. Copyright © 2004 John Wiley Sons, Ltd.     

Global Well‐Posedness of the Three‐Dimensional Primitive Equations with Only Horizontal Viscosity and Diffusion

In this paper, we consider the initial boundary value problem of the three‐dimensional primitive equations for planetary oceanic and atmospheric dynamics with only horizontal eddy viscosity in the horizontal momentum equations and only horizontal diffusion in the temperature equation. Global well‐posedness of the strong solution is established for any H² initial data. An N‐dimensional logarithmic Sobolev embedding inequality, which bounds the L^∞‐norm in terms of the L^q‐norms up to a logarithm of the L^p‐norm for p > N of the first‐order derivatives, and a system version of the classic Grönwall inequality are exploited to establish the required a~priori H² estimates for global regularity.© 2016 Wiley Periodicals, Inc.     

Self‐dual and self‐petrie‐dual regular maps

Regular maps are cellular decompositions of surfaces with the “highest level of symmetry”, not necessarily orientation‐preserving. Such maps can be identified with three‐generator presentations of groups G of the form G = 〈a, b, c|a² = b² = c² = (ab)^k = (bc)^m = (ca)² = … = 1〉; the positive integers k and m are the face length and the vertex degree of the map. A regular map (G;a, b, c) is self‐dual if the assignment b?b, c?a and a?c extends to an automorphism of G, and self‐Petrie‐dual if G admits an automorphism fixing b and c and interchanging a with ca. In this note we show that for infinitely many numbers k there exist finite, self‐dual and self‐Petrie‐dual regular maps of vertex degree and face length equal to k. We also prove that no such map with odd vertex degree is a normal Cayley map. Copyright © 2011 Wiley Periodicals, Inc. J Graph Theory 69:152‐159, 2012     

Time‐weighted blow‐up rates and pointwise profile for single‐point blow‐up solutions in reaction–diffusion equations

This paper deals with asymptotic behavior for blow‐up solutions to time‐weighted reaction–diffusion equations u_t=Δu+e^αtv^p and v_t=Δv+e^βtu^q, subject to homogeneous Dirichlet boundary. The time‐weighted blow‐up rates are defined and obtained by ways of the scaling or auxiliary‐function methods for all α, . Aiding by key inequalities between components of solutions, we give lower pointwise blow‐up profiles for single‐point blow‐up solutions. We also study the solutions of the system with variable exponents instead of constant ones, where blow‐up rates and new blow‐up versus global existence criteria are obtained. Time‐weighted functions influence critical Fujita exponent, critical Fujita coefficient and formulae of blow‐up rates, but they do not limit the order of time‐weighted blow‐up rates and pointwise profile near blow‐up time. Copyright © 2017 John Wiley & Sons, Ltd.     

Diff(Rn) as a Milnor–Lie group

We describe a construction of the Lie group structure on the diffeomorphism group Diff( R ⁿ), modelled on the space D( R ⁿ, R ⁿ) of R ⁿ‐valued test functions on R ⁿ, in John Milnor's setting of infinite‐dimensional Lie groups. New tools are introduced to simplify this task. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Stepanov‐like doubly weighted pseudo almost automorphic processes and its application to Sobolev‐type stochastic differential equations driven by G‐Brownian motion

This paper investigates the properties of the p‐mean Stepanov‐like doubly weighted pseudo almost automorphic (S^pDWPAA) processes and its application to Sobolev‐type stochastic differential equations driven by G‐Brownian motion. We firstly prove the equivalent relation between the S^pDWPAA and Stepanov‐like asymptotically almost automorphic stochastic processes based on ergodic zero set. We further establish the completeness of the space and the composition theorem for S^pDWPAA processes. These results obtained improve and extend previous related conclusions. As an application, we show the existence and uniqueness of the S^p DWPAA solution for a class of nonlinear Sobolev‐type stochastic differential equations driven by G‐Brownian motion and present a decomposition of this unique solution. Moreover, an example is given to illustrate the effectiveness of our results.     

Sharp regularity results on second derivatives of solutions to the Monge‐Ampère equation with VMO type data

We establish interior estimates for L^p‐norms, Orlicz norms, and mean oscillation of second derivatives of solutions to the Monge‐Ampère equation det D²u = f(x) with zero boundary value, where f(x) is strictly positive, bounded, and satisfies a VMO‐type condition. These estimates develop the regularity theory of the Monge‐Ampère equation in VMO‐type spaces. Our Orlicz estimates also sharpen Caffarelli's celebrated W^{2, p}‐estimates. © 2008 Wiley Periodicals, Inc.     

Asymptotic analysis and estimates of blow‐up time for the radial symmetric semilinear heat equation in the open‐spectrum case

We estimate the blow‐up time for the reaction diffusion equation u_t=Δu+ λf(u), for the radial symmetric case, where f is a positive, increasing and convex function growing fast enough at infinity. Here λ>λ^*, where λ^* is the ‘extremal’ (critical) value for λ, such that there exists an ‘extremal’ weak but not a classical steady‐state solution at λ=λ^* with ∥w(?, λ)∥_∞→∞ as 0<λ→λ^*?. Estimates of the blow‐up time are obtained by using comparison methods. Also an asymptotic analysis is applied when f(s)=e^s, for λ?λ^*?1, regarding the form of the solution during blow‐up and an asymptotic estimate of blow‐up time is obtained. Finally, some numerical results are also presented. Copyright © 2007 John Wiley & Sons, Ltd.     

New energy identities and super convergence analysis of the energy conserved splitting FDTD methods for 3D Maxwell's equations

The energy‐conserved splitting finite‐difference time‐domain (EC‐S‐FDTD) method has recently been proposed to solve the Maxwell equations with second order accuracy while numerically keep the L² energy conservation laws of the equations. In this paper, the EC‐S‐FDTD scheme for the 3D Maxwell equations is proved to be energy‐conserved and unconditionally stable in the discrete H¹ norm. The EC‐S‐FDTD scheme is of second‐order accuracy both in time step and spatial steps, which suggests the super‐convergence of this scheme in the discrete H¹ norm. And the divergence of the electric field of the EC‐S‐FDTD scheme in the discrete L² norm is second‐order accurate. Numerical experiments confirm our theoretical analysis. Copyright © 2012 John Wiley & Sons, Ltd.     

A convolution formula for time‐invariant linear communication systems

For every linear and time‐invariant time‐discrete (communication) system T : l^∞ → l^∞, formally, the following convolution formula can be derived: \input amssym.def $$(Tf)(n)=\sum_{k \in {\Bbb Z}} h(n‐k) f(k),\quad n \in {\Bbb Z}, f \in l^{\infty},$$ where h = Tδ is the delta impulse response. This paper is concerned with the question under which assumptions linear and time‐invariant time‐discrete systems T : l^∞ → l^∞ can be characterized by this formula. For this purpose we derive a convolution formula in a more general situation which also leads to a well‐known convolution formula in the time‐continuous case. Copyright © 1999 John Wiley & Sons, Ltd.     

A Crank‐Nicolson Petrov‐Galerkin method with quadrature for semi‐linear parabolic problems

We propose and analyze an application of a fully discrete C² spline quadrature Petrov‐Galerkin method for spatial discretization of semi‐linear parabolic initial‐boundary value problems on rectangular domains. We prove second order in time and optimal order H¹ norm convergence in space for the extrapolated Crank‐Nicolson quadrature Petrov‐Galerkin scheme. We demonstrate numerically both L² and H¹ norm optimal order convergence of the scheme even if the nonlinear source term is not smooth. © 2005 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2005.     

Destructibility of stationary subsets of Pκλ

For a regular cardinal κ with κ ^<κ = κ and κ ≤ λ , we construct generically (forcing by a < κ‐closed κ ⁺‐c. c. p. o.‐set ℙ₀) a subset S of {x ∈ P _κ λ : x ∩ κ is a singular ordinal} such that S is stationary in a strong sense (F ^IA_κ λ ‐stationary in our terminology) but the stationarity of S can be destroyed by a κ ⁺‐c. c. forcing ℙ* (in V ^ℙ) which does not add any new element of P _κ λ . Actually ℙ* can be chosen so that ℙ* is κ‐strategically closed. However we show that such ℙ* itself cannot be κ‐strategically closed or even <κ‐strategically closed if κ is inaccessible. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

The n‐ordered graphs: A new graph class

For a positive integer n, we introduce the new graph class of n‐ordered graphs, which generalize partial n‐trees. Several characterizations are given for the finite n‐ordered graphs, including one via a combinatorial game. We introduce new countably infinite graphs R⁽ⁿ⁾, which we name the infinite random n‐ordered graphs. The graphs R⁽ⁿ⁾ play a crucial role in the theory of n‐ordered graphs, and are inspired by recent research on the web graph and the infinite random graph. We characterize R⁽ⁿ⁾ as a limit of a random process, and via an adjacency property and a certain folding operation. We prove that the induced subgraphs of R⁽ⁿ⁾ are exactly the countable n‐ordered graphs. We show that all countable groups embed in the automorphism group of R⁽ⁿ⁾. © 2008 Wiley Periodicals, Inc. J Graph Theory 60: 204–218, 2009