Recent content by simba31415

  1. S

    Probability problem: upper bounds on binomial CDF

    No thoughts anyone? Sorry to bump but I could really use some help with this, any thoughts at all please respond!
  2. S

    Probability problem: upper bounds on binomial CDF

    Homework Statement Hi all, just a quick question here - the setup is as follows: X is a random variable, X \sim \operatorname{Bin}(m,p) where p=2^{-\sqrt{\log n}}(\log n)^2 and m \geq 2^{\sqrt{\log n}}c for constants c, n (n "large" here). I wish to show that \mathbb{P}(X < c) \leq e^{-(\log...
  3. S

    Quick help finishing off a proof: extension of p-adic fields

    Hi morphism, sorry it took me so long to reply - I didn't see anyone had responded to me. I've been having a think, but I can't think of any obvious inequalities which we can deduce for e_1: presumably we want e_1 \geq something for this. I know all the ramification indices for any prime...
  4. S

    Quick help finishing off a proof: extension of p-adic fields

    Homework Statement Let L_1/K,\,L_2/K be extensions of p-adic fields, at least one of which is Galois, with ramification indices e_1,\,e_2 . Suppose that (e_1,\,e_2) = 1 . Show that L_1 L_2/K has ramification index e_1 e_2. Homework Equations I have most of the proof done: I'm trying to show...
  5. S

    Bipartite graphs and isolated vertices

    Aaanyone? If not, I guess the mods should feel free to close this thread!
  6. S

    Bipartite graphs and isolated vertices

    Just thought i'd check again, nobody has any thoughts on this perhaps? :)
  7. S

    Bipartite graphs and isolated vertices

    Homework Statement Hello everyone, I am trying to determine the the threshold function p=p(n) for a random bipartite graph (see http://en.wikipedia.org/wiki/Erd%C5%91s%E2%80%93R%C3%A9nyi_model for a 'random graph': I am interested in the same idea, but for random bipartite graphs), such that...
  8. S

    Algorithm for computing conjugacy classes in subgroups of the GL(n,F_p) efficiently

    Homework Statement As the title says, I'm trying to find an efficient algorithm in order to write a program for computing conjugacy classes in subgroups of the general linear group GL(n,\mathbb{F}_p) (n x n matrices over a finite field of p elements, p prime) efficiently. In particular, I am...
  9. S

    Cts functions on [0,1] tending ptwise to 0 - convergence be uniform on an interval?

    Homework Statement As in the question - Suppose that f_n:[0,1] -> Reals is a sequence of continuous functions tending pointwise to 0. Must there be an interval on which f_n -> 0 uniformly? I have considered using the Weierstrass approximation theorem here, which states that we can find...
  10. S

    Efficient way to calculate a power of one polynomial mod another polynomial in GF(p)

    Please could the mods delete this thread? I believe I found a way myself, so I'd appreciate it if they could get rid of this :)
  11. S

    Efficient way to calculate a power of one polynomial mod another polynomial in GF(p)

    Incidentally, if anyone can point me in the right direction for this then I'd be very happy to read up on it myself, I don't need the whole concept explained to me if you can just nudge me in the right area :)
  12. S

    Efficient way to calculate a power of one polynomial mod another polynomial in GF(p)

    Hi all, I've been set some holiday work by my study director which is meant to be teaching us all about algorithms and a few other mathematical bits and bobs - unfortunately I've come unstuck on one of the bobs, and was hoping for some help! I've asked for help elsewhere but was given very...
Top