• Title/Summary/Keyword: isomorphic

Search Result 236, Processing Time 0.024 seconds

FUNCTIONS ATTAINING THE SUPREMUM AND ISOMORPHIC PROPERTIES OF A BANACH SPACE

  • D. Acosta, Maria ;Becerra Guerrero, Julio ;Ruiz Galan, Manuel
    • Journal of the Korean Mathematical Society
    • /
    • v.41 no.1
    • /
    • pp.21-38
    • /
    • 2004
  • We prove that a Banach space that is convex-transitive and such that for some element u in the unit sphere, and for every subspace Μ containing u, it happens that the subset of norm attaining functionals on Μ is second Baire category in $M^{*}$ is, in fact, almost-transitive and superreflexive. We also obtain a characterization of finite-dimensional spaces in terms of functions that attain their supremum: a Banach space is finite-dimensional if, for every equivalent norm, every rank-one operator attains its numerical radius. Finally, we describe the subset of norm attaining functionals on a space isomorphic to $\ell$$_1$, where the norm is the restriction of a Luxembourg norm on $L_1$. In fact, the subset of norm attaining functionals for this norm coincides with the subset of norm attaining functionals for the usual norm.m.

LINEAR ISOMORPHIC EULER FRACTIONAL DIFFERENCE SEQUENCE SPACES AND THEIR TOEPLITZ DUALS

  • RAJ, KULDIP;AIYUB, M.;SAINI, KAVITA
    • Journal of applied mathematics & informatics
    • /
    • v.40 no.3_4
    • /
    • pp.657-668
    • /
    • 2022
  • In the present paper we introduce and study Euler sequence spaces of fractional difference and backward difference operators. We make an effort to prove that these spaces are BK-spaces and linearly isomorphic. Further, Schauder basis for Euler fractional difference sequence spaces $e^{\varsigma}_{0,p}({\Delta}^{(\tilde{\beta})},\;{\nabla}^m)$ and $e^{\varsigma}_{c,p}({\Delta}^{(\tilde{\beta})},\;{\nabla}^m)$ are also elaborate. In addition to this, we determine the 𝛼-, 𝛽- and 𝛾- duals of these spaces.

Minimization of Communication Cost using Repeated Task Partition for Hypercube Multiprocessors (하이퍼큐브 다중컴퓨터에서 반복 타스크 분할에 의한 통신 비용 최소화)

  • Kim, Joo-Man;Yoon, Suk-Han;Lee, Cheol-Hoon
    • The Transactions of the Korea Information Processing Society
    • /
    • v.5 no.11
    • /
    • pp.2823-2834
    • /
    • 1998
  • This paper deals with the problem of one-to-one mapping of $2^n$ task modules of a parallel program to an n-dimensional hypercube multicomputer so as to minimize to total communication cost during the execution of the task. The problem of finding an optimal mapping has been proven to be NP-complete. We first propose a graph modification technique which transfers the mapping problem in a hypercube multicomputer into the problem of finding a set of maximum cutsets on a given task graph. Using the graph modification technique, we then propose a repeated mapping scheme which efficiently finds a one-to-one mapping of task modules to a hypercube multicomputer by repeatedly applying an existing bipartitioning algorithm on the modified graph. The repeated mapping scheme is shown to be highly effective on a number of test task graphs, it increasingly outperforms the greedy and recursive mapping algorithms as the number of processors increase. The proposed algorithm is shown to be very effective for regular graph, such as hypercube-isomorphic or 'almost' isomorphic graphs and meshes; it finds optimal mapping on almost all the regular task graphs considered.

  • PDF

