enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. 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.

  3. COIN-OR - Wikipedia

    en.wikipedia.org/wiki/COIN-OR

    It is designed to be as reliable as any commercial solver, although several times slower, [3] and to be able to tackle very large problems. CLP is designed to solve linear programming problems such as : minimize + subject to problem constraints of the following form

  4. 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.

  5. TK Solver - Wikipedia

    en.wikipedia.org/wiki/TK_Solver

    Variables in a rule are automatically posted to the Variable Sheet when the rule is entered and the rule is displayed in mathematical format in the MathLook View window at the bottom of the screen. Any variable can operate as an input or an output, and the model [8] will be solved for the output variables depending on the choice of inputs.

  6. 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.

  7. SolverStudio - Wikipedia

    en.wikipedia.org/wiki/SolverStudio

    SolverStudio is a free Excel plug-in developed at the University of Auckland [1] that supports optimization and simulation modelling in a spreadsheet using an algebraic modeling language. It is popular in education, [ 2 ] the public sector [ 3 ] and industry for optimization users because it uses industry-standard modelling languages and is ...

  8. List of open-source software for mathematics - Wikipedia

    en.wikipedia.org/wiki/List_of_open-source...

    SageMath is designed partially as a free alternative to the general-purpose mathematics products Maple and MATLAB. It can be downloaded or used through a web site. SageMath comprises a variety of other free packages, with a common interface and language. SageMath is developed in Python.

  9. j-invariant - Wikipedia

    en.wikipedia.org/wiki/J-invariant

    In mathematics, Felix Klein's j-invariant or j function, regarded as a function of a complex variable τ, is a modular function of weight zero for special linear group SL(2, Z) defined on the upper half-plane of complex numbers. It is the unique such function that is holomorphic away from a simple pole at the cusp such that