We first introduce 20 weak forms of continuity, which are closely related to 5 known weak forms of continuity. Then we classify them into 9 groups and give 12 decompositions of continuity. 1. Introduction. Continuity is one of the most important concepts in mathematics. In order to find deep properties of continuity, many weak forms of continuity were introduced in the literature. For instance,...

In this work we define generalized weak structures which naturally generalize minimal structures, generalized topologies and weak structures recently proposed in the literature. Moreover, we study some properties of the interior, the closure and other concepts in this new context. Mathematics Subject Classification: Primary 54A05, Secondary 54D10

This paper considers a supply chain where a manufacturer sells its product through a retailer. In such a market, a potential entrant can make a substitute product by imitating the incumbent's product and then sells it to the common market with one of three alternative entry modes: (i) selling through the incumbent's retailer, (ii) selling through another independent retailer, or (iii) selling d...

avila and molina [1] introduced the notion of generalized weak structures which naturally generalize minimal structures, generalized topologies and weak structures and the structures α(g),π(g),σ(g) and β(g). this work is a further investigation of generalized weak structures due to avila and molina. further we introduce the structures ro(g) and rc(g) and study the properties of the structur...

in this note we introduce the notion of weak mccoy rings as a generalization of mccoy rings, and investigate their properties. also we show that, if is a semi-commutative ring, then is weak mccoy if and only if is weak mccoy.

The weak selection approximation of population genetics has made possible the analysis of social evolution under a considerable variety of biological scenarios. Despite its extensive usage, the accuracy of weak selection in predicting the emergence of altruism under limited dispersal when selection intensity increases remains unclear. Here, we derive the condition for the spread of an altruisti...

It is expensive to maintain strong data consistency during concurrent execution. However, weak consistency levels, which are considered harmful, have been widely applied in analytical jobs. Their success challenges our belief: data consistency, which is believed to be an essential to precise computing, does not always need to be preserved. In this paper, we tackle one of the core questions rela...

In this paper we revisit Wiener’s method (IEEE-IT 1990) of continued fraction (CF) to find new weaknesses in RSA. We consider RSA with N = pq, q < p < 2q, public encryption exponent e and private decryption exponent d. Our motivation is to find out when RSA is insecure given d is O(N), where we are mostly interested in the range 0.3 ≤ δ ≤ 0.5. Given ρ (1 ≤ ρ ≤ 2) is known to the attacker, we sh...

This complements the work of [2] on the construction of scales of minimal complexity on sets of reals in K(R). Theorem 0.1 was proved there under the stronger hypothesis that all sets definable over M are determined, although without the capturing hypothesis. (See [2, Theorem 4.14].) Unfortunately, this is more determinacy than would be available as an induction hypothesis in a core model induc...

Starting from a logic which speciies how to make deductions from a set of sentences (a ``at theory'), a way to generalise this to a partially ordered bag of sentences (a `structured theory') is given. The partial order is used to resolve connicts. If occurs below then is accepted only insofar as it does not connict with. We start with a language L, a set of interpretations M and a satisfaction ...