TENSOR PRODUCTS OF C*-ALGEBRAS WITH FIBRES GENERALIZED NONCOMMUTATIVE TORI AND CUNTZ ALGEBRAS

  • Boo, Deok-Hoon;Park, Chun-Gil
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.13 no.1
    • /
    • pp.139-144
    • /
    • 2000
  • The generalized noncommutative torus $T_{\rho}^d$ of rank m was defined in [2]. Assume that for the completely irrational noncommutative subtorus $A_{\rho}$ of rank m of $T_{\rho}^d$ there is no integer q > 1 such that $tr(K_0(A_{\rho}))=\frac{1}{q}{\cdot}tr(K_0(A_{\rho^{\prime}}))$ for $A_{\rho^{\prime}}$ a completely irrational noncommutative torus of rank m. All $C^*$-algebras ${\Gamma}({\eta})$ of sections of locally trivial $C^*$-algebra bundles ${\eta}$ over $M=\prod_{i=1}^{e}S^{2k_i}{\times}\prod_{i=1}^{s}S^{2n_i+1}$, $\prod_{i=1}^{s}\mathbb{PR}_{2n_i}$, or $\prod_{i=1}^{s}L_{k_i}(n_i)$ with fibres $T_{\rho}^d{\otimes}M_c(\mathbb{C})$ were constructed in [6, 7, 8]. We prove that ${\Gamma}({\eta}){\otimes}M_{p^{\infty}}$ is isomorphic to $C(M){\otimes}A_{\rho}{\otimes}M_{cd}(\mathbb{C}){\otimes}M_{p^{\infty}}$ if and only if the set of prime factors of cd is a subset of the set of prime factors of p, that $\mathcal{O}_{2u}{\otimes}{\Gamma}({\eta})$ is isomorphic to $\mathcal{O}_{2u}{\otimes}C(M){\otimes}A_{\rho}{\otimes}M_{cd}(\mathbb{C})$ if and only if cd and 2u - 1 are relatively prime, and that $\mathcal{O}_{\infty}{\otimes}{\Gamma}({\eta})$ is not isomorphic to $\mathcal{O}_{\infty}{\otimes}C(M){\otimes}A_{\rho}{\otimes}M_{cd}(\mathbb{C})$ if cd > 1 when no non-trivial matrix algebra can be ${\Gamma}({\eta})$.

  • PDF

SUBTOURNAMENTS ISOMORPHIC TO W5 OF AN INDECOMPOSABLE TOURNAMENT

  • Belkhechine, Houmem;Boudabbous, Imed;Hzami, Kaouthar
    • Journal of the Korean Mathematical Society
    • /
    • v.49 no.6
    • /
    • pp.1259-1271
    • /
    • 2012
  • We consider a tournament T = (V,A). For each subset X of V is associated the subtournament T(X) = (X,$A{\cap}(X{\times}X)$) of T induced by X. We say that a tournament T' embeds into a tournament T when T' is isomorphic to a subtournament of T. Otherwise, we say that T omits T'. A subset X of V is a clan of T provided that for a, $b{\in}X$ and $x{\in}V{\backslash}X$, $(a,x){\in}A$ if and only if $(b,x){\in}A$. For example, ${\emptyset}$, $\{x\}(x{\in}V)$ and V are clans of T, called trivial clans. A tournament is indecomposable if all its clans are trivial. In 2003, B. J. Latka characterized the class ${\tau}$ of indecomposable tournaments omitting a certain tournament $W_5$ on 5 vertices. In the case of an indecomposable tournament T, we will study the set $W_5$(T) of vertices $x{\in}V$ for which there exists a subset X of V such that $x{\in}X$ and T(X) is isomorphic to $W_5$. We prove the following: for any indecomposable tournament T, if $T{\notin}{\tau}$, then ${\mid}W_5(T){\mid}{\geq}{\mid}V{\mid}$ -2 and ${\mid}W_5(T){\mid}{\geq}{\mid}V{\mid}$ -1 if ${\mid}V{\mid}$ is even. By giving examples, we also verify that this statement is optimal.

Analysis of abduction and thinking strategies by type of mathematical problem posing (수학 문제 만들기 유형에 따른 가추 유형과 가추에 동원된 사고 전략 분석)

  • Lee, Myoung Hwa;Kim, Sun Hee
    • The Mathematical Education
    • /
    • v.59 no.1
    • /
    • pp.81-99
    • /
    • 2020
  • This study examined the types of abduction and the thinking strategies by the mathematics problems posed by students. Four students who were 2nd graders in middle school participated in problem posing on four tasks that were given, and the problems that they posed were classified into equivalence problem, isomorphic problem, and similar problem. The type of abduction appeared were different depending on the type of problems that students posed. In case of equivalence problem, the given condition of the problems was recognized as object for posing problems and it was the manipulative abduction. In isomorphic problem and similar problem, manipulative abduction, theoretical abduction, and creative abduction were all manifested, and creative abduction was manifested more in similar problem than in isomorphic problem. Thinking strategies employed at abduction were examined in order to find out what rules were presumed by students across problem posing activity. Seven types of thinking strategies were identified as having been used on rule inference by manipulative selective abduction. Three types of knowledge were used on rule inference by theoretical selective abduction. Three types of thinking strategies were used on rule inference by creative abduction.