language:
Find link is a tool written by Edward Betts.Longer titles found: Riesz representation theorem (view), Martingale representation theorem (view), Riesz–Markov–Kakutani representation theorem (view), Skorokhod's representation theorem (view), Stone's representation theorem for Boolean algebras (view), Birkhoff's representation theorem (view), Kolmogorov–Arnold representation theorem (view), Chomsky–Schützenberger representation theorem (view), Utility representation theorem (view), Debreu's representation theorems (view)
searching for Representation theorem 68 found (256 total)
alternate case: representation theorem
Oriented matroid
(3,949 words)
[view diff]
exact match in snippet
view article
find links to article
hyperplane arrangements. In particular, the Folkman–Lawrence topological representation theorem states that any oriented matroid has a realization as an arrangementDe Finetti's theorem (2,571 words) [view diff] exact match in snippet view article find links to article
"De Finetti theorem", Encyclopedia of Mathematics, EMS Press What is so cool about De Finetti's representation theorem? De Finetti's theorem at the nLabInverse semigroup (3,739 words) [view diff] no match in snippet view article find links to article
In group theory, an inverse semigroup (occasionally called an inversion semigroup) S is a semigroup in which every element x in S has a unique inversePositive harmonic function (861 words) [view diff] exact match in snippet view article find links to article
positive measure on the circle. This result, the Herglotz-Riesz representation theorem, was proved independently by Gustav Herglotz and Frigyes Riesz inDiagonal lemma (1,745 words) [view diff] exact match in snippet view article find links to article
{\overline {m_{k}}},y)\leftrightarrow y={\overline {n}})} . The representation theorem is provable, i.e. every recursive function is representable in TExpected utility hypothesis (5,770 words) [view diff] exact match in snippet view article find links to article
infinite. In 1926, Frank Ramsey introduced Ramsey's Representation Theorem. This representation theorem for expected utility assumes that preferences areSubharmonic function (1,833 words) [view diff] exact match in snippet view article find links to article
Borel measure in D {\displaystyle D} . This is called the Riesz representation theorem. Subharmonic functions are of a particular importance in complexSlowly varying function (587 words) [view diff] no match in snippet view article find links to article
In real analysis, a branch of mathematics, a slowly varying function is a function of a real variable whose behaviour at infinity is in some sense similarSchlessinger's theorem (608 words) [view diff] no match in snippet view article find links to article
In algebra, Schlessinger's theorem is a theorem in deformation theory introduced by Schlessinger (1968) that gives conditions for a functor of artinianConstantin Piron (265 words) [view diff] exact match in snippet view article find links to article
foundations of quantum mechanics. Piron's Theorem (1964) is a famous representation theorem for quantum lattices. He was appointed assistant professor in theAlgebraic logic (2,224 words) [view diff] exact match in snippet view article find links to article
problems like representation and duality. Well known results like the representation theorem for Boolean algebras and Stone duality fall under the umbrella ofDenotational semantics of the Actor model (3,346 words) [view diff] case mismatch in snippet view article find links to article
the least fixed point of ProgressionS is given by the Concurrency Representation Theorem as follows: ⊔iεω ProgressionSi(⊥S) where ⊥S is the initial configurationType-1 OWA operators (2,315 words) [view diff] case mismatch in snippet view article find links to article
G} is the result obtained by in Definition 2. According to the Representation Theorem of Type-1 OWA Operators, a general type-1 OWA operator can be decomposedRational consequence relation (1,574 words) [view diff] no match in snippet view article find links to article
In logic, a rational consequence relation is a non-monotonic consequence relation satisfying certain properties listed below. A rational consequence relationJon Folkman (1,140 words) [view diff] exact match in snippet view article find links to article
oriented matroids; in particular, the Folkman–Lawrence topological representation theorem is "one of the cornerstones of the theory of oriented matroids"Jim Agler (189 words) [view diff] exact match in snippet view article find links to article
Mathematical Society, 2002). Some efforts to extend the Herglotz representation theorem are described in Classical function theory, Operator Dilation TheoryReal algebraic geometry (3,217 words) [view diff] exact match in snippet view article find links to article
(Kadison–Dubois representation theorem). Further improved by Mihai Putinar in 1993 and Jacobi in 2001 (Putinar–Jacobi representation theorem). 1952 John Nash provedActor model (7,144 words) [view diff] case mismatch in snippet view article find links to article
model using a two-phase commit protocol. There is a Computational Representation Theorem in the actor model for systems which are closed in the sense thatAnscombe-Aumann subjective expected utility model (1,018 words) [view diff] exact match in snippet view article find links to article
Anscombe-Aumann framework, Anscombe-Aumann approach, or Anscombe-Aumann representation theorem) is a framework to formalizing subjective expected utility (SEU)Gustav Herglotz (1,080 words) [view diff] exact match in snippet view article find links to article
transformation#Lorentz transformation). In 1911, he formulated the Herglotz representation theorem which concerns holomorphic functions f on the unit disk D, withGeorge Maltese (789 words) [view diff] exact match in snippet view article find links to article
functions and Choquet’s representation theorem. J. Math. Anal. Appl. 12, 371–377 (1965). mit R.S. Bucy: A representation theorem for positive functionalsSavage's subjective expected utility model (1,489 words) [view diff] exact match in snippet view article find links to article
(also known as Savage's framework, Savage's axioms, or Savage's representation theorem) is a formalization of subjective expected utility (SEU) developedWold's theorem (810 words) [view diff] exact match in snippet view article find links to article
In statistics, Wold's decomposition or the Wold representation theorem (not to be confused with the Wold theorem that is the discrete-time analog of theNonabelian algebraic topology (690 words) [view diff] exact match in snippet view article find links to article
categories, or indexed/'parametrized' categories. The Joyal–Tierney representation theorem for topoi is also a generalisation of the Galois theory. Thus, indexingExchangeable random variables (2,561 words) [view diff] exact match in snippet view article find links to article
can be established for infinite sequences, through an important representation theorem by Bruno de Finetti (later extended by other probability theoristsConcurrency (computer science) (1,420 words) [view diff] case mismatch in snippet view article
similar unified understanding of different models. The Concurrency Representation Theorem in the actor model provides a fairly general way to represent concurrentRichard Bradley (philosopher) (398 words) [view diff] case mismatch in snippet view article
1093/mind/fzm001. ISSN 0026-4423. Bradley, Richard (23 June 2005). "Ramsey's Representation Theorem". Dialectica. 58 (4). Verein philosophie.ch: 483–497. doi:10.1111/jPure inductive logic (4,462 words) [view diff] exact match in snippet view article find links to article
the only functions that satisfy Recovery, Reg and ULi with Ax. A representation theorem for a class of probability functions provides means of expressingBoolean algebras canonically defined (8,242 words) [view diff] exact match in snippet view article find links to article
a power of 2, namely one of 1,2,4,8,...,2n,... This is called a representation theorem as it gives insight into the nature of finite Boolean algebras byQuantale (597 words) [view diff] case mismatch in snippet view article find links to article
I}f(x_{i}).} Relation algebra Paeska, Jan; Slesinger, Radek (2018). "A Representation Theorem for Quantale Valued sup-algebras". 2018 IEEE 48th InternationalClark–Ocone theorem (733 words) [view diff] exact match in snippet view article find links to article
Skorokhod integral and the tools of the Malliavin calculus. Integral representation theorem for classical Wiener space, which uses the Clark–Ocone theorem inPower set (2,479 words) [view diff] exact match in snippet view article find links to article
represented as a subalgebra of a power set Boolean algebra (see Stone's representation theorem). The power set of a set S forms an abelian group when it is consideredSubdirectly irreducible algebra (853 words) [view diff] exact match in snippet view article find links to article
irreducible if and only if it has dimension one. The subdirect representation theorem of universal algebra states that every algebra is subdirectly representableBruno de Finetti (1,324 words) [view diff] exact match in snippet view article find links to article
him too. In the 21st century quantum extensions of de Finetti's representation theorem have been found to be useful in quantum information, in topics likeAparna Higgins (321 words) [view diff] case mismatch in snippet view article find links to article
Heterogeneous Algebras Associated with Non-Indexed Algebras, a Representation Theorem on Weak Automorphisms of Universal Algebras, was supervised by AbrahamGordon Preston (373 words) [view diff] exact match in snippet view article find links to article
University of Oxford Known for Inverse semigroups, Wagner–Preston representation theorem Scientific career Fields Mathematics Institutions Monash UniversityR. L. Hudson (782 words) [view diff] exact match in snippet view article find links to article
Hudson, R. L.; Lindsay, J. M. (1985). "A non-commutative martingale representation theorem for non-Fock quantum Brownian motion". Journal of Functional AnalysisIndeterminacy in concurrent computation (1,318 words) [view diff] case mismatch in snippet view article find links to article
all the possible computations of a closed Actor system using the Representation Theorem [Hewitt 2007] as follows: The mathematical denotation denoted byAlbert Baernstein II (590 words) [view diff] exact match in snippet view article find links to article
doi:10.1090/S0002-9947-1971-0283182-0. Baernstein, Albert (1972). "A representation theorem for functions holomorphic off the real axis". Trans. Amer. MathPeter Whittle (mathematician) (1,375 words) [view diff] exact match in snippet view article
Hypothesis Testing in Time Series, generalised Wold's autoregressive representation theorem for univariate stationary processes to multivariate processes. Whittle'sGraphon (5,460 words) [view diff] exact match in snippet view article find links to article
There is a representation theorem for jointly exchangeable random adjacency matrices, analogous to de Finetti’s representation theorem for exchangeableError correction model (1,903 words) [view diff] exact match in snippet view article find links to article
and this ECM exists, they are cointegrated by the Engle–Granger representation theorem. The second step is then to estimate the model using ordinary leastPositive polynomial (1,413 words) [view diff] exact match in snippet view article find links to article
Indiana Univ. Math. J. 42 (1993), no. 3, 969–984. T. Jacobi, "A representation theorem for certain partially ordered commutative rings". Math. Z. 237 (2001)Size function (1,892 words) [view diff] case mismatch in snippet view article find links to article
\mu (r)} is sad to be the multiplicity of r {\displaystyle r} . Representation Theorem: For every x ¯ < y ¯ {\displaystyle {\bar {x}}<{\bar {y}}} , itSystem F (2,532 words) [view diff] case mismatch in snippet view article find links to article
(1972) and independently by Reynolds (1974). Girard proved the Representation Theorem: that in second-order intuitionistic predicate logic (P2), functionsJean-Claude Falmagne (1,212 words) [view diff] case mismatch in snippet view article find links to article
F78. Falmagne, Jean-Claude (1978). "A Representation Theorem for Finite Random Scale Systems". Journal of Mathematical Psychology. 18 (1): 52–72. doi:10Density on a manifold (1,562 words) [view diff] exact match in snippet view article find links to article
{\displaystyle |\Lambda |_{M}^{1}} using the Riesz-Markov-Kakutani representation theorem. The set of 1/p-densities such that | ϕ | p = ( ∫ | ϕ | p ) 1 /Compact space (5,704 words) [view diff] exact match in snippet view article find links to article
a Boolean algebra is compact, a fact which is part of the Stone representation theorem. Stone spaces, compact totally disconnected Hausdorff spaces, formGleason's theorem (4,107 words) [view diff] exact match in snippet view article find links to article
not all pairs of quantities can be measured simultaneously. The representation theorem in quantum logic shows that such a lattice is isomorphic to theConvex hull (7,147 words) [view diff] exact match in snippet view article find links to article
Kenji; Nakamura, Masataka; Okamoto, Yoshio (2005), "The affine representation theorem for abstract convex geometries", Computational Geometry, 30 (2):Lester Dubins (1,466 words) [view diff] case mismatch in snippet view article find links to article
Dubins, Lester E. (1983). "An Extension of Skorohod's Almost Sure Representation Theorem". Proceedings of the American Mathematical Society. 89 (4): 691–692Cantor set (6,396 words) [view diff] exact match in snippet view article find links to article
applications in functional analysis, where it is sometimes known as the representation theorem for compact metric spaces. For any integer q ≥ 2, the topology onW. T. Tutte (4,719 words) [view diff] exact match in snippet view article find links to article
Tutte's statistical method Tutte's triangle lemma Tutte's unimodular representation theorem Tutte's wheel theorem Spouse Dorothea Mitchell (m. 1949; died 1994)Multi-task learning (6,154 words) [view diff] exact match in snippet view article find links to article
kernels Γ is a current field of research. For the separable case, the representation theorem is reduced to f ( x ) = ∑ i = 1 N k ( x , x i ) A c i {\textstyleQuaternion (12,657 words) [view diff] exact match in snippet view article find links to article
Mebius, Johan E. (2005). "A matrix-based proof of the quaternion representation theorem for four-dimensional rotations". arXiv:math/0501249. Mebius, JohanQuasiconvexity (calculus of variations) (1,691 words) [view diff] exact match in snippet view article
{\displaystyle \int _{B(0,1)}V(x)dx=0} . The Riesz-Markov-Kakutani representation theorem states that the dual space of C 0 ( R m × d ) {\displaystyle C_{0}(\mathbbActor model and process calculi history (2,420 words) [view diff] case mismatch in snippet view article find links to article
[Hewitt 2006, 2007a] has emphasized denotational models and the Representation Theorem. Nevertheless there are interesting co-evolutions between the ActorRotations in 4-dimensional Euclidean space (5,718 words) [view diff] exact match in snippet view article find links to article
Johan Ernest Mebius (2005). "A matrix-based proof of the quaternion representation theorem for four-dimensional rotations". arXiv:math/0501249. Johan ErnestLoewner differential equation (2,606 words) [view diff] exact match in snippet view article find links to article
( 0 ) = 1 {\displaystyle p(0)=1} are described by the Herglotz representation theorem: p ( z ) = ∫ 0 2 π 1 + e − i θ z 1 − e − i θ z d μ ( θ ) , {\displaystyleFounders of statistics (2,073 words) [view diff] exact match in snippet view article find links to article
exposition of the Bayesian method of statistical analysis. Developed the representation theorem for exchangeable random variables showing that they are the basisEffect algebra (2,131 words) [view diff] exact match in snippet view article find links to article
unit interval [ 0 , 1 ] {\displaystyle [0,1]} on the algebra. A representation theorem of Gudder shows that these all arise as an interval effect algebraTimeline of category theory and related mathematics (273 words) [view diff] exact match in snippet view article find links to article
homotopy groups of a topological space. 1936 Marshall Stone Stone representation theorem for Boolean algebras initiates various Stone dualities. 1937 RichardLeon Henkin (10,254 words) [view diff] exact match in snippet view article find links to article
Belgian Mathematical Society. 7, 137-141. Henkin, L. (1955) The representation theorem for cylindrical algebras. En Skolem, Th., Hasenjaeger, G., KreiselRandom utility model (1,641 words) [view diff] exact match in snippet view article find links to article
1007/978-94-010-9276-0_8. ISBN 978-90-277-1195-3. Falmagne, J.C. (August 1978). "A representation theorem for finite random scale systems". Journal of Mathematical PsychologyHistory of the Church–Turing thesis (8,298 words) [view diff] exact match in snippet view article find links to article
be simulated by a letter machine, [and] is best understood as a representation theorem for the axiomatic notion. [boldface added] "The axiomatic approachWasserstein GAN (2,884 words) [view diff] exact match in snippet view article find links to article
obtained by using the Wasserstein metric, which satisfies a "dual representation theorem" that renders it highly efficient to compute: Theorem (Kantorovich-RubensteinFokas method (5,052 words) [view diff] exact match in snippet view article find links to article
by u {\displaystyle u} . In the case of straight edges, Green's representation theorem leads to Due to the orthogonality of the Legendre polynomials, forArtin transfer (group theory) (28,815 words) [view diff] no match in snippet view article
homomorphism property of the Artin transfer with the aid of the monomial representation. Theorem. Let G {\displaystyle G} be a group with nested subgroups K ≤ H