Stability analysis of higher order nonlinear differential equations in β–normed spaces

In this paper, we interrogate different Ulam type stabilities, ie, β–Ulam–Hyers stability, generalized β–Ulam–Hyers stability, β–Ulam–Hyers–Rassias stability, and generalized β–Ulam–Hyers–Rassias stability, for nth order nonlinear differential equations with integrable impulses of fractional type. The existence and uniqueness of solutions are investigated by using the Banach contraction principle. In the end, we give an example to support our main result.     

New types of hyper MV‐deductive systems in hyper MV‐algebras

The notions of a (weak) hyper MV‐deductive system, a (?, ?; ?)‐hyper MV‐deductive system, a (?, ?; ?)‐ hyper MV‐deductive system, a (?, ?; ?)‐hyper MV‐deductive system, a (?, ?; ?)‐hyper MV‐deductive system and a (∩, ∩; ∩)‐hyper MV‐deductive system are introduced, and then their relations are investigated (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Hilbert's ϵ-operator in intuitionistic type theories

We investigate Hilbert's ?-calculus in the context of intuitionistic type theories, that is, within certain systems of intuitionistic higher-order logic. We determine the additional deductive strength conferred on an intuitionistic type theory by the adjunction of closed ?-terms. We extend the usual topos semantics for type theories to the ?-operator and prove a completeness theorem. The paper also contains a discussion of the concept of “partially defined” ?-term. MSC: 03B15, 03B20, 03G30.     

Admissible perturbations of α‐ψ‐pseudocontractive operators: convergence theorems

We prove some convergence theorems for α‐ψ‐pseudocontractive operators in real Hilbert spaces, by using the concept of admissible perturbation. Our results extend and complement some theorems in the existing literature. Copyright © 2016 John Wiley & Sons, Ltd.     

Orthogonally Resolvable Cycle Decompositions

If a cycle decomposition of a graph G admits two resolutions, and , such that for each resolution class and , then the resolutions and are said to be orthogonal. In this paper, we introduce the notion of an orthogonally resolvable cycle decomposition, which is a cycle decomposition admitting a pair of orthogonal resolutions. An orthogonally resolvable cycle decomposition of a graph G may be represented by a square array in which each cell is either empty or filled with a k–cycle from G, such that every vertex appears exactly once in each row and column of the array and every edge of G appears in exactly one cycle. We focus mainly on orthogonal k‐cycle decompositions of and (the complete graph with the edges of a 1‐factor removed), denoted . We give general constructions for such decompositions, which we use to construct several infinite families. We find necessary and sufficient conditions for the existence of an OCD(n, 4). In addition, we consider orthogonal cycle decompositions of the lexicographic product of a complete graph or cycle with . Finally, we give some nonexistence results.     

Higher‐order generalized invexity in variational problems

We introduce higher‐order duality (Mangasarian type and Mond–Wier type) of variational problems. Under higher‐order generalized invexity assumptions on functions that compose the primal problem, higher‐order duality results (weak duality, strong duality, and converse duality) are derived for this pair of problems. Also, we establish many examples and counter‐examples to support our investigation. Copyright © 2012 John Wiley & Sons, Ltd.     

Asymptotic analysis of unsteady neutron transport equation

Consider the unsteady neutron transport equation with diffusive boundary condition in 2D convex domains. We establish the diffusive limit with both initial layer and boundary layer corrections. The major difficulty is the lack of regularity in the boundary layer with geometric correction. Our contribution relies on a detailed analysis of asymptotic expansions inspired by the compatibility condition and an intricate L^2m ? L^∞ framework, which yields stronger remainder estimates.     

Exceptions and characterization results for type‐1 λ‐designs

Let $X$ be a finite set with $v$ elements, called points and $\beta$ be a family of subsets of $X$, called blocks. A pair $\left(X,\beta \right)$ is called $\lambda$‐design whenever $\mid \beta \mid =\mid X\mid$ and

• 1. for all $B_i,B_j\in \beta ,i\ne j,\mid B_i\cap B_j\mid =\lambda$;
• 2. for all $B_j\in \beta ,\mid B_j\mid =k_j>\lambda$, and not all $k_j$ are equal.

The only known examples of $\lambda$‐designs are so‐called type‐1 designs, which are obtained from symmetric designs by a certain complementation procedure. Ryser and Woodall had independently conjectured that all $\lambda$‐designs are type‐1. Let $r,r^{*}?(r>r^{*})$ be replication numbers of a $\lambda$‐design $D=\left(X,\beta \right)$ and $g=\text{gcd}\left(r?1,r^{*}?1\right),m=\text{gcd}\left(\left(r?r^{*}\right)∕g,\lambda \right)$, and $m\prime =m$, if $m$ is odd and $m\prime =m∕2$, otherwise. For distinct points $x$ and $y$ of $D$, let $\lambda \left(x,y\right)$ denote the number of blocks of $X$ containing $x$ and $y$. We strengthen a lemma of S.S. Shrikhande and N.M. Singhi and use it to prove that if $\frac{r\left(r?1\right)}{\left(v?1\right)}?\frac{k\left(r?r^{*}\right)}{m\prime \left(v?1\right)}$ are not integers for $k=1,2,\text{…},m\prime ?1$, then $D$ is type‐1. As an application of these results, we show that for fixed positive integer $\theta$ there are finitely many nontype‐1 $\lambda$‐designs with $r=r^{*}+\theta$. If $r?r^{*}=27$ or $r?r^{*}=4p$ and $r^{*}\ne {\left(p?1\right)}^2$, or $v=7p+1$ such that $p?1,13\left(\mathrm{mod}21\right)$ and $p?4,9,19,24\left(\mathrm{mod}35\right)$, where $p$ is a positive prime, then $D$ is type‐1. We further obtain several inequalities involving $\lambda (x,y)$, where equality holds if and only if D is type‐1.     

Superconvergent recovery of gradients of piecewise linear finite element approximations on non-uniform mesh partitions

We propose the use of an averaging scheme, which recovers gradients from piecewise linear finite element approximations on the (1 + α˜)—regular triangular elements to gradients of the weak solution of a second-order elliptic boundary value problem in the 2-dimensional space. The recovered gradients, from mid-points of element edges, are superconvergent estimates of the true gradients. This work is an extension of Levine [Levine, IMA J. Numer. Anal. 5 , 407 (1985)] and follows some of the ideas therein. © 1998 John Wiley & Sons, Inc. Numer Methods Partial Differential Eq 14:169–192, 1998     

On the Riemann Summability of Fourier Integrals and Real Hardy Spaces

We consider the Riemann means of single and multiple Fourier integrals of functions belonging to L¹ or the real Hardy spaces defined on ℝⁿ, where n ≥ 1 is an integer. We prove that the maximal Riemann operator is bounded both from H¹(ℝ) into L¹(ℝ) and from L¹(ℝ) into weak –L¹(ℝ). We also prove that the double maximal Riemann operator is bounded from the hybrid Hardy spaces H^(1,0)(ℝIsup2), H^(0,1)(ℝ²⁾ into weak –L¹(ℝ²). Hence pointwise Riemann summability of Fourier integrals of functions in H^(1,0) ∪ H^(0,1)(ℝ²) follows almost everywhere.The maximal conjugate Riemann operators as well as the pointwise convergence of the conjugate Riemann means are also dealt with.     

Completely 𝒲-Resolved Complexes

Let R be a ring and 𝒲 a self-orthogonal class of left R-modules which is closed under finite direct sums and direct summands. A complex C of left R-modules is called a 𝒲-complex if it is exact with each cycle Z ⁿ (C) ∈ 𝒲. The class of such complexes is denoted by 𝒞_𝒲. A complex C is called completely 𝒲-resolved if there exists an exact sequence of complexes D _· = … → D _?1 → D ₀ → D ₁ → … with each term D _i in 𝒞_𝒲 such that C = ker(D ₀ → D ₁) and D _· is both Hom(𝒞_𝒲, ?) and Hom(?, 𝒞_𝒲) exact. In this article, we show that C = … → C ^?1 → C ⁰ → C ¹ → … is a completely 𝒲-resolved complex if and only if C ⁿ is a completely 𝒲-resolved module for all n ∈ ?. Some known results are obtained as corollaries.     

Omega- and Beta-Models of Alternative Set Theory

We present the axioms of Alternative Set Theory (AST) in the language of second-order arithmetic and study its ω- and β-models. These are expansions of the form (M, M), M ? P(M), of nonstandard models M of Peano arithmetic (PA) such that (M, M) ? AST and ω ? M. Our main results are: (1) A countable M ? PA is β-expandable iff there is a regular well-ordering for M. (2) Every countable β-model can be elementarily extended to an ω-model which is not a β-model. (3) The Ω-orderings of an ω-model (M, M) are absolute well-orderings iff the standard system SS(M) of M is a β-model of A^?_2. (4) There are ω-expandable models M such that no ω-expansion of M contains absolute Ω-orderings. (5) There are s-expandable models (i. e., their ω-expansions contain only absolute Ω-orderings) which are not β-expandable. (6) For every countable β-expansion M of M, there is a generic extension M[G] which is also a β-expansion of M. (7) If M is countable and β-expandable, then there are regular orderings <₁, <₂ such that neither <₁ belongs to the ramified analytical hierarchy of the structure (M, <₂), nor <₂ to that of (M, <₁). (8) The result (1) can be improved as follows: A countable M ? PA is β-expandable iff there is a semi-regular well-ordering for M.     

On Random Attractors for Mixing Type Systems

The paper deals with infinite-dimensional random dynamical systems. Under the condition that the system in question is of mixing type and possesses a random compact attracting set, we show that the support of the unique invariant measure is the minimal random point attractor. The results obtained apply to the randomly forced 2D Navier–Stokes system.     

Triangle‐free graphs that are signable without even holes

We characterize triangle‐free graphs for which there exists a subset of edges that intersects every chordless cycle in an odd number of edges (TF odd‐signable graphs). These graphs arise as building blocks of a decomposition theorem (for cap‐free odd‐signable graphs) obtained by the same authors. We give a polytime algorithm to test membership in this class. This algorithm is itself based on a decomposition theorem. © 2000 John Wiley & Sons, Inc. J Graph Theory 34: 204–220, 2000     

Second homology of Lie superalgebras

The second homology of Lie superalgebras over a field of characteristic 0 extended over a supercommutative superalgebra A and their twisted version are obtained. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Some results on λ‐designs with two block sizes

A λ‐design is a family ?? = {B₁, B₂, …, B_v} of subsets of X = {1, 2, …, v} such that |B_i∩B_j| = λ for all i≠jand not all B_i are of the same size. The only known example of λ‐designs (called type‐1 designs) are those obtained from symmetric designs by a certain complementation procedure. Ryser [J Algebra 10 (1968), 246–261] and Woodall [Proc London Math Soc 20 (1970), 669–687] independently conjectured that all λ‐designs are type‐1. Let g = gcd(r ? 1, r^* ? 1), where rand r^* are the two replication numbers. Ionin and Shrikhande [J Combin Comput 22 (1996), 135–142; J Combin Theory Ser A 74 (1996), 100–114] showed that λ‐designs with g = 1, 2, 3, 4 are type‐1 and that the Ryser–Woodall conjecture is true for λ‐designs on p + 1, 2p + 1, 3p + 1, 4p + 1 points, where pis a prime. Hein and Ionin [Codes and Designs—Proceedings of Conference honoring Prof. D. K. Ray‐Chaudhuri on the occasion of his 65th birthday, Ohio State University Mathematical Research Institute Publications, 10, Walter de Gruyter, Berlin, 2002, pp. 145–156] proved corresponding results for g = 5 and Fiala [Codes and Designs—Proceedings of Conference honoring Prof. D. K. Ray‐Chaudhuri on the occasion of his 65th birthday, Ohio State University Mathematical Research Institute Publications, 10, Walter de Gruyter, Berlin, 2002, pp. 109–124; Ars Combin 68 (2003), 17–32; Ars Combin, to appear] for g = 6, 7, and 8. In this article, we consider λ designs with exactly two block sizes. We show that in this case, the conjecture is true for g = 9, 11, 12, 13, 15, 16, 17, 19, 20, 21, and for g = 10, 14, 18, 22 with v≠4λ ? 1. We also give two results on such λ‐designs on v = 9p + 1 and 12p + 1 points, where pis a prime. © 2010 Wiley Periodicals, Inc. J Combin Designs 19:95‐110, 2011