نتایج جستجو برای: complemented subspace

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

Let $mathcal{A}$ be a Banach algebra with BAI and $E$ be an introverted subspace of $mathcal{A}^prime$. In this paper we study the quotient Arens regularity of $mathcal{A}$ with respect to $E$ and prove that the group algebra $L^1(G)$ for a locally compact group $G$, is quotient Arens regular with respect to certain introverted subspace $E$ of $L^infty(G)$. Some related result are given as well.

Journal: :Algebra Universalis 2021

Abstract We study the computational complexity of satisfiability problem and complement equivalence for complemented (orthocomplemented) modular lattices L classes thereof. Concerning a simple finite height, $$\mathcal {NP}$$ NP -hardness is shown both problems. Moreover, problems are to be polynomial-time eq...

2010
C. Mendes C. MENDES

An Ockham algebra L = (L,∧,∨, f, 0, 1) that satisfies the identity f2n+m = fm, n ∈ N and m ∈ N0, is called a Kn,m-algebra. Generalizing some results obtained in [2], J. Varlet and T. Blyth, in [3, Chapter 8], study congruences on K1,1-algebras. In particular, they describe the complement (when it exists) of a principal congruence and characterize these congruences that are complemented. In this...

1996
ANDERS KOCK

We prove how any (elementary) topos may be reconstructed from the data of two complemented subtoposes together with a pair of left exact “glueing functors”. This generalizes the classical glueing theorem for toposes, which deals with the special case of an open subtopos and its closed complement. Our glueing analysis applies in a particularly simple form to a locally closed subtopos and its com...

Journal: :Discrete Mathematics & Theoretical Computer Science 2002
Elias Dahlhaus Jens Gustedt Ross M. McConnell

A complementation operation on a vertex of a digraph changes all outgoing arcs into non-arcs, and outgoing non-arcs into arcs. This defines an equivalence relation where two digraphs are equivalent if one can be obtained from the other by a sequence of such operations. We show that given an adjacency-list representation of a digraph G, many fundamental graph algorithms can be carried out on any...

This article presents a new subspace-based technique for reducing the noise of signals in time-series. In the proposed approach, the signal is initially represented as a data matrix. Then using Singular Value Decomposition (SVD), noisy data matrix is divided into signal subspace and noise subspace. In this subspace division, each derivative of the singular values with respect to rank order is u...

1999
A. Arias H. P. Rosenthal

This work introduces the concept of an M-complete approximate identity (M-cai) for a given operator subspace X of an operator space Y. M-cai's generalize central approximate identities in ideals in C *-algebras, for it is proved that if X admits an M-cai in Y , then X is a complete M-ideal in Y. It is proved, using " special " M-cai's, that if J is a nuclear ideal in a C *-algebra A, then J is ...

Journal: :SIAM Journal on Matrix Analysis and Applications 2021

This article is concerned with the numerical solution of subspace optimization problems, consisting minimizing a smooth functional over set orthogonal projectors fixed rank. Such problems are encountered in particular electronic structure calculation (Hartree--Fock and Kohn--Sham density theory models). We compare from analysis perspective two simple representatives, damped self-consistent fiel...

2013
Spiros Argyros Gilles Godefroy

s: Plenary Speakers Spiros Argyros (National Technical University of Athens, Greece) sargyros@math.ntua.gr HI extensions of L∞ spaces and spaces with very few operators Tuesday, July 30, HA4, 9:00–9:50 We will present a general method of embedding Banach spaces with separable dual into L∞ spaces admitting very few operators. In particular we will discuss the following two results. Theorem 1. (i...

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

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

function paginate(evt) { url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term pg=parseInt(evt.target.text) var data={ "year":filter_year, "term":term, "pgn":pg } filtered_res=post_and_fetch(data,url) window.scrollTo(0,0); } function update_search_meta(search_meta) { meta_place=document.getElementById("search_meta_data") term=search_meta.term active_pgn=search_meta.pgn num_res=search_meta.num_res num_pages=search_meta.num_pages year=search_meta.year meta_place.dataset.term=term meta_place.dataset.page=active_pgn meta_place.dataset.num_res=num_res meta_place.dataset.num_pages=num_pages meta_place.dataset.year=year document.getElementById("num_result_place").innerHTML=num_res if (year !== "unfilter"){ document.getElementById("year_filter_label").style="display:inline;" document.getElementById("year_filter_place").innerHTML=year }else { document.getElementById("year_filter_label").style="display:none;" document.getElementById("year_filter_place").innerHTML="" } } function update_pagination() { search_meta_place=document.getElementById('search_meta_data') num_pages=search_meta_place.dataset.num_pages; active_pgn=parseInt(search_meta_place.dataset.page); document.getElementById("pgn-ul").innerHTML=""; pgn_html=""; for (i = 1; i <= num_pages; i++){ if (i===active_pgn){ actv="active" }else {actv=""} pgn_li="
  • " +i+ "
  • "; pgn_html+=pgn_li; } document.getElementById("pgn-ul").innerHTML=pgn_html var pgn_links = document.querySelectorAll('.mypgn'); pgn_links.forEach(function(pgn_link) { pgn_link.addEventListener('click', paginate) }) } function post_and_fetch(data,url) { showLoading() xhr = new XMLHttpRequest(); xhr.open('POST', url, true); xhr.setRequestHeader('Content-Type', 'application/json; charset=UTF-8'); xhr.onreadystatechange = function() { if (xhr.readyState === 4 && xhr.status === 200) { var resp = xhr.responseText; resp_json=JSON.parse(resp) resp_place = document.getElementById("search_result_div") resp_place.innerHTML = resp_json['results'] search_meta = resp_json['meta'] update_search_meta(search_meta) update_pagination() hideLoading() } }; xhr.send(JSON.stringify(data)); } function unfilter() { url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term var data={ "year":"unfilter", "term":term, "pgn":1 } filtered_res=post_and_fetch(data,url) } function deactivate_all_bars(){ var yrchart = document.querySelectorAll('.ct-bar'); yrchart.forEach(function(bar) { bar.dataset.active = false bar.style = "stroke:#71a3c5;" }) } year_chart.on("created", function() { var yrchart = document.querySelectorAll('.ct-bar'); yrchart.forEach(function(check) { check.addEventListener('click', checkIndex); }) }); function checkIndex(event) { var yrchart = document.querySelectorAll('.ct-bar'); var year_bar = event.target if (year_bar.dataset.active == "true") { unfilter_res = unfilter() year_bar.dataset.active = false year_bar.style = "stroke:#1d2b3699;" } else { deactivate_all_bars() year_bar.dataset.active = true year_bar.style = "stroke:#e56f6f;" filter_year = chart_data['labels'][Array.from(yrchart).indexOf(year_bar)] url=/search_year_filter/ var term=document.getElementById("search_meta_data").dataset.term var data={ "year":filter_year, "term":term, "pgn":1 } filtered_res=post_and_fetch(data,url) } } function showLoading() { document.getElementById("loading").style.display = "block"; setTimeout(hideLoading, 10000); // 10 seconds } function hideLoading() { document.getElementById("loading").style.display = "none"; } -->