More on regular and decomposable ultrafilters in ZFC

We prove, in ZFC alone, some new results on regularity and decomposability of ultrafilters; among them: (a) If m ≥ 1 and the ultrafilter D is (_m(λ⁺ⁿ), _m(λ⁺ⁿ))‐regular, then D is κ ‐decomposable for some κ with λ ≤ κ ≤ 2^λ (Theorem 4.3(a^')). (b) If λ is a strong limit cardinal and D is (_m(λ⁺ⁿ), _m(λ⁺ⁿ))‐regular, then either D is (cf λ, cf λ)‐regular or there are arbitrarily large κ < λ for which D is κ ‐decomposable (Theorem 4.3(b)). (c) Suppose that λ is singular, λ < κ, cf κ ≠ cf λ and D is (λ⁺, κ)‐regular. Then: (i) D is either (cf λ, cf λ)‐regular, or (λ^', κ)‐regular for some λ^' < λ (Theorem 2.2). (ii) If κ is regular, then D is either (λ, κ)‐regular, or (ω, κ^')‐regular for every κ^' < κ (Corollary 6.4). (iii) If either (1) λ is a strong limit cardinal and λ^<λ < 2^κ, or (2) λ^<λ < κ, then D is either λ ‐decomposable, or (λ^', κ)‐regular for some λ^' < λ (Theorem 6.5). (d) If λ is singular, D is (μ, cf λ)‐regular and there are arbitrarily large ν < λ for which D is ν ‐decomposable, then D is κ ‐decomposable for some κ with λ ≤ κ ≤ λ^<μ (Theorem 5.1; actually, our result is stronger and involves a covering number). (e) D × D^' is (λ, μ)‐regular if and only if there is a ν such that D is (ν, μ)‐regular and D^' is (λ, ν^')‐regular for all ν^～ < ν (Proposition 7.1). We also list some problems, and furnish applications to topological spaces and to extended logics (Corollar‐ies 4.6 and 4.8) (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On Keisler singular‐like models

Keisler in [7] proved that for a strong limit cardinal κ and a singular cardinal λ, the transfer relation κ → λ holds. We analyze the λ ‐like models produced in the proof of Keisler's transfer theorem when κ is further assumed to be regular. Our main result shows that with this extra assumption, Keisler's proof can be modified to produce a λ ‐like model M with built‐in Skolem functions that satisfies the following two properties: (1) M is generated by a subset C of order‐type λ. (2) M can be written as union of an elementary end extension chain 〈N_i: i < δ 〉 such that for each i < δ, there is an initial segment C_i of C with C_i ? N_i, and N_i ∩ (C \Ci) = ??. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Indestructibility and stationary reflection

If κ < λ are such that κ is a strong cardinal whose strongness is indestructible under κ ‐strategically closed forcing and λ is weakly compact, then we show that A = {δ < κ | δ is a non‐weakly compact Mahlo cardinal which reflects stationary sets} must be unbounded in κ. This phenomenon, however, need not occur in a universe with relatively few large cardinals. In particular, we show how to construct a model where no cardinal is supercompact up to a Mahlo cardinal in which the least supercompact cardinal κ is also the least strongly compact cardinal, κ 's strongness is indestructible under κ ‐strategically closed forcing, κ 's supercompactness is indestructible under κ ‐directed closed forcing not adding any new subsets of κ, and δ is Mahlo and reflects stationary sets iff δ is weakly compact. In this model, no strong cardinal δ < κ is indestructible under δ ‐strategically closed forcing. It therefore follows that it is relatively consistent for the least strong cardinal κ whose strongness is indestructible under κ ‐strategically closed forcing to be the same as the least supercompact cardinal, which also has its supercompactness indestructible under κ ‐directed closed forcing not adding any new subsets of κ (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Large set of P3‐decompositions

Let G=(V(G),E(G)) be a graph. A (n,G, λ)‐GD is a partition of the edges of λK_n into subgraphs (G‐blocks), each of which is isomorphic to G. The (n,G,λ)‐GD is named as graph design for G or G‐decomposition. The large set of (n,G,λ)‐GD is denoted by (n,G,λ)‐LGD. In this work, we obtain the existence spectrum of (n,P₃,λ)‐LGD. © 2002 Wiley Periodicals, Inc. J Combin Designs 10: 151–159, 2002; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10008     

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)     

Non‐isolated quasi‐degrees

We show that non‐isolated from below 2‐c.e. Q ‐degrees are dense in the structure of c.e. Q ‐degrees. We construct a 2‐c.e. Q ‐degree, which can't be isolated from below not only by c.e. Q ‐degrees, but by any Q ‐degree. We also prove that below any c.e. Q ‐degree there is a 2‐c.e. Q ‐degree, which is non‐isolated from below and from above (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A Sturm–Liouville problem depending rationally on the eigenvalue parameter

We consider the Sturm–Liouville problem (1.1) and (1.2) with a potential depending rationally on the eigenvalue parameter. With these equations a λ ‐linear eigenvalue problem is associated in such a way that L₂‐solutions of (1.1), (1.2) correspond to eigenvectors of a linear operator. If the functions q and u are real and satisfy some additional conditions, the corresponding linear operator is a definitizable self‐adjoint operator in some Krein space. Moreover we consider the problem (1.1) and (1.3) on the positive half‐axis. Here we use results on the absense of positive eigenvalues for Sturm–Liouville operators to exclude critical points of the associated definitizable operator. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Positive periodic solutions and eigenvalue intervals for systems of second order differential equations

In this paper, we employ a well‐known fixed point theorem for cones to study the existence of positive periodic solutions to the n ‐dimensional system x ″ + A (t)x = H (t)G (x). Moreover, the eigenvalue intervals for x ″ + A (t)x = λH (t)G (x) are easily characterized. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Quasi‐random hypergraphs revisited

The quasi‐random theory for graphs mainly focuses on a large equivalent class of graph properties each of which can be used as a certificate for randomness. For k ‐graphs (i.e., k ‐uniform hypergraphs), an analogous quasi‐random class contains various equivalent graph properties including the k ‐discrepancy property (bounding the number of edges in the generalized induced subgraph determined by any given (k ‐ 1) ‐graph on the same vertex set) as well as the k ‐deviation property (bounding the occurrences of “octahedron”, a generalization of 4 ‐cycle). In a 1990 paper (Chung, Random Struct Algorithms 1 (1990) 363‐382), a weaker notion of l ‐discrepancy properties for k ‐graphs was introduced for forming a nested chain of quasi‐random classes, but the proof for showing the equivalence of l ‐discrepancy and l ‐deviation, for 2 ≤ l < k, contains an error. An additional parameter is needed in the definition of discrepancy, because of the rich and complex structure in hypergraphs. In this note, we introduce the notion of (l,s) ‐discrepancy for k ‐graphs and prove that the equivalence of the (k,s) ‐discrepancy and the s ‐deviation for 1 ≤ s ≤ k. We remark that this refined notion of discrepancy seems to point to a lattice structure in relating various quasi‐random classes for hypergraphs. © 2011 Wiley Periodicals, Inc. Random Struct. Alg., 2011     

Multiplicity results near the principal eigenvalue for boundary‐value problems with periodic nonlinearity

Let us consider the boundary‐value problem where g: ? → ? is a continuous and T ‐periodic function with zero mean value, not identically zero, (λ, a) ∈ ?² and ∈ C [0, π ] with ∫^π ₀ (x) sin x dx = 0. If λ ₁ denotes the first eigenvalue of the associated eigenvalue problem, we prove that if (λ, a) → (λ ₁, 0), then the number of solutions increases to infinity. The proof combines Liapunov–Schmidt reduction together with a careful analysis of the oscillatory behavior of the bifurcation equation. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Certain classes of potentials for p ‐Laplacian to be non‐degenerate

Given a positive integer n and an exponent 1 ≤ α ≤ ∞. We will find explicitly the optimal bound r_n such that if the L^α norm of a potential q (t ) satisfies ‖q ‖equation/tex2gif-inf-2.gif < r_n then the n ^th Dirichlet eigenvalue of the onedimensional p ‐Laplacian with the potential q (t ): (|u ′|^{p –2} u ′)′ + (λ + q (t )) |u |^{p –2}u = 0 (1 < p < ∞) will be positive. Using these bounds, we will construct, for the Dirichlet, the Neumann, the periodic or the antiperiodic boundary conditions, certain classes of potentials q (t ) so that the p ‐Laplacian with the potential q (t ) is non‐degenerate, which means that the above equation with λ = 0 has only the trivial solution verifying the corresponding boundary condition. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Categorical Abstract Algebraic Logic: Structurality,protoalgebraicity, and correspondence

The notion of an ? ‐matrix as a model of a given π ‐institution ? is introduced. The main difference from the approach followed so far in Categorical Abstract Algebraic Logic (CAAL) and the one adopted here is that an ? ‐matrix is considered modulo the entire class of morphisms from the underlying N ‐algebraic system of ? into its own underlying algebraic system, rather than modulo a single fixed (N,N ′)‐logical morphism. The motivation for introducing ? ‐matrices comes from a desire to formulate a correspondence property for N ‐protoalgebraic π ‐institutions closer in spirit to the one for sentential logics than that considered in CAAL before. As a result, in the previously established hierarchy of syntactically protoalgebraic π ‐institutions, i. e., those with an implication system, and of protoalgebraic π ‐institutions, i. e., those with a monotone Leibniz operator, the present paper interjects the class of those π ‐institutions with the correspondence property, as applied to ? ‐matrices. Moreover, this work on ? ‐matrices enables us to prove many results pertaining to the local deduction‐detachment theorems, paralleling classical results in Abstract Algebraic Logic formulated, first, by Czelakowski and Blok and Pigozzi. Those results will appear in a sequel to this paper. (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On the number of (r,r+1)‐ factors in an (r,r+1)‐factorization of a simple graph

For integers d≥0, s≥0, a (d, d+s)‐graph is a graph in which the degrees of all the vertices lie in the set {d, d+1, …, d+s}. For an integer r≥0, an (r, r+1)‐factor of a graph G is a spanning (r, r+1)‐subgraph of G. An (r, r+1)‐factorization of a graph G is the expression of G as the edge‐disjoint union of (r, r+1)‐factors. For integers r, s≥0, t≥1, let f(r, s, t) be the smallest integer such that, for each integer d≥f(r, s, t), each simple (d, d+s) ‐graph has an (r, r+1) ‐factorization with x (r, r+1) ‐factors for at least t different values of x. In this note we evaluate f(r, s, t). © 2009 Wiley Periodicals, Inc. J Graph Theory 60: 257‐268, 2009     

On some notions of convergence for n‐tuples of operators

The aim of this paper is to show that we can extend the notion of convergence in the norm‐resolvent sense to the case of several unbounded noncommuting operators (and to quaternionic operators as a particular case) using the notion of S‐resolvent operator. With this notion, we can define bounded functions of unbounded operators using the S‐functional calculus for n‐tuples of noncommuting operators. The same notion can be extended to the case of the F‐resolvent operator, which is the basis of the F‐functional calculus, a monogenic functional calculus for n‐tuples of commuting operators. We also prove some properties of the F‐functional calculus, which are of independent interest. Copyright © 2013 John Wiley & Sons, Ltd.     

Non Deterministic Classical Logic: The λμ++ ‐calculus

In this paper, we present an extension of λμ‐calculus called λμ⁺⁺‐calculus which has the following properties: subject reduction, strong normalization, unicity of the representation of data and thus confluence only on data types. This calculus allows also to program the parallel‐or.     

Titchmarsh–Weyl m ‐functions for second‐order Sturm–Liouville problems with two singular endpoints

In this paper we consider some cases of Sturm–Liouville problems with two singular endpoints at x = 0 and x = ∞ which have a simple spectrum, and show that the simplicity of the spectrum can be built into the definition of a Titchmarsh–Weyl m ‐function from which the eigenfunction expansion can be constructed. The use of initial conditions at a point interior to the interval (0,∞) is avoided in favor of Frobenius solutions near the regular singular point x = 0. In contrast to the classical theory associated with a regular left endpoint, the growth behaviour of the associated spectral functions can be on the order of λ^β for any β ∈ (0,∞). Application of the theory to the Bessel equation on (0,∞) and to the radial part of the separated hydrogen atom on (0,∞) is given. In the case of the hydrogen atom a single Titchmarsh–Weyl m ‐function is obtained which completely describes both the discrete negative spectrum and the continuous positive spectrum. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Fuzzy topology representation for MV‐algebras

Let M be an MV‐algebra and Ω_M be the set of all σ ‐valuations from M into the MV‐unit interval. This paper focuses on the characterization of MV‐algebras using σ ‐valuations of MV‐algebras and proves that a σ ‐complete MV‐algebra is σ ‐regular, which means that a ≤ b if and only if v (a) ≤ v (b) for any v ∈ Ω_M. Then one can introduce in a natural way a fuzzy topology δ on Ω_M. The representation theorem forMV‐algebras is established by means of fuzzy topology. Some properties of fuzzy topology δ and its cut topology U are investigated (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A relationship between λ‐symmetries and first integrals for ordinary differential equations

In this paper, we provide some geometric properties of λ‐symmetries of ordinary differential equations using vector fields and differential forms. According to the corresponding geometric representation of λ‐symmetries, we conclude that first integrals can also be derived if the equations do not possess enough symmetries. We also investigate the properties of λ‐symmetries in the sense of the deformed Lie derivative and differential operator. We show that λ‐symmetries have the exact analogous properties as standard symmetries if we take into consideration the deformed cases.     

A gap 1 cardinal transfer theorem

We extend the gap 1 cardinal transfer theorem (κ ⁺, κ ) → (λ ⁺, λ ) to any language of cardinality ≤λ, where λ is a regular cardinal. This transfer theorem has been proved by Chang under GCH for countable languages and by Silver in some cases for bigger languages (also under GCH). We assume the existence of a coarse (λ, 1)‐morass instead of GCH. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Hyper MV ‐ideals in hyper MV ‐algebras

In this paper we define the hyper operations ?, ∨ and ∧ on a hyper MV ‐algebra and we obtain some related results. After that by considering the notions ofhyper MV ‐ideals and weak hyper MV ‐ideals, we prove some theorems. Then we determine relationships between (weak) hyper MV ‐ideals in a hyper MV ‐algebra (M, ⊕, *, 0) and (weak) hyper K ‐ideals in a hyper K ‐algebra (M, °, 0). Finally we give a characterization of hyper MV ‐algebras of order 3 or 4 based on the (weak) hyper MV ‐ideals (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)