‎In 1970‎, ‎Menegazzo [Gruppi nei quali ogni sottogruppo e intersezione di sottogruppi massimali‎, ‎ Atti Accad‎. ‎Naz‎. ‎Lincei Rend‎. ‎Cl‎. ‎Sci‎. ‎Fis‎. ‎Mat‎. ‎Natur. 48 (1970)‎, ‎559--562.] gave a complete description of the structure of soluble $IM$-groups‎, ‎i.e.‎, ‎groups in which every subgroup can be obtained as intersection of maximal subgroups‎. ‎A group $G$ is said to have the $FM$...

In this paper we prove an analogue of Banach and Kannan fixed point theorems by generalizing the Lipschitz constat $k$, in generalized Lipschitz mapping on cone metric space over Banach algebra, which are answers for the open problems proposed by Sastry et al, [K. P. R. Sastry, G. A. Naidu, T. Bakeshie, Fixed point theorems in cone metric spaces with Banach algebra cones, Int. J. of Math. Sci. ...

and Applied Analysis 3 Generalized derivations first appeared in the context of operator algebras 7 . Later, these were introduced in the framework of pure algebra 8, 9 . Definition 1.1. LetA be an algebra and let X be anA-bimodule. A linear mapping d : A → X is called i derivation if d ab d a b ad b , for all a, b ∈ A; ii generalized derivation if there exists a derivation in the usual sense δ...

In this paper, we obtain the general solution and the generalized   Hyers-Ulam-Rassias stability in random normed spaces, in non-Archimedean spaces and also in $p$-Banach spaces and finally the stability via fixed point method for a functional equationbegin{align*}&D_f(x_{1},.., x_{m}):= sum^{m}_{k=2}(sum^{k}_{i_{1}=2}sum^{k+1}_{i_{2}=i_{1}+1}... sum^{m}_{i_{m-k+1}=i_{m-k}+1}) f(sum^{m}_{i=1, i...

Constraint satisfaction problems (CSPs) models many important intractable NP-hard problems such as propositional satisfiability problem (SAT). Algorithms with non-trivial upper bounds on running time for restricted SAT with bounded clause length k (k-SAT) can be classified into three styles: DPLL-like, PPSZ-like and Local Search, with local search algorithms having already been generalized to C...

This paper presents a generalized version of the conventional k-means clustering algorithm [Proceedings of 5th Berkeley Symposium on Mathematical Statistics and Probability, 1, University of California Press, Berkeley, 1967, p. 281]. Not only is this new one applicable to ellipse-shaped data clusters without dead-unit problem, but also performs correct clustering without pre-assigning the exact...

AbsrructAn ( n, k, d) linear code over F = GF( q) is said to be ntcrximunt dktunce separable (MDS) if d = n k + 1. It is shown that an (II, k, FI k + 1) generalized Reed-Solomon code such that 2 I k 5 n 1 ((I 1)/2] (k + 3 if q is even) can be extended by one digit while preserving the MDS property if and only if the resulting extended code is also a generalized Reed-Solomon code. It follows tha...

In this paper, we consider the usual and generalized order-k Fibonacci and Pell recurrences, thenwe define a new recurrence, which we call generalized order-k F–P sequence. Also we present a systematic investigation of the generalized order-k F–P sequence. We give the generalized Binet formula, some identities and an explicit formula for sums of the generalized order-k F–P sequence by matrix me...

A graph G is a chordal-k-generalized split graph if G is chordal and there is a clique Q in G such that every connected component in G[V \ Q] has at most k vertices. Thus, chordal-1-generalized split graphs are exactly the split graphs. We characterize chordal-k-generalized split graphs by forbidden induced subgraphs. Moreover, we characterize a very special case of chordal-2-generalized split ...