Index sets for ω‐languages

An ω‐language is a set of infinite sequences (words) on a countable language, and corresponds to a set of real numbers in a natural way. Languages may be described by logical formulas in the arithmetical hierarchy and also may be described as the set of words accepted by some type of automata or Turing machine. Certain families of languages, such as the languages, may enumerated as P₀, P₁, … and then an index set associated to a given property R (such as finiteness) of languages is just the set of e such that P_e has the property. The complexity of index sets for 7 types of languages is determined for various properties related to the size of the language.     

Hierarchies in φ‐spaces and applications

We establish some results on the Borel and difference hierarchies in φ‐spaces. Such spaces are the topological counterpart of the algebraic directed‐complete partial orderings. E.g., we prove analogs of the Hausdorff Theorem relating the difference and Borel hierarchies and of the Lavrentyev Theorem on the non‐collapse of the difference hierarchy. Some of our results generalize results of A. Tang for the space Pω. We also sketch some older applications of these hierarchies and present a new application to the question of characterizing the ω‐ary Boolean operations generating a given level of the Wadge hierarchy from the open sets. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

ω-operations over partial enumerated sets

In the present paper we concentrate on fundamental problems concerning ω-operations over partial enumerated sets. The notion of “HOM-lifts” seems to be an adequate tool for this kind of investigations. MSC: 03D45, 18A30.     

Bernstein sets and κ ‐coverings

