Namespaces
Variants
Views
Actions

Search results

Jump to: navigation, search

Page title matches

Page text matches

  • #Leave this line exactly as it is<pre> #These will be matched with the URLs of external (hotlinked) images
    483 bytes (78 words) - 14:30, 26 April 2017
  • #<!-- leave this line exactly as it is --> <pre> # Syntax is as follows:
    320 bytes (58 words) - 20:03, 21 February 2015
  • The group $\langle 4,3,2 \rangle$ abstractly presented as: ...\langle 3,3,2 \rangle$ as a subgroup of index 2. It occurs as a subgroup of the [[unit quaternion]]s.
    612 bytes (88 words) - 20:50, 23 November 2023
  • The exceptional group $G_4$ or $\langle 3,3,2 \rangle$, abstractly presented as: ...] $A_4$ as quotient by the centre and the [[quaternion group]] of order 8 as a quotient.
    764 bytes (115 words) - 20:46, 23 November 2023
  • This page is critized as anachronistic and needs urgent update. This entry could be mistaken as something from the
    317 bytes (50 words) - 20:59, 25 April 2012
  • The group $\langle 5,3,2 \rangle$ abstractly presented as: It is finite of order 120. It occurs as a subgroup of the [[unit quaternion]]s.
    520 bytes (74 words) - 14:29, 12 November 2023
  • ...e specifically working on structural aspects of sparse structures, as well as on limits of structures.
    384 bytes (56 words) - 16:04, 23 November 2013
  • ...s classes of numbers; [[conjunction]], [[disjunction]] and [[implication]] of propositions. ...A \times A$ (as for example division by zero is not defined). Properties of binary operations which occur in many contexts include
    1 KB (193 words) - 19:47, 13 November 2016
  • Here "decomposition" means a closed disjoint covering of a topological space, but the linked article "[[Decomposition]]" does not me ...t turns out to be the same thing as an upper semi-continuous decomposition as defined here. [[User:Richard Pinch|Richard Pinch]] ([[User talk:Richard Pi
    924 bytes (137 words) - 11:36, 10 December 2016
  • though it started in the 19th century, and is a very important area of modern (pure as well as applied) mathematics.
    363 bytes (64 words) - 11:12, 25 April 2012
  • ...uling problems, the problem of minimizing the makespan is as hard to solve as the [[travelling salesman problem]].
    309 bytes (46 words) - 12:27, 17 February 2021
  • ...d at the barycentre. Geometrically, the barycentre is at the [[centroid]] of the body.
    628 bytes (99 words) - 20:44, 5 December 2023
  • ...ontain elliptic points as well. Thus, an elliptic paraboloid consists only of elliptic points, and is an affine minimal surface.
    295 bytes (46 words) - 09:29, 27 June 2014
  • ...usion, according to Michele Autin, she herself transliterated her own name as "Sophie Kowalevski". [[User:Richard Pinch|Richard Pinch]] ([[User talk:Ri
    412 bytes (61 words) - 17:00, 24 March 2018
  • ...a''' is a branch of [[mathematics]]. The term is used in combinations such as [[homological algebra]], [[commutative algebra]], [[Linear-algebra(2)|linea An [[algebraic system]], consisting of a set with a family of algebraic operations.
    788 bytes (106 words) - 11:22, 9 April 2017
  • A term with a variety of meanings. ...l function]], such as $\exp(x+y) = \exp(x)\exp(y)$ or of a [[power]], such as $x^{yz} = (x^y)^z$.
    531 bytes (94 words) - 18:21, 19 December 2014
  • ...hen a computable real number is considered in the framework of some system of constructive mathematics (see [[Constructive analysis|Constructive analysis
    388 bytes (57 words) - 17:04, 7 February 2011
  • ...ously with its negation. In the language of propositional calculus the law of contradiction is expressed by This formula is derivable in classical as well as in intuitionistic [[Constructive propositional calculus|constructive propos
    421 bytes (57 words) - 13:51, 30 December 2018
  • ...nly if $P$ is balanced as an $R$-module, projective and finitely generated as an $\mathrm{End}_R P$-module.
    646 bytes (112 words) - 20:23, 10 October 2017
  • ...al{A}$-set (Suslin's criterion); and 2) it can be represented as the union of non-intersecting components (Luzin's criterion).
    356 bytes (55 words) - 21:57, 19 December 2014

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)