enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Euler's continued fraction formula - Wikipedia

    en.wikipedia.org/wiki/Euler's_continued_fraction...

    In the analytic theory of continued fractions, Euler's continued fraction formula is an identity connecting a certain very general infinite series with an infinite continued fraction. First published in 1748, it was at first regarded as a simple identity connecting a finite sum with a finite continued fraction in such a way that the extension ...

  3. List of representations of e - Wikipedia

    en.wikipedia.org/wiki/List_of_representations_of_e

    This last non-simple continued fraction (sequence A110185 in the OEIS), equivalent to = [;,,,,,...], has a quicker convergence rate compared to Euler's continued fraction formula [clarification needed] and is a special case of a general formula for the exponential function:

  4. Sobolev space - Wikipedia

    en.wikipedia.org/wiki/Sobolev_space

    There are examples of irregular Ω such that , is not even a vector subspace of , for 0 < s < 1 (see Example 9.1 of [8]) From an abstract point of view, the spaces W s , p ( Ω ) {\displaystyle W^{s,p}(\Omega )} coincide with the real interpolation spaces of Sobolev spaces, i.e. in the sense of equivalent norms the following holds:

  5. Algebraic number field - Wikipedia

    en.wikipedia.org/wiki/Algebraic_number_field

    Then an integral basis is [1, x, 1/2(x 2 + 1)], and the corresponding integral trace form is []. The "3" in the upper left hand corner of this matrix is the trace of the matrix of the map defined by the first basis element (1) in the regular representation of K {\displaystyle K} on K {\displaystyle K} .

  6. Union-closed sets conjecture - Wikipedia

    en.wikipedia.org/wiki/Union-closed_sets_conjecture

    The union-closed sets conjecture, also known as Frankl’s conjecture, is an open problem in combinatorics posed by Péter Frankl in 1979. A family of sets is said to be union-closed if the union of any two sets from the family belongs to the family.

  7. Kőnig's theorem (graph theory) - Wikipedia

    en.wikipedia.org/wiki/Kőnig's_theorem_(graph...

    1 V is a vector of |V| ones and A G is the incidence matrix of G, so the third line indicates the constraint that the sum of weights near each vertex is at most 1. Similarly, the minimum fractional vertex-cover size in = (,) is the solution of the following LP: Minimize 1 V · y. Subject to: y ≥ 0 V _____ A G T · y ≥ 1 E.

  8. Electrical length - Wikipedia

    en.wikipedia.org/wiki/Electrical_length

    The electrical length of a conductor with a physical length of at a given frequency is the number of wavelengths or fractions of a wavelength of the wave along the conductor; in other words the conductor's length measured in wavelengths [6] [1] [2]