نتایج جستجو برای: irreducibility
تعداد نتایج: 1316 فیلتر نتایج به سال:
Casson and Gordon gave the rectangle condition for strong irreducibility of Heegaard splittings [1]. We give a weak version of rectangle condition for irreducibility of Heegaard splittings. As an application, we give an example of an irreducible genus three Heegaard splitting of a 3-manifold which is not a minimal genus Heegaard splitting.
Hilbert ’ s irreducibility theorem , and integral points of bounded degree on curves par Aaron LEVIN
We study the problem of constructing and enumerating, for any integers m,n > 1, number fields of degree n whose ideal class groups have “large” m-rank. Our technique relies fundamentally on Hilbert’s irreducibility theorem and results on integral points of bounded degree on curves.
We describe an explicit version of Hilbert’s irreducibility theorem using a generalization of Gallagher’s larger sieve. We give applications to the Galois theory of random polynomials, and to the images of the adelic representation associated to elliptic curves varying in rational families.
In the study of Galois theory, after computing a few Galois groups of a given field, it is very natural to ask the question of whether or not every finite group can appear as a Galois group for that particular field. This question was first studied in depth by David Hilbert, and since then it has become known as the Inverse Galois Problem. It is usually posed as which groups appear as Galois ex...
In this paper, we study irreducibility of Kuramoto-Sivashinsky equation which is driven by an additive noise acting only on a finite number Fourier modes. order to obtain the irreducibility, first investigate approximate controllability finite-dimensional force, proof based Agrachev-Sarychev type geometric control approach. Next, continuity solving operator for deterministic equation. Finally, ...
We determine classes of degrees where testing irreducibility for univariate polynomials over finite fields can be done without any GCD computation. This work was partly funded by the INRIA Associate Team “Algorithms, Numbers, Computers” (http://www.loria.fr/~zimmerma/anc.html). Key-words: finite fields, irreducible polynomial, GCD ∗ ANU, Canberra, [email protected] Test d’irréductibilité de polynôme...
We extend the notions of irreducibility and periodicity of a stochastic matrix to a unital positive linear map © on a finite-dimensional C∗algebra A and discuss the non-commutative version of the Perron-Frobenius theorem. For a completely positive linear map © with ©(a) = ∑ l Ll ∗aLl, we give conditions on the Ll’s equivalent to irreducibility or periodicity of ©. As an example, positive linear...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید