1 Dirichlet’s theorem — set up Dirichlet’s famous theorem from 1837 asserts that if k is a positive integer and a is an integer coprime to k, then there are infinitely many primes p with p ≡ a (mod k). In this unit we will prove the stronger assertion that the sum of the reciprocals of the primes p ≡ a (mod k) is divergent. Important in the proof is the use of the orthogonality relations for th...

When collective decisions should be made democratically, which people form the relevant demos? Many theorists think this question is an embarrassment to democratic theory: (1) because any decision about who forms demos must democratically by right demos, itself constituted and so on ad infinitum; (2) neither concept of democracy, nor (3) our reasons for caring determine demos. Having distinguis...

Let S-Set be the category of $S$-sets, sets together with the actions of a semigroup $S$ on them. And, let S-Pos be the category of $S$-posets, posets together with the actions compatible with the orders on them. In this paper we show that the category S-Pos is a radical extension of S-Set; that is there is a radical on the category S-Pos, the order desolator radical, whose torsion-free class i...

in this paper, we have de ned and studied a generalized form of topological vectorspaces called s-topological vector spaces. s-topological vector spaces are de ned by using semi-open sets and semi-continuity in the sense of levine. along with other results, it is provedthat every s-topological vector space is generalized homogeneous space. every open subspaceof an s-topological vector space is ...

A set S of vertices in a graph G=(V,E) is a dominating set ofG if every vertex of V-S is adjacent to some vertex of S.For an integer k≥1, a set S of vertices is a k-step dominating set if any vertex of $G$ is at distance k from somevertex of S. In this paper, using membership values of vertices and edges in fuzzy graphs, we introduce the concepts of strength of strongestdominating set as well a...