Some Results on LΔ

We study the quantifier complexity and the relative strength of some fragments of arithmetic axiomatized by induction and minimization schemes for Δ_n+1 formulas.     

Relatively Recursively Enumerable Versus Relatively Σ1 in Models of Peano Arithmetic

We show that that every countable model of PA has a conservative extension M with a subset Y such that a certain Σ₁(Y)-formula defines in M a subset which is not r. e. relative to Y.     

On Overspill Principles and Axiom Schemes for Bounded Formulas

We study the theories I?_n, L?_n and overspill principles for ?_n formulas. We show that IE_n ? L?_n ? I?_n, but we do not know if I?_n L?_n. We introduce a new scheme, the growth scheme Crγ, and we prove that L?_n ? Cr?_n? I?_n. Also, we analyse the utility of bounded collection axioms for the study of the above theories. Mathematics Subject Classification: 03F30, 03H15.     

The existence of a 2‐factor in K1, n‐free graphs with large connectivity and large edge‐connectivity

In this article, we study the existence of a 2‐factor in a K_{1, n}‐free graph. Sumner [J London Math Soc 13 (1976), 351–359] proved that for n?4, an (n?1)‐connected K_{1, n}‐free graph of even order has a 1‐factor. On the other hand, for every pair of integers m and n with m?n?4, there exist infinitely many (n?2)‐connected K_{1, n}‐free graphs of even order and minimum degree at least m which have no 1‐factor. This implies that the connectivity condition of Sumner's result is sharp, and we cannot guarantee the existence of a 1‐factor by imposing a large minimum degree. On the other hand, Ota and Tokuda [J Graph Theory 22 (1996), 59–64] proved that for n?3, every K_{1, n}‐free graph of minimum degree at least 2n?2 has a 2‐factor, regardless of its connectivity. They also gave examples showing that their minimum degree condition is sharp. But all of them have bridges. These suggest that the effects of connectivity, edge‐connectivity and minimum degree to the existence of a 2‐factor in a K_{1, n}‐free graph are more complicated than those to the existence of a 1‐factor. In this article, we clarify these effects by giving sharp minimum degree conditions for a K_{1, n}‐free graph with a given connectivity or edge‐connectivity to have a 2‐factor. Copyright © 2010 Wiley Periodicals, Inc. J Graph Theory 68:77‐89, 2011     

Wave solutions for variants of the KdV–Burger and the K(n,n)–Burger equations by the generalized G′/G‐expansion method

An application of the ‐expansion method to search for exact solutions of nonlinear partial differential equations is analyzed. This method is used for variants of the Korteweg–de Vries–Burger and the K(n,n)–Burger equations. The generalized ‐expansion method was used to construct periodic wave and solitary wave solutions of nonlinear evolution equations. This method is developed for searching exact traveling wave solutions of nonlinear partial differential equations. It is shown that the generalized ‐expansion method, with the help of symbolic computation, provides a straightforward and powerful mathematical tool for solving nonlinear problems. Copyright © 2017 John Wiley & Sons, Ltd.     

Alpha invariant for general polarizations of del Pezzo surfaces of degree 1

For an arbitrary ample divisor A in smooth del Pezzo surface S of degree 1, we verify the condition of the polarization to be K‐stable and it is a simple numerical condition.     

Numerical analysis and computational testing of a high accuracy Leray‐deconvolution model of turbulence

We study a computationally attractive algorithm (based on an extrapolated Crank‐Nicolson method) for a recently proposed family of high accuracy turbulence models, the Leray‐deconvolution family. First we prove convergence of the algorithm to the solution of the Navier‐Stokes equations and delineate its (optimal) accuracy. Numerical experiments are presented which confirm the convergence theory. Our 3d experiments also give a careful comparison of various related approaches. They show the combination of the Leray‐deconvolution regularization with the extrapolated Crank‐Nicolson method can be more accurate at higher Reynolds number that the classical extrapolated trapezoidal method of Baker (Report, Harvard University, 1976). We also show the higher order Leray‐deconvolution models (e.g. N = 1,2,3) have greater accuracy than the N = 0 case of the Leray‐α model. Numerical experiments for the 2d step problem are also successfully investigated. Around the critical Reynolds number, the low order models inhibit vortex shedding behind the step. The higher order models, correctly, do not. To estimate the complexity of using Leray‐deconvolution models for turbulent flow simulations we estimate the models' microscale.© 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2008     

