enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Modular group - Wikipedia

    en.wikipedia.org/wiki/Modular_group

    In mathematics, the modular group is the projective special linear group ⁡ (,) of matrices with integer coefficients and determinant, such that the matrices and are identified. The modular group acts on the upper-half of the complex plane by linear fractional transformations .

  3. Modular equation - Wikipedia

    en.wikipedia.org/wiki/Modular_equation

    That implies that any two rational functions F and G, in the function field of the modular curve, will satisfy a modular equation P(F,G) = 0 with P a non-zero polynomial of two variables over the complex numbers. For suitable non-degenerate choice of F and G, the equation P(X,Y) = 0 will actually define the modular curve.

  4. Modular form - Wikipedia

    en.wikipedia.org/wiki/Modular_form

    A modular function is a function that is invariant with respect to the modular group, but without the condition that it be holomorphic in the upper half-plane (among other requirements). Instead, modular functions are meromorphic : they are holomorphic on the complement of a set of isolated points, which are poles of the function.

  5. Satisfiability modulo theories - Wikipedia

    en.wikipedia.org/wiki/Satisfiability_modulo_theories

    In computer science and mathematical logic, satisfiability modulo theories (SMT) is the problem of determining whether a mathematical formula is satisfiable.It generalizes the Boolean satisfiability problem (SAT) to more complex formulas involving real numbers, integers, and/or various data structures such as lists, arrays, bit vectors, and strings.

  6. Haar measure - Wikipedia

    en.wikipedia.org/wiki/Haar_measure

    The modular function is a continuous group homomorphism from G to the multiplicative group of positive real numbers. A group is called unimodular if the modular function is identically 1 {\displaystyle 1} , or, equivalently, if the Haar measure is both left and right invariant.

  7. LP-type problem - Wikipedia

    en.wikipedia.org/wiki/LP-type_problem

    The discovery of linear time algorithms for linear programming and the observation that the same algorithms could in many cases be used to solve geometric optimization problems that were not linear programs goes back at least to Megiddo (1983, 1984), who gave a linear expected time algorithm for both three-variable linear programs and the ...

  8. Modular invariant theory - Wikipedia

    en.wikipedia.org/wiki/Modular_invariant_theory

    The matrices [e 1, ..., e n] are divisible by all non-zero linear forms in the variables X i with coefficients in the finite field F q. In particular the Moore determinant [0, 1, ..., n − 1] is a product of such linear forms, taken over 1 + q + q 2 + ... + q n – 1 representatives of ( n – 1)-dimensional projective space over the field.

  9. Modular representation theory - Wikipedia

    en.wikipedia.org/wiki/Modular_representation_theory

    Within finite group theory, character-theoretic results proved by Richard Brauer using modular representation theory played an important role in early progress towards the classification of finite simple groups, especially for simple groups whose characterization was not amenable to purely group-theoretic methods because their Sylow 2-subgroups ...

  1. Related searches modular linear group of two variables problem solver excel sample test questions and answers

    modular group in mathmodular group wikipedia
    modular group definition