An ideal-based cozero-divisor graph of a commutative ring

Let $R$ be a commutative ring and let $I$ be an ideal of $R$. In this article, we introduce the cozero-divisor graph $\acute{\Gamma}_I(R)$ of $R$ and explore some of its basic properties. This graph can be regarded as a dual notion of an ideal-based zero-divisor graph.

The Dual Notion of St-Polyform Modules

The concept of St-Polyform modules, was introduced and studied by Ahmed in [1], where a module M is called St-polyform, if for every submodule N of M and for any homomorphism 𝑓:N M; ker𝑓 is St-closed submodule in N. The novelty of this paper is to dualize this class of modules, the authors call it CSt-polyform modules, and according to this dualizations, some results which appeared in [1] are dualized for example we prove that in the class of hollow modules, every CSt-polyform module is coquasi-Dedekind. In addition, several important properties of CSt-polyform module are established, and other characterization of CSt-polyform is given. Moreover, many relationships of CSt-polyform modules with other related concepts are considered such as copolyform, epiform, CSt-semisimple, -nonsingular modules, and some others will be introduced such as non CSt-singular and G. coquasi-Dedekind modules.

Strong Differential Superordination Results Involving Extended Sălăgean and Ruscheweyh Operators

The notion of strong differential subordination was introduced in 1994 and the theory related to it was developed in 2009. The dual notion of strong differential superordination was also introduced in 2009. In a paper published in 2012, the notion of strong differential subordination was given a new approach by defining new classes of analytic functions on U×U¯ having as coefficients holomorphic functions in U¯. Using those new classes, extended Sălăgean and Ruscheweyh operators were introduced and a new extended operator was defined as Lαm:Anζ*→Anζ*,Lαmf(z,ζ)=(1−α)Rmf(z,ζ)+αSmf(z,ζ),z∈U,ζ∈U¯, where Rmf(z,ζ) is the extended Ruscheweyh derivative, Smf(z,ζ) is the extended Sălăgean operator and Anζ*={f∈H(U×U¯), f(z,ζ)=z+an+1ζzn+1+⋯,z∈U,ζ∈U¯}. This operator was previously studied using the new approach on strong differential subordinations. In the present paper, the operator is studied by applying means of strong differential superordination theory using the same new classes of analytic functions on U×U¯. Several strong differential superordinations concerning the operator Lαm are established and the best subordinant is given for each strong differential superordination.

A Uniform Abstraction Framework for Generalized Planning

Generalized planning aims at finding a general solution for a set of similar planning problems. Abstractions are widely used to solve such problems. However, the connections among these abstraction works remain vague. Thus, to facilitate a deep understanding and further exploration of abstraction approaches for generalized planning, it is important to develop a uniform abstraction framework for generalized planning. Recently, Banihashemi et al. proposed an agent abstraction framework based on the situation calculus. However, expressiveness of such an abstraction framework is limited. In this paper, by extending their abstraction framework, we propose a uniform abstraction framework for generalized planning. We formalize a generalized planning problem as a triple of a basic action theory, a trajectory constraint, and a goal. Then we define the concepts of sound abstractions of a generalized planning problem. We show that solutions to a generalized planning problem are nicely related to those of its sound abstractions. We also define and analyze the dual notion of complete abstractions. Finally, we review some important abstraction works for generalized planning and show that they can be formalized in our framework.

Relating Apartness and Bisimulation

A bisimulation for a coalgebra of a functor on the category of sets can be described via a coalgebra in the category of relations, of a lifted functor. A final coalgebra then gives rise to the coinduction principle, which states that two bisimilar elements are equal. For polynomial functors, this leads to well-known descriptions. In the present paper we look at the dual notion of "apartness". Intuitively, two elements are apart if there is a positive way to distinguish them. Phrased differently: two elements are apart if and only if they are not bisimilar. Since apartness is an inductive notion, described by a least fixed point, we can give a proof system, to derive that two elements are apart. This proof system has derivation rules and two elements are apart if and only if there is a finite derivation (using the rules) of this fact. We study apartness versus bisimulation in two separate ways. First, for weak forms of bisimulation on labelled transition systems, where silent (tau) steps are included, we define an apartness notion that corresponds to weak bisimulation and another apartness that corresponds to branching bisimulation. The rules for apartness can be used to show that two states of a labelled transition system are not branching bismilar. To support the apartness view on labelled transition systems, we cast a number of well-known properties of branching bisimulation in terms of branching apartness and prove them. Next, we also study the more general categorical situation and show that indeed, apartness is the dual of bisimilarity in a precise categorical sense: apartness is an initial algebra and gives rise to an induction principle. In this analogy, we include the powerset functor, which gives a semantics to non-deterministic choice in process-theory.

