When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. List of mathematical artists - Wikipedia

    en.wikipedia.org/wiki/List_of_mathematical_artists

    Fine art: Geometric abstraction in Constructivist art [33] [34] Leonardo da Vinci: 1452–1519: Fine art: Mathematically-inspired proportion, including golden ratio (used as golden rectangles) [19] [35] Longhurst, Robert: 1949– Sculpture: Sculptures of minimal surfaces, saddle surfaces, and other mathematical concepts [36] Man Ray: 1890 ...

  3. Calculus on finite weighted graphs - Wikipedia

    en.wikipedia.org/wiki/Calculus_on_finite...

    An important ingredient in the calculus on finite weighted graphs is the mimicking of standard differential operators from the continuum setting in the discrete setting of finite weighted graphs. This allows one to translate well-studied tools from mathematics, such as partial differential equations and variational methods, and make them usable ...

  4. List of theorems - Wikipedia

    en.wikipedia.org/wiki/List_of_theorems

    Gradient theorem (vector calculus) Graph structure theorem (graph theory) Grauert–Riemenschneider vanishing theorem (algebraic geometry) Great orthogonality theorem (group theory) Green–Tao theorem (number theory) Green's theorem (vector calculus) Grinberg's theorem (graph theory) Gromov's compactness theorem (Riemannian geometry)

  5. Differential calculus - Wikipedia

    en.wikipedia.org/wiki/Differential_calculus

    In mathematics, differential calculus is a subfield of calculus that studies the rates at which quantities change. [1] It is one of the two traditional divisions of calculus, the other being integral calculus —the study of the area beneath a curve.

  6. Discrete mathematics - Wikipedia

    en.wikipedia.org/wiki/Discrete_mathematics

    Graph theory, the study of graphs and networks, is often considered part of combinatorics, but has grown large enough and distinct enough, with its own kind of problems, to be regarded as a subject in its own right. [14] Graphs are one of the prime objects of study in discrete mathematics.

  7. List of NP-complete problems - Wikipedia

    en.wikipedia.org/wiki/List_of_NP-complete_problems

    Minor testing (checking whether an input graph contains an input graph as a minor); the same holds with topological minors; Steiner tree, or Minimum spanning tree for a subset of the vertices of a graph. [2] (The minimum spanning tree for an entire graph is solvable in polynomial time.) Modularity maximization [5]

  8. Graph factorization - Wikipedia

    en.wikipedia.org/wiki/Graph_factorization

    1-factorization of the Desargues graph: each color class is a 1-factor. The Petersen graph can be partitioned into a 1-factor (red) and a 2-factor (blue). However, the graph is not 1-factorable. In graph theory, a factor of a graph G is a spanning subgraph, i.e., a subgraph that has the same vertex set as G.

  9. Discrete calculus - Wikipedia

    en.wikipedia.org/wiki/Discrete_calculus

    Meanwhile, calculus, originally called infinitesimal calculus or "the calculus of infinitesimals", is the study of continuous change. Discrete calculus has two entry points, differential calculus and integral calculus. Differential calculus concerns incremental rates of change and the slopes of piece-wise linear curves.