A new constraint qualification for the formula of the subdifferential of composed convex functions in infinite dimensional spaces

In this paper we work in separated locally convex spaces where we give equivalent statements for the formulae of the conjugate function of the sum of a convex lower‐semicontinuous function and the precomposition of another convex lower‐semicontinuous function which is also K ‐increasing with a K ‐convex K ‐epi‐closed function, where K is a nonempty closed convex cone. These statements prove to be the weakest constraint qualifications given so far under which the formulae for the subdifferential of the mentioned sum of functions are valid. Then we deliver constraint qualifications inspired from them that guarantee some conjugate duality assertions. Two interesting special cases taken from the literature conclude the paper. (© 2008 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)     

NZ‐flows in strong products of graphs

We prove that the strong product G₁? G₂ of G₁ and G₂ is ?₃‐flow contractible if and only if G₁? G₂ is not T? K₂, where T is a tree (we call T? K₂ a K₄‐tree). It follows that G₁? G₂ admits an NZ 3 ‐flow unless G₁? G₂ is a K₄ ‐tree. We also give a constructive proof that yields a polynomial algorithm whose output is an NZ 3‐flow if G₁? G₂ is not a K₄ ‐tree, and an NZ 4‐flow otherwise. © 2009 Wiley Periodicals, Inc. J Graph Theory 64: 267–276, 2010     

Hermite–Fejér interpolation operator and characterization of functions

In this paper we investigate the approximation behaviour of the so‐called Hermite–Fejér interpolation operator based on the zeros of Jacobi polynomials. As a result we obtain the asymptotic formula of approximation rate for these operators. Moreover, such a formula is valid for any individual continuous function. We will also study the K ‐functional deduced by this operator. Consequently the asymptotic term of this K ‐functional is established. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

The class of infinite dimensional neat reducts of quasi‐polyadic algebras is not axiomatizable

SC, CA, QA and QEA denote the classes of Pinter's substitution algebras, Tarski's cylindric algebras, Halmos' quasi‐polyadic algebras and quasi‐polyadic equality algebras, respectively. Let ω ≤ α < β and let K ∈ {SC,CA,QA,QEA}. We show that the class of α ‐dimensional neat reducts of algebras in K_β is not elementary. This solves a problem in [3]. Also our result generalizes results proved in [2] and [3]. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A new infinite class of S(3, {4, 5, 7}, v)

A t‐wise balanced design ( at BD) of order v and block sizes from K , denoted by S ( t , K , v ), is a pair ( X , ??), where X is a v ‐element set and ?? is a set of subsets of X , called blocks , with the property that | B |∈ K for any B ∈?? and every t ‐element subset of X is contained in a unique block. In this article, we shall show that there is an S ( 3 , { 4 , 5 , 7 }, v ) for any positive integer v ≡ 7 ( mod12 ) with v ≠ 19 . Copyright © 2011 Wiley Periodicals, Inc. J Combin Designs 20:68–80, 2012     

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)     

Holomorphic liftings and Bergman kernel estimates for 𝒟ℱ𝒩‐domains

Let E be a 𝒟ℱ𝒩‐space and let U ⊂ E be open. By applying the nuclearity of the Fréchet space ℋ︁(U) of holomorphic functions on U we show that there are finite measures μ on U leading to Bergman spaces of μ ‐square integrable holomorphic functions. We give an explicit construction for μ by using infinite dimensional Gaussian measures. Moreover, we prove boundary estimates for the corresponding Bergman kernels K_μ on the diagonal and we give an application of our results to liftings of μ ‐square integrable Banach space valued holomorphic functions over U. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Polychromatic colorings of bounded degree plane graphs

A polychromatic k‐coloring of a plane graph G is an assignment of k colors to the vertices of G such that every face of G has all k colors on its boundary. For a given plane graph G, one seeks the maximum number k such that G admits a polychromatic k ‐coloring. In this paper, it is proven that every connected plane graph of order at least three, and maximum degree three, other than K₄ or a subdivision of K₄ on five vertices, admits a 3‐coloring in the regular sense (i.e., no monochromatic edges) that is also a polychromatic 3‐coloring. Our proof is constructive and implies a polynomial‐time algorithm. © 2009 Wiley Periodicals, Inc. J Graph Theory 60: 269‐283, 2009     

Minors in large almost‐5‐connected non‐planar graphs

