نتایج جستجو برای: closedness degree

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

Journal: :Optimization 2021

In this paper, we first consider the class of minimal time functions in general setting locally convex topological vector (LCTV) spaces. The results obtained framework are based on a novel notion closedness target sets with respect to constant dynamics. Then, introduce and investigate new signed functions, which generalizations distance functions. Subdifferential formulas for under convexity as...

Journal: :Annali di Matematica Pura ed Applicata 2021

We study Blaschke-Santal\'o diagrams associated to the torsional rigidity and first eigenvalue of Laplacian with Dirichlet boundary conditions. work under convexity volume constraints, in both strong (volume exactly one) weak at most form. discuss some topological (closedness, simply connectedness) geometric (shape boundaries, slopes near point corresponding ball) properties these diagrams, als...

Journal: :Asian research journal of mathematics 2022

In this paper, we prove some common fixed point theorems for four weakly compatible self-maps along with (CLR) property in fuzzy 2- metric spaces. Our results are the improved version of proved by Shojaei et al. [1] 2013, since our does not require closedness ranges subsets X.

Journal: :Mathematica Scandinavica 2021

In this paper, we introduce techniques for producing normal square-free monomial ideals from old such ideals. These are then used to investigate the normality of cover under some graph operations. Square-free that come out as linear combinations two shown be not necessarily normal; a case integral closedness all powers these

Journal: :Hacettepe journal of mathematics and statistics 2022

Lattice-valued semiuniform convergence structures are important mathematical in the theory of lattice-valued topology. Choosing a complete residuated lattice $L$ as background, we introduce new type filters using tensor and implication operations on $L$, which is called $\top$-filters. By means $\top$-filters, propose concept $\top$-semiuniform counterpart structures. Different from usual discu...

Journal: :Mathematics 2021

In this work, we study iterative methods for the approximation of common attractive points two widely more generalized hybrid mappings in Hilbert spaces and obtain weak strong convergence theorems without assuming closedness domain. A numerical example supporting our main result is also presented. As a consequence, results can be applied to solving fixed point problem.

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

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

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"; } -->