Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 125 for “"Irreducibility"”.

  1. Irreducibility over the rationals.

    nps Repository record for Irreducibility over the rationals. (opens in a new tab)

  2. Irreducibility of Random Hilbert Schemes

    We prove that a random Hilbert scheme that parametrizes the closed subschemes with a fixed Hilbert polynomial in some projective space is irreducible and nonsingular with probability greater than $0.5$. To consider the set of nonempty Hilbert schemes as a probability space, we transform this set …

    queens Repository record for Irreducibility of Random Hilbert Schemes (opens in a new tab)

  3. Computation of Four Color Irreducibility

    Made available in DSpace on 2014-12-13T18:01:50Z (GMT). No. of bitstreams: 1 7624119.pdf: 3298163 bytes, checksum: 138fd9f740dfcae356daf62066e871db (MD5) Previous issue date: 1976

    uiuc Repository record for Computation of Four Color Irreducibility (opens in a new tab)

  4. The irreducibility of guilt in Dostoevsky

    Dostoevsky views guilt as a qualitative determination of the person. Guilt's referent is man's personality, his ontological status, and not simply external or conventional judgments. Both the judgment and the chastisement for guilt are internalized in conscience. Dostoevsky placed guilt within a …

    rice Repository record for The irreducibility of guilt in Dostoevsky (opens in a new tab)

  5. The irreducibility of certain sets of assumptions

    Thesis (M.A.)--University of Kansas, Mathematics, 1925.

    ku Repository record for The irreducibility of certain sets of assumptions (opens in a new tab)

  6. On the Irreducibility of the Cauchy-Mirimanoff Polynomials

    … to be irreducible over 100 years ago, the irreducibility of the Cauchy-Mirimanoff polynomials is still an open conjecture.</p> <p>This dissertation takes a new approach to the study of the Cauchy-Mirimanoff Polynomials. The reciprocal transform of a self-reciprocal polynomial is defined, …

    utk-theses Repository record for On the Irreducibility of the Cauchy-Mirimanoff Polynomials (opens in a new tab)

  7. Generalized Sierpiński Numbers and New Irreducibility Criteria on Legendre Polynomials

    … n. We then use this algorithm to deduce the irreducibility of P̅n(x) for all n ≤ 10^7. Using similar ideas, we produce several new irreducibility criteria for P̅n(x) that build on prior results. Most notably, in an extension of existing irreducibility criteria, we show, for a fixed odd prime …

    south-carolina Repository record for Generalized Sierpiński Numbers and New Irreducibility Criteria on Legendre Polynomials (opens in a new tab)

  8. Paintings and their irreducibility to explanation : myth and multiform aesthetic experience

    This Ph.D. consists of a written thesis developed alongside seventeen original oil paintings. The original purpose was to examine through thesis how creative painting practice and a reconsideration of myth in word and image would, or could, express my experience of post-war Bosnia in 1999. In light …

    dundee Repository record for Paintings and their irreducibility to explanation : myth and multiform aesthetic experience (opens in a new tab) Download PDF for Paintings and their irreducibility to explanation : myth and multiform aesthetic experience (opens in a new tab)

  9. Widely Digitally Stable Numbers and Irreducibility Criteria For Polynomials With Prime Values

    This dissertation considers three different topics. In the first part of the dissertation, we show for an integer b > 2 that if a polynomial f(x) with non-negative integer coefficients is such that f(b) is prime, then there are explicit bounds M1(b), M2(b), and M3(b) such that if the coefficients …

    south-carolina Repository record for Widely Digitally Stable Numbers and Irreducibility Criteria For Polynomials With Prime Values (opens in a new tab)

  10. Algebraic geometric methods for algorithms in satisfiability, irreducibility of varieties, and identity testing

    In this thesis we study three problems that lie in the intersection of abstract algebra and theoretical computer science. The first of these is the polynomial identity testing problem, which is the task of determining if an algebraic circuit computes the identically zero polynomial. We give the …

    waterloo Repository record for Algebraic geometric methods for algorithms in satisfiability, irreducibility of varieties, and identity testing (opens in a new tab)

  11. Widely Digitally Delicate Brier Primes and Irreducibility Results for Some Classes of Polynomials

    … that gcd(f(x), g(x)) = 1. A version of Hilbert’s Irreducibility Theorem in this setting implies that F(x) is irreducible for almost all M. In the case that deg f < deg g, recent results by M. Cavachi, M. Vajaitu, and A. Zaharescu [14] and by N.C. Bonciocat, Y. Bugeaud, M. Cipu, and M. Mignotte [9] …

    south-carolina Repository record for Widely Digitally Delicate Brier Primes and Irreducibility Results for Some Classes of Polynomials (opens in a new tab)

  12. Sharp Bounds Associated With An Irreducibility Theorem For Polynomials Having Non-Negative Coefficients

    Consider a polynomial f(x) having non-negative integer coefficients with f(b) prime for some integer b greater than or equal to 2. We will investigate the size of the coefficients of the polynomial and establish a largest such bound on the coefficients that would imply that f(x) is irreducible. A …

    south-carolina Repository record for Sharp Bounds Associated With An Irreducibility Theorem For Polynomials Having Non-Negative Coefficients (opens in a new tab)

  13. Topics in divisibility: pairwise coprimality, the GCD of shifted sets and polynomial irreducibility

    … of primality, common divisors and polynomial irreducibility. In this thesis we explore some modern results regarding these three concepts.

    unsw Repository record for Topics in divisibility: pairwise coprimality, the GCD of shifted sets and polynomial irreducibility (opens in a new tab)

  14. On a Conjecture on Covering Systems and an Irreducibility Question on Sparse 0,1-Polynomials

    In 1952, H. Davenport posed the problem of determining a condition on the minimum modulus $m_0$ in a finite distinct covering system that would imply that the sum of the reciprocals of the moduli in the covering system is bounded away from 1. In 1973, P.~Erd\H os and J.~Selfridge indicated that …

    south-carolina Repository record for On a Conjecture on Covering Systems and an Irreducibility Question on Sparse 0,1-Polynomials (opens in a new tab)

Page 1 of 7