in the present paper we define strongly δn -summable sequences which generalize a-summablesequences and prove such spaces to be complete paranormed spaces under certain conditions, sometopological results have also been discussed.

We study ideal languages generated by a single word. We provide an algorithm to construct a strongly connected synchronizing automaton for which such a language serves as the language of synchronizing words. Also we present a compact formula to calculate the syntactic complexity of this language.

An n-partite tournament is an orientation of a complete n-partite graph. An npartite tournament is a tournament, if it contains exactly one vertex in each partite set. Douglas, Proc. London Math. Soc. 21 (1970) 716-730, obtained a characterization of strongly connected tournaments with exactly one Hamilton cycle (i.e., n-cycle). For n ≥, we characterize strongly connected n-partite tournaments ...

We model a two-candidate electoral competition in which there is uncertainty about a policy-relevant state of the world. The candidates receive private signals about the true state, which are imperfectly correlated. We study whether the candidates are able to credibly communicate their information to voters through their choice of policy platforms. Our results show that the fact that private in...

The inverse Gröbner basis problem is to find the ideals that have a given monomial ideal as its initial ideal. We consider the problem of finding when the given monomial ideal is the initial ideal of a prime ideal. Kalkbrenner and Sturmfels (1995), in Theorem 1, prove that the radical of the initial ideal of a prime ideal is equi-dimensional and connected in codimension one or equivalently, the...

We consider directed strongly regular graphs de2ned in 1988 by Duval. All such graphs with n vertices, n6 20, having a vertex-transitive automorphism group, are determined with the aid of a computer. As a consequence, we prove the existence of directed strongly regular graphs for three feasible parameter sets listed by Duval. For one parameter set a computer-free proof of the nonexistence is pr...

In Euclidean geometry we find three types of special conics, which are distinguished with respect to the Euclidean similarity group: circles, parabolas, and equilateral hyperbolas. They have on one hand special elementary geometric properties (c.f. [7]) and on the other they are strongly connected to the “absolute elliptic involution” in the ideal line of the projectively enclosed Euclidean pla...

High rates of self-employment among ethnic minorities in England and Wales are investigated using a framework in which the self-employment decision is influenced by ethnic-specific attributes as well as sectoral earnings differentials. As expected, differences in an individual’s predicted earnings in paid and self-employment are strongly correlated with self-employment decisions. Individuals wi...

The action of PGL(2,2m) on the set of exterior lines to a nonsingular conic in PG(2,2m) affords an association scheme, which was shown to be pseudocyclic in [H.D.L. Hollmann, Association schemes, Master thesis, Eindhoven University of Technology, 1982]. It was further conjectured in [H.D.L. Hollmann, Association schemes, Master thesis, Eindhoven University of Technology, 1982] that the orbital ...

In this paper we consider discrete random walks on infinite graphs that are generated by copying and shifting one finite (strongly connected) graph into one direction and connecting successive copies always in the same way. With help of generating functions it is shown that there are only three types for the asymptotic behaviour of the random walk. It either converges to the stationary distribu...