Eikonal Blog

2013.08.06

Applied graph theory (“Social Networks Analysis”)

Filed under: complexity, mathematics, networking, science, small worlds — Tags: , , , , , , , — sandokan65 @ 15:11

Concepts

Graph theory:

  • nodes and edges
  • degree = number of edges for a given node
  • isolated nodes
  • connected nodes
  • hub = well connected node
  • Scale-free networks = average number of nodes stays constant
  • preferential attachment:
    • the fraction of nodes with k edges: p(k) \sim k^{-\gamma}
    • a long tail distribution
  • Degree of distribution

SNAs on YouTube

Six degrees of separation, Small Worlds, Kevin Bacon metric, Erdos metric, etc

Books

Authors and Sites

Papers

  • “Power laws, Pareto distributions and Zipf’s law” by M.E.J. Newman (arXiv) – http://arxiv.org/abs/cond-mat/0412004
    • When the probability of measuring a particular value of some quantity varies inversely as a power of that value, the quantity is said to follow a power law, also known variously as Zipf’s law or the Pareto distribution. Power laws appear widely in physics, biology, earth and planetary sciences, economics and finance, computer science, demography and the social sciences. For instance, the distributions of the sizes of cities, earthquakes, solar flares, moon craters, wars and people’s personal fortunes all appear to follow power laws. The origin of power-law behaviour has been a topic of debate in the scientific community for more than a century. Here we review some of the empirical evidence for the existence of power-law forms and the theories proposed to explain them.
    • more papers by M.E.J. Newman at arXiv – arxiv.org/find/cond-mat/1/au:+Newman_M/0/1/0/all/0/1

2012.11.26

Generating functions

Filed under: fun, mathematics, number theory — Tags: , , , , , , , , , , , , , , , , , , , — sandokan65 @ 13:53

Recently I have been rereading the Herbert S. Wilf’s free online book Generatingfunctionology – http://www.math.upenn.edu/~wilf/DownldGF.html. It is choke-full of interesting results.

Definitions

For a number series {\bf a} :\equiv \{a_n|n\in\{0,\infty\}\} one defines following generating functions (GFs):

  • Ordinary Power Series GF (OPSGF): OPSGF[a](x) :\equiv \sum_{n=0}^\infty a_n x^n \leftrightarrow_{opsgf} {\bf a};
  • Exponential Series GF (EGF): EGF[a](x) :\equiv \sum_{n=0}^\infty a_n \frac{x^n}{n!} \leftrightarrow_{egf} {\bf a};
  • Dirichlet GF (DGF): DGF(x;s) :\equiv \sum_n \frac{a_n}{n^s} x^n \leftrightarrow_{dgf} {\bf a};
  • Lambert GF (LGF): LGF(x) :\equiv \sum_n \frac{a_n}{1-x^n} x^n \leftrightarrow_{lgf} {\bf a};
  • Bell GF (BGF): BGF(x;s) :\equiv \sum_n a_{p^n} x^n \leftrightarrow_{bgf} {\bf a};
  • Poisson GF (PGF): PGF(x;s) :\equiv \sum_n \frac{a_n}{n!} x^n e^{-x} = e^{-x} EGF(x) \leftrightarrow_{pgf} {\bf a};

