In this paper, we present a concept of nC- symmetric operator as follows: Let A be a bounded linear operator on separable complex Hilbert space , the operator A is said to be nC-symmetric if there exists a positive number n (n such that CAn = A*ⁿ C (An = C A*ⁿ C). We provide an example and study the basic properties of this class of operators. Finally, we attempt to describe the relation between nC-symmetric operator and some other operators such as Fredholm and self-adjoint operators.
Chemical compounds, characteristics, and molecular structures are inevitably connected. Topological indices are numerical values connected with chemical molecular graphs that contribute to understanding a chemical compounds physical qualities, chemical reactivity, and biological activity. In this study, we have obtained some topological properties of the first dominating David derived (DDD) networks and computed several K-Banhatti polynomials of the first type of DDD.
The objective of this work is to study the concept of a fuzzy -cone metric space And some related definitions in space. Also, we discuss some new results of fixed point theorems. Finally, we apply the theory of fixed point achieved in the research on an integral type.
The main purpose of this article is to study the soft LC-spaces as soft spaces in which every soft Lindelöf subset of is soft closed. Also, we study the weak forms of soft LC-spaces and we discussed their relationships with soft LC-spaces as well as among themselves.
Objective(s): To measure serum C-reactive protein (CRP) titer as a predictive diagnosis of acute hepatitis C virus (HCV)
infection.
Methodology: Two hundred and ten patients with acute HCV infection and 234 apparently healthy individuals as
control group were enrolled in this study in Baghdad medical city (Teaching Laboratories). The patents include
74(35.2%) females and 136 (64.8%) males with mean age (27±16.5) years. The control group includes 114 (48.7%)
females and 120 (51.3%) males with mean age (26±5.8) years. Blood samples were collected from out patients from
Alfadul in Baghdad city. Sera were separated and stored at 20 0
C. The diagnosis of acute HCV infection was based on
detection of HC Ag and anti- H
In this work, we introduce a new convergence formula. We also define cluster point , δ-Cauchy sequence, δ-convergent, δ-completeness , and define sequentially contraction in approach space. In addition, we prove the contraction condition is necessary and sufficient to get the function is sequentially contraction as well as we put a new structure for the norm in the approach space which is called approach –Banach space, we discuss the normed approach space with uniform condition is a Hausdorff space. Also, we prove a normed approach space is complete if and only if the metric generated from approach space is complete as well as prove every finite –dimensional approach normed space is δ-complete. We prove several r
... Show MoreIn this work, we construct complete (K, n)-arcs in the projective plane over Galois field GF (11), where 12 2 ≤ ≤ n ,by using geometrical method (using the union of some maximum(k,2)- Arcs , we found (12,2)-arc, (19,3)-arc , (29,4)-arc, (38,5)-arc , (47,6)-arc, (58,7)-arc, (68,6)-arc, (81,9)-arc, (96,10)-arc, (109,11)-arc, (133,12)-arc, all of them are complete arc in PG(2, 11) over GF(11).
A (b,t)-blocking set B in PG(2,q) is set of b points such that every line of PG(2,q) intersects B in at least t points and there is a line intersecting B in exactly t points. In this paper we construct a minimal (b,t)-blocking sets, t = 1,2,3,4,5 in PG(2,5) by using conics to obtain complete arcs and projective codes related with them.
In this paper,we construct complete (kn,n)-arcs in the projective plane PG(2,11), n = 2,3,…,10,11 by geometric method, with the related blocking sets and projective codes.
A (k,n)-arc is a set of k points of PG(2,q) for some n, but not n + 1 of them, are collinear. A (k,n)-arc is complete if it is not contained in a (k + 1,n)-arc. In this paper we construct complete (kn,n)-arcs in PG(2,5), n = 2,3,4,5, by geometric method, with the related blocking sets and projective codes.
In this paper, the packing problem for complete ( 4)-arcs in is partially solved. The minimum and the maximum sizes of complete ( 4)-arcs in are obtained. The idea that has been used to do this classification is based on using the algorithm introduced in Section 3 in this paper. Also, this paper establishes the connection between the projective geometry in terms of a complete ( , 4)-arc in and the algebraic characteristics of a plane quartic curve over the field represented by the number of its rational points and inflexion points. In addition, some sizes of complete ( 6)-arcs in the projective plane of order thirteen are established, namely for = 53, 54, 55, 56.