نتایج جستجو برای: free rank

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

Journal: :international journal of group theory 0
francesco de giovanni dipartimento di matematica e applicazioni - university of napoli "federico ii" marco trombetti dipartimento di matematica e applicazooni - university of napoli "federico ii"

a result of dixon‎, ‎evans and smith shows that if $g$ is a locally (soluble-by-finite) group whose proper subgroups are (finite rank)-by-abelian‎, ‎then $g$ itself has this property‎, ‎i.e‎. ‎the commutator subgroup of $g$ has finite rank‎. ‎it is proved here that if $g$ is a locally (soluble-by-finite) group whose proper subgroups have minimax commutator subgroup‎, ‎then also the commutator s...

Journal: :iranian journal of mathematical chemistry 2014
a. sanami

let h be a finite dimensional complex hilbert space, b(h)+ be the set of all positive semi-definite operators on h and phi is a (not necessarily linear) unital map of b(h) + preserving the entropy-gibbs transformation. then there exists either a unitary or an anti-unitary operator u on h such that phi(a) = uau* for any b(h) +. thermodynamics, a branch of physics that is concerned with the study...

Purpose: This article is an attempt to determine the share of two types of readings (profession-oriented reading and free reading) which are performed in public libraries. It also tries to show the types of library divisions (circulation, membership, collection, area and library clients) which explain the mentioned reading types. Method: In the present research, which is an applied research w...

Journal: :Journal of Algebra 2014

1999
BENJAMIN STEINBERG

To each pseudovariety of abelian groups residually containing the integers, there is naturally associated a proonite topology on any nite rank free abelian group. We show in this paper that if the pseudovariety in question has a decidable membership problem, then one can eeectively compute membership in the closure of a subgroup and more generally, in the closure of a rational subset of such a ...

Journal: :Inf. Process. Lett. 2013
Arnaud Carayol Zoltán Ésik

We prove that the finite condensation rank (FC-rank) of the lexicographic ordering of a context-free language is strictly less than ω.

Journal: :Proceedings of the Edinburgh Mathematical Society 1998

2017
Edward Cheung Yuying Li

The Frank-Wolfe (FW) algorithm has been widely used in solving nuclear norm constrained problems, since it does not require projections. However, FW often yields high rank intermediate iterates, which can be very expensive in time and space costs for large problems. To address this issue, we propose a rank-drop method for nuclear norm constrained problems. The goal is to generate descent steps ...

Journal: :Hokkaido Mathematical Journal 2001

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

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