نتایج جستجو برای: hyper k

تعداد نتایج: 400077  

Journal: :Psychological Science 2010

Journal: :Journal of Instrumentation 2020

2002
YOUNG BAE WOOK HWAN SHIM W. H. SHIM

We consider the fuzzification of the notion of implicative hyper BCK-ideals, and then investigate several properties. Using the concept of level subsets, we give a characterization of a fuzzy implicative hyper BCK-ideal. We state a relation between a fuzzy hyper BCK-ideal and a fuzzy implicative hyper BCK-ideal. We establish a condition for a fuzzy hyper BCK-ideal to be a fuzzy implicative hype...

2009
Young Bae Jun Min Su Kang Hee Sik Kim

Bipolar-valued fuzzification of the notion of implicative hyper BCK-ideals is considered. Using the concepts of positive and negative lever sets, a characterization of a bipolar fuzzy implicative hyper BCK-ideal is provided. A relation between a bipolar fuzzy hyper BCK-ideal and a bipolar fuzzy implicative hyper BCK-ideal is established. A condition for a bipolar fuzzy hyper BCK-ideal to be a b...

2011
R. Ameri R. A. Borzooei

In this paper we introduce the concepts of hyper P -semisimple Ialgebra and Abelian hyper I-algebra and we state and prove some related results. The hyper p-semi simple I-algebras is a generalization of p-semisimple BCI-algebras and a subclass of hyper I-algebras. Specially we show that every Abelian hyper I-algebra is a hyper psemisimple I-algebra and a commutative canonical hypergroup. In fol...

2011
L. C. DE ANDRÉS M. FERNÁNDEZ S. IVANOV J. A. SANTISTEBAN L. UGARTE D. VASSILEV

We present a simple explicit construction of hyper-Kähler and hyper-symplectic (also known as neutral hyper-Kähler or hyper-parakähler) metrics in 4D using the Bianchi type groups of class A. The construction underlies a correspondence between hyper-Kähler and hyper-symplectic structures in dimension four.

‎Let G=(V(G),E(G)) be a simple connected graph with vertex set V(G) and edge‎ ‎set E(G)‎. ‎The (first) edge-hyper Wiener index of the graph G is defined as‎: ‎$$WW_{e}(G)=sum_{{f,g}subseteq E(G)}(d_{e}(f,g|G)+d_{e}^{2}(f,g|G))=frac{1}{2}sum_{fin E(G)}(d_{e}(f|G)+d^{2}_{e}(f|G)),$$‎ ‎where de(f,g|G) denotes the distance between the edges f=xy and g=uv in E(G) and de(f|G)=∑g€(G)de(f,g|G). ‎In thi...

2015
Zelealem Belaineh Yilma Tom Bohman Po-Shen Loh Asaf Shapira

In graph theory, as in many fields of mathematics, one is often interested in finding the maxima or minima of certain functions and identifying the points of optimality. We consider a variety of functions on graphs and hypegraphs and determine the structures that optimize them. A central problem in extremal (hyper)graph theory is that of finding the maximum number of edges in a (hyper)graph tha...

Journal: :Mathematische Zeitschrift 2022

We show that the Andr\'{e} motive of a hyper-K\"{a}hler variety $X$ over field $K \subset \mathbb{C}$ with $b_2(X)>6$ is governed by its component in degree $2$. More precisely, we prove if $X_1$ and $X_2$ are deformation equivalent varieties $b_2(X_i)>6$ there exists Hodge isometry $f\colon H^2(X_1,\mathbb{Q})\to H^2(X_2,\mathbb{Q})$, then Andr\'e motives isomorphic after finite extension $K$,...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید