Wikipedia:Reference desk/Archives/Mathematics/2012 April 8

From Wikipedia, the free encyclopedia
Jump to: navigation, search
Mathematics desk
< April 7 << Mar | April | May >> April 9 >
Welcome to the Wikipedia Mathematics Reference Desk Archives
The page you are currently viewing is an archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages.


April 8[edit]

Polynomials modulo p[edit]

Given p, a prime, I am concerned with finding the roots of a polynomial f(x) mod p. Can anyone suggest where I might find information regarding algorithms I might use to investigate this? Thanks. meromorphic [talk to me] 10:45, 8 April 2012 (UTC)

See our articles on factorization of polynomials over a finite field and irreducibility tests, Berlekamp's algorithm, and Cantor–Zassenhaus algorithm. Gandalf61 (talk) 09:18, 9 April 2012 (UTC)

"Free" Nonassociative ring?[edit]

I'm certain I'm reinventing the wheel here (albeit with perhaps a somewhat distasteful choice of terminology and notation, since aesthetics has never been my strong suit), so my prompt is simply: please point me to the right literature to find out more about this.

Let be a Nonassociative ring, in which we recall that multiplication is not required to be invertible, have an identity, be commutative, or even (hence the name) be associative. For the most basic instance of this construction, we could take . Let be a set of symbols, chosen to be disjoint from . We may define the set of all "monomials" recursively as follows:

  • If , then the 1-tuple is a monomial. If , then .
  • If and at least one of the two is not equal to for some , then the 2-tuple .

This definition is carefully constructed to avoid any accidental collision of elements, as long as a 1-tuple cannot be interpretted as a 2-tuple and vice-versa. A monomial is built to encode the tree of a fully parenthesized multiplicative expression in elements of and , with the caveat that adjacent multiplied elements of be collapsed into a single element of .

Define the ring as the set of all functions such that for all but finitely many . We think of this intuitively as . Addition is pointwise, and multiplication is fun to define (actually, it almost ends up being easier to define than it usually is, as a consequence of the fact that it's usually possible to extract the original factors from a product of two monomials, but that's a bit of a tangent). It trivially satisfies the requirement that it form a group under addition, since as an additive set, it is nothing more than a direct sum of with many copies of , and distributivity takes a bit more work, but it again follows as essentially a direct consequence of distributivity of multiplication over addition in .

Then satisfies a universal property: for any nonassociative ring with a map , and a function , there is a unique extension , with and for .

For nonassociative rings, the definition of a two-sided ideal needed to define a quotient ring is identical to that for a noncommutative ring (although the ideal generated by an element or subset of a nonassociative ring is a much worse monster). --COVIZAPIBETEFOKY (talk) 17:01, 8 April 2012 (UTC)

On Hypergeometric Functions[edit]

Given the integral formula for the hypergeometric function , I have to express the integral in terms of a combination of hypergeometric functions. I am keen to do as much of the legwork by myself as possible, so no answers or hints that would remove all challenge from the question please, but I have no clue how to express functions, however they may be represented, in terms of hypergeometric functions. Could someone please give me some help? Thanks. meromorphic [talk to me] 17:13, 8 April 2012 (UTC)

Hilbert's second problem[edit]

There is reference to : "Dawson (2006:sec. 2)" but no other identifying information. I would like to pursue reading his discussion; please help completing that reference; the citation itself & more on who Dawson is. Thank you. — Preceding unsigned comment added by 75.141.237.29 (talk) 18:20, 8 April 2012 (UTC)

The Hilbert's second problem article has Harvard-style citations, which means that you need to look down in the References section to see which Dawson is being referred to and what he wrote in 2006. One advantage of the Harvard style is that footnotes can then be used for notes rather than for citations. Hopefully this is enough information for you to find the Dawson ref; if not, please feel free to ask more. --Trovatore (talk) 19:18, 8 April 2012 (UTC)

yes, thank you. This is my first time using this forum - apologies for any format/procedure errors. But mainly, thank you for re-directing me to the references section again - it was inverted from the sequence I was used to; that's what caught me up (looking at the bottom of the list rather than the top. CeptualInstitute. — Preceding unsigned comment added by 75.141.237.29 (talk) 20:03, 8 April 2012 (UTC)

Showing an integral is well defined[edit]

Given where a>0, , 0<b<1, I am supposed to show that this integral is well defined. I'm not entirely sure what this process constitutes though. Is it essentially just showing that this integral exists and is finite? If so, how do you do this without directly evaluating it? Thanks. meromorphic [talk to me] 19:51, 8 April 2012 (UTC)

An improper integral is defined as a limit, so proving that the integral is well-defined means proving that the limit exists. You don't necessarily need to evaluate it to do that, although you'll probably need to get most of the way to evaluating it (if you know a particular term is finite you don't need to actually plug the numbers in and work it out, you can just move on to the next term). --Tango (talk) 21:46, 8 April 2012 (UTC)
Can't you use Cauchy's residue theorem and a suitable choice of contour? I get the integrand having poles at z = ±ia, while the residues are ∓eiab respectively. Alternatively, try multiplying the numerator and denominator of the first quotient by the denominator of the second and vice versa. I got a cosine and a hyperbolic sine when I tried. Fly by Night (talk) 02:29, 9 April 2012 (UTC)