id stringlengths 14 14 | text stringlengths 10 3.14k | title stringlengths 1 250 | embeddings listlengths 768 768 |
|---|---|---|---|
c_hl4ic40u3w3m | In mathematical analysis, the Cauchy index is an integer associated to a real rational function over an interval. By the Routh–Hurwitz theorem, we have the following interpretation: the Cauchy index of r(x) = p(x)/q(x)over the real line is the difference between the number of roots of f(z) located in the right half-pla... | Cauchy index | [
-0.6179105639457703,
-0.026703502982854843,
0.2172188013792038,
0.038448069244623184,
-0.14300014078617096,
0.3293686509132385,
-0.10084355622529984,
-0.36529573798179626,
0.17336785793304443,
-0.28359726071357727,
-0.22847895324230194,
0.4827438294887543,
-0.3085837960243225,
0.4049253761... |
c_scxuwnj5gvkt | In mathematical analysis, the universal chord theorem states that if a function f is continuous on and satisfies f ( a ) = f ( b ) {\displaystyle f(a)=f(b)} , then for every natural number n {\displaystyle n} , there exists some x ∈ {\displaystyle x\in } such that f ( x ) = f ( x + b − a n ) {\displaystyle f(x)=f\lef... | Universal chord theorem | [
-0.3322068452835083,
-0.06606321781873703,
0.4010508954524994,
-0.21640272438526154,
-0.08721749484539032,
0.32976293563842773,
-0.21380646526813507,
0.28430846333503723,
-0.28269141912460327,
-0.4571515619754791,
-0.5699694752693176,
0.541309654712677,
-0.4454677402973175,
0.2054960876703... |
c_35yd2rasda2g | In mathematical analysis, the Hilbert–Schmidt theorem, also known as the eigenfunction expansion theorem, is a fundamental result concerning compact, self-adjoint operators on Hilbert spaces. In the theory of partial differential equations, it is very useful in solving elliptic boundary value problems. | Hilbert–Schmidt theorem | [
-0.551821768283844,
-0.3194016218185425,
0.21629364788532257,
0.11326363682746887,
-0.18287663161754608,
-0.012409599497914314,
-0.42144709825515747,
-0.46855735778808594,
0.4556398093700409,
-0.38825052976608276,
-0.29900047183036804,
-0.11705571413040161,
-0.4691448211669922,
0.231620952... |
c_5lis8a4pdqwu | In mathematical analysis, the final value theorem (FVT) is one of several similar theorems used to relate frequency domain expressions to the time domain behavior as time approaches infinity. Mathematically, if f ( t ) {\displaystyle f(t)} in continuous time has (unilateral) Laplace transform F ( s ) {\displaystyle F(s... | Final value theorem | [
-0.5831866264343262,
-0.488934189081192,
0.8518837094306946,
-0.07019278407096863,
-0.02084043249487877,
0.305804044008255,
-0.06910368800163269,
-0.2376844584941864,
0.023582201451063156,
-0.6687686443328857,
-0.5254775285720825,
0.6226897239685059,
-0.00038569170283153653,
0.302971392869... |
c_28uyklxxco7m | In mathematical analysis, constructive function theory is a field which studies the connection between the smoothness of a function and its degree of approximation. It is closely related to approximation theory. The term was coined by Sergei Bernstein. | Constructive function theory | [
-0.284318745136261,
-0.07665795087814331,
0.026921475306153297,
-0.06690848618745804,
-0.36434635519981384,
0.11593055725097656,
-0.05300549045205116,
-0.27668628096580505,
0.4736110270023346,
-0.29472148418426514,
-0.3522685468196869,
0.6317700147628784,
-0.5240990519523621,
0.06536539644... |
c_dqwo65pb0gaf | In mathematical analysis, idempotent analysis is the study of idempotent semirings, such as the tropical semiring. The lack of an additive inverse in the semiring is compensated somewhat by the idempotent rule A ⊕ A = A {\displaystyle A\oplus A=A} . == References == | Idempotent analysis | [
-0.31409913301467896,
-0.36991241574287415,
0.03574967011809349,
-0.03912748768925667,
-0.37388476729393005,
-0.10090862214565277,
-0.25320401787757874,
-0.03234909102320671,
-0.06537221372127533,
-0.09431494772434235,
-0.6709964871406555,
0.20494720339775085,
-0.6222145557403564,
0.258376... |
c_5ev3dhu7bq90 | Kakutani's theorem extends this to set-valued functions. The theorem was developed by Shizuo Kakutani in 1941, and was used by John Nash in his description of Nash equilibria. It has subsequently found widespread application in game theory and economics. | Kakutani fixed-point theorem | [
-0.6490367650985718,
-0.011093861423432827,
-0.26021793484687805,
0.009297818876802921,
-0.5042900443077087,
0.31412699818611145,
-0.2833271622657776,
-0.46016138792037964,
0.3233298659324646,
-0.13496671617031097,
-0.17965729534626007,
-0.027966775000095367,
-0.46897178888320923,
0.601604... |
c_9v2fbcd9isfl | In mathematical analysis, the Kakutani fixed-point theorem is a fixed-point theorem for set-valued functions. It provides sufficient conditions for a set-valued function defined on a convex, compact subset of a Euclidean space to have a fixed point, i.e. a point which is mapped to a set containing it. The Kakutani fixe... | Kakutani fixed-point theorem | [
-0.2793031930923462,
0.13849206268787384,
-0.14750096201896667,
0.14421682059764862,
-0.5780216455459595,
0.20470787584781647,
-0.16491474211215973,
-0.24811522662639618,
0.3061453104019165,
-0.08011183142662048,
-0.32078418135643005,
-0.03957587480545044,
-0.23604844510555267,
0.359975486... |
c_3zqp8y9qwl7s | If the codomain has a structure of R {\displaystyle \mathbb {R} } -algebra, the same is true for the functions. The image of a function of a real variable is a curve in the codomain. In this context, a function that defines curve is called a parametric equation of the curve. When the codomain of a function of a real va... | Function of a real variable | [
-0.4030383825302124,
-0.2790979743003845,
0.2951257824897766,
0.021353235468268394,
-0.26258745789527893,
0.31389865279197693,
-0.2265632599592209,
0.06535398215055466,
0.053966451436281204,
-0.5194225311279297,
-0.4463605582714081,
0.6601420640945435,
-0.353793740272522,
0.255281150341033... |
c_1qhv2i8119o5 | In mathematical analysis, and applications in geometry, applied mathematics, engineering, and natural sciences, a function of a real variable is a function whose domain is the real numbers R {\displaystyle \mathbb {R} } , or a subset of R {\displaystyle \mathbb {R} } that contains an interval of positive length. Most r... | Function of a real variable | [
-0.3790336847305298,
-0.07194948941469193,
0.359874963760376,
0.1847422868013382,
-0.24868088960647583,
0.3006015717983246,
-0.2237049639225006,
0.25029098987579346,
-0.13157397508621216,
-0.3666120767593384,
-0.41320860385894775,
0.5982415080070496,
-0.3471672236919403,
0.4777946472167969... |
c_nyzvymtzjlvn | However, it is often assumed to have a structure of R {\displaystyle \mathbb {R} } -vector space over the reals. That is, the codomain may be a Euclidean space, a coordinate vector, the set of matrices of real numbers of a given size, or an R {\displaystyle \mathbb {R} } -algebra, such as the complex numbers or the qua... | Function of a real variable | [
-0.39436081051826477,
-0.2775333821773529,
0.48693355917930603,
0.07449508458375931,
-0.26610782742500305,
0.2896295189857483,
-0.2761949896812439,
0.056146565824747086,
-0.05033788084983826,
-0.26146626472473145,
-0.16593511402606964,
0.6570484638214111,
-0.4439590871334076,
0.36368548870... |
c_ooyjnr72ousd | In mathematical analysis, a space-filling curve is a curve whose range reaches every point in a higher dimensional region, typically the unit square (or more generally an n-dimensional unit hypercube). Because Giuseppe Peano (1858–1932) was the first to discover one, space-filling curves in the 2-dimensional plane are ... | Space-filling curves | [
-0.6908778548240662,
-0.0524396151304245,
0.3121704161167145,
0.08816532790660858,
-0.07272903621196747,
0.7878565788269043,
-0.49572449922561646,
-0.010248814709484577,
-0.0767240971326828,
-0.8450330495834351,
-0.5073217749595642,
0.24925272166728973,
-0.25491586327552795,
0.314394563436... |
c_w1gi2tk9j741 | In mathematical analysis, a strong measure zero set is a subset A of the real line with the following property: for every sequence (εn) of positive reals there exists a sequence (In) of intervals such that |In| < εn for all n and A is contained in the union of the In. (Here |In| denotes the length of the interval In.) ... | Strong measure zero set | [
-0.5581449866294861,
-0.32346007227897644,
-0.2039536088705063,
-0.3560347259044647,
-0.44548892974853516,
0.050686173141002655,
0.1790524274110794,
0.05703844875097275,
0.03383660688996315,
-0.31618064641952515,
-0.7239391207695007,
0.19402115046977997,
-0.5919227004051208,
0.153225883841... |
c_rcwego6totmb | Sierpiński proved in 1928 that the continuum hypothesis (which is now also known to be independent of ZFC) implies the existence of uncountable strong measure zero sets. In 1976 Laver used a method of forcing to construct a model of ZFC in which Borel's conjecture holds. These two results together establish the indepen... | Strong measure zero set | [
-0.5966061949729919,
-0.24696192145347595,
-0.08963758498430252,
-0.21681936085224152,
-0.6163331866264343,
0.0778406485915184,
0.1263861209154129,
-0.09434660524129868,
-0.3252975344657898,
-0.2132813036441803,
-0.36052608489990234,
0.26002174615859985,
-0.5195485353469849,
0.622892141342... |
c_36k604pzsyof | The following characterization of strong measure zero sets was proved in 1973: A set A ⊆ R has strong measure zero if and only if A + M ≠ R for every meagre set M ⊆ R.This result establishes a connection to the notion of strongly meagre set, defined as follows: A set M ⊆ R is strongly meagre if and only if A + M ≠ R fo... | Strong measure zero set | [
-0.578773558139801,
-0.04196867346763611,
0.025082604959607124,
-0.3580304682254791,
-0.6756467223167419,
-0.005507700145244598,
0.2902190685272217,
-0.19399917125701904,
-0.12461840361356735,
-0.18426303565502167,
-0.6197904348373413,
0.15964102745056152,
-0.2960728704929352,
0.3825571238... |
c_j9khdlunmqoa | In mathematical biology, van den Driessche's contributions include important work on delay differential equations and on Hopf bifurcations, and the effects of changing population size and immigration on epidemics.She has also done more fundamental research in linear algebra, motivated by applications in mathematical bi... | Pauline van den Driessche | [
0.010568255558609962,
0.05206095054745674,
-0.5598503351211548,
-0.44649097323417664,
-0.05556962639093399,
1.0740734338760376,
0.33271655440330505,
-0.5135511755943298,
-0.39205053448677063,
-0.5306997299194336,
0.3947714567184448,
-0.3083656132221222,
-0.049450747668743134,
0.17453898489... |
c_pm1faufk8xvv | In mathematical cryptography, a Kleinian integer is a complex number of the form m + n 1 + − 7 2 {\displaystyle m+n{\frac {1+{\sqrt {-7}}}{2}}} , with m and n rational integers. They are named after Felix Klein. The Kleinian integers form a ring called the Kleinian ring, which is the ring of integers in the imaginary q... | Kleinian integer | [
-0.1644732803106308,
-0.2286560982465744,
0.23886893689632416,
-0.029475579038262367,
-0.15238846838474274,
0.6482246518135071,
-0.04641414061188698,
-0.2992617189884186,
-0.37411919236183167,
0.14428503811359406,
-0.18163105845451355,
0.1695241630077362,
-0.49178409576416016,
0.4364496767... |
c_2a5150d2itg7 | In mathematical analysis, the maximum and minimum of a function are, respectively, the largest and smallest value taken by the function. Known generically as extremum, they may be defined either within a given range (the local or relative extrema) or on the entire domain (the global or absolute extrema) of a function. ... | Local maxima | [
-0.5132972002029419,
-0.3930198848247528,
0.035263240337371826,
0.22855006158351898,
-0.3872889280319214,
0.5766540765762329,
0.19447331130504608,
0.21060405671596527,
0.2639230489730835,
-0.6417582631111145,
-0.3572959005832672,
0.6944518685340881,
-0.3804251253604889,
0.384677916765213,
... |
c_fmduebhpxx67 | As defined in set theory, the maximum and minimum of a set are the greatest and least elements in the set, respectively. Unbounded infinite sets, such as the set of real numbers, have no minimum or maximum. In statistics, the corresponding concept is the sample maximum and minimum. | Local maxima | [
-0.1058667004108429,
-0.7072476744651794,
-0.04257405921816826,
0.25901514291763306,
-0.1253138929605484,
0.14768756926059723,
0.2943135201931,
0.3598945736885071,
0.022965405136346817,
-0.4402066171169281,
-0.49795323610305786,
0.4753516912460327,
-0.42075684666633606,
0.08539484441280365... |
c_o93t6a1dixi5 | In mathematical analysis, the mean value theorem for divided differences generalizes the mean value theorem to higher derivatives. | Mean value theorem for divided differences | [
-0.2763361930847168,
-0.5511908531188965,
0.4384825527667999,
-0.05901983380317688,
-0.05724873021245003,
0.17257818579673767,
-0.420232892036438,
-0.2166294902563095,
0.34732937812805176,
-0.38670864701271057,
-0.0360342413187027,
0.5398377180099487,
-0.11564749479293823,
0.28316253423690... |
c_ueebyjc1g5oc | In mathematical analysis, the Dirichlet kernel, named after the German mathematician Peter Gustav Lejeune Dirichlet, is the collection of periodic functions defined as where n is any nonnegative integer. The kernel functions are periodic with period 2 π {\displaystyle 2\pi } . The importance of the Dirichlet kernel com... | Dirichlet kernel | [
-0.665488600730896,
-0.41762951016426086,
0.15504059195518494,
-0.2226647287607193,
-0.5809885859489441,
0.34431666135787964,
0.047450121492147446,
-0.3626425564289093,
0.09099477529525757,
-0.12304352968931198,
-0.43753209710121155,
0.2767806947231293,
-0.5369381904602051,
0.3762654364109... |
c_87lj9xecycqc | Mikhlin studied also the spectrum of the operator pencil of the classical linear elastostatic operator or Navier–Cauchy operator A ( ω ) u = Δ 2 u + ω ∇ ( ∇ ⋅ u ) {\displaystyle {\boldsymbol {\mathcal {A}}}(\omega ){\boldsymbol {u}}=\Delta _{2}{\boldsymbol {u}}+\omega \nabla \left(\nabla \cdot {\boldsymbol {u}}\right)}... | Solomon Mikhlin | [
-0.21880634129047394,
-0.07782909274101257,
0.10852427035570145,
-0.23627837002277374,
-0.28036895394325256,
0.8415987491607666,
0.14179083704948425,
-0.7027773261070251,
-0.10441616922616959,
0.022967256605625153,
0.08871031552553177,
0.2312074899673462,
-0.4651193618774414,
0.50537699460... |
c_eiico05tbyt6 | He studied the error of the approximate solution for shells, similar to plane plates, and found out that this error is small for the so-called purely rotational state of stress. As a result of his study of this problem, Mikhlin also gave a new (invariant) form of the basic equations of the theory. He also proved a theo... | Solomon Mikhlin | [
-0.19136159121990204,
0.4317493736743927,
-0.4356321692466736,
0.05418095737695694,
-0.22171270847320557,
0.9219170808792114,
0.030830491334199905,
-0.5371731519699097,
0.1493007242679596,
-0.14621111750602722,
-0.056525129824876785,
0.2667435109615326,
-0.29925310611724854,
0.681119501590... |
c_44x0hmcbltls | Mikhlin studied its convergence and gave applications to special applied problems. He proved existence theorems for the fundamental problems of plane elasticity involving inhomogeneous anisotropic media: these results are collected in the book (Mikhlin 1957). Concerning the theory of shells, there are several Mikhlin's... | Solomon Mikhlin | [
0.06581621617078781,
0.4774762690067291,
-0.45040884613990784,
-0.07799416780471802,
-0.12660567462444305,
0.7039057016372681,
-0.08029554039239883,
-0.34463828802108765,
-0.10041996836662292,
0.01260941382497549,
-0.2388007938861847,
0.300438791513443,
-0.27894866466522217,
0.799687743186... |
c_ht9zkdaqh9d1 | In mathematical analysis, limit superior and limit inferior are important tools for studying sequences of real numbers. Since the supremum and infimum of an unbounded set of real numbers may not exist (the reals are not a complete lattice), it is convenient to consider sequences in the affinely extended real number sys... | Limit inferior | [
-0.2332429736852646,
-0.14481109380722046,
-0.0060760327614843845,
-0.021513687446713448,
-0.21063277125358582,
0.3524578809738159,
-0.16798190772533417,
-0.14384683966636658,
0.1992567926645279,
-0.6094290018081665,
-0.23303158581256866,
0.40738117694854736,
-0.1279589980840683,
0.4178420... |
c_1x4c6t21pxjk | In mathematical analysis, the rising sun lemma is a lemma due to Frigyes Riesz, used in the proof of the Hardy–Littlewood maximal theorem. The lemma was a precursor in one dimension of the Calderón–Zygmund lemma.The lemma is stated as follows: Suppose g is a real-valued continuous function on the interval and S is the... | Rising sun lemma | [
0.030368361622095108,
-0.21229581534862518,
0.40362319350242615,
-0.2704356908798218,
0.15210260450839996,
0.16130170226097107,
0.2520439326763153,
-0.3067008852958679,
-0.22005683183670044,
-0.46584033966064453,
-0.5480107665061951,
0.23544129729270935,
-0.36961379647254944,
0.31615704298... |
c_xskmiar6tw57 | Each set of seven uses every line of a Fano plane, labelled with the numbers 1 to 7, and 8 to 14. At least two of the three randomly chosen numbers must be in one Fano plane set, and any two points on a Fano plane are on a line, so there will be a ticket in the collection containing those two numbers. There is a (6/13)... | Transylvania lottery | [
-0.05335086211562157,
-0.04907682165503502,
0.34910786151885986,
0.09183171391487122,
0.15135334432125092,
0.45925870537757874,
-0.11397230625152588,
-0.4282073378562927,
-0.06747367978096008,
-0.3564181923866272,
0.19193190336227417,
0.17805969715118408,
-0.15324755012989044,
0.4284331500... |
c_lgw8pphziufq | In mathematical combinatorics, the Transylvania lottery is a lottery where players selected three numbers from 1-14 for each ticket, and then three numbers are chosen randomly. A ticket wins if two of the numbers match the random ones. The problem asks how many tickets the player must buy in order to be certain of winn... | Transylvania lottery | [
-0.2668573558330536,
-0.18023404479026794,
0.2614161968231201,
0.25225159525871277,
-0.06023214012384415,
0.46865877509117126,
-0.0809083878993988,
-0.31878674030303955,
-0.07030794024467468,
-0.21073222160339355,
0.01522904820740223,
0.09579341858625412,
-0.3783281743526459,
0.28549945354... |
c_x2a1jbftzt7w | In mathematical analysis, the Rademacher–Menchov theorem, introduced by Rademacher (1922) and Menchoff (1923), gives a sufficient condition for a series of orthogonal functions on an interval to converge almost everywhere. | Rademacher–Menchov theorem | [
-0.2816525399684906,
-0.1271297037601471,
0.3285001814365387,
-0.28054699301719666,
-0.23046688735485077,
0.5598114728927612,
0.16244502365589142,
-0.5535549521446228,
0.15586930513381958,
-0.29583844542503357,
-0.2539491057395935,
0.10937964171171188,
-0.32653969526290894,
0.4594607651233... |
c_472jo8hqam7i | The name "uniform norm" derives from the fact that a sequence of functions { f n } {\displaystyle \left\{f_{n}\right\}} converges to f {\displaystyle f} under the metric derived from the uniform norm if and only if f n {\displaystyle f_{n}} converges to f {\displaystyle f} uniformly.If f {\displaystyle f} is a continuo... | Chebyshev norm | [
-0.2385587990283966,
-0.4537723958492279,
0.6858785152435303,
-0.25406554341316223,
-0.5175463557243347,
0.3430306613445282,
-0.09073825180530548,
0.022009659558534622,
0.002338075079023838,
-0.27929139137268066,
-0.3566334545612335,
0.05038241669535637,
-0.4693428575992584,
0.421356379985... |
c_vyukr0vcpidx | In mathematical analysis, the uniform norm (or sup norm) assigns to real- or complex-valued bounded functions f {\displaystyle f} defined on a set S {\displaystyle S} the non-negative number ‖ f ‖ ∞ = ‖ f ‖ ∞ , S = sup { | f ( s ) |: s ∈ S } . {\displaystyle \|f\|_{\infty }=\|f\|_{\infty ,S}=\sup \left\{\,|f(s)|:s\in S... | Chebyshev norm | [
-0.397025465965271,
-0.5809154510498047,
0.5871512293815613,
-0.09265946596860886,
-0.48506513237953186,
0.2776576280593872,
-0.21826940774917603,
0.039785150438547134,
0.07727789133787155,
-0.29628241062164307,
-0.7105763554573059,
0.07784561067819595,
-0.6340735554695129,
0.3251331746578... |
c_ydxhdt2lmxax | In mathematical analysis, microlocal analysis comprises techniques developed from the 1950s onwards based on Fourier transforms related to the study of variable-coefficients-linear and nonlinear partial differential equations. This includes generalized functions, pseudo-differential operators, wave front sets, Fourier ... | Microlocalization functor | [
-0.3357408046722412,
-0.47934630513191223,
0.49752333760261536,
0.2986331582069397,
-0.05581950023770332,
0.5561638474464417,
-0.5970801711082458,
0.14819441735744476,
-0.1684122383594513,
-0.4637543261051178,
-0.33055421710014343,
0.4098592698574066,
-0.08981297165155411,
0.42658630013465... |
c_uodmgwqx9ucm | Such an integral is sometimes described as being of the "first" type or kind if the integrand otherwise satisfies the assumptions of integration. Integrals in the fourth form that are improper because f ( x ) {\displaystyle f(x)} has a vertical asymptote somewhere on the interval {\displaystyle } may be described as b... | Improper integrals | [
-0.3406386375427246,
-0.22960618138313293,
0.39788761734962463,
-0.012773343361914158,
-0.07219546288251877,
-0.1245265081524849,
0.11623765528202057,
-0.4370213747024536,
0.28495997190475464,
-0.45012927055358887,
-0.1962001472711563,
0.6178159117698669,
-0.3581453561782837,
0.19402135908... |
c_5biduppnpbal | If a regular definite integral (which may retronymically be called a proper integral) is worked out as if it is improper, the same answer will result. In the simplest case of a real-valued function of a single variable integrated in the sense of Riemann (or Darboux) over a single interval, improper integrals may be in ... | Improper integrals | [
-0.6348711848258972,
-0.21469646692276,
0.42806878685951233,
-0.06607363373041153,
-0.21502754092216492,
-0.06989050656557083,
0.11320044100284576,
-0.5721255540847778,
0.29605022072792053,
-0.23805896937847137,
0.010003572329878807,
0.7733518481254578,
-0.4755650460720062,
0.1102659478783... |
c_4tj6joi6y79v | The function f ( x ) {\displaystyle f(x)} can have more discontinuities, in which case even more limits would be required (or a more complicated principal value expression). Cases 2–4 are handled similarly. See the examples below. Improper integrals can also be evaluated in the context of complex numbers, in higher dim... | Improper integrals | [
-0.4614613652229309,
-0.06270667165517807,
0.03951536864042282,
-0.0027837343513965607,
-0.06706281751394272,
-0.10476814210414886,
0.05447385087609291,
-0.4589790403842926,
0.36925944685935974,
-0.4286474585533142,
-0.1466018408536911,
0.7577351927757263,
-0.3629456162452698,
0.0564340837... |
c_bngt2fbilcwl | In mathematical analysis, the Hardy–Littlewood inequality, named after G. H. Hardy and John Edensor Littlewood, states that if f {\displaystyle f} and g {\displaystyle g} are nonnegative measurable real functions vanishing at infinity that are defined on n {\displaystyle n} -dimensional Euclidean space R n {\displaysty... | Hardy–Littlewood inequality | [
-0.1848001927137375,
-0.06904032826423645,
0.29447928071022034,
-0.050730567425489426,
-0.3258166015148163,
0.30797821283340454,
0.15959866344928741,
-0.25459617376327515,
-0.445313423871994,
-0.6231493353843689,
-0.18947291374206543,
0.28579166531562805,
-0.35486188530921936,
0.2423635423... |
c_puw2gp2za5z6 | See the figures in this article for examples. The three defining points may also identify angles in geometric figures. For example, the angle with vertex A formed by the rays AB and AC (that is, the half-lines from point A through points B and C) is denoted ∠BAC or B A C ^ {\displaystyle {\widehat {\rm {BAC}}}} . | Corner angle | [
-0.08041872084140778,
-0.126174658536911,
0.4441297948360443,
-0.24751949310302734,
-0.2708902657032013,
0.04727281630039215,
-0.2093835175037384,
-0.10768910497426987,
0.1373406946659088,
-0.7378771901130676,
-0.06949128955602646,
0.3027701675891876,
-0.14848551154136658,
0.39977487921714... |
c_grtlw71cz2dq | In mathematical expressions, it is common to use Greek letters (α, β, γ, θ, φ, . . . ) | Corner angle | [
-0.19295582175254822,
0.14048705995082855,
0.38531067967414856,
-0.1607198417186737,
-0.19212807714939117,
0.6440185308456421,
-0.44711756706237793,
-0.1571827530860901,
0.06706992536783218,
-0.6880550384521484,
-0.024866169318556786,
0.289521187543869,
-0.21504047513008118,
0.431395977735... |
c_ppp4c0c5126h | as variables denoting the size of some angle (to avoid confusion with its other meaning, the symbol π is typically not used for this purpose). Lower case Roman letters (a, b, c, . . | Corner angle | [
-0.16360525786876678,
0.19051870703697205,
0.29551374912261963,
-0.32237690687179565,
-0.17490404844284058,
0.41910520195961,
-0.24907532334327698,
-0.188532754778862,
0.10828585177659988,
-0.5749362707138062,
-0.150181844830513,
0.32272249460220337,
-0.1327778398990631,
0.1163429021835327... |
c_15sm4lpugkb1 | In mathematical economics, Topkis's theorem is a result that is useful for establishing comparative statics. The theorem allows researchers to understand how the optimal value for a choice variable changes when a feature of the environment changes. The result states that if f is supermodular in (x,θ), and D is a lattic... | Topkis's Theorem | [
-0.4685685932636261,
-0.4096691906452179,
0.07428392767906189,
0.10787085443735123,
-0.23038503527641296,
0.5232817530632019,
0.009412829764187336,
-0.2686310410499573,
-0.35550785064697266,
0.06884030252695084,
-0.2950228750705719,
0.12905795872211456,
-0.8330950736999512,
0.1736224442720... |
c_t8pwbxg0no8w | Such a point, if it exists, is called a global minimum point of the function and its value at this point is called the global minimum (value) of the function. If the function takes − ∞ {\displaystyle -\infty } as a value then − ∞ {\displaystyle -\infty } is necessarily the global minimum value and the minimization prob... | Proper convex function | [
-0.7568252086639404,
-0.06558994948863983,
0.6797363758087158,
-0.03608286753296852,
-0.17218807339668274,
0.3109475374221802,
0.06746266782283783,
0.13753992319107056,
0.024789417162537575,
-0.40121787786483765,
-0.2027003914117813,
0.7397933006286621,
-0.5111098289489746,
0.0879606828093... |
c_5gcduzf2mcem | Extended real-valued function for which the minimization problem is not solved by any one of these three trivial cases are exactly those that are called proper. Many (although not all) results whose hypotheses require that the function be proper add this requirement specifically to exclude these trivial cases. If the p... | Proper convex function | [
-0.5032645463943481,
-0.006093668285757303,
0.37902069091796875,
0.1129317656159401,
-0.4831254482269287,
0.1440029740333557,
0.108986496925354,
0.07677130401134491,
0.21607668697834015,
-0.44760599732398987,
-0.41810178756713867,
0.7549737095832825,
-0.5034492611885071,
-0.206522285938262... |
c_dl11n5u502yw | In mathematical analysis, in particular the subfields of convex analysis and optimization, a proper convex function is an extended real-valued convex function with a non-empty domain, that never takes on the value − ∞ {\displaystyle -\infty } and also is not identically equal to + ∞ . {\displaystyle +\infty .} In conve... | Proper convex function | [
-0.5999810099601746,
-0.13979852199554443,
0.6851545572280884,
0.11622150987386703,
-0.2444521188735962,
0.35169854760169983,
0.043346770107746124,
0.075926274061203,
-0.15499524772167206,
-0.33698171377182007,
-0.29954850673675537,
0.5793602466583252,
-0.6555810570716858,
-0.0642947331070... |
c_gtozwvpyidlh | When evaluating the integral, t is held constant, and so it is considered to be a parameter. If we are interested in the value of F for different values of t, we then consider t to be a variable. The quantity x is a dummy variable or variable of integration (confusingly, also sometimes called a parameter of integration... | Parameter | [
-0.20949508249759674,
-0.4494021236896515,
0.26952633261680603,
0.0625944584608078,
-0.19154563546180725,
0.24462424218654633,
-0.2875117063522339,
-0.3233473300933838,
0.09864652901887894,
-0.2373126745223999,
0.11012744158506393,
0.6530902981758118,
-0.32163020968437195,
0.24456052482128... |
c_btf95eqtr02d | In mathematical analysis, integrals dependent on a parameter are often considered. These are of the form F ( t ) = ∫ x 0 ( t ) x 1 ( t ) f ( x ; t ) d x . {\displaystyle F(t)=\int _{x_{0}(t)}^{x_{1}(t)}f(x;t)\,dx.} In this formula, t is the argument of the function F, and on the right-hand side the parameter on which t... | Parameter | [
-0.19373708963394165,
-0.4159640073776245,
0.3576413691043854,
0.043475233018398285,
-0.24180124700069427,
0.34008094668388367,
-0.2734878659248352,
-0.44695809483528137,
0.29949048161506653,
-0.333788126707077,
0.06662648916244507,
0.900148868560791,
-0.3219488561153412,
0.129851788282394... |
c_d8r8tgiyg3mn | In mathematical analysis, the Pólya–Szegő inequality (or Szegő inequality) states that the Sobolev energy of a function in a Sobolev space does not increase under symmetric decreasing rearrangement. The inequality is named after the mathematicians George Pólya and Gábor Szegő. | Pólya–Szegő inequality | [
-0.153391033411026,
-0.12503014504909515,
-0.008921269327402115,
-0.28833499550819397,
-0.0876656323671341,
0.8987007141113281,
0.031683098524808884,
-0.6245658993721008,
-0.4310585558414459,
-0.3100155293941498,
-0.289041668176651,
0.006932386197149754,
-0.7386970520019531,
0.514252007007... |
c_xaprntlu9in1 | In mathematical analysis, a positively (or positive) invariant set is a set with the following properties: Suppose x ˙ = f ( x ) {\displaystyle {\dot {x}}=f(x)} is a dynamical system, x ( t , x 0 ) {\displaystyle x(t,x_{0})} is a trajectory, and x 0 {\displaystyle x_{0}} is the initial point. Let O := { x ∈ R n ∣ φ ( x... | Positive invariant set | [
-0.44134649634361267,
-0.37802889943122864,
0.528774619102478,
0.1568610966205597,
-0.23089437186717987,
0.027461674064397812,
-0.32008540630340576,
-0.22226473689079285,
-0.13250821828842163,
-0.31631624698638916,
-0.45903223752975464,
0.22982832789421082,
-0.6413841247558594,
0.155054599... |
c_9a1xwybe7kpk | In mathematical complex analysis, a quasiconformal mapping, introduced by Grötzsch (1928) and named by Ahlfors (1935), is a homeomorphism between plane domains which to first order takes small circles to small ellipses of bounded eccentricity. Intuitively, let f: D → D′ be an orientation-preserving homeomorphism betwee... | Quasiconformal map | [
-0.3498243987560272,
-0.485776424407959,
0.8251208662986755,
0.2386876493692398,
-0.4960165321826935,
-0.30242618918418884,
-0.18373873829841614,
-0.028357991948723793,
-0.10576080530881882,
-0.1126447394490242,
-0.5079271197319031,
0.2636708915233612,
-0.5124472975730896,
0.44786429405212... |
c_tc3w9rdaooto | In mathematical analysis, the Agranovich–Dynin formula is a formula for the index of an elliptic system of differential operators, introduced by Agranovich and Dynin (1962). | Agranovich–Dynin formula | [
-0.5748853087425232,
-0.05606278404593468,
0.32870206236839294,
-0.20332783460617065,
-0.19097568094730377,
0.49308252334594727,
-0.1668333262205124,
-0.5784325003623962,
0.11308666318655014,
0.015319256111979485,
-0.03829076141119003,
0.320499449968338,
-0.5364319682121277,
0.610824048519... |
c_w6mv7xsj3e7x | In mathematical analysis, the Weierstrass approximation theorem states that every continuous function defined on a closed interval can be uniformly approximated as closely as desired by a polynomial function. Because polynomials are among the simplest functions, and because computers can directly evaluate polynomials,... | Weierstrass approximation theorem | [
-0.6137576103210449,
-0.12861864268779755,
0.4086177349090576,
-0.19405286014080048,
-0.010456765070557594,
0.36920326948165894,
-0.04450157657265663,
-0.4242636263370514,
0.7067105770111084,
-0.5630850195884705,
-0.043252333998680115,
0.2659517824649811,
-0.6097286343574524,
0.24580097198... |
c_3nub7hbohpbb | His result is known as the Stone–Weierstrass theorem. The Stone–Weierstrass theorem generalizes the Weierstrass approximation theorem in two directions: instead of the real interval , an arbitrary compact Hausdorff space X is considered, and instead of the algebra of polynomial functions, a variety of other families of... | Weierstrass approximation theorem | [
-0.5104411244392395,
-0.06772955507040024,
0.11428302526473999,
-0.22440442442893982,
-0.2898821234703064,
0.326463520526886,
-0.061656203120946884,
-0.21370503306388855,
0.4254663288593292,
-0.6549251079559326,
-0.2552187144756317,
0.43068763613700867,
-0.5052277445793152,
0.4387658238410... |
c_rv1h5rfyh9dc | One well known example of this being applied would be in the movie Interstellar where Executive Director Kip Thorne helped create one of the most realistic depictions of a blackhole in film. The visual effects team under Paul Franklin took Kip Thorne's mathematical data and applied it into their own visual effects engi... | Multimedia | [
0.2989681661128998,
0.26079416275024414,
0.06104695796966553,
0.40983739495277405,
-0.028695926070213318,
-0.007134337443858385,
-0.3600250780582428,
0.0773625522851944,
-0.4929022789001465,
0.14423049986362457,
-0.4332309067249298,
0.4712524712085724,
-0.059313107281923294,
0.262130469083... |
c_bbjatgrhdwxs | In mathematical and scientific research, multimedia is mainly used for modeling and simulation. For example, a scientist can look at a molecular model of a particular substance and manipulate it to arrive at a new substance. Representative research can be found in journals such as the Journal of Multimedia. | Multimedia | [
0.36962032318115234,
0.23799572885036469,
-0.011120496317744255,
0.5828843712806702,
-0.07465403527021408,
-0.19237910211086273,
-0.36543476581573486,
0.26378270983695984,
-0.47418150305747986,
-0.5675719976425171,
-0.5007009506225586,
0.40687909722328186,
-0.21233253180980682,
0.295701652... |
c_p4mwk5hgv5dt | {\displaystyle Tf(x)=\int _{Y}K(x,y)f(y)\,dy.} If there exist real functions p ( x ) > 0 {\displaystyle \,p(x)>0} and q ( y ) > 0 {\displaystyle \,q(y)>0} and numbers α , β > 0 {\displaystyle \,\alpha ,\beta >0} such that ( 1 ) ∫ Y K ( x , y ) q ( y ) d y ≤ α p ( x ) {\displaystyle (1)\qquad \int _{Y}K(x,y)q(y)\,dy\leq... | Schur test | [
-0.5480002164840698,
-0.26309555768966675,
0.0858798548579216,
0.20241451263427734,
-0.3085591197013855,
0.3919055461883545,
0.15720055997371674,
-0.4803330600261688,
0.3631187677383423,
-0.40226462483406067,
0.016758808866143227,
0.14179040491580963,
-0.12761740386486053,
0.44153842329978... |
c_87caax1x4hr3 | In mathematical analysis, the Schur test, named after German mathematician Issai Schur, is a bound on the L 2 → L 2 {\displaystyle L^{2}\to L^{2}} operator norm of an integral operator in terms of its Schwartz kernel (see Schwartz kernel theorem). Here is one version. Let X , Y {\displaystyle X,\,Y} be two measurable s... | Schur test | [
-0.4745250642299652,
-0.3256501257419586,
0.03491256758570671,
-0.06767648458480835,
-0.5348856449127197,
0.3095693588256836,
-0.0766700804233551,
-0.3154566287994385,
0.2494347095489502,
-0.38834601640701294,
-0.19053992629051208,
0.261198490858078,
-0.39638856053352356,
0.178571939468383... |
c_psxpsqzage99 | In mathematical analysis, nullclines, sometimes called zero-growth isoclines, are encountered in a system of ordinary differential equations x 1 ′ = f 1 ( x 1 , … , x n ) {\displaystyle x_{1}'=f_{1}(x_{1},\ldots ,x_{n})} x 2 ′ = f 2 ( x 1 , … , x n ) {\displaystyle x_{2}'=f_{2}(x_{1},\ldots ,x_{n})} ⋮ {\displaystyle \v... | Nullcline | [
-0.289222776889801,
-0.47760310769081116,
0.11187504231929779,
0.1660303771495819,
-0.1760462075471878,
0.15797197818756104,
-0.010249155573546886,
0.2782878875732422,
-0.046907100826501846,
-0.6013117432594299,
-0.4198358952999115,
-0.22231580317020416,
-0.661634087562561,
0.6467802524566... |
c_hqcg9ef3sika | In mathematical analysis, the staircase paradox is a pathological example showing that limits of curves do not necessarily preserve their length. It consists of a sequence of "staircase" polygonal chains in a unit square, formed from horizontal and vertical line segments of decreasing length, so that these staircases c... | Staircase paradox | [
-0.17136481404304504,
-0.2617683410644531,
0.17849993705749512,
0.2140212059020996,
-0.046445466578006744,
0.36721929907798767,
0.528838038444519,
-0.5456271767616272,
-0.33245399594306946,
-0.2754308879375458,
-0.2840960621833801,
-0.30907854437828064,
-0.5707181096076965,
0.7132611870765... |
c_qe4optiqci0w | It shows that, for curves under uniform convergence, the length of a curve is not a continuous function of the curve.For any smooth curve, polygonal chains with segment lengths decreasing to zero, connecting consecutive vertices along the curve, always converge to the arc length. The failure of the staircase curves to ... | Staircase paradox | [
-0.2571929097175598,
-0.27537181973457336,
0.1800329089164734,
0.2947523295879364,
-0.20715054869651794,
0.31381756067276,
0.538021445274353,
-0.3045820891857147,
-0.23429720103740692,
-0.4218943417072296,
-0.14554040133953094,
0.007255421951413155,
-0.454824835062027,
0.7286071181297302,
... |
c_9oeg4aeoqeyb | In mathematical analysis, p-variation is a collection of seminorms on functions from an ordered set to a metric space, indexed by a real number p ≥ 1 {\displaystyle p\geq 1} . p-variation is a measure of the regularity or smoothness of a function. Specifically, if f: I → ( M , d ) {\displaystyle f:I\to (M,d)} , where (... | P-variation | [
-0.4540558159351349,
-0.5979646444320679,
0.7193512320518494,
-0.07127278298139572,
-0.4881143569946289,
0.5737982988357544,
-0.29643064737319946,
-0.27019038796424866,
-0.31791213154792786,
-0.5641806721687317,
-0.5322779417037964,
0.26446279883384705,
-0.23762524127960205,
0.267473965883... |
c_vhzl46wlpgc9 | In mathematical analysis, every convergent power series defines a function with values in the real or complex numbers. Formal power series over certain special rings can also be interpreted as functions, but one has to be careful with the domain and codomain. Let f = ∑ a n X n ∈ R ] , {\displaystyle f=\sum a_{n}X^{n}\... | Power series ring | [
-0.27527594566345215,
-0.5692565441131592,
0.5994046330451965,
-0.15440112352371216,
-0.32581648230552673,
-0.11887545883655548,
-0.04789481312036514,
-0.5247893333435059,
0.16501201689243317,
-0.4418364465236664,
-0.5534672141075134,
0.5174670219421387,
-0.4075588285923004,
0.160680100321... |
c_bry3orcebb9d | {\displaystyle f(x)=\sum _{n\geq 0}a_{n}x^{n}.} This series is guaranteed to converge in S {\displaystyle S} given the above assumptions on x {\displaystyle x} . Furthermore, we have ( f + g ) ( x ) = f ( x ) + g ( x ) {\displaystyle (f+g)(x)=f(x)+g(x)} and ( f g ) ( x ) = f ( x ) g ( x ) . | Power series ring | [
-0.1937984973192215,
-0.5899680852890015,
0.9717690944671631,
-0.05552631616592407,
-0.290254682302475,
-0.11952179670333862,
0.00900233257561922,
-0.3759678900241852,
-0.123435840010643,
-0.3688688576221466,
-0.3583779036998749,
0.6161479353904724,
-0.4361761212348938,
0.4148902893066406,... |
c_7fg6shi206hk | {\displaystyle (fg)(x)=f(x)g(x).} Unlike in the case of bona fide functions, these formulas are not definitions but have to be proved. Since the topology on R ] {\displaystyle R]} is the ( X ) {\displaystyle (X)} -adic topology and R ] {\displaystyle R]} is complete, we can in particular apply power series to other p... | Power series ring | [
-0.21992585062980652,
-0.4725327491760254,
0.7947329878807068,
-0.07118924707174301,
-0.32886162400245667,
-0.1555788218975067,
-0.054358966648578644,
-0.5698590874671936,
-0.10112887620925903,
-0.4267439842224121,
-0.44873538613319397,
0.5221934914588928,
-0.4055793285369873,
0.2589350938... |
c_en4nfi6mvxym | In mathematical complex analysis, Radó's theorem, proved by Tibor Radó (1925), states that every connected Riemann surface is second-countable (has a countable base for its topology). The Prüfer surface is an example of a surface with no countable base for the topology, so cannot have the structure of a Riemann surface... | Radó's theorem (Riemann surfaces) | [
-0.5381923317909241,
0.06824128329753876,
-0.20453740656375885,
-0.202858105301857,
-0.4691804349422455,
0.5143173336982727,
0.10906855762004852,
-0.4462028741836548,
0.0931437686085701,
-0.40053215622901917,
-0.01570190116763115,
0.15511669218540192,
-0.8403305411338806,
0.293613851070404... |
c_a03w2o1mz77b | In mathematical finance, a replicating portfolio for a given asset or series of cash flows is a portfolio of assets with the same properties (especially cash flows). This is meant in two distinct senses: static replication, where the portfolio has the same cash flows as the reference asset (and no changes need to be ma... | Replicating portfolio | [
0.10537593066692352,
-0.5210736393928528,
-0.1459130048751831,
0.318335622549057,
0.17460061609745026,
0.29880034923553467,
-0.3510631024837494,
-0.1495278775691986,
-0.49921515583992004,
-0.07001856714487076,
-0.10241661220788956,
0.835485577583313,
-0.28982648253440857,
0.634987175464630... |
c_grnhiladhd66 | The notion of a replicating portfolio is fundamental to rational pricing, which assumes that market prices are arbitrage-free – concretely, arbitrage opportunities are exploited by constructing a replicating portfolio. In practice, replicating portfolios are seldom, if ever, exact replications. Most significantly, unle... | Replicating portfolio | [
-0.00974857434630394,
-0.28219202160835266,
-0.1808699667453766,
0.5431463122367859,
0.2126844823360443,
0.24692726135253906,
-0.07782869786024094,
0.022033540531992912,
-0.28347840905189514,
-0.33108237385749817,
0.2057083398103714,
1.0255205631256104,
-0.29215872287750244,
0.704434871673... |
c_vvp24ggdjzn2 | In mathematical finite group theory, the Baer–Suzuki theorem, proved by Baer (1957) and Suzuki (1965), states that if any two elements of a conjugacy class C of a finite group generate a nilpotent subgroup, then all elements of the conjugacy class C are contained in a nilpotent subgroup. Alperin & Lyons (1971) gave a s... | Baer–Suzuki theorem | [
-0.37269917130470276,
-0.09590062499046326,
-0.260944664478302,
-0.22195175290107727,
-0.5373294949531555,
0.12233646214008331,
-0.1440889537334442,
-0.2648087441921234,
-0.3269365131855011,
0.08396165072917938,
-0.40024375915527344,
-0.05871322378516197,
-0.4270283877849579,
0.51903772354... |
c_rijutjngt4bo | In mathematical finance, Margrabe's formula is an option pricing formula applicable to an option to exchange one risky asset for another risky asset at maturity. It was derived by William Margrabe (PhD Chicago) in 1978. Margrabe's paper has been cited by over 2000 subsequent articles. | Margrabe's formula | [
-0.3331921696662903,
-0.25055840611457825,
0.009730237536132336,
-0.46702665090560913,
0.6860150694847107,
0.32885485887527466,
-0.450307697057724,
-0.36434808373451233,
0.14076274633407593,
-0.07066868990659714,
0.013658134266734123,
0.6670679450035095,
-0.14921990036964417,
0.40464416146... |
c_c8wxfu1gdhcj | In mathematical finance, the volatility risk premium is a measure of the extra amount investors demand in order to hold a volatile security, above what can be computed based on expected returns. It can be defined as the compensation for inherent volatility risk divided by the volatility beta. | Volatility risk premium | [
-0.17415614426136017,
-0.5191690921783447,
0.36786726117134094,
0.032489486038684845,
0.04431763291358948,
-0.10369254648685455,
-0.30776503682136536,
-0.14504854381084442,
-0.12134489417076111,
0.16917772591114044,
-0.459862619638443,
1.1601005792617798,
-0.31640222668647766,
0.3847242295... |
c_8uaognnplxym | In mathematical invariant theory, the canonizant or canonisant is a covariant of forms related to a canonical form for them. | Canonizant | [
-0.004127573687583208,
-0.11845411360263824,
0.13173428177833557,
-0.027996210381388664,
-0.36874380707740784,
0.2803056240081787,
0.1852477490901947,
-0.17209288477897644,
0.11749688535928726,
-0.13541574776172638,
-0.20148247480392456,
0.2783105671405792,
-0.1947423368692398,
0.335320770... |
c_pry42kdmesja | In mathematical invariant theory, the osculant or tacinvariant or tact invariant is an invariant of a hypersurface that vanishes if the hypersurface touches itself, or an invariant of several hypersurfaces that osculate, meaning that they have a common point where they meet to unusually high order. | Osculant | [
-0.43191003799438477,
-0.35259509086608887,
0.6140878200531006,
-0.0177640188485384,
-0.31693705916404724,
0.1196114718914032,
0.09090499579906464,
0.2777862846851349,
-0.0013047790853306651,
-0.40019816160202026,
-0.5410314202308655,
0.4657767415046692,
-0.43095386028289795,
0.16882525384... |
c_6vpxb3tvbtvd | In mathematical finite group theory, the classical involution theorem of Aschbacher (1977a, 1977b, 1980) classifies simple groups with a classical involution and satisfying some other conditions, showing that they are mostly groups of Lie type over a field of odd characteristic. Berkman (2001) extended the classical in... | Classical involution theorem | [
-0.5403261184692383,
-0.4172171950340271,
-0.185527503490448,
-0.24391904473304749,
-0.5107881426811218,
0.17723751068115234,
-0.08387095481157303,
-0.48315125703811646,
0.17882412672042847,
-0.21719121932983398,
-0.5905362367630005,
0.28294476866722107,
-0.45649293065071106,
0.09300078451... |
c_8cgw3qvm2pxp | In mathematical logic and computer science, homotopy type theory (HoTT ) refers to various lines of development of intuitionistic type theory, based on the interpretation of types as objects to which the intuition of (abstract) homotopy theory applies. This includes, among other lines of work, the construction of homot... | Univalence axiom | [
0.1866365522146225,
-0.2072606384754181,
-0.15205061435699463,
0.12835846841335297,
-0.42027080059051514,
0.14855381846427917,
0.04197611287236214,
-0.34350454807281494,
0.06434653699398041,
-0.16000600159168243,
-0.6325939893722534,
0.45875445008277893,
-0.5643402338027954,
0.117506742477... |
c_kqnqpt1xgj7k | Although neither is precisely delineated, and the terms are sometimes used interchangeably, the choice of usage also sometimes corresponds to differences in viewpoint and emphasis. As such, this article may not represent the views of all researchers in the fields equally. This kind of variability is unavoidable when a ... | Univalence axiom | [
0.42156004905700684,
-0.3584619164466858,
-0.011152169667184353,
0.12459903210401535,
-0.2772049605846405,
-0.2105899602174759,
0.08708811551332474,
-0.3858030438423157,
-0.17094570398330688,
-0.2069467455148697,
-0.30568575859069824,
0.29218438267707825,
-0.3691153824329376,
0.58305889368... |
c_7v9pxc0djz0i | If V {\displaystyle V} is a set of strings, then V ∗ {\displaystyle V^{*}} is defined as the smallest superset of V {\displaystyle V} that contains the empty string ε {\displaystyle \varepsilon } and is closed under the string concatenation operation. If V {\displaystyle V} is a set of symbols or characters, then V ∗ {... | Kleene star | [
-0.16314440965652466,
0.008886463940143585,
0.5255072116851807,
-0.15608824789524078,
-0.23031103610992432,
0.37385299801826477,
0.3329536020755768,
-0.252591609954834,
-0.03995711728930473,
-0.0819355919957161,
-0.4236820936203003,
0.17063136398792267,
-0.22597043216228485,
0.341288745403... |
c_5xuxzguq6qba | In mathematical logic and computer science, the Kleene star (or Kleene operator or Kleene closure) is a unary operation, either on sets of strings or on sets of symbols or characters. In mathematics, it is more commonly known as the free monoid construction. The application of the Kleene star to a set V {\displaystyle ... | Kleene star | [
0.05939116328954697,
-0.22503283619880676,
0.24608290195465088,
-0.11922997981309891,
-0.2742619514465332,
0.20465736091136932,
0.3315885066986084,
-0.21274925768375397,
-0.1062278151512146,
0.4455075263977051,
-0.8045744895935059,
-0.013576501049101353,
-0.8415668606758118,
0.513176202774... |
c_fis02p4wqglx | In mathematical group theory, the Schur multiplier or Schur multiplicator is the second homology group H 2 ( G , Z ) {\displaystyle H_{2}(G,\mathbb {Z} )} of a group G. It was introduced by Issai Schur (1904) in his work on projective representations. | Schur cover | [
-0.7467749714851379,
-0.3040757179260254,
0.33406344056129456,
-0.035016018897295,
-0.9725772738456726,
0.0039899214170873165,
-0.39296263456344604,
-0.21294452250003815,
0.062176842242479324,
-0.34096211194992065,
-0.6336891055107117,
-0.19609688222408295,
-0.6659859418869019,
0.444423377... |
c_ogips1fqd5mb | In mathematical knot theory, the Hopf link is the simplest nontrivial link with more than one component. It consists of two circles linked together exactly once, and is named after Heinz Hopf. | Hopf link | [
-0.12951837480068207,
-0.09294996410608292,
0.6787436008453369,
-0.014269446954131126,
-0.054669346660375595,
0.24155756831169128,
0.02437341772019863,
-0.30742430686950684,
-0.42612001299858093,
-0.38661935925483704,
-0.11689098924398422,
-0.7923585176467896,
-0.7559104561805725,
0.137085... |
c_mz23ddu2plqu | In mathematical logic and logic programming, a Horn clause is a logical formula of a particular rule-like form which gives it useful properties for use in logic programming, formal specification, and model theory. Horn clauses are named for the logician Alfred Horn, who first pointed out their significance in 1951. | Universal Horn theory | [
0.008378202095627785,
0.5844091773033142,
0.09571544080972672,
-0.19156043231487274,
-0.4955378472805023,
0.22676731646060944,
0.43299660086631775,
-0.36857831478118896,
-0.23049050569534302,
0.29843389987945557,
-0.5656814575195312,
0.31152743101119995,
-0.7200971841812134,
0.308183014392... |
c_16srhpgg7rf6 | In mathematical finite group theory, the Thompson transitivity theorem gives conditions under which the centralizer of an abelian subgroup A acts transitively on certain subgroups normalized by A. It originated in the proof of the odd order theorem by Feit and Thompson (1963), where it was used to prove the Thompson un... | Thompson transitivity theorem | [
-0.4929230213165283,
-0.3146568834781647,
-0.13777680695056915,
-0.3286610543727875,
-0.4055255949497223,
-0.023717891424894333,
-0.18466857075691223,
-0.017911182716488838,
-0.04624759778380394,
-0.018318939954042435,
-0.3661068081855774,
-0.15923216938972473,
-0.9244996309280396,
0.19659... |
c_4quex9pcq49c | In mathematical finite group theory, a Thompson factorization, introduced by Thompson (1966), is an expression of some finite groups as a product of two subgroups, usually normalizers or centralizers of p-subgroups for some prime p. | Thompson factorization | [
-0.5002411603927612,
-0.49102354049682617,
-0.15568570792675018,
-0.3315507173538208,
-0.2744549512863159,
0.35922524333000183,
-0.2931137681007385,
-0.24565547704696655,
-0.08025708794593811,
-0.0922529399394989,
-0.39571788907051086,
-0.08428405970335007,
-0.7316240668296814,
-0.36330875... |
c_rji790yn9m4y | In mathematical finite group theory, the concept of regular p-group captures some of the more important properties of abelian p-groups, but is general enough to include most "small" p-groups. Regular p-groups were introduced by Phillip Hall (1934). | Regular p-group | [
-0.4150189757347107,
-0.0722430944442749,
-0.12489794939756393,
-0.24554665386676788,
-0.8846317529678345,
0.2692541778087616,
-0.11941765248775482,
-0.07613149285316467,
-0.4465348422527313,
-0.042120542377233505,
-0.6841270327568054,
-0.17380304634571075,
-0.8809148669242859,
0.063699446... |
c_3uju06rykpib | From this point of view, quaternionic representation of a group G is a group homomorphism φ: G → GL(V, H), the group of invertible quaternion-linear transformations of V. In particular, a quaternionic matrix representation of g assigns a square matrix of quaternions ρ(g) to each element g of G such that ρ(e) is the ide... | Pseudoreal representation | [
-0.11229860037565231,
-0.39160361886024475,
0.714288592338562,
0.1370786726474762,
-0.08838193118572235,
0.47508907318115234,
-0.3473493754863739,
-0.2026808112859726,
0.006410993169993162,
-0.28984972834587097,
-0.10322300344705582,
0.5758923888206482,
-0.5133297443389893,
0.0504763461649... |
c_jis98rhm1t02 | In mathematical field of representation theory, a quaternionic representation is a representation on a complex vector space V with an invariant quaternionic structure, i.e., an antilinear equivariant map j: V → V {\displaystyle j\colon V\to V} which satisfies j 2 = − 1. {\displaystyle j^{2}=-1.} Together with the imagi... | Pseudoreal representation | [
-0.08352155238389969,
-0.39733409881591797,
0.7382263541221619,
0.16052746772766113,
-0.09458501636981964,
0.5228642821311951,
-0.33271679282188416,
-0.03037642315030098,
-0.0021988011430948973,
-0.3100155293941498,
-0.12853197753429413,
0.27483126521110535,
-0.3450726866722107,
0.18448278... |
c_7z495wkn9rdn | In mathematical finance, a risk-neutral measure (also called an equilibrium measure, or equivalent martingale measure) is a probability measure such that each share price is exactly equal to the discounted expectation of the share price under this measure. This is heavily used in the pricing of financial derivatives du... | Equivalent Martingale Measure | [
-0.10557767003774643,
-0.6797605752944946,
0.2758304178714752,
0.0023777177557349205,
-0.06322039663791656,
0.1371501386165619,
-0.5636416673660278,
-0.17182928323745728,
0.08921164274215698,
-0.1595500260591507,
-0.2448531836271286,
1.0928850173950195,
-0.17231522500514984,
0.332893669605... |
c_k9515ivgpvy5 | In mathematical group theory, a tame group is a certain kind of group defined in model theory. Formally, we define a bad field as a structure of the form (K, T), where K is an algebraically closed field and T is an infinite, proper, distinguished subgroup of K, such that (K, T) is of finite Morley rank in its full lang... | Tame group | [
-0.28261590003967285,
-0.15420763194561005,
-0.09347283095121384,
0.028945215046405792,
-0.6331206560134888,
-0.2599147856235504,
0.10798799246549606,
-0.07599959522485733,
-0.087088942527771,
-0.1857251077890396,
-0.6438520550727844,
-0.07253390550613403,
-1.0474668741226196,
0.3410263955... |
c_5nd6rbtrxlby | In mathematical group theory, the root datum of a connected split reductive algebraic group over a field is a generalization of a root system that determines the group up to isomorphism. They were introduced by Michel Demazure in SGA III, published in 1970. | Root data | [
-0.3749137818813324,
-0.27046999335289,
-0.14741715788841248,
0.3234421908855438,
-0.3374614417552948,
0.12528972327709198,
-0.050852254033088684,
-0.14630894362926483,
-0.20604568719863892,
0.007929733023047447,
-0.2733355164527893,
0.0949612632393837,
-0.22681333124637604,
0.177412107586... |
c_k3b44wxsv67t | In mathematical logic and computer science, two-variable logic is the fragment of first-order logic where formulae can be written using only two different variables. This fragment is usually studied without function symbols. | Two-variable logic with counting | [
-0.06830601394176483,
-0.03457097336649895,
-0.6707156896591187,
0.3979107439517975,
-0.3625255823135376,
-0.05649997293949127,
0.051825378090143204,
-0.28400537371635437,
-0.002468988299369812,
-0.14461073279380798,
-0.33544278144836426,
0.2007608711719513,
-0.44468438625335693,
-0.284588... |
c_zmcv9slvsx6y | In mathematical folklore, the no free lunch theorem (sometimes pluralized) of David Wolpert and William G. Macready appears in the 1997 "No Free Lunch Theorems for Optimization. "This mathematical result states the need for a specific effort in the design of a new algorithm, tailored to the specific problem to be optim... | Kimeme | [
-0.18802571296691895,
0.13540519773960114,
-0.33618035912513733,
0.1428551971912384,
-0.40200796723365784,
0.07298838347196579,
0.12970982491970062,
0.20588742196559906,
0.159750297665596,
-0.08174590766429901,
-0.4258670210838318,
0.23834997415542603,
-0.3684847056865692,
-0.1520969569683... |
c_cv8qqt1io5y4 | In mathematical finite group theory, the Puig subgroup, introduced by Puig (1976), is a characteristic subgroup of a p-group analogous to the Thompson subgroup. | Puig subgroup | [
-0.4701148569583893,
-0.3673867881298065,
0.06940647214651108,
-0.47424328327178955,
-0.5897703170776367,
0.41502460837364197,
-0.36638596653938293,
0.2715708017349243,
0.06060395389795303,
-0.23951013386249542,
-0.4648130238056183,
-0.14815643429756165,
-0.5249157547950745,
-0.26389345526... |
c_hdn6e4ykd1f2 | In mathematical knot theory, 74 is the name of a 7-crossing knot which can be visually depicted in a highly-symmetric form, and so appears in the symbolism and/or artistic ornamentation of various cultures. | 74 knot | [
0.3102445602416992,
0.01956942118704319,
0.361780047416687,
-0.21748703718185425,
-0.1986619383096695,
-0.06548716872930527,
0.4241293668746948,
-0.16339553892612457,
-0.45635151863098145,
-0.30084219574928284,
-0.4600299298763275,
-0.04698363319039345,
-0.3558259904384613,
0.0541061982512... |
c_y58rpzmf3125 | In mathematical finite group theory, a rank 3 permutation group acts transitively on a set such that the stabilizer of a point has 3 orbits. The study of these groups was started by Higman (1964, 1971). Several of the sporadic simple groups were discovered as rank 3 permutation groups. | Rank 3 permutation group | [
-0.5790233612060547,
0.18598291277885437,
0.277626097202301,
-0.5412412881851196,
-0.8450685739517212,
0.1580306440591812,
-0.05070088058710098,
-0.49669915437698364,
-0.23258337378501892,
-0.043185845017433167,
-0.4317842423915863,
-0.12035462260246277,
-0.9672696590423584,
0.164300635457... |
c_5x4pb7efh1g0 | In mathematical finance, the Black–Scholes equation is a partial differential equation (PDE) governing the price evolution of a European call or European put under the Black–Scholes model. Broadly speaking, the term may refer to a similar PDE that can be derived for a variety of options, or more generally, derivatives.... | Black-Scholes equation | [
-0.11336538195610046,
-0.6869764924049377,
0.10710658133029938,
-0.2343873679637909,
0.2933060824871063,
0.38376808166503906,
-0.3163348436355591,
-0.13962088525295258,
-0.05430947244167328,
-0.21305818855762482,
-0.3266966640949249,
0.7810893654823303,
-0.5383114218711853,
0.4729859232902... |
c_1r01xh9b2kir | In mathematical finance, if security weights maximize the expected geometric growth rate (which is equivalent to maximizing log wealth), then a portfolio is growth optimal. Computations of growth optimal portfolios can suffer tremendous garbage in, garbage out problems. For example, the cases below take as given the ex... | Kelly criterion | [
0.01822766847908497,
0.03272715210914612,
-0.11114369332790375,
0.285332590341568,
0.15048204362392426,
0.183867409825325,
-0.08220644295215607,
-0.46882665157318115,
-0.06355619430541992,
-0.3592216968536377,
-0.0986517146229744,
1.081268072128296,
-0.04621106758713722,
0.366047739982605,... |
c_98tishu6utuq | If portfolio weights are largely a function of estimation errors, then Ex-post performance of a growth-optimal portfolio may differ fantastically from the ex-ante prediction. Parameter uncertainty and estimation errors are a large topic in portfolio theory. An approach to counteract the unknown risk is to invest less t... | Kelly criterion | [
0.11896581202745438,
-0.07698432356119156,
-0.06514880806207657,
0.11934394389390945,
0.10876099020242691,
0.3423868715763092,
0.02107951231300831,
-0.4313823878765106,
0.16290690004825592,
-0.40405550599098206,
0.1657850444316864,
1.1099578142166138,
-0.1682761013507843,
0.297530025243759... |
c_zl2kb29xoimr | In mathematical finite group theory, the Dade isometry is an isometry from class function on a subgroup H with support on a subset K of H to class functions on a group G (Collins 1990, 6.1). It was introduced by Dade (1964) as a generalization and simplification of an isometry used by Feit & Thompson (1963) in their pr... | Dade isometry | [
-0.5378689169883728,
-0.20652399957180023,
-0.13012813031673431,
-0.15956580638885498,
-0.5428886413574219,
0.22281812131404877,
-0.20297887921333313,
-0.4060840308666229,
0.10059873759746552,
-0.1220787912607193,
-0.4055793881416321,
-0.1634867638349533,
-0.3527854084968567,
0.36653175950... |
c_s7r6gstcus2a | In mathematical field of representation theory, a symplectic representation is a representation of a group or a Lie algebra on a symplectic vector space (V, ω) which preserves the symplectic form ω. Here ω is a nondegenerate skew symmetric bilinear form ω: V × V → F {\displaystyle \omega \colon V\times V\to \mathbb {F}... | Symplectic representation | [
-0.39914023876190186,
-0.3615761995315552,
0.31515127420425415,
0.18101149797439575,
-0.24364115297794342,
0.16983747482299805,
-0.26600658893585205,
0.11086755990982056,
-0.2709430158138275,
-0.6272329092025757,
-0.7157595157623291,
0.14391285181045532,
-0.5115218162536621,
-0.01465250179... |
c_vevaozxmv6ym | In mathematical group theory, a C-group is a group such that the centralizer of any involution has a normal Sylow 2-subgroup. They include as special cases CIT-groups where the centralizer of any involution is a 2-group, and TI-groups where any Sylow 2-subgroups have trivial intersection. The simple C-groups were deter... | C-group | [
-0.5848292708396912,
-0.04847428575158119,
0.14835581183433533,
-0.06412341445684433,
-0.7854115962982178,
0.21464724838733673,
-0.20089346170425415,
-0.31955885887145996,
-0.2771601676940918,
0.012993726879358292,
-0.5846433639526367,
0.0018708076095208526,
-0.6262890100479126,
0.26040655... |
c_asq6ef548j4t | And when such volatility is merely a function of the current underlying asset level St and of time t, we have a local volatility model. The local volatility model is a useful simplification of the stochastic volatility model. | Local volatility | [
-0.5267587900161743,
-0.7298764586448669,
0.4578006863594055,
0.13755467534065247,
-0.08891089260578156,
0.1801232248544693,
-0.16926626861095428,
0.25650158524513245,
-0.17014604806900024,
-0.5400925874710083,
-0.26462677121162415,
0.861445426940918,
-0.24192814528942108,
0.44398859143257... |
c_8rje2dvhpq81 | In mathematical finance, the asset St that underlies a financial derivative is typically assumed to follow a stochastic differential equation of the form d S t = ( r t − d t ) S t d t + σ t S t d W t {\displaystyle dS_{t}=(r_{t}-d_{t})S_{t}\,dt+\sigma _{t}S_{t}\,dW_{t}} ,under the risk neutral measure, where r t {\disp... | Local volatility | [
-0.4598747193813324,
-0.7398367524147034,
0.5067234039306641,
0.16907712817192078,
-0.4002789556980133,
0.09052501618862152,
-0.0500052385032177,
0.24420467019081116,
-0.2930777668952942,
-0.30861151218414307,
-0.38519275188446045,
1.0755611658096313,
-0.47554656863212585,
0.59362471103668... |
c_7z8duzb4yhp5 | "Local volatility" is thus a term used in quantitative finance to denote the set of diffusion coefficients, σ t = σ ( S t , t ) {\displaystyle \sigma _{t}=\sigma (S_{t},t)} , that are consistent with market prices for all options on a given underlying, yielding an asset price model of the type d S t = ( r t − d t ) S t... | Local volatility | [
-0.503422200679779,
-1.0241538286209106,
0.45756861567497253,
0.23996450006961823,
-0.09431229531764984,
0.07843145728111267,
-0.25277450680732727,
0.05655786022543907,
-0.19062064588069916,
-0.1358441412448883,
-0.2862359881401062,
0.9156369566917419,
-0.4441819489002228,
0.60451531410217... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.