An almost L‐stable BDF‐type method for the numerical solution of stiff ODEs arising from the method of lines

A new BDF‐type scheme is proposed for the numerical integration of the system of ordinary differential equations that arises in the Method of Lines solution of time‐dependent partial differential equations. This system is usually stiff, so it is desirable for the numerical method to solve it to have good properties concerning stability. The method proposed in this article is almost L‐stable and of algebraic order three. Numerical experiments illustrate the performance of the new method on different stiff systems of ODEs after discretizing in the space variable some PDE problems. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq, 2007     

The recognition of symmetric latin squares

A latin square S is isotopic to another latin square S′ if S′ can be obtained from S by permuting the row indices, the column indices and the symbols in S. Because the three permutations used above may all be different, a latin square which is isotopic to a symmetric latin square need not be symmetric. We call the problem of determining whether a latin square is isotopic to a symmetric latin square the symmetry recognition problem. It is the purpose of this article to give a solution to this problem. For this purpose we will introduce a cocycle corresponding to a latin square which transforms very simply under isotopy, and we show this cocycle contains all the information needed to determine whether a latin square is isotopic to a symmetric latin square. Our results relate to 1‐factorizations of the complete graph on n + 1 vertices, K_{n + 1}. There is a well known construction which can be used to make an n × n latin square from a 1‐factorization on n + 1 vertices. The symmetric idempotent latin squares are exactly the latin squares that result from this construction. The idempotent recognition problem is simple for symmetric latin squares, so our results enable us to recognize exactly which latin squares arise from 1‐factorizations of K_{n + 1}. As an example we show that the patterned starter 1‐factorization for the group G gives rise to a latin square which is in the main class of the Cayley latin square for G if and only if G is abelian. Hence, every non‐abelian group gives rise to two latin squares in different main classes. © 2007 Wiley Periodicals, Inc. J Combin Designs 16: 291–300, 2008     

On κ‐hereditary Sets and Consequences of the Axiom of Choice

We will prove that some so‐called union theorems (see [2]) are equivalent in ZF⁰ to statements about the transitive closure of relations. The special case of “bounded” union theorems dealing with κ‐hereditary sets yields equivalents to statements about the transitive closure of κ‐narrow relations. The instance κ = ω₁ (i. e., hereditarily countable sets) yields an equivalent to Howard‐Rubin's Form 172 (the transitive closure Tc(x) of every hereditarily countable set x is countable). In particular, the countable union theorem (Howard‐Rubin's Form 31) and, a fortiori, the axiom of countable choice imply Form 172.     

The Existence of Mixed Orthogonal Arrays with Four and Five Factors of Strength Two

Symmetric orthogonal arrays and mixed orthogonal arrays are useful in the design of various experiments. They are also a fundamental tool in the construction of various combinatorial configurations. In this paper, we investigated the mixed orthogonal arrays with four and five factors of strength two, and proved that the necessary conditions of such mixed orthogonal arrays are also sufficient with several exceptions and one possible exception.     

On the connections between symmetries and conservation rules of dynamical systems

The strict connection between Lie point‐symmetries of a dynamical system and its constants of motion is discussed and emphasized through old and new results. It is shown in particular how the knowledge of the symmetry of a dynamical system can allow us to obtain conserved quantities that are invariant under the symmetry. In the case of Hamiltonian dynamical systems, it is shown that if the system admits a symmetry of a ‘weaker’ type (specifically, a λ or a Λ‐symmetry), then the generating function of the symmetry is not a conserved quantity, but the deviation from the exact conservation is ‘controlled’ in a well‐defined way. Several examples illustrate the various aspects. Copyright © 2012 John Wiley & Sons, Ltd.     

