Tensor Geometry

From MaRDI portal
Revision as of 01:03, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4002166

DOI10.1007/978-3-642-10514-2zbMath0732.53002OpenAlexW4251672886WikidataQ56156740 ScholiaQ56156740MaRDI QIDQ4002166

Christopher T. J. Dodson, Timothy Poston

Publication date: 18 September 1992

Published in: Graduate Texts in Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10514-2




Related Items (36)

Monopole charge quantization or why electromagnetism is a \(U\)(1)-gauge theoryTensors in computationsA fixed cube theorem for median graphsThe complexity of counting edge colorings and a dichotomy for some higher domain Holant problemsValiant's holant theorem and matchgate tensorsUnnamed ItemClassification of a Class of Counting Problems Using Holographic ReductionsInvariant Hamming graphs in infinite quasi-median graphsUnnamed ItemHolographic algorithms by Fibonacci gatesWhy Shading Matters along ContoursFrom Holant to \#CSP and back: dichotomy for Holant\(^{c}\) problemsA model for Gaussian perturbations of grapheneHolographic algorithms beyond matchgatesAbsolute objects and counterexamples: Jones-geroch dust, torretti constant curvature, tetrad-spinor, and scalar densitySignature theory in holographic algorithmsA new generalisation of graph theoryOn the Complexity of Holant ProblemsComponents of the fundamental category. IISemi-metrics, closure spaces and digital topologyGeometry of the Welch boundsHolographic Algorithms with Matchgates Capture Precisely Tractable Planar #CSPWelch bounds for cross correlation of subspaces and generalizationsThe complexity of planar Boolean \#CSP with complex weightsThe Complexity of Symmetric Boolean Parity Holant ProblemsTensors, differential geometry and statistical shading analysisHolographic algorithms: the power of dimensionality resolvedA Complete Dichotomy Rises from the Capture of Vanishing SignaturesMultilinear methods in linear algebraUnnamed ItemYet another introduction to rough pathsAlgorithms for the fixed point propertyFKT is not universal -- a planar holant dichotomy for symmetric constraintsClique graphs and Helly graphsLinearisation of tautological control systemsA dichotomy for real weighted Holant problems







This page was built for publication: Tensor Geometry