• Corpus ID: 15045416

Nauseating Notation Very Much in Draft

  title={Nauseating Notation Very Much in Draft},
  author={James H. Davenport},
1 the abuses of language without which any mathematical text threatens to become pedantic and even unreadable. [3] but some abuse is more harmful than others. 1 Intervals We raise this old chestnut first because it illustrates some of the problems. How do we represent {x : 0 < x ≤ 1}? Semantically, there is no problem. <OMA> <OMS name="interval_oc" cd="interval1''/> <OMI>0</OMI> <OMI>1</OMI> <\OMA> Presentationally, there are two well-kown routes: the " anglo-saxon " way (0, 1] and the " french… 

Tables from this paper

A New Asymptotic Notation: Weak Theta
A new asymptotic notation is defined, called “Weak Theta,” that uses the comparison of various complexity functions with two given complexity functions to highlight the main particularities of Weak Theta.


The Freedom to Extend OpenMath and its Utility
This paper proposes methods to exploit the content dictionaries so as to allow an OpenMath-consuming tool to process expressions even if containing symbols it did not know about before, and is generalized to allow such newly discovered symbol to be rendered or input.
NIST Digital Library of Mathematical Functions
  • D. Lozier
  • Computer Science
    Annals of Mathematics and Artificial Intelligence
  • 2004
The National Institute of Standards and Technology is preparing a Digital Library of Mathematical Functions (DLMF) to provide useful data about special functions for a wide audience. The initial
The Utility of OpenMath
OpenMath [5] is a standard for representing the semantics of mathematical objects. It differs from ‘Presentation’ MathML [7] in not being directly concerned with the presentation of the object, and
A Variant of the F4 Algorithm
The "Grobner trace" method of Traverso is adapted to the context of F4, a heuristic algorithm well suited to algebraic attacks of cryptosystems since it is designed to compute with high probability Grobner bases of a set of polynomial systems having the same shape.
Fast algorithms for matrix normal forms
  • M. Giesbrecht
  • Computer Science, Mathematics
    Proceedings., 33rd Annual Symposium on Foundations of Computer Science
  • 1992
A Las Vegas type probabilistic algorithm is presented for computing the Frobenius normal form of an n*n matrix T over any field K, which nearly matches the lower bound of Omega (MM(n) operations in K for this problem, and improves on the O(n/sup 4/) operations inK required by the previously best known algorithm.
“According to Abramowitz and Stegun” or arccoth needn't be uncouth
The concept of a couth pair of definitions is introduced, e.g. of arcsin and arcsinh, and it is shown that the pair arccot and arccoth can be couth.
Tractable Temporal Reasoning
This paper shows that tractable sub-classes of propositional linear temporal logic can be developed, based on the use of XOR fragments of the logic, via clausal temporal resolution, and describes how such a temporal language might be used in application areas.
Hash Functions in the Dedicated-Key Setting: Design Choices and MPP Transforms
The benefits and drawbacks of building hash functions in the dedicated-key setting (as compared to the more traditional approach) are explored and multi-property-preserving (MPP) domain extension transforms are suggested.
The constructible topology on spaces of valuation domains
We consider properties and applications of a compact, Hausdorff topology called the "ultrafilter topology" defined on an arbitrary spectral space and we observe that this topology coincides with the