نتایج جستجو برای: group factorization

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

2008
ANDREAS THOM

In this note we give an example of a group which is locally embeddable into finite groups (in particular it is initially subamenable, sofic and hence hyperlinear) but does not have Kirchberg’s factorization property. This group provides also an example of a sofic Kazhdan group which is not residually finite, answering a question from [ES05]. We also give an example of a group which is not initi...

Journal: :Journal of High Energy Physics 2021

We investigate the high energy behavior of SU(N) chiral Gross-Neveu model in 1 + dimensions. The is integrable and matrix elements several local operators (form factors) are known exactly. form factors show rapidity space clustering, which means factorization, if a group rapidities shifted to infinity. analyze this phenomenon for model. For factorization formulas presented explicitly.

Journal: :iranian journal of science and technology (sciences) 2010
h. mehrban

using qcd factorization for the hadronic matrix elements, we show that existing data, inparticular the branching ratios br ( b →j/ψk) and br ( b →j/ψπ), can be accounted for in this approach.we analyze the decay b j /k( ) within the framework of qcd factorization. the calculation of therelevant hard-scattering kernels for twist-2 and twist-3 is completed. we calculate this decay in a special...

2016
Alfred Geroldinger Wolfgang Schmid ALFRED GEROLDINGER

Let H be a Krull monoid with class group G and suppose that each class contains a prime divisor. Then every element a ∈ H has a factorization into irreducible elements, and the set L(a) of all possible factorization lengths for a is the set of lengths of a. We consider the system L(H) = {L(a) | a ∈ H} of all sets of lengths, and we characterize (in terms of the class group G) when L(H) is addit...

Journal: :Journal of Combinatorial Designs 2022

The existence of 1-factorizations an infinite complete equipartite graph K m [ n ] ${K}_{m}[n]$ (with $m$ parts size $n$ ) admitting a vertex-regular automorphism group G $G$ is known only when = 1 $n=1$ and countable (i.e., for graphs) and, in addition, finitely generated abelian order . In this paper, we show that 1-factorization under the exists if has subgroup H $H$ whose index Furthermore,...

Since it is well-known that the Vandermonde matrix is ill-conditioned, while the interpolation itself is not unstable in function space, this paper surveys the choices of other new bases. These bases are data-dependent and are categorized into discretely l2-orthonormal and continuously L2-orthonormal bases. The first one construct a unitary Gramian matrix in the space l2(X) while the late...

ژورنال: پژوهش های ریاضی 2021

Nonnegative Matrix Factorization is a new approach to reduce data dimensions. In this method, by applying the nonnegativity of the matrix data, the matrix is ​​decomposed into components that are more interrelated and divide the data into sections where the data in these sections have a specific relationship. In this paper, we use the nonnegative matrix factorization to decompose the user ratin...

Journal: :Ars Comb. 2016
Marius Tarnauceanu

This note deals with the computation of the factorization number F2(G) of a finite group G. By using the Möbius inversion formula, explicit expressions of F2(G) are obtained for two classes of finite abelian groups, improving the results of Factorization numbers of some finite groups, Glasgow Math. J. (2012). MSC (2010): Primary 20D40; Secondary 20D60.

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

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

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