Search results

Jump to navigation Jump to search
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • ...-from-infinities-20230406/|title=How to Tame the Endless Infinities Hiding in the Heart of Particle Physics|last=Wood|first=Charlie|website=Quanta Magazi ...ifferential equations]], in [[perturbation theory]] and in [[quantum field theory]]. ...
    5 KB (720 words) - 18:42, 6 February 2025
  • ...</math> a [[bimorphism]], and <math>\sigma</math> a [[Monomorphism#Related concepts|strong monomorphism]].<ref>A [[monomorphism]] <math>\mu:C\to D</math> is sa ...on.]] If it exists, the nodal decomposition is unique up to an isomorphism in the following sense: for any two nodal decompositions <math>\varphi=\sigma ...
    9 KB (1,208 words) - 07:23, 23 April 2024
  • ...such as conceptual [[Similarity (psychology)|similarity]] and [[prototype theory]]. ...r geometric knowledge representation |series=[[Synthese]] library: studies in epistemology, logic, methodology, and philosophy of science |volume=359 |lo ...
    4 KB (532 words) - 22:44, 28 April 2024
  • | thesis_title = Topics in Homology Theory | known_for = [[Enriched category theory]] ...
    5 KB (628 words) - 23:32, 8 December 2024
  • ...th>x_T := (x_s)_{s\in S}</math> such that <math>x_s = 1</math> if <math>s \in T</math> and <math>x_s = 0</math> if <math>s \notin T.</math> ...x_T = (x_1,x_2,\ldots,x_n)</math> where <math>x_i = 1</math> if <math>s_i \in T</math> and <math>x_i = 0</math> if <math>s_i \notin T.</math> ...
    2 KB (390 words) - 03:19, 8 February 2025
  • ...an (2005)<ref>Ryckman 2005, p. 22.</ref>). A frame of reference provides a set of coordinates for an observer moving with that frame to make measurements [[Special relativity]] considers observers in [[Inertial frame of reference|inertial frames]], and the covariance group c ...
    3 KB (363 words) - 03:01, 25 July 2023
  • ...of sets. Randolph diagrams were created by mathematician John F. Randolph in 1965, during his tenure at the [[University of Arkansas]]. ...each line as ''belonging to'' or ''relating to'' one logical statement or set. Any dot above the line indicates truth or inclusion and below the line ind ...
    10 KB (1,432 words) - 17:08, 6 September 2024
  • ...Almgren, Jr.]] and his student [[Jon T. Pitts]]) is an analogue of [[Morse theory]] for [[hypersurface]]s. ...g/abs/math/0303305 The min-max construction of minimal surfaces]", Surveys in Differential Geometry</ref> ...
    7 KB (980 words) - 12:04, 24 June 2024
  • In [[discrete mathematics]], a '''discrete fixed-point''' is a [[fixed point ( ...e fixed point analysis and its applications|journal=Journal of Fixed Point Theory and Applications|language=en|volume=6|issue=2|pages=351–371|doi=10.1007/s11 ...
    9 KB (1,375 words) - 14:29, 2 March 2024
  • In [[category theory]], a branch of mathematics, the '''formal criteria for adjoint functors''' ...{{harvnb|Freyd|2003|loc=Chapter 3. (pp.84–)}}</ref> an Introduction to the Theory of Functors'': ...
    6 KB (882 words) - 17:31, 16 August 2024
  • ...er than the set of states. It was created by [[Grigore Roșu]] and is used in the K Framework. ...is.edu/publications/rosu-2017-lmcs.pdf}}</ref> Statements evaluate to the set of values that "match" them, not to true or false. ...
    3 KB (522 words) - 14:20, 2 April 2024
  • '''Minimal algebra''' is an important concept in tame congruence theory, a theory that has been developed by [[Ralph McKenzie]] and David Hobby.<ref name="Ho ...ngs]]). These algebras provide intriguing connections between mathematical concepts and are classified into different types, including affine, Boolean, lattice ...
    3 KB (407 words) - 10:20, 23 August 2024
  • ...h>f(x) = f(c)</math> then <math>x \in C</math>). Said more succinctly, the set <math>C</math> is called saturated if <math>C = f^{-1}(f(C)).</math> ...n subsets]] of <math>X.</math> In a [[T1 space|T<sub>1</sub> space]] every set is saturated. ...
    6 KB (1,131 words) - 12:03, 8 December 2023
  • {{short description|Concept in mathematics}} ...line]] (purple) in two points (red). The disk (yellow) intersects the line in the [[line segment]] between the two red points.]] ...
    6 KB (934 words) - 12:00, 11 December 2024
  • ...as [[morphism]]s between them. One of the basic thrusts of representation theory is to understand the conditions under which this [[category (mathematics)|c {{See also|Representation theory of finite groups#Representations, modules and the convolution algebra|Isomo ...
    7 KB (993 words) - 20:28, 12 February 2025
  • ...nt from the 1-D case, because the multi-dimensional [[polynomials]] cannot in general be factored. This means that an arbitrary transfer function cannot ...n signal analysis and processing technology. Filters also play a main role in signal acquisition, transmission, processing and exchange. ...
    11 KB (1,694 words) - 08:12, 18 November 2022
  • ...ite parameters to estimate the power spectrum of multidimensional signals. In this article, we will be looking into the basics of methods used to estimat ...of [[sensors]] and [[Antenna (radio)|antennas]] and vibrational analysis. In the field of radio astronomy,<ref name="James"/> it is used to synchronize ...
    14 KB (2,185 words) - 07:09, 12 July 2024
  • {{Short description|Set of elements common to all of some sets}} ...math> and <math>B,</math> represented by circles. <math>A \cap B</math> is in red. ...
    12 KB (1,961 words) - 00:16, 27 December 2023
  • ...action lead to the development of the interpersonal adaptation theory. The theory states, individuals enter interactions with [[expectation (epistemic)|expec ...minant pattern, they conflict over which patterns are likely under a given set of conditions."<ref name=Burgoon1995 /> ...
    18 KB (2,482 words) - 15:11, 12 February 2025
  • ...ion|Collection of objects, each associated with an element from some index set}} ...e [[index set]]. For example, a family of [[real number]]s, indexed by the set of [[integer]]s, is a collection of real numbers, where a given function se ...
    9 KB (1,561 words) - 20:04, 19 December 2024
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)