Search results

Jump to navigation Jump to search
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • ...gly regular and perfect line graphs|triangulated graphs|Chordal graph|data graphs plotted across three variables|Ternary plot}} !colspan="2"|Example graphs ...
    36 KB (5,352 words) - 18:48, 29 May 2026
  • ...ts of unity]] under multiplication is isomorphic to the group of rotations of the regular pentagon under composition. | alt1 = Fifth roots of unity ...
    19 KB (2,909 words) - 16:53, 12 May 2026
  • {{Short description|Group in which the order of every element is a power of p}} ...entity element]]. The orders of different elements may be different powers of ''p''. ...
    21 KB (3,242 words) - 01:29, 24 September 2025
  • {{Short description|Study of discrete mathematical structures}} ...ing [[graph property|mathematical properties]], their usefulness as models of real-world problems, and their importance in developing computer [[algorith ...
    26 KB (3,634 words) - 15:58, 31 March 2026
  • {{Short description|Mathematical space with a notion of closeness}} ...e are several equivalent definitions of a topology, the most commonly used of which is the definition through [[open set]]s. ...
    28 KB (4,287 words) - 18:15, 8 May 2026
  • ...ield on vertices connected by edges|graphs of mathematical functions|Graph of a function|other uses|Graph (disambiguation)}} {{short description|Area of discrete mathematics}} ...
    74 KB (10,404 words) - 20:14, 11 May 2026
  • {{Short description|Branch of discrete mathematics}} ...ematical structure|structures]]. It is closely related to many other areas of mathematics and has many applications ranging from [[logic]] to [[statistic ...
    34 KB (4,661 words) - 22:21, 14 May 2026
  • {{Short description|Relationship between elements of two sets}} ...n two finite sets of [[natural numbers]], A and B. Note that R is a subset of the [[Cartesian product]], A ''×'' B. In this example, R = {(a, b) ∈ A ''×' ...
    63 KB (9,792 words) - 14:09, 20 May 2026
  • {{short description|Mathematical proposition equivalent to the axiom of choice}} ...phs in Mathematics|year=2003}}</ref> Zorn's lemma is not needed for finite graphs, such as the one pictured here.]] ...
    45 KB (7,526 words) - 04:41, 24 May 2026
  • {{Short description|Mathematical group of the homotopy classes of loops in a topological space}} {{For|the fundamental group of a factor|von Neumann algebra}}{{Not to be confused with|Simple group}} ...
    55 KB (8,729 words) - 17:49, 10 May 2026
  • ...priate, as this image does not properly clarify what associative property (of string concatenation or anything else) is and creates confusion rather than ...up associative image.svg|thumb|right|upright=1.75|The associative property of string concatenation.]] -->{{Confused|quasigroups}} ...
    39 KB (5,844 words) - 17:12, 30 April 2026
  • ...]s with identity. Such [[algebraic structure]]s occur in several branches of mathematics. ...unction composition. More generally, in [[category theory]], the morphisms of an [[object (category theory)|object]] to itself form a monoid, and, conver ...
    35 KB (5,167 words) - 22:06, 25 May 2026
  • [[Image:EllipticCurveCatalog.svg|right|thumb|392px|A catalog of elliptic curves. The region shown is {{math|''x'', ''y'' ∈ [−3,3]}}.<br>(Fo ...n the curve can be described as a [[plane algebraic curve]] which consists of solutions {{math|(''x'', ''y'')}} for: ...
    54 KB (8,676 words) - 09:57, 12 April 2026
  • ...s are [[square]]s. It may be regarded as a finite and connected [[subset]] of the regular [[square tiling]]. ...''[[Fairy Chess Review]]'' between the years 1937 and 1957, under the name of "dissection problems." The name ''polyomino'' was invented by [[Solomon W. ...
    41 KB (5,851 words) - 15:10, 30 April 2026
  • {{for|a different notion of tree automaton|tree walking automaton}} ...[[tree structure]]s, rather than the [[string (computer science)|strings]] of more conventional state machines. ...
    33 KB (4,211 words) - 01:58, 15 February 2026
  • ...where the red line intersects the polygon. The red line is a [[level set]] of the cost function, and the arrow indicates the direction in which we are op ...ee variables is a convex [[polyhedron]]. The surfaces giving a fixed value of the objective function are [[Plane (geometry)|planes]] (not shown). The lin ...
    62 KB (8,749 words) - 10:14, 27 April 2026
  • {{short description|Search algorithm finding the position of a target value within a sorted array}} |caption=Visualization of the binary search algorithm where 7 is the target value ...
    77 KB (11,543 words) - 12:36, 27 April 2026
  • ..., and four [[vertex (geometry)|vertices]]. The tetrahedron is the simplest of all the ordinary [[convex polytope|convex polyhedra]].<ref name="MW">{{Math ...tetrahedron is the [[three-dimensional]] case of the more general concept of a [[Euclidean geometry|Euclidean]] [[simplex]], and may thus also be called ...
    61 KB (8,716 words) - 21:41, 19 April 2026
  • {{Short description|Branch of mathematics that studies sets}} {{About|the branch of mathematics}} ...
    64 KB (9,273 words) - 16:09, 28 May 2026
  • {{about|3-dimensional polytopes|intersections of half-spaces in arbitrary dimension|N-dimensional polyhedron}} | title = Examples of polyhedra ...
    112 KB (15,232 words) - 04:52, 27 May 2026
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)