Simple results

  • \{a_n=n\} \leftrightarrow_{opsgf} f(x) = \frac{x}{(1-x)^2}.
  • \{a_n=n^2\} \leftrightarrow_{opsgf} f(x) = \frac{x(x+1)}{(1-x)^3}.
  • \{a_n=b^n\} \leftrightarrow_{opsgf} f(x) = \frac{1}{1-b x}.
  • \{a_n=n\} \leftrightarrow_{egf} f(x) = x e^{x}.
  • \{a_n=n^2\} \leftrightarrow_{egf} f(x) = x(x+1)e^{x}.
  • \{a_n=b^n\} \leftrightarrow_{egf} f(x) = e^{b x}.
  • For Fibonacci numbers \{F_n|F_{n+1} = F_n + F_{n-1} | f_0 = F_1 = 1\} one has: OPSGF(x) = \frac{x}{1-x-x^2}, leading to F_n = \frac{r_+^n-(r_-^n}{\sqrt{5}} (r_\pm = \frac{1\pm\sqrt{5}}{2}).
  • \{a_n|a_{n+1}=2 a_n + 1| a_0=0\} \leftrightarrow_{opsgf} OPSGF = \frac{x}{(1-x)(1-2x)} = \frac{1}{1-2x} - \frac{1}{1-x}; which leads to a_n=2^n - 1.
  • For a_{n+1} = 2 a_n + n, $alatex _0=1$ one has: OPSGF = \frac{2}{1-2x} - \frac1{(1-x)^2} leading to
    a_n = 2^{n-1} - n - 1.

Define [x^n]f(x) as the coefficient next to x^n in power series f(x). Examples and properties:

  • [x^n] e^x = \frac1{n!},
  • [x^n] \frac1{1-ax} = a^n,
  • [x^n] (1+x)^s = \binom{s}{n},
  • [x^n] \{x^m f(x)\} = [x^{n-m}] f(x),
  • [\lambda x^n] f(x) = \frac1{\lambda} [x^n]f(x),
  • \left[\frac{x^n}{n!}\right] e^x = 1.

For binomial coeficients:

  • \sum_{k=0}^{\infty} \binom{n}{k} x^k = (1+x)^n,
  • \sum_{n=0}^{\infty} \binom{n}{k} y^n = \frac{y^k}{(1-y)^{k+1}},
  • \binom{n}{k} = [x^k y^n] \frac1{1 - y (1+x)}.

Some orthogonal polynomials:

  • Tchebitshev polynomials generating function: \sum_{n=0}^\infty \frac{z^n}{n!} T_n(x) = e^{zx}\cos(z\sqrt{1-x^2}).
  • Legendre polynomials generating function: \frac1{(1-2tz+z^2)^{\frac12}} = \sum_{n=0}^\infty P_n(t)z^n.
  • Generating function for associated Legendre polynomials: (1-2tc+t^2)^{\alpha} = |1-t e^{i\theta}|^{2\alpha} = \sum_{n=0}^\infty t^n P_n^{\alpha}(c).

Dirichlet series generating functions

  • For a_n=1: DGF = \zeta(s).
  • For a_n=\mu(n) (the Moebius function): DGF = \frac1{\zeta(s)}.
  • For a_n=d(n)=\sigma_0(n) (the zeroth-order divisor function): DGF = \zeta(s)^2.
  • For a_n=\sigma_k(n) (the kth-order divisor function): DGF = \zeta(s)\zeta(s-k).
  • For a_n=\phi(n) (the totient function): DGF = \frac{\zeta(s-1)}{\zeta(s)}.
  • For a_n=H(n) (the number of ordered factorizations): DGF = \frac{1}{2 - \zeta(s)}.
  • For a_n=\frac12 [1-(-1)^n]: DGF = \lambda(s) (the Dirichlet lambda function).

Moebius inversion formula:

  • If two DGF series A(s) and B(s) have coefficient relation a_n = \sum_{d|n} b_d, then A(s) = B(s) \zeta(s), and b_n = \sum_{d|n} \mu\left(\frac{n}{d}\right) a_d.
  • If a_n = \sum_{d|n} b_d, then b_n = \sum_{d|n} \mu\left(\frac{n}{d}\right) a_d.

2012.03.14

Pretty little tables

Filed under: mathematics, number theory, puzzles — Tags: , — sandokan65 @ 14:59

Recently I have seen in an math forum this:

    Wonder #1

and just a few days later this one, too:

    Wonders 1-4

Pretty little tables, aren’t they? How could they be so regular? Can they be generalized somehow?

Answers are: yes, you will see, and yes.

Wonder #1

Let’s first take a look at the first table:

Table 1
  • 1 \times 8 + 1 = 9,
  • 12 \times 8 + 2 = 98,
  • 123 \times 8 + 3 = 987,
  • 1,234 \times 8 + 4 = 9,876,
  • 12,345 \times 8 + 5 = 98,765,
  • 123,456 \times 8 + 6 = 987,654,
  • 1,234,567 \times 8 + 7 = 9,876,543,
  • 12,345,678 \times 8 + 8 = 98,765,432,
  • 123,456,789 \times 8 + 9 = 987,654,321,

In order to understand it one has to work not with the specific numbers (digits), but with their abstract representations. For this, we will work with a number system of base B (\in {\Bbb N}), which in the orginal tables is B=10. Then we can rewrite several first members of the Table 1 as follows:

  • 1 \cdot B^0 \times (B-2) + 1 = (B-1) B^0,
  • (1 \cdot B^1 + 2 B^0) \times (B-2) + 2 = (B-1) B^1 + (B-2)B^0,
  • (1 \cdot B^2 + 2 B^1 + 3 B^0) \times (B-2) + 3 = (B-1)B^2 + (B-2)B^1 + (B-3)B^0,
  • etc

Ok, we see some regularity here. To proceed further, rewrite the n^{th} row of that table in the form a mathematical equation y_n :\equiv x_n \cdot \hbox{some number} + \hbox{some other number}, transforming the first beautifully looking number (x_n) into second beautifully looking number y_n.

Here the series \{x_n\} is:

  • x_1 = 1_B = 1\times B^0,
  • x_2 = 12_B = 1\times B^1 + 2 \times B^0,
  • x_3 = 123_B = 1\times B^2 + 2 \times B^1 + 3 \times B^0,
  • …
  • x_n = 123...n_B = 1\times B^{n-1} + 2 \times B^{n-2} + \cdots + n \times B^0 = \sum_{k=1}^n k B^{n-k}.
    A side note:
    Note that x_n = \sum_{s=0}^{n-1} (n-s) B^s. It can be explicitly summarized as follows:

      x_ n = (n- B \partial_B) \sum_{s=0}^{n-1} B^s = (n-B\partial_B) \frac{B^n-1}{B-1} = \frac{B(B^n-1)-n(B-1)}{(B-1)^2}.

    For example, for B=10 that formula yields x_n = \frac{10(10^n-1)-9n}{81}: x_1 = 1, x_2 = 12, …, x_5 = 12345, etc.

Let’s go back to the main line of discussion.

Now we are interested in the following derivative series y_n :\equiv x_n \cdot (B-2) + n. The straightforward manipulation leads to the anticipated result:

    y_ n = B^n + \sum_{s=1}^{n-1} (s+1-n)B^s - n
    = (B-1)B^{n-1} + B^{n-1} + \sum_{s=1}^{n-2} (s+1-n)B^s - n
    = (B-1)B^{n-1} + (B-2) B^{n-2} + \sum_{s=1}^{n-3} (s+1-n)B^s - n

    \cdots

    = \sum_{r=1}^{m} (B-r)B^{n-r} + B^{n-m} + \sum_{s=1}^{n-m-1} (s+1-n)B^s - n

    \cdots

    = \sum_{r=1}^{n-2} (B-r)B^{n-r} + B^{2} + \sum_{s=1}^{1} (s+1-n)B^s - n
    = \sum_{r=1}^{n-2} (B-r)B^{n-r} + B^{2} + (2-n)B^1 - n
    = \sum_{r=1}^{n-1} (B-r)B^{n-r} + B^{1} - n
    = \sum_{r=1}^{n} (B-r)B^{n-r}.

i.e. y_n = (B-1)(B-2)...(B-n+2)(B-n+1)(B-n)_B. The initial pyramid of simple results holds for every base B.

Example: for B=5 we have x_n = \frac{5(5^n-1)-4n}{16}, so x_1 = \frac{5\cdot 4 - 4 \cdot 1}{16} = 1, x_2 = \frac{5\cdot 24 - 4 \cdot 2}{16} = 7_{10} = 12_5, etc. Then, for example y_2 = x_2 \cdot 3 + 2 = 7\cdot 3 + 2 = 21 + 2 = 23_{10} = 43_5.

Wonder #2

Let’s look at the Table 2:

Table 2
  • 1 \times 9 + 2 = 11,
  • 12 \times 9 + 3 = 111,
  • 123 \times 9 + 4 = 1,111,
  • 1,234 \times 9 + 5 = 11,111,
  • 12,345 \times 9 + 6 = 111,111,
  • 123,456 \times 9 + 7 = 1,111,111,
  • 1,234,567 \times 9 + 8 = 11,111,111,
  • 12,345,678 \times 9 + 9 = 111,111,111,
  • 123,456,789 \times 9 + 10 = 1,111,111,111,

Here the first (i.e. the independent) variable x_n is the exactly same as the one used for Table 1. The second (i.e. the dependent) variable z_n is new one, determined by defining equation:

    x_n = \sum_{s=0}^{n-1}(n-s)B^s,

Then, using steps similar to these used in analysis of the Table 1, we get:

    z_n :\equiv x_b \cdot (B-1) + (n+1) =
    = \sum_{s=0}^{n-1} (n-s) B^{s+1} - \sum_{s=0}^{n-1} (n-s) B^s + (n+1) =
    = \sum_{s=1}^{n} (n+1-s) B^{s} - \sum_{s=0}^{n-1} (n-s) B^s + (n+1) =
    = B^n + \sum_{s=1}^{n-1} (n+1-s - n +s) B^{s} - n + (n+1) =
    = B^n + \sum_{s=1}^{n-1} B^{s} +1 =
    = \sum_{s=0}^{n} B^{s} =
    = 1\cdots 1_B,

where there are (n+1) copies of digit 1.

Nice. Easy.

Wonder #3

Table 3
  • 9 \times 9 + 7 = 88,
  • 98 \times 9 + 6 = 888,
  • 987 \times 9 + 5 = 8,888,
  • 9,876 \times 9 + 4 = 88,888,
  • 98,765 \times 9 + 3 = 888,888,
  • 987,654 \times 9 + 2 = 8,888,888,
  • 9,876,543 \times 9 + 1 = 88,888,888,
  • 98,765,432 \times 9 + 0 = 888,888,888,

That series of relations has form v_n = u_n \cdot 9 + (8-n) where the dependent variable is
v_n = \underbrace{8\cdots8}_{n+1} in the normal decimal system (B=10).

For general basis B this generalizes to the:
v_n = u_n \cdot (B-1) + (B - n -2). Here the independent variable u_n is

    u_n = \sum_{k=1}^n (B-k) B^{n-k} =
    = \sum_{s=0}^{n-1} (B- n -s) B^s =
    = (B - n + B \partial_B) \sum_{s=0}^{n-1}B^s =
    = (B - n + B \partial_B)\frac{B^n-1}{B-1} =
    = \frac{B(B-2)(B^n-1)+n (B-1)}{(B-1)^2}.

Now

    v_ n :\equiv u_n (B-1) + (B-n-2) =
    = (B-1) B^n - \sum_{s=1}^{n-1} B^s - 2 =
    = (B-2) B^n + (B-1) B^{n-1} - \sum_{s=1}^{n-2} B^s - 2 =
    = (B-2) B^n + (B-2) B^{n-1} + (B-1)B^{n-2} - \sum_{s=1}^{n-3} B^s - 2 =

    \cdots

    = (B-2) B^n + \cdots + (B-2) B^{n-m+1} + (B-1)B^{n-m} - \sum_{s=1}^{n-m-1} B^s - 2 =

    \cdots

    = (B-2) B^n + \cdots + (B-2) B^{3} + (B-1)B^{2} - B^1 - 2 =
    = (B-2) B^n + \cdots + (B-2) B^{3} + (B-2)B^{2} + B^2 - B^1 - 2 =
    = (B-2) B^n + \cdots + (B-2) B^{2} + (B-1)B^{1} - 2 =
    = (B-2) B^n + \cdots + (B-2) B^{1} + B - 2 =
    = \sum_{r=0}^{n} (B-2) B^r.

For B=10 that covers all examples in the Table 3.

Note: Even more, we can add two more members to it, corresponding to n=9 and n=10:

  • u_9 = 987,654,321 corresponds to v_9 = x_9 \cdot 9 + (-1) = 8,888,888,888,
  • u_{10} = 9,876,543,210 corresponds to v_{10} = x_{10} \cdot 9 + (-2) = 88,888,888,888.

Also, the u_0=0 provides one more line, which is prepended to this more complete table 3:

Table 3*
  • 0 \times 9 + 8 = 8,
  • 9 \times 9 + 7 = 88,
  • 98 \times 9 + 6 = 888,
  • 987 \times 9 + 5 = 8,888,
  • 9,876 \times 9 + 4 = 88,888,
  • 98,765 \times 9 + 3 = 888,888,
  • 987,654 \times 9 + 2 = 8,888,888,
  • 9,876,543 \times 9 + 1 = 88,888,888,
  • 98,765,432 \times 9 + 0 = 888,888,888,
  • 987,654,321 \times 9 - 1 = 8,888,888,888,
  • 9,876,543,210 \times 9 - 2 = 88,888,888,888.

Wonder #4

Table 4
  • 1^2 = 1,
  • 11^2 = 121,
  • 111^2 = 12,321,
  • 1,111^2 = 1,234,321,
  • 11,111^2 = 123,454,321,
  • 111,111^2 = 1,2345,654,321,
  • 1,111,111^2 = 1,234,567,654,321,
  • 11,111,111^2 = 123,456,787,654,321,
  • 111,111,111^2 = 12,345,678,987,654,321.

Here the independent variable is

    p_n :\equiv 1\cdot B^{n} + 1\cdot B^{n-1} + \cdots + 1\cdot B^0 = \sum_{i=0}^n B^i = \frac{B^{n+1}-1}{B-1}.

The resulting variable is

    r_n :\equiv p_n^2 = \sum_{i=0}^n \sum_{j=0}^n B^{i+j} =
    = \sum_{k=0}^{2n} (\sum_{i=0}^n \sum_{j=0}^n \delta_{i+j,k}) B^k.

Now the sum in brackets can be transformed as follows:

    \sum_{i=0}^n \sum_{j=0}^n \delta_{i+j,k} = \sum_{i=0}^n \Theta(0 \le k-i \le n) =
    = \sum_{i=0}^n \Theta(k-n \le i \le k) = \sum_{i=\hbox{max}(0,k-n)}^{\hbox{min}(n,k)} 1 =
    = \hbox{min}(n,k) - \hbox{max}(0,k-n) + 1 = *

which has three posible simplifications:

  • * = k - 0 + 1 = k + 1 for k < n,
  • * = n + 1 for k = n,
  • * = n - (k-n) + 1 = 2n - k + 1 for k > n.

So, now we can write the final form for r_n as following:

    r_n = \sum_{k=0}^{n-1} (k+1) B^k + (n+1) B^n + \sum_{k=n+1}^{2n} (2n-k+1) B^k =
    = 1\cdot B^0 + 2\cdot B^1 + 3\cdot B^2 + \cdots + (n+1) B^n + \cdots 2\cdot B^{2n-1} + 1\cdot B^{2n} =
    = 123\cdots(n+1)\cdots321_B.

That is it.

Note that one can get some regularities for degrees higher than 2. For example, for degree 3 one has:

    1^3 = 1
    11^3 = 1,331
    111^3 = 135,531

    1,111^3 = 13,577,531
    11,111^3 = 1,357,997,531
    111,111^3 = 135,79b,b97,531
    1,111,111^3 = 13,579,bdd,b97,531

    \cdots

    {\underbrace{1\cdots1}_{[B'/2]+1}}^3 = 1357\cdots B'B'\cdots 7531.

up to the last member (of that series) where the two central digits are the highest single-digit number B' allowed in the number system of base B (i.e. B'=B-2 if B is odd, and B'=B-1 if B is even).

Note: Here a = 10_{10}, b = 11_{10}, c = 12_{10}, d = 13_{10}, e = 14_{10}, f = 15_{10}, g = 16_{10}, h = 17_{10}, i = 18_{10}, etc.

For the degree 4 the similar pyramid/table is:

    1^4 = 1
    11^4 = 14,641
    111^4 = 1,48a,841

    1,111^4 = 1,48a,cec,841

    \cdots

Here one can also work some more (and I did not do that work yet) to establish which is the last member of that table (as a function of the base B), and what is the innermost digit in that last member.
This could be a homework for you. 🙂

For the degree 5:

    1^5 = 1
    11^5 = 15885
    111^5 = 15ciic51

    \cdots

Similar here: More simple math wonders – https://eikonal.wordpress.com/2012/03/14/more-simple-math-wonders/ | Mental calculation of cube root of a six-digit number – https://eikonal.wordpress.com/2010/01/14/mental-calculation-of-cube-root-of-a-two-digit-number/ | Squares with just two different decimal digits – https://eikonal.wordpress.com/2010/01/05/squares-with-just-two-different-decimal-digits/ | Number theory finite concidental sums – https://eikonal.wordpress.com/2010/01/05/number-theory-finite-considental-sums/

2011.07.20

Lambert W function

Filed under: mathematics — Tags: — sandokan65 @ 13:38

Definition: A function W: {\mathbb C} \rightarrow {\mathbb C} defined by W(z) e^{W(z)} = z is named the Lambert W-function.

Literature:

2011.07.06

Derivatives of numbers

Filed under: mathematics, number theory — Tags: , , — sandokan65 @ 23:45

Definitions:

  • p'=1 for every prime number p
  • (a b)' = a' b + a b' (Leibnitz rule) for every two natural numbers a, b \in {\Bbb N}

Concequences:

  • 1' = 0.
  • (p^n)' = n \cdot p^{n-1}
  • for any natural number n= \prod_{i=1}{k} {p_i}^{n_i} one has n' = n \sum_{i=1}^{k} \frac{n_i}{p_i}.
    • Eg: 40' = (2^3 \cdot 5)' = 3 \cdot 2^2 \cdot 5 + 2^3 = 68.
  • in general (a+b)' \ne a' + b'
  • \left(\frac{a}{b}\right)' = \frac{a' b - a b'}{b^2}
  • (p^p)' = p^p for any prime number p is equivalent of the exponential function’s property that its derivative is itself.
  • If n = p^p \cdot m for prime p and natural m>1, then n' = p^p (m+m') > n, n^{(k)} \ge n+k, and \lim_{k\rightarrow \infty} n^{(k)} = \infty.
  • For infinitely many natural numbers n there exist suitable k s/t n^{(k)}=0
  • Ufnarovski and Åhlander give following conjecture: for every natural n, as we observe its derivatives n^{(k)} (as k grows to infinity), the limit will be either 0, \infty, or n itself (if n=p^p for some prime p).
  • If n'=0, then n=1.
  • If n'=1, then n = p (for all possible primes).

Sources:

  • “Deriving the Structure of Numbers” by Ivars Peterson (Ivars Peterson’s MathTrek) – http://www.maa.org/mathland/mathtrek_03_22_04.html
  • “How to differentiate a number” by Ufnarovski, V., and B. Åhlander (Journal of Integer Sequences 6; 2003.09.17) – http://www.cs.uwaterloo.ca/journals/JIS/VOL6/Ufnarovski/ufnarovski.html
      Abstract: We define the derivative of an integer to be the map sending every prime to 1 and satisfying the Leibnitz rule. The aim of the article is to consider the basic properties of this map and to show how to generalize the notion to the case of rational and arbitrary real numbers. We make some conjectures and find some connections with Goldbach’s Conjecture and the Twin Prime Conjecture. Finally, we solve the easiest associated differential equations and calculate the generating function.
  • “Investigations of the number derivative” by Linda Westrick – http://web.mit.edu/lwest/www/intmain.pdf

2011.06.03

Collatz conjecture

Filed under: mathematics, puzzles — Tags: , , , , , , — sandokan65 @ 15:02

2011.03.28

Universal calendars

Filed under: mathematics — Tags: — sandokan65 @ 16:59

According to Daniel Zwillinger (“Standard Mathematical Tables And Formulae”; 31st ed; 2003; Recipe 10.3.2, but formula 10.3.1) the specific date maps to the following day of the week (in the Gregorian calendar):

    W = \left(k + [2.6 m -0.2] - 2 C + Y + \left[\frac{Y}4\right] + \left[\frac{C}{4}\right]\right) \ (mod \ 7)

Here:

  • W = day of the week (0=Sunday to 6=Saturday)
  • k = the day in the month (= 1 to 31)
  • m = the month (1=March to 12=February)
  • C = century minus one (1997 \rightarrow C=19, 2005 \rightarrow C=20)
  • Y = the year inside century, where the years begining is march 1st (so, 1997 maps to Y=97 except for January and February when it goes to Y=96
  • and [...] is the floor function (the largest integer part of the enclosed real number).

For example, today is March 29th, 2011. That would be:

  • The day’s order number inside this month: k=29
  • This month is, according to Roman counting, the first one in the year: m=1
  • The year inside the century is Y=11 (since it is past February)
  • The century is 21st, so C=21-1 = 20
  • So: [2.6 m -0.2] = [2.6 -0.2] = [2.4] = 2, [Y/4] = [11/4] = [2.25] = 2, [C/4] = [20/4] = 5
  • and W = \left(29 + 2 - 2 \times 20 + 11 + 2 + 5\right) \ (mod \ 7) = (49-40) \ (mod \ 7) = 9 \ (mod \ 7) = 2 i.e. today is Tuesday (correct).

2011.01.13

Deformations

Filed under: mathematics, physics — Tags: — sandokan65 @ 14:33

References

2010.12.16

History of Mathematics

Filed under: mathematics — Tags: , , , , — sandokan65 @ 11:39

2010.12.10

Monodromy

Filed under: mathematics — Tags: — sandokan65 @ 16:10

Large part of my research interests used to be centered around the concept of the monodromy matrix in its many forms and names:

  • The Fundamental Solution Matrix,
  • The Ordered Exponential Matrix,
  • The Floquet Matrix.

It is an integral matrix characterization of the periodic dynamical systems. John Baez gives nice layman explanation what it is. Related concepts are the Monodromy Group and the Monodromy Principle.

The Erdos Number

Filed under: mathematics, number theory — Tags: — sandokan65 @ 15:52

A simple metric on the space of the publishing mathematicians. That space consists of the discrete nodes that represent each publishing mathematician. For each jointly publication there is a link between the two nodes representing authors of that publication. If two authors have N common publications, the link connecting them has weight N. A distance between two nodes (x and y) is defined as the shortest number of steps from x to y. The Erdos Number is the distance (metric) of x to the one specific node (Paul Erdos). Majority of the nodes in the space belong to a one extremely large cluster/graph (a dominant/principal component). Still, there are many solitary nodes.

2010.11.15

Cyclic numbers

Filed under: mathematics, number theory — Tags: , — sandokan65 @ 14:14

Definition: (source: [3]) A number with n digits, which, when multiplied by 1, 2, 3, …, n produces the same digits in a different order. For example, 142857 is a cyclic number: 142857 × 2 = 285714; 142857 × 3 = 428571; 142857 × 4 = 571428; 142857 × 5 = 714285; 142857 × 6 = 857142, and so on. It has been conjectured, but not yet proven, that an infinite number of cyclic numbers exist.

Properties:

  • 142,857 X 1 = 142,857
  • 142,857 X 2 = 285,714
  • 142,857 X 3 = 428,571
  • 142,857 X 4 = 571,428
  • 142,857 X 5 = 714,285
  • 142,857 X 6 = 857,142
  • 142,857 X 7 = 999,999
  • 142 + 857 = 999
  • 14 + 28 + 57 = 99
  • from [2]: … Multiplication by an integer greater than 7: adding the lowest six digits (ones through hundred thousands) to the remaining digits and repeat this process until you have only the six digits left, it will result in a cyclic permutation of 142857. Example:
    • 142,857 X 142,857 = 20,408,122,449
    • 20,408 + 122,449 = 142,857

Sources:

2010.11.02

Readings in number theory

Filed under: mathematics, number theory — Tags: , , , , , , , , , , — sandokan65 @ 11:17

Partition function p(n)

Definition: The partition function p(n):{\Bbb N}\rightarrow{\Bbb N}_0 is defined by

    p(n) = \hbox{number of partitions of } n.

Examples: The partitions of 5:

  • 5 = 5,
  • 5 = 4+1,
  • 5 = 3+2,
  • 5 = 3+1+1,
  • 5 = 2+2+1,
  • 5 = 2+1+1+1,
  • 5 = 1+1+1+1+1.

i.e. p(5)= 7.

Properties:

  • p(1)=1, p(2)=2, p(3)=3, p(4)=5, p(5)=7, p(6)=11, p(7)=15, p(8)=22, p(9)=30, p(10)=42, … p(100)=190,569,292, … p(200)=3,972,999,029,388, … p(1,000)=24,061,467,864,032,622,473,692,149,727,991, …
  • An asymptotic formula: p(n) \sim \frac{e^{\pi \sqrt{\frac{2n}3}}}{4n\sqrt{3}}.
  • Generating function: F(x) :\equiv \prod_{m=1}^\infty \frac1{(1-x^m)} = \sum_{n=0}^\infty p(n) x^n (where |x|<1).
  • p(n) = \oint_C \frac{dx}{2\pi i} \frac{F(x)}{x^{n+1}}
    • … [the] main contributions [to this integral] come from poles of F(x), [and] these lie at every root of 1.
    • Circle Method: using the function T_q(n) that estimates the contribution [to the above integral] from the poles on the circle ${\cal C}$ that are near the q-th roots of unity. The main formula of the method is: p(n) = \sum_{q=1}^\infty T_q(n). Taking the finite number of terms in that sum gives surprisingly good results, due to the fact that the estimated function has integer values.

Some applications of Circle Method:

  • Lagrange’s conjecture: Each natural number can be expressed as the sum of at most four squares.
  • Waring’s problem: Every sufficiently large natural number can be expressed as the sum of at most w(k) k-th powers.
  • Example: To calculate the exact expression for the number of ways (R_k(N)) to write number N as a sum of k squares (i.e. N = \sum_{i=1}^k n_i^2) use the k-th potency of the function f(x):\equiv \sum_{n=0}^\infty x^{n^2}:
    • f(x)^k = \sum_{N=0}^\infty R_k(N) x^N,
    • and, therefore: R_k(N) = \oint_C \frac{dx}{2\pi i} \frac{f(x)^k}{x^{n+1}}

Goldbach’s conjecture:

  • Every even number greater than two can be represented as a sum of two primes.
  • Every odd number greater than five can be represented as a sum of three primes.

Congruences for p(n)

Ramanujan’s congruences:

  • p(5n+4) \equiv 0 (mod \ 5),
  • p(7n+5) \equiv 0 (mod \ 7),
  • p(11n+6) \equiv 0 (mod \ 11).

Congruences found in 1960s:

    p(A n + B) \equiv 0 (mod \ l^k)

for l = 13, 17, 19, 23, 29, 31.

Example: p(13^2\cdot 97^3 \cdot 103^3 \cdot n - 6,950,975,499,605) \equiv 0 (mod \ 13^2).

Theorem (Ono, 2000): For prime l \ge 5 there exist infinitely many congruences of the form p(A n + B) \equiv 0 (mod \ l).

Theorem (Ahlgren, 2000): For prime l \ge 5 and a positive integer m there exist infinitely many congruences of the form p(A n + B) \equiv 0 (mod \ l^m).

Modular forms

Definition: Ramanujan’s tau-function:

  • \sum_{n=1}^\infty \tau(n) q^n :\equiv q \prod_{m=1}^\infty (1-q^m)^{24} = q -24 q^2 +252 q^3 - 1,472 q^4 + 4,830 q^5 - - 6,048 q^6 - 16,744 q^7 + 84,480 q^8 - 113,643 q^9 - 115,920 q^{10} + \cdots

Definition: \Delta(z) :\equiv \sum_{n=1}^\infty \tau(n) q^n :\equiv q \prod_{m=1}^\infty (1-q^m)^{24} for q :\equiv e^{2\pi i z} (with \Im{z}>0).

The \Delta(z) has modular symmetries: \Delta\left(\frac{az+b}{cz+d}\right) = (cz+d)^{12} \Delta(z) (\forall z) for any integer M= \begin{pmatrix}a & b \\ c & d\end{pmatrix} that is unimodular (\det M = 1). In another words, \Delta(z) is a modular form of weight 12.

Definition: The function f:{\Bbb C}\rightarrow{\Bbb C} is a modular form of weight k if it satisfies the modularity equation f\left(\frac{az+b}{cz+d}\right) = (cz+d)^{k} f(z) (\forall z, (\forall M\in{\Bbb Z}^{2\times2}/\{\det M=1\})).

The \Delta(z) is a prototype of all modular functions. Some other examples are:

  • \theta(z) :\equiv \sum_{n\in{\Bbb Z}} q^{n^2},
  • E(z) :\equiv 1+ 240 \sum_{n=1}^\infty (\sum_{d|n} d^3) q^{n}.

Some properties of \tau(n):

  • \tau(n) \tau(m) = \tau(nm) if gcd(n,m)=1.
  • Ramanujan’s conjecture: |\tau(p)| \le 2 p^{11/2} for every prime p.
  • Generalized Ramanujan’s conjecture: if f(z) = \sum_{n=1}^\infty a(n) q^n has weight k, then |a(p)| \le 2 p^{{k-1}/2} for all primes p.

Congruences for \tau function:

  • \tau(p) \equiv 1+ p^{11} \ (\hbox{mod} \ 691) for every prime p.
  • \tau(p) \equiv 1+p^{11} \ (\hbox{mod} \ 2^5) for p\ne 2.
  • \tau(p) \equiv 1+p \ (\hbox{mod} \ 3) for p\ne 3.
  • \tau(p) \equiv p^{30}+p^{-41} \ (\hbox{mod} \ 5^3) for p\ne 5.
  • \tau(p) \equiv p+p^4 \ (\hbox{mod} \ 7) for p\ne 7.
  • These are the only congruences of the form \tau(p) \equiv p^a + p^{11-a} \ (\hbox{mod} \ l^k).

Sources

More

2010.10.20

“Quantum” calculus

Filed under: mathematics, Quantum mechanics — Tags: , , , , , , , , , , , , , , , , , , — sandokan65 @ 08:40

Currently all this material is retyped from the reference [1].

Definitions:

  • The q-analogue of n: [n]:\equiv \frac{q^n-1}{q-1};
  • The q-analogue of factorial n!: [n]! :\equiv \prod_{k=1}^{n}[k] for k\in{\Bbb N} (and [0]!=1);
  • (x-a)^{n}_{q} :\equiv \prod_{k=0}^{n-1} (x-q^k a) for n\in{\Bbb N}.
  • (x-a)^{-n}_{q} :\equiv \frac1{(x- q^{-n}a)^{n}_{q}}.

Properties:

  • [-n] = - q^{-n} [n].
  • (x-a)^{m+n}_{q} = (x-a)^{m}_{q} (x- q^m a)^{n}_{q},
  • (a-x)^{n}_{q} = (-)^n q^{n(n-1)/2} (x - q^{-n+1}a)^{n}_{q},

the “quantum” differentials

Definitions: For an arbitrary function f:{\Bbb R}\rightarrow {\Bbb R} define:

  • its q-differential: d_q f(x) :\equiv f(q x) - f(x);
  • its h-differential: d_h f(x) :\equiv f(x+h) - f(x);
  • its q-derivative: D_q f(x) :\equiv \frac{d_q f(x)}{d_q x} = \frac{f(q x) - f(x)}{(q-1)x};
  • its h-derivative: D_h f(x) :\equiv \frac{d_h f(x)}{d_h x} = \frac{f(x+h) - f(x)}{h};

Note that d_q x = (q-1) x and d_h x = h.

Basic properties:

  • all four operators (d_q, d_h, D_q and D_h) are linear, e.g. d_q (\alpha f(x) + \beta g(x)) = \alpha d_q f(x) + \beta d_q g(x).
  • d_q (f(x)g(x)) = (d_q f(x)) g(x) + f(qx) (d_q g(x));
  • d_h (f(x)g(x)) = (d_h f(x)) g(x) + f(x+h) (d_h g(x));
  • D_q (f(x)g(x)) = (D_q f(x)) g(x) + f(qx) (D_q g(x));
  • D_q \left(\frac{f(x)}{g(x)}\right) = \frac{D_q f(x) \ g(x) - f(x) \ D_q g(x)}{g(x)g(qx)} = \frac{D_q f(x) \ g(q x) - f(q x) \ D_q g(x)}{g(x)g(qx)} ;
  • there does not exist a general chain rule for q-derivatives
  • such rule exists for monomial changes of variables x\rightarrow x' = \alpha x^{\beta}, where D_q f(x'(x)) = (D_{q^\beta}f)(x') \cdot D_q x'(x).

Examples and properties:

  • D_q x^n = [n] x^{n-1}.
  • (D^n_q f)(0) = \frac{f^{(n)}(0)}{n!} [n]!.
  • D_q f(x) = \sum_{n=0}^{\infty}\frac{(q-1)^n}{(n+1)!} x^n f^{(n+1)}(x).
  • P_n(x) :\equiv \frac{x^n}{[n]!} satisfies D_q P_n(x) = P_{n-1}(x).
  • D_q (x-a)^{n}_{q} = [n] (x-a)^{n-1}_{q},
  • D_q (a-x)^{n}_{q} = - [n] (a- q x)^{n-1}_{q},
  • D_q \frac1{(x-a)^{n}_{q}} = [-n] (x-q^n a)^{-n-1}_{q},
  • D_q \frac1{(a-x)^{n}_{q}} = \frac{[n]}{(a-x)^{n+1}_{q}},

q-binomial calculus

Definition: The q-binomial coefficient is defined by \left[{n \atop j}\right] :\equiv \frac{[n]!}{[j]![n-j]!}.

Properties of q-binomial coefficients:

  • \left[{n \atop n-j}\right] = \left[{n \atop j}\right].
  • there exist two q-Pascal rules: \left[{n \atop j}\right] = \left[{n-1 \atop j-1}\right] + q^j \left[{n-1 \atop j}\right] and \left[{n \atop j}\right] = q ^{n-j}\left[{n-1 \atop j-1}\right] + \left[{n-1 \atop j}\right].
  • \left[{n \atop 0}\right] = \left[{n \atop n}\right] = 1.
  • \left[{n \atop j}\right] is a polynomial in q of degree j(n-j) with the leading coefficient equal to 1.
  • \left[{\alpha \atop j}\right] = \frac{[\alpha] [\alpha-1] \cdots [\alpha -j +1]}{[j]!} for any number \alpha.
  • \left[{m+n \atop k}\right] = \sum_{j=0}^{k} q^{(k-j)(m-j)} \left[{m \atop j}\right] \left[{n \atop k-j}\right].
  • x^n = \sum_{j=0}^{n} \left[{n \atop j}\right] (x-1)^j_q.
  • \sum_{j=0}^{2m} (-)^j \left[{2m \atop j}\right] = (1-q^{2m-1})(1-q^{2m-3})\cdots(1-q).
  • \sum_{j=0}^{2m+1} (-)^j \left[{2m+1 \atop j}\right] = 0.
  • The Gauss’s binomial formula: (x+a)^n_q = \sum_{j=0}^n \left[{n \atop j}\right] q^{j(j-1)/2} a^{j} x^{n-j}.
  • For two non-commutative operators \hat{A} and \hat{B} s/t \hat{B}\hat{A} = q\hat{A}\hat{B} (with q and ordinary number), the non-commutative Gauss’s binomial formula is: (\hat{A}+\hat{B})^n = \sum_{j=0}^n \left[{n \atop j}\right] \hat{A}^{j} \hat{B}^{n-j}. Such two operators are \hat{x} and \hat{M_q} defined as \hat{x} f(x) :\equiv x f(x) and \hat{M_q} f(x) :\equiv f(qx).
  • The Heine’s binomial formula: \frac1{(1-x)^n_q} = 1+ \sum_{j=1}^{\infty} \frac{[n][n+1]\cdots[n+j-1]}{[j]!} x^j.
  • \frac1{(1-x)^{\infty}_q} = \sum_{j=0}^{\infty} \frac{x^j}{(1-q)(1-q^2)\cdots(1-q^j)}.
  • (1+x)^{\infty}_q = \sum_{j=0}^{\infty} q^{j(j-1)/2} \frac{x^j}{(1-q)(1-q^2)\cdots(1-q^j)}.

Generalized Taylor’s formula for polynomials

For given number a and linear operator D on space of polynomials, there exist a unique sequence of polynomials \{P_0(x), P_1(x), \cdots\} such that

  • P_0(a)=1 and P_{n>0}(a)=0;
  • \hbox{deg}P_n = n;
  • D P_n(x) = P_{n-1}(x) (\forall n\ge 1) and D(1)=0.

Then any polynomial f(x) of degree n has the unique expansion via following generalized Taylor expression: f(x) = \sum_{j=0}^n (D^j f)(a) P_j(x).

Examples:

  • If D is D_q we have: f(x) = \sum_{j=0}^n (D_q^j f)(a) \frac{(x-a)^j_q}{[j]!}.
  • for f(x)=x^n and a=1 one gets: x^n = \sum_{j=0}^n \left[{n \atop j}\right] (x-1)^j_q.

Exponentials and trigonometric functions

Definitions: (q-exponentials):

  • e_q^x :\equiv \sum_{k=0}^\infty \frac{x^k}{[k]!} = \frac1{(1-(1-q)x)_q^\infty};
  • E_q^x :\equiv \sum_{k=0}^\infty q^{k(k-1)/2} \frac{x^k}{[k]!} = (1+(1-q)x)_q^\infty.

Properties:

  • e_q^0 = 1, E_q^0 =1.
  • \frac1{(1-x)_0^\infty} = e_q^{x/(1-q)}.
  • D_q e_q^x = e_q^x, D_q E_q^x = E_q^{qx}.
  • D_q \frac1{(1-(1-q)x)_q^n} = \frac{(1-q)[n]}{(1-(1-q)x)_q^{n+1}}, D_q (1+(1-q)x)_q^n = (1-q) [n] (1+q(1-q)x)^{n-1}_q.
  • e_q^{x}e_q^{y} \ne e_q^{x+y}; but e_q^{x}e_q^{y} = e_q^{x+y} iff yx=qxy.
  • E_q^{-x} = \frac1{e_q^{x}}, i.e. E_q^{x} = \frac1{e_q^{-x}}.
  • e_{\frac1{q}}^{x} = E_q^x.
  • direct consequence of the previous two lines: e_q^{-x}e_{\frac1{q}}^{x} = 1.

Definitions: (q-trigonometric functions):

  • sin_q(x) :\equiv \frac{e_q^{ix}-e_q^{-ix}}{2i},
  • Sin_q(x) :\equiv \frac{E_q^{ix}-E_q^{-ix}}{2i},
  • cos_q(x) :\equiv \frac{e_q^{ix}+e_q^{-ix}}{2i},
  • Cos_q(x) :\equiv \frac{E_q^{ix}+E_q^{-ix}}{2i}.

Properties:

  • cos_q(x) Cos_q(x) + sin_q(x) Sin_q(x) = 1.
  • D_q sin_q(x) = cos_q(x),
  • D_q Sin_q(x) = Cos_q(qx),
  • D_q cos_q(x) = - sin_q(x),
  • D_q Cos_q(x) = - Sin_q(qx).

Partition functions and product formulas

Definitions:

  • The triangular numbers: \Delta_n :\equiv \frac{n(n+1)}2,
  • the square numbers: \Box_n :\equiv n^2,
  • the pentagonal numbers: \Pi_n :\equiv \frac{n(3n-1)}2,
  • the k-gonal numbers: m^{(k)}_n :\equiv (k-2) \Delta_{n-1} + n = \frac{n(kn -2n -k +4)}2.

Definition: The classical partition function p(n):{\Bbb Z}\rightarrow{\Bbb N}) is defined as

  • p(n) = the number of ways to partition an positive integer number n into sum of positive integers (modulo reordering of summands);
  • p(n)=0 for n<0;
  • p(0)=1.

Properties:

  • Examples: p(1)=1, p(2)=2, p(3) =3, p(4) = 5, p(5)=7.
  • Asymptotic behavior: p(n) \sim \frac1{3\sqrt{3}n} e^{\pi \sqrt{\frac{2n}{3}}} \ as \ n\rightarrow \infty.
  • \varphi(q)^{-1} = \sum_{n=0}^\infty p(n) q^n.
  • p(n) = \sum_{n=0}^\infty (-)^{n-1} (p(n-\Pi_n) + p(n-\Pi_{-n})).

Definition: the Euler’s product: \varphi(q) :\equiv \prod_{n=1}^\infty (1-q^{n}).

Theorem (Jacobi’s triple product identity): For |q|<1 following is true:

    \sum_{n\in{\Bbb Z}} q^{n^2}z^n = \prod_{n=1}^\infty (1-q^{2n})(1+q^{2n-1}z)(1+q^{2n-1}z^{-1}).

Consequences:

  • Euler’s product formula: \sum_{n\in{\Bbb Z}} (-)^n q^{\frac{n(3n-1)}2} = \prod_{n=1}^\infty (1-q^{n}).
    • This can be rephrased as follows: \varphi(q) = \sum_{n\in{\Bbb Z}} (-)^n q^{\Pi_n} where \Pi_n are the pentagonal numbers defined above.
  • Following Gauss identities are special cases of the Jacobi’s triple product identity:
    • \sum_{n=0}^{\infty} q^{\Delta_n} = \prod_{n=1}^\infty \frac{1-q^{2n}}{1-q^{2n-1}},
    • \sum_{n=0}^{\infty} (-q)^{\Box_n} = \prod_{n=1}^\infty \frac{1-q^{n}}{1+q^{n}}.

Sources:

  • [1] book: “Quantum Calculus” by Victor Kac and Pokman Cheung (Springer) – ISBN 0-387-9534198; QA303.C537 2001

Other references:

2010.10.14

Sylvester and Lyapunov equations

Filed under: mathematics — Tags: , , , — sandokan65 @ 11:42

Definitions: ([1],[2]) For n\times n matrices A, B, X, Y:

  • the Sylvester equation: AY+YB=X;
  • the Lyapunov equation: AYA^{\dagger}-Y=X;
  • the “continuous” Lyapunov equation: AY+YA^{\dagger}=X.

More:

2010.10.13

Calabi-Yau

Filed under: mathematics — Tags: — sandokan65 @ 10:46

2010.08.12

Uses of Eikonal approximation

Filed under: eikonal approximation, mathematics, physics — Tags: — sandokan65 @ 14:41
  • “Rytov/Eikonal Approximation of Wavepaths” by William S. Harlan (1998.04) – http://billharlan.com/pub/papers/rytov/rytov.html
  • “Structure of entropy solutions to the eikonal equation” by Camillo De Lellis and Felix Otto (Journal: J. Eur. Math. Soc.; Volume: 5; Number: 2; Pages: 107-145; 2003) – http://cvgmt.sns.it/papers/delott02/
      Abstract: In this paper, we establish rectifiability of the jump set of an S1-valued conservation law in two space-dimensions. This conservation law is a reformulation of the eikonal equation and is motivated by the singular limit of a class of variational problems. The only assumption on the weak solutions is that the entropy productions are (signed) Radon measures, an assumption which is justified by the variational origin. The methods are a combination of Geometric Measure Theory and elementary geometric arguments used to classify blow-ups.
      The merit of our approach is that we obtain the structure as if the solutions were in BV, without using the BV-control, which is not available in these variationally motivated problems.

2010.08.06

Calculating e

Filed under: mathematics — Tags: , — sandokan65 @ 09:48

Related at this blog: Pi calculations – https://eikonal.wordpress.com/2010/01/05/pi-calculations/

2010.07.22

Volume of the ball

Filed under: geometry — Tags: , — sandokan65 @ 13:12
  • The “volume” \Omega_n :\equiv \hbox{Vol}(B^n) of the ball B^n :\equiv \{x \in {\Bbb R}^n | s/t |x|<1\} is given by \Omega_n = \frac{\pi^{n/2}}{\Gamma(1+\frac{n}2)}.
  • The “surface area” \omega_n :\equiv \hbox{Area}({\Bbb S}^{n-1}) of the sphere {\Bbb S}^{n-1} :\equiv \{x \in {\Bbb R}^n | s/t |x|=1\} = \partial B^n is given by \omega_n = (n+1) \Omega_{n+1}.

Note: \Omega_{n+2} = \frac{\pi}{n+1}\Omega_n, so: \Omega_{2n} = \frac{\pi^n}{(2n-1)!!} and \Omega_{2n+1} = \frac{8 \pi^n}{3(2n)!!}.

Examples:
\begin{array}{ | c | c | c | c | c | c | c | c |} \hline n & 2 & 3 & 4 & 5 & 6 & 7 & 8 \\ \hline \Omega_n & \pi & \frac{4\pi}{3} & \frac{\pi^2}2 & \frac{\pi^2}3 & \frac{\pi^3}{10} & \frac{\pi^3}{18} & \frac{\pi^4}{70} \\ \hline \omega_{n-1} & 2\pi & 4\pi & 2\pi^2 & \frac{5\pi^2}{3} & \frac{3\pi^3}5 & \frac{7\pi^3}{18} & \frac{4\pi^4}{35} \\ \hline \end{array}

Alzer’s inequalities (as cited in [1]):

  • a \Omega_{n+1}^{\frac{n}{n+1}} \le \Omega_n \le b \Omega_{n+1}^{\frac{n}{n+1}}, where a=\frac{2}{\sqrt{2}} = 1.128,37\cdots, b=\sqrt{e}=1.648,72\cdots;
  • \sqrt{\frac{n+A}{2\pi}} \le \frac{\Omega_{n-1}}{\Omega_n} \le \sqrt{\frac{n+B}{2\pi}}, where A=\frac12 and B=\frac\pi2-1=0.570,79\cdots;
  • \left(1+\frac1{n}\right)^\alpha \le \frac{\Omega_n^2}{\Omega_{n-1}\Omega_{n+1}} \le \left(1+\frac1{n}\right)^\beta, where \alpha=2-\frac{\ln(\pi)}{\ln(2)} = 0.348,50\cdots and \beta=\frac12.

Sources:

  1. [1] “Topics in Special Functions” by G. D. Anderson, M. K. Vamanamurthy, M. Vuorinen – http://arxiv.org/abs/0712.3856

Library of metrics

Filed under: General relativity, geometry — Tags: , , — sandokan65 @ 09:42

ADM decomposition

In D=1+3 dimensions the ADM (Arnowitt-Deser-Misner) split of the metric is given by (i,j\in\overline{1,3}, \mu,\nu\in\overline{0,3}):

ds^2 = -N^2 dt^2 + g_{ij}^{(3)}(dx^i+N^i dt)(dx^j+N^j dt)
where N is the lapse variable, N^i is the shift 3-vector.

Here:

  • R = K_{ij}K^{ij} - K^2 + R^{(3)} + 2\nabla_\mu (n^\mu \nabla_\nu n^\nu - n^\nu \nabla_\nu n^\mu) is the Ricci scalar,
  • K_{ij} :\equiv \frac1{2N} (\dot{g}_{ij}^{(3)} - \nabla_i^{(3)} N_j - \nabla_j^{(3)} N_i) is the extrinsic curvature, K :\equiv g^{ij}K_{ij}.

Source: “Unifying inflation with dark energy in modified F(R) Horava-Lifshitz gravity” by E. Elizalde, S. Nojiri, S. D. Odintsov, D. Saez-Gomez; arXiv.org > hep-th > arXiv:1006.3387 (http://arxiv4.library.cornell.edu/abs/1006.3387).

More:

Older Posts »
May 2024
M T W T F S S
 12345
6789101112
13141516171819
20212223242526
2728293031  

  • Categories

  • Archives

  • Join 37 other subscribers

  • Recent Posts

  • atheism awk bash bookmarklets books climate change cloud computing critical thinking crypto cygwin evolution excel Exponential splittings facebook facebook dirty tricks Facebook privacy firefox fitness Gamma function health infosec Integral Transforms JavaScript knowledge management language acquisition LaTeX latin language learning language learning languages linguistics linux martial arts math Matrix exponentials MD5 meme memetics Moore-Penrose inverse music nessus networking nmap opression password 7 password cracking patents Penetration testing Perl physics powershell privacy productivity regular expressions religion scripting security tools sed shell skills Snopes software patents SourceForge ssh SSL SSl certificates sums surveilance text processing tracking transcendental numbers transformers TSA unix WikiLeaks workout

    • Blog at WordPress.com.