It is shown that every sufficiently large almost‐5‐connected non‐planar graph contains a minor isomorphic to an arbitrarily large graph from one of six families of graphs. The graphs in these families are also almost‐5‐connected, by which we mean that they are 4‐connected and all 4‐separations contain a “small” side. As a corollary, every sufficiently large almost‐5‐connected non‐planar graph contains both a K_{3, 4}‐minor and a ‐minor. The connectivity condition cannot be reduced to 4‐connectivity, as there are known infinite families of 4‐connected non‐planar graphs that do not contain a K_{3, 4}‐minor. Similarly, there are known infinite families of 4‐connected non‐planar graphs that do not contain a ‐minor.     

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     

On weights of induced paths and cycles in claw‐free and K1,r‐free graphs

Let G be a K_1,r ‐free graph (r ≥ 3) on n vertices. We prove that, for any induced path or induced cycle on k vertices in G (k ≥ 2r − 1 or k ≥ 2r, respectively), the degree sum of its vertices is at most (2r − 2)(n − α) where α is the independence number of G. As a corollary we obtain an upper bound on the length of a longest induced path and a longest induced cycle in a K_1,r ‐free graph. Stronger bounds are given in the special case of claw‐free graphs (i.e., r = 3). Sharpness examples are also presented. © 2001 John Wiley & Sons, Inc. J Graph Theory 36: 131–143, 2001     

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)     

Compact operators which factor through subspaces of lp

Let 1 ≤ p ≤ ∞. A subset K of a Banach space X is said to be relatively p ‐compact if there is an 〈x_n 〉 ∈ l^s _p (X) such that for every k ∈ K there is an 〈α_n 〉 ∈ l_{p ′} such that k = σ^∞_n=1 α_n x_n . A linear operator T: X → Y is said to be p ‐compact if T (Ball (X)) is relatively p ‐compact in Y. The set of all p ‐compact operators K_p (X, Y) from X to Y is a Banach space with a suitable factorization norm κ_p and (K_p , κ_p ) is a Banach operator ideal. In this paper we investigate the dual operator ideal (K^d _p , κ^d _p ). It is shown that κ^d _p (T) = π_p (T) for all T ∈ B (X, Y) if either X or Y is finite‐dimensional. As a consequence it is proved that the adjoint ideal of K^d _p is I_{p ′}, the ideal of p ′‐integral operators. Further, a composition/decomposition theorem K^d _p = Π_p K is proved which also yields that (Π^min _p )^inj = K^d _p . Finally, we discuss the density of finite rank operators in K^d _p and give some examples for different values of p in this respect. (© 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)     

On pseudolinearity and generic pairs

We continue the study of the connection between the “geometric” properties of SU ‐rank 1 structures and the properties of “generic” pairs of such structures, started in [8]. In particular, we show that the SU‐rank of the (complete) theory of generic pairs of models of an SU ‐rank 1 theory T can only take values 1 (if and only if T is trivial), 2 (if and only if T is linear) or ω, generalizing the corresponding results for a strongly minimal T in [3]. We also use pairs to derive the implication from pseudolinearity to linearity for ω ‐categorical SU ‐rank 1 structures, established in [7], from the conjecture that an ω ‐categorical supersimple theory has finite SU ‐rank, and find a condition on generic pairs, equivalent to pseudolinearity in the general case (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Categorical abstract algebraic logic: Gentzen π ‐institutions and the deduction‐detachment property

Given a π ‐institution I , a hierarchy of π ‐institutions I ^{(n )} is constructed, for n ≥ 1. We call I ^{(n )} the n‐th order counterpart of I . The second‐order counterpart of a deductive π ‐institution is a Gentzen π ‐institution, i.e. a π ‐institution associated with a structural Gentzen system in a canonical way. So, by analogy, the second order counterpart I ⁽²⁾ of I is also called the “Gentzenization” of I . In the main result of the paper, it is shown that I is strongly Gentzen , i.e. it is deductively equivalent to its Gentzenization via a special deductive equivalence, if and only if it has the deduction‐detachment property . (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Positive Frege and its Scott‐style semantics

We show that the untyped λ ‐calculus can be extended with Frege's interpretation of propositional notions, provided we restrict β ‐conversion to positive expressions. The system of illative λ ‐calculus so obtained admits a natural Scott‐style semantics. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Increasing η ‐representable degrees

In this paper we prove that any Δ₃⁰ degree has an increasing η ‐representation. Therefore, there is an increasing η ‐representable set without a strong η ‐representation (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

M ‐elliptic pseudo‐differential operators on L p (ℝn )

We construct the minimal and maximal extensions in L ^p (?ⁿ ), 1 < p < ∞, for M ‐elliptic pseudo‐differential operators initiated by Garello and Morando. We prove that they are equal and determine the domains of the minimal, and hence maximal, extensions of M ‐elliptic pseudo‐differential operators. For M ‐elliptic pseudodifferential operators with constant coefficients, the spectra and essential spectra are computed. An application to quantization is given. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)