Description:
Mathematical discussions and pursuits.
|
|
|
a simple iteration -> 1,39865929053...
|
| |
( only considering reals , imput and output ) A = 1,39865929053... f(0) = f(1) = x_0 f(n) = exp(f(n-1)) - exp(f(n-2)) ( f(2) is thus always = 0 ) for some x_0 the sequence f(n) seems to diverge to oo and for others it seems bounded. it seems that the sequence for 1 < x_0 < A is bounded. and for larger x_0 > A it diverges to oo.... more »
|
|
|
closure of a subspace of l-infinity (space of bounded sequences)
|
| |
Hello, Could someone verify that for the following statement, the proof given below it is correct: Statement: The subspace of l-infinity (space of bounded sequences with the sup norm) consisting of all scalar sequences converging to zero [let's call this subspace c0] is closed. Proof: For any point x in cl(c0) (the closure of c0) there exists a sequence... more »
|
|
|
Transitively Orientable Graphs
|
| |
I need necessary and sufficient conditions for a graph being transitively orientable and algorithm for finding such orientation. Thanks in advance, Narek Saribekyan
|
|
|
Cohomology and Poincare duality
|
| |
Hello, I am trying to understand Poincare duality at a concrete example. Consider X as the boundary of the embedded standard 2-simplex, i.e. X looks like this a / \ / \ v v b --- > c where the opposite edge of a,b,c gets the name A,B,C respectively.... more »
|
|
|
My bio
|
| |
In the thread "Every Chess Configuration", Johannes Bauer wrote (sarcastically) about my biography (and I quote): ...As was explained in the aforementioned thread, my bio was put up there as a response to the Wiki editors requesting it (after they somehow learned, God knows how, that I've worked on tetration).... more »
|
|
|
A set of approximations the central binomial coefficient
|
| |
An interesting type of approximation to the central binomial coefficient is of the form: C(2n, n) ~= 4^n / sqrt( Rm(n) ) Rm being a rational function of max. degree m+1 (m>0): Rm(n) = (pi n^(m+1) + sum(i=0,m) Pi n^i) / (n^m + sum(i=0,m-1) Qi n^i) and where the 2m+1 coefficients are defined by simply requiring exact... more »
|
|
|
solutions manual
|
| |
solutions manual I am a solutions manual collector, I offer solutions manual ebook services Note: all solutions manual in soft copy that mean in Adobe Acrobat Reader (PDF ) format. if you want any book not just solutions just contact with us。 to get the solution manual you want ，please send message to... more »
|
|
|
Book reference needed for self study
|
| |
Hello, Which book(s) will this ng recommend for self study in mathematics. I am looking for a book which gives me a solid foundation and insight in mathematics, starting from scratch. Thanks in advance.
|
|
|
Check Polynomial for Convexity
|
| |
Let f:R^n --> R be a polynomial of n variables and non-negative coefficients and K := { (x_1, ..., x_n) \in R^n ; x_1+...+x_n = s } for some fixed s > 0. Are there any good characterizations for f being convex on K? Any that would be efficiently testable? I could provide a few more structural information on f, if that would help.... more »
|
|
|