Synchronization of nonlinear master–slave systems under input delay and slope‐restricted input nonlinearity

This article addresses the synchronization of nonlinear master–slave systems under input time‐delay and slope‐restricted input nonlinearity. The input nonlinearity is transformed into linear time‐varying parameters belonging to a known range. Using the linear parameter varying (LPV) approach, applying the information of delay range, using the triple‐integral‐based Lyapunov–Krasovskii functional and utilizing the bounds on nonlinear dynamics of the nonlinear systems, nonlinear matrix inequalities for designing a simple delay‐range‐dependent state feedback control for synchronization of the drive and response systems is derived. The proposed controller synthesis condition is transformed into an equivalent but relatively simple criterion that can be solved through a recursive linear matrix inequality based approach by application of cone complementary linearization algorithm. In contrast to the conventional adaptive approaches, the proposed approach is simple in design and implementation and is capable to synchronize nonlinear oscillators under input delays in addition to the slope‐restricted nonlinearity. Further, time‐delays are treated using an advanced delay‐range‐dependent approach, which is adequate to synchronize nonlinear systems with either higher or lower delays. Furthermore, the resultant approach is applicable to the input nonlinearity, without using any adaptation law, owing to the utilization of LPV approach. A numerical example is worked out, demonstrating effectiveness of the proposed methodology in synchronization of two chaotic gyro systems. © 2015 Wiley Periodicals, Inc. Complexity 21: 220–233, 2016     

Antipodal Theorems for Sets in Rn Bounded by a Finite Number of Spheres

This is a continuation of paper in Adv. Appl. Math. 22 (1999), 219–226, on an antipodal theorem for sets Dⁿ in Rⁿ bounded by a finite number of spheres. Here this theorem is first applied to set-valued mappings from Dⁿ to the boundary of an (n + 1)-cube or a d- dimensional octahedron. Next, the antipodal theorem is reformulated in terms of real continuous functions on Dⁿ, together with applications to the classical theorems of Borsuk–Ulam and Lusternik–Schnirelmann–Borsuk.     

A locally and cubically convergent algorithm for computing 𝒵‐eigenpairs of symmetric tensors

This paper is concerned with computing $\mathrm{??}$‐eigenpairs of symmetric tensors. We first show that computing $\mathrm{??}$‐eigenpairs of a symmetric tensor is equivalent to finding the nonzero solutions of a nonlinear system of equations, and then propose a modified normalized Newton method (MNNM) for it. Our proposed MNNM method is proved to be locally and cubically convergent under some suitable conditions, which greatly improves the Newton correction method and the orthogonal Newton correction method recently provided by Jaffe, Weiss and Nadler since these two methods only enjoy a quadratic rate of convergence. As an application, the unitary symmetric eigenpairs of a complex‐valued symmetric tensor arising from the computation of quantum entanglement in quantum physics are calculated by the MNNM method. Some numerical results are presented to illustrate the efficiency and effectiveness of our method.     

Isomorphic copies of ℓ1 for m‐homogeneous non‐analytic Bohnenblust–Hille polynomials

We employ a classical result by Toeplitz (1913) and the seminal work by Bohnenblust and Hille on Dirichlet series (1931) to show that the set of continuous m‐homogeneous non‐analytic polynomials on c ₀ contains an isomorphic copy of ℓ₁. Moreover, we can have this copy of ℓ₁ in such a way that every non‐zero element of it fails to be analytic at precisely the same point.     

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.     

A new risk model based on policy entrance process and its weak convergence properties

In this paper, we construct a new risk model based on the policy entrance process. The model is concerned with n kinds of independent policies, and each policy is allowed to claim more than once before it expires. As each kind of policy is issued according to a non‐homogeneous Poisson process, the long run behaviour of the new risk process is investigated. When the tail of the claim size distribution is regularly varying, the standardized risk process is proved to converge to a stable law. When each kind of policy is issued according to a homogeneous Poisson process, we also give a diffusion approximation of the new risk process. Copyright © 2007 John Wiley & Sons, Ltd.