mm-275 Followup-to: posterSubject: on line internshipCentral European Science Journals The publisher of electronic journals is looking for candidatesinterested inINTERNSHIP FOR STUDENTSREQUIREMENTS: Education: student of mathematics - effective knowledge of the internet environment- very good knowledge of English (work language)POSITION DESCRIPTION: - the internet research processes support - information research - data analysis WE OFFER: - on-line work - possibility of cooperation in developing international scienceproject- references letter Please note that we do not offer financial profits. If you are interested in our offer please send us your CV and coverletter both in English with the subject Internship - Mathematics at:rekrutacja@cesj.comSubject: integro-differential equationsDear all,in a modeling problem, I have arrived to an integro-differentialequation, which I write in (La)TeX as follows:partial_t f(x,t) = f(x,t) ( int x f(x,t) dx - x )where f(x,t) is a probability distribution. Now, I have been able toprove basically everything I need to, but since in the following Iwill have to deal with more complex equations of similar kind, I wouldlike to know whether there is a standard method for dealing with suchequations. In particular, I would like to solve initial-conditionproblems of the form f(x,0)=g(x).Directions for reading are welcome!Thanks,-- Stefano Subject: Unmapped territory?In the following, === represents the congruence symbol.Given the congruence b^n === m (mod x), where the values ofn, m and x are known (all positive naturals > 1), what isthe easiest (= best?) way of finding the first occurrence(if any) of b that satisfies the equation?Actually, any occurrence would do, although the first oneis deemed preferable.If this has been done before, I'd appreciate some pointers.BTW, someone mentioned A Course in Computational AlgebraicNumber Theory by Henri Cohen, Springer Verlag, pages 36-38as a possible recursive solution when x is a prime. Whatsay you, any improvements to this?TIA,DanielSubject: Re: Unmapped territory?Daniel Dudley> In the following, === represents the congruence symbol.> Given the congruence b^n === m (mod x), where the values of> n, m and x are known (all positive naturals > 1), what is> the easiest (= best?) way of finding the first occurrence> (if any) of b that satisfies the equation?> Actually, any occurrence would do, although the first one> is deemed preferable.....I'm no expert but I've heard that there is no known reasonably smartalgorithm even to find a mere quadratic nonresidue modulo a prime, i.e. analgo for the equationb^{(p-1)/2} === p-1 mod p.You might try this mailing list for pros:http://listserv.nodak.edu/archives/ nmbrthry.htmlLarrySubject: Re: Unmapped territory?Daniel Dudley> In the following, === represents the congruence symbol.> Given the congruence b^n === m (mod x), where the values of> n, m and x are known (all positive naturals > 1), what is> the easiest (= best?) way of finding the first occurrence> (if any) of b that satisfies the equation?> Actually, any occurrence would do, although the first one> is deemed preferable.> ....> I'm no expert but I've heard that there is no known reasonably> smart algorithm even to find a mere quadratic nonresidue> modulo a prime, i.e. an algo for the equation> b^{(p-1)/2} === p-1 mod p.I wouldn't know about the expert part, but clearly you aresmart enough to guess where I'm going with this. ;-)IMHO, a considerable amount of effort should be devoted tofinding a smart algorithm that resolves the equation, sincethis would probably provide (I suspect) an almost constanttime solution to the prime identification problem.> You might try this mailing list for pros:> http://listserv.nodak.edu/archives/nmbrthry.htmlI wasn't aware of this ML -- thanks for the tip, Larry.DanielSubject: Re: Question on category theoryEpigone-thread: feewermflilDear Tom,Thank you for your answer.> This is a special case of the notion of discrete fibration, or more > accurately, discrete opfibration.What is your mention about using term close in for this specialcase? I use some easy notions of the category theory for the PDEinvestigation (you can see some old results in [Prokhorova, M.Factorization of nonlinear heat equation posed on Riemann manifold //http://arxiv.org/abs/math.AP/0108001]). So I try to avoid unnecessary(for my aids) terms and notions of the category theory (most of PDEinvestigators don't familiar with this theory, and I am not expert init too :-)> I'm not sure what's meant by equivalent here,F:A->B is equivalent to F':A'->B' if that there exist isomorphisms ofK G:A'->A, H:B->B' such that GFH=F'. In my definition must be: there exist isomorphism of K H:B->B' suchthat FH=F'.> A decent reference for fibrations is Borceux's Handbook of > Categorical Algebra (Cambridge University Press) - volume 2, Ithink.Unfortunately our library don't has this books...> The name dense is probably not a great choice, as it already hasan > established meaning in category theoryOh, it is important information for me. Thank you!What do you think about term rich in? Or may be you have moreconvinient terms for my notion?Yours,Marinahttp://vpro.convex.ru/Marina/Subject: Re: Symmetric designs> I wanted too but the only copy our library has is on loan till 2015.> This seems excessive even for a university librarian.Ask a librarian. Perhaps the book can be called in for you.Subject: This week in the mathematics arXiv (18 Aug - 22 Aug)Here are this week's titles in the mathematics arXiv, available at: http://front.math.ucdavis.edu/ http://front.math.ucdavis.edu/submissionsThis week in the mathematics arXiv may be freely redistributedwith attribution and without modification.Titles in the mathematics arXiv (18 Aug - 22 Aug)-------------------------------------------------AG: Algebraic Geometry----------------------math.AG/0308205