نتایج جستجو برای: rational canonical form

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

2009
R. F. GOLDIN

The main purpose of this article is to extend some of the ideas from Schubert calculus to the more general setting of Hamiltonian torus actions on compact symplectic manifolds with isolated fixed points. Given a generic component Ψ of the moment map, which is a Morse function, we define a canonical class αp in the equivariant cohomology of the manifold M for each fixed point p ∈ M. When they ex...

Journal: :IEEE Trans. Information Theory 1996
G. David Forney Rolf Johannesson Zhe-xian Wan

A full-rank IC x n matrix G ( D ) over the rational functions F ( D ) generates a rate R = k / n convolutional code C. G ( D ) is minimal if it can be realized with as few memory elements as any encoder for C, and G ( D ) is canonical if it has a minimal realization in controller canonical form. We show that G ( D ) is minimal if and only if for all rational input sequences p1 ( D ) , the span ...

2000
Reza Jafari Khosrow Sohraby

In this paper, we study Markov chains with innnite state block-structured transition matrix with repeated rows and rational structure. We provide an algorithmic approach to nd the stationary probability distribution based on the concepts of linear systems theory. These chains include well-known structured Markov chains such as canonical and non-canonical M/G/1 and G/M/1. We provide a truncation...

2016
LAURA DE MARCO

In this article, we prove the equivalence of dynamical stability, preperiodicity, and canonical height 0, for algebraic families of rational maps ft : P(C)→ P(C), parameterized by t in a quasi-projective complex variety. We use this to prove one implication in the if-and-only-if statement of [BD2, Conjecture 1.10] on unlikely intersections in the moduli space of rational maps; we present the co...

2015
András Mészáros Miklós Telek

Canonical forms of Markovian distributions and processes provide an efficient way of describing these structures by eliminating the redundancy of general representations. Canonical forms of order 2 stationary Markov arrival processes (MAPs) have already been established for both continuous and discrete time. In this paper we present canonical form of continuous time non-stationary MAPs of order...

2016
Massoud Malek

is the geometric multiplicity of λk which is also the number of Jordan blocks corresponding to λk . • The orders of the Jordan Blocks of λk must sum to the algebraic multiplicity of λk . • The number of Jordan blocks corresponding to an eigenvalue λk is its geometric multiplicity. • The matrix A is diagonalizable if and only if, for any eigenvalue λ of A , its geometric and algebraic multiplici...

2015
PATRICK BROSNAN

Definition 2.1. Suppose p1, . . . , pk are polynomials in F[x] which are not all 0. Set I = 〈p1, . . . , pk〉. Let d denote the monic generator of I. We call d the greatest common divisor of the pi and write d = gcd(p1, . . . , pk). If d = 1, we say that the polynomials p1, . . . , pk is relatively prime. Note that, by definition, there exists polynomials q1, . . . , qk ∈ F[x] such that d = p1q1...

1997
Andrew Kresch

We consider the operation of intersecting with a locally principal Cartier divisor (i.e., a Cartier divisor which is principal on some neighborhood of its support). We describe this operation explicitly on the level of cycles and rational equivalences and as a corollary obtain a formula for rational equivalence between intersections of two locally principal Cartier divisors. Such canonical rati...

2002

Let β1, . . . , βn be linearly independent vectors in a vector space. For all j with 0 ≤ j ≤ n and all vectors α1, . . . , αk, if β1, . . . , βn are in the span of β1, . . . , βj, α1, . . . , αk, then j + k ≥ n. The proof of the claim is by induction on k. For k = 0, the claim is obvious since β1, . . . , βn are linearly independent. Suppose the claim is true for k−1, and suppose that β1, . . ....

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

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

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