Aggregation of Indistinguishability Fuzzy Relations Revisited

Indistinguishability fuzzy relations were introduced with the aim of providing a fuzzy notion of equivalence relation. Many works have explored their relation to metrics, since they can be interpreted as a kind of measure of similarity and this is, in fact, a dual notion to dissimilarity. Moreover, the problem of how to construct new indistinguishability fuzzy relations by means of aggregation has been explored in the literature. In this paper, we provide new characterizations of those functions that allow us to merge a collection of indistinguishability fuzzy relations into a new one in terms of triangular triplets and, in addition, we explore the relationship between such functions and those that aggregate extended pseudo-metrics, which are the natural distances associated to indistinguishability fuzzy relations. Our new results extend some already known characterizations which involve only bounded pseudo-metrics. In addition, we provide a completely new description of those indistinguishability fuzzy relations that separate points, and we show that both differ a lot.

Onto extensions of free groups

An extension of subgroups $H\leqslant K\leqslant F_A$ of the free group of rank $|A|=r\geqslant 2$ is called onto when, for every ambient free basis $A'$, the Stallings graph $\Gamma_{A'}(K)$ is a quotient of $\Gamma_{A'}(H)$. Algebraic extensions are onto and the converse implication was conjectured by Miasnikov-Ventura-Weil, and resolved in the negative, first by Parzanchevski-Puder for rank $r=2$, and recently by Kolodner for general rank. In this note we study properties of this new type of extension among free groups (as well as the fully onto variant), and investigate their corresponding closure operators. Interestingly, the natural attempt for a dual notion -- into extensions -- becomes trivial, making a Takahasi type theorem not possible in this setting.

Applications of Inequalities in the Complex Plane Associated with Confluent Hypergeometric Function

The idea of inequality has been extended from the real plane to the complex plane through the notion of subordination introduced by Professors Miller and Mocanu in two papers published in 1978 and 1981. With this notion came a whole new theory called the theory of differential subordination or admissible functions theory. Later, in 2003, a particular form of inequality in the complex plane was also defined by them as dual notion for subordination, the notion of differential superordination and with it, the theory of differential superordination appeared. In this paper, the theory of differential superordination is applied to confluent hypergeometric function. Hypergeometric functions are intensely studied nowadays, the interest on the applications of those functions in complex analysis being renewed by their use in the proof of Bieberbach’s conjecture given by de Branges in 1985. Using the theory of differential superodination, best subordinants of certain differential superordinations involving confluent (Kummer) hypergeometric function are stated in the theorems and relation with previously obtained results are highlighted in corollaries using particular functions and in a sandwich-type theorem. An example is also enclosed in order to show how the theoretical findings can be applied.

Causal-Consistent Replay Reversible Semantics for Message Passing Concurrent Programs

Causal-consistent reversible debugging is an innovative technique for debugging concurrent systems. It allows one to go back in the execution focusing on the actions that most likely caused a visible misbehavior. When such an action is selected, the debugger undoes it, including all and only its consequences. This operation is called a causal-consistent rollback. In this way, the user can avoid being distracted by the actions of other, unrelated processes. In this work, we introduce its dual notion: causal-consistent replay. We allow the user to record an execution of a running program and, in contrast to traditional replay debuggers, to reproduce a visible misbehavior inside the debugger including all and only its causes. Furthermore, we present a unified framework that combines both causal-consistent replay and causal-consistent rollback. Although most of the ideas that we present are rather general, we focus on a popular functional and concurrent programming language based on message passing: Erlang.