In this paper we study a notion of a κ ‐covering set in connection with Bernstein sets and other types of non‐measurability. Our results correspond to those obtained by Muthuvel in [7] and Nowik in [8]. We consider also other types of coverings (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On effective σ‐boundedness and σ‐compactness

We prove several dichotomy theorems which extend some known results on σ‐bounded and σ‐compact pointsets. In particular we show that, given a finite number of $\Delta ^{1}_{1}$ equivalence relations $\mathrel {\mathsf {F}}_1,\dots ,\mathrel {\mathsf {F}}_n$, any $\Sigma ^{1}_{1}$ set A of the Baire space either is covered by compact $\Delta ^{1}_{1}$ sets and lightface $\Delta ^{1}_{1}$ equivalence classes of the relations $\mathrel {\mathsf {F}}_i$, or A contains a superperfect subset which is pairwise $\mathrel {\mathsf {F}}_i$‐inequivalent for all i = 1, …, n. Further generalizations to $\Sigma ^{1}_{2}$ sets A are obtained.     

ω‐saturated quasi‐minimal models of Th(ℚω, +, σ, 0)

We show that (ℚ^ω, +, σ, 0) is a quasi-minimal torsion-free divisible abelian group. After discussing the axiomatization of the theory of this structure, we present its ω-saturated quasi-minimal model. (© 2005 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

ON THE ITERATED ω-RULE

Let Γ_n(φ) be a formula of L_PA (PA = Peano Arithmetic) meaning “there is a proof of φ from PA-axioms, in which ω-rule is iterated no more than n times”. We examine relations over pairs of natural numbers of the kind. (n, k) ≦_H (n', k') iff PA + RFN_n' (H_k') ? RFN_n (H_k). Where H denotes one of the hierarchies ∑ or Π and RFN_n(C) is the scheme of the reflection principle for Γ_n restricted to formulas from the class C(Γ_n(φ) implies “φ is true”, for every φ ∈ C). Our main result is that. (n, k) ≦H (n', k') if n ≦ n' and k ≦ max (k', 2n' + 1).     

ω‐categorical weakly o‐minimal expansions of Boolean lattices

We study ω‐categorical weakly o‐minimal expansions of Boolean lattices. We show that a structure ?? = (A,≤, ?) expanding a Boolean lattice (A,≤) by a finite sequence I of ideals of A closed under the usual Heyting algebra operations is weakly o‐minimal if and only if it is ω‐categorical, and hence if and only if A/I has only finitely many atoms for every I ∈ ?. We propose other related examples of weakly o‐minimal ω‐categorical models in this framework, and we examine the internal structure of these models.     

Two Remarks on Partitions of ω with Finite Blocks

We prove that all algebras P(w)/I_R, where the I_R-'s are ideals generated by partitions of W into finite and arbitrary large elements, are isomorphic and homogeneous. Moreover, we show that the smallest size of a tower of such partitions with respect to the eventually-refining preordering is equal to the smallest size of a tower on ω.     

S‐asymptotically ω‐periodic solutions for semilinear Volterra equations

We study S‐asymptotically ω‐periodic mild solutions of the semilinear Volterra equation u′(t)=(a* Au)(t)+f(t, u(t)), considered in a Banach space X, where A is the generator of an (exponentially) stable resolvent family. In particular, we extend the recent results for semilinear fractional integro‐differential equations considered in (Appl. Math. Lett. 2009; 22:865–870) and for semilinear Cauchy problems of first order given in (J. Math. Anal. Appl. 2008; 343(2): 1119–1130). Applications to integral equations arising in viscoelasticity theory are shown. Copyright © 2010 John Wiley & Sons, Ltd.     

On the Roots of σ‐Polynomials

Given a graph G of order n, the σ‐polynomial of G is the generating function where is the number of partitions of the vertex set of G into i nonempty independent sets. Such polynomials arise in a natural way from chromatic polynomials. Brenti (Trans Am Math Soc 332 (1992), 729–756) proved that σ‐polynomials of graphs with chromatic number at least had all real roots, and conjectured the same held for chromatic number . We affirm this conjecture.     

Characterization of g∞,σ‐integral operators

The application of the general tensor norms theory of Defant and Floret to the ideal of (p, σ)‐absolutely continuous operators of Matter, 0 < σ < 1, 1 ≤ p < ∞ leads to the study of g_p′,σ‐nuclear and g_p′,σ‐integral operators. Characterizations of such operators has been obtained previously in the case p > 1. In this paper we characterize the g_∞,σ‐nuclear and g_∞,σ‐integral operators by the existence of factorizations of some special kinds. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On the ω-problem for some types of non-metrizable spaces

The ω-problem on a topological space X consists in finding out whether there exists a function whose oscillation is equal to a given upper semi-continuous (USC) function f:X→[0,∞] vanishing at isolated points of X. If such F exists, we call it an ω-primitive for f. Unlike the case of metrizable spaces, an ω-primitive need not exist if X is not metrizable. We study the ω-problem for f taking the value ∞ in the case of ordinal space, products of regular “constancy” spaces and the wedge sums of such spaces. Some open problems are formulated.     

On approximating the nearest Ω‐stable matrix

In this paper, we consider the problem of approximating a given matrix with a matrix whose eigenvalues lie in some specific region Ω of the complex plane. More precisely, we consider three types of regions and their intersections: conic sectors, vertical strips, and disks. We refer to this problem as the nearest Ω‐stable matrix problem. This includes as special cases the stable matrices for continuous and discrete time linear time‐invariant systems. In order to achieve this goal, we parameterize this problem using dissipative Hamiltonian matrices and linear matrix inequalities. This leads to a reformulation of the problem with a convex feasible set. By applying a block coordinate descent method on this reformulation, we are able to compute solutions to the approximation problem, which is illustrated on some examples.     

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.     

χ‐bounded families of oriented graphs

A famous conjecture of Gyárfás and Sumner states for any tree T and integer k, if the chromatic number of a graph is large enough, either the graph contains a clique of size k or it contains T as an induced subgraph. We discuss some results and open problems about extensions of this conjecture to oriented graphs. We conjecture that for every oriented star S and integer k, if the chromatic number of a digraph is large enough, either the digraph contains a clique of size k or it contains S as an induced subgraph. As an evidence, we prove that for any oriented star S, every oriented graph with sufficiently large chromatic number contains either a transitive tournament of order 3 or S as an induced subdigraph. We then study for which sets of orientations of P₄ (the path on four vertices) similar statements hold. We establish some positive and negative results.     

A (T,ψ)‐ψe decoupled scheme for a time‐dependent multiply‐connected eddy current problem

The aim of this paper is to develop a fully discrete ( T ,ψ)‐ψ_e finite element decoupled scheme to solve time‐dependent eddy current problems with multiply‐connected conductors. By making ‘cuts’ and setting jumps of ψ_e across the cuts in nonconductive domain, the uniqueness of ψ_e is guaranteed. Distinguished from the traditional T ‐ ψ method, our decoupled scheme solves the potentials T and ψ‐ ψ_e separately in two different simple equation systems, which avoids solving a saddle‐point equation system and leads to a remarkable reduction in computational efforts. The energy‐norm error estimate of the fully discrete decoupled scheme is provided. Finally, the scheme is applied to solve two benchmark problems—TEAM Workshop Problems 7 and IEEJ model. Copyright © 2013 John Wiley & Sons, Ltd.     

Fixed points of (α,ψ)‐contractions in Hausdorff partial metric spaces

The concept of (α,ψ)‐contractions was introduced by Samet et al. in this paper, we introduce (α,ψ)‐generalized contractions in a Hausdorff partial metric space. We discuss its significance and obtain some common fixed point theorems for a pair of self‐mappings. Some examples are given to support the theory.     

On the Boolean algebras of definable sets in weakly o‐minimal theories

We consider the sets definable in the countable models of a weakly o‐minimal theory T of totally ordered structures. We investigate under which conditions their Boolean algebras are isomorphic (hence T is p‐ω‐categorical), in other words when each of these definable sets admits, if infinite, an infinite coinfinite definable subset. We show that this is true if and only if T has no infinite definable discrete (convex) subset. We examine the same problem among arbitrary theories of mere linear orders. Finally we prove that, within expansions of Boolean lattices, every weakly o‐minimal theory is p‐ω‐categorical. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Maximal σ‐polynomials of connected 3‐chromatic graphs

In the set of graphs of order n and chromatic number k the following partial order relation is defined. One says that a graph G is less than a graph H if c_i(G) ≤ c_i(H) holds for every i, k ≤ i ≤ n and at least one inequality is strict, where c_i(G) denotes the number of i‐color partitions of G. In this paper the first ? n/2 ? levels of the diagram of the partially ordered set of connected 3‐chromatic graphs of order n are described. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 210–222, 2003