From enhanced coinduction towards enhanced induction

There exist a rich and well-developed theory of enhancements of the coinduction proof method, widely used on behavioural relations such as bisimilarity. We study how to develop an analogous theory for inductive behaviour relations, i.e., relations defined from inductive observables. Similarly to the coinductive setting, our theory makes use of (semi)-progressions of the form R->F(R), where R is a relation on processes and F is a function on relations, meaning that there is an appropriate match on the transitions that the processes in R can perform in which the process derivatives are in F(R). For a given preorder, an enhancement corresponds to a sound function, i.e., one for which R->F(R) implies that R is contained in the preorder; and similarly for equivalences. We introduce weights on the observables of an inductive relation, and a weight-preserving condition on functions that guarantees soundness. We show that the class of functions contains non-trivial functions and enjoys closure properties with respect to desirable function constructors, so to be able to derive sophisticated sound functions (and hence sophisticated proof techniques) from simpler ones. We consider both strong semantics (in which all actions are treated equally) and weak semantics (in which one abstracts from internal transitions). We test our enhancements on a few non-trivial examples.

Good-for-games $\omega$-Pushdown Automata

We introduce good-for-games $\omega$-pushdown automata ($\omega$-GFG-PDA). These are automata whose nondeterminism can be resolved based on the input processed so far. Good-for-gameness enables automata to be composed with games, trees, and other automata, applications which otherwise require deterministic automata. Our main results are that $\omega$-GFG-PDA are more expressive than deterministic $\omega$- pushdown automata and that solving infinite games with winning conditions specified by $\omega$-GFG-PDA is EXPTIME-complete. Thus, we have identified a new class of $\omega$-contextfree winning conditions for which solving games is decidable. It follows that the universality problem for $\omega$-GFG-PDA is in EXPTIME as well. Moreover, we study closure properties of the class of languages recognized by $\omega$-GFG- PDA and decidability of good-for-gameness of $\omega$-pushdown automata and languages. Finally, we compare $\omega$-GFG-PDA to $\omega$-visibly PDA, study the resources necessary to resolve the nondeterminism in $\omega$-GFG-PDA, and prove that the parity index hierarchy for $\omega$-GFG-PDA is infinite.

Certain Properties of a Class of Functions Defined by Means of a Generalized Differential Operator

In this article, we construct a new subclass of analytic functions involving a generalized differential operator and investigate certain properties including the radius of starlikeness, closure properties and integral means result for the class of analytic functions with negative coefficients. Further, the relationship between the results and some known results in literature are also established.

On the Generalized Decreasing Mean Time to Failure or Replaced Ordering

In this paper, we establish two new stochastic orders, DMTFR (decreasing mean time to failure or replaced) and GDMTFR (generalized decreasing mean time to failure or replaced), and mainly investigate properties of the GDMTFR order. Some characterizations of the GDMTFR order are given. The implication relationships between the DMTFR and the GDMTFR orders are considered. Also, closure and reversed closure properties of the new order GDMTFR are investigated. Meanwhile, several illustrative examples that meet the GDMTFR order are shown as well.

On the Dynamic Cumulative Past Quantile Entropy Ordering

In many society and natural science fields, some stochastic orders have been established in the literature to compare the variability of two random variables. For a stochastic order, if an individual (or a unit) has some property, sometimes we need to infer that the population (or a system) also has the same property. Then, we say this order has closed property. Reversely, we say this order has reversed closure. This kind of symmetry or anti-symmetry is constructive to uncertainty management. In this paper, we obtain a quantile version of DCPE, termed as the dynamic cumulative past quantile entropy (DCPQE). On the basis of the DCPQE function, we introduce two new nonparametric classes of life distributions and a new stochastic order, the dynamic cumulative past quantile entropy (DCPQE) order. Some characterization results of the new order are investigated, some closure and reversed closure properties of the DCPQE order are obtained. As applications of one of the main results, we also deal with the preservation of the DCPQE order in several stochastic models.

Further Results of the TTT Transform Ordering of Order n

To compare the variability of two random variables, we can use a partial order relation defined on a distribution class, which contains the anti-symmetry. Recently, Nair et al. studied the properties of total time on test (TTT) transforms of order n and examined their applications in reliability analysis. Based on the TTT transform functions of order n, they proposed a new stochastic order, the TTT transform ordering of order n (TTT-n), and discussed the implications of order TTT-n. The aim of the present study is to consider the closure and reversed closure of the TTT-n ordering. We examine some characterizations of the TTT-n ordering, and obtain the closure and reversed closure properties of this new stochastic order under several reliability operations. Preservation results of this order in several stochastic models are investigated. The closure and reversed closure properties of the TTT-n ordering for coherent systems with dependent and identically distributed components are also obtained.

Abelian p-groups with minimal full inertia

The class of abelian p-groups with minimal full inertia, that is, satisfying the property that fully inert subgroups are commensurable with fully invariant subgroups is investigated, as well as the class of groups not satisfying this property; it is known that both the class of direct sums of cyclic groups and that of torsion-complete groups are of the first type. It is proved that groups with “small" endomorphism ring do not satisfy the property and concrete examples of them are provided via Corner’s realization theorems. Closure properties with respect to direct sums of the two classes of groups are also studied. A topological condition of the socle and a structural condition of the Jacobson radical of the endomorphism ring of a p-group G, both of which are satisfied by direct sums of cyclic groups and by torsion-complete groups, are shown to be independent of the property of having minimal full inertia. The new examples of fully inert subgroups, which are proved not to be commensurable with fully invariant subgroups, are shown not to be uniformly fully inert.

A Class of k-Symmetric Harmonic Functions Involving a Certain q-Derivative Operator

In this paper, we introduce a new class of harmonic univalent functions with respect to k-symmetric points by using a newly-defined q-analog of the derivative operator for complex harmonic functions. For this harmonic univalent function class, we derive a sufficient condition, a representation theorem, and a distortion theorem. We also apply a generalized q-Bernardi–Libera–Livingston integral operator to examine the closure properties and coefficient bounds. Furthermore, we highlight some known consequences of our main results. In the concluding part of the article, we have finally reiterated the well-demonstrated fact that the results presented in this article can easily be rewritten as the so-called (p,q)-variations by making some straightforward simplifications, and it will be an inconsequential exercise, simply because the additional parameter p is obviously unnecessary.