Mathematical notation is a system of written symbols and conventions for specifying mathematical objects, operations and relations. Its purpose is to make structure visible while keeping expressions unambiguous. An expression needs meanings for its symbols as well as rules for how they combine.
For instance denotes composition in the convention , so the rightmost function acts first. The summation binds a dummy index and records both endpoints. Familiar symbols can conceal different conventions; stating index ranges, domains and normalization prevents a compact formula from becoming an ambiguous one.
A numeral system represents numbers by finite strings of symbols with stated interpretation rules. A positional notation assigns place values according to powers of a base: in base , the string means , with .
Thus . The unary numeral system instead represents a count by repeated marks. A numeral is a representation of a number, not the number itself: different strings and bases can name the same abstract integer. Computational costs can depend strongly on the representation length.
Represent a nonnegative integer by , using delimiters when several quantities are encoded. The length is , rather than the length of a binary numeral system representation. Despite the parent category for numerical notation, this is not a positional base-one place-value system.
Expression notation specifies how operators and operands are arranged to encode a mathematical computation. Infix notation places an operator between operands, as in ; Polish notation places it first, and reverse Polish notation places it last.
The computation can be written in prefix form as * + a b c or postfix form as a b + c *. Known operator arities make these forms parse without parentheses. Infix notation instead uses parentheses and precedence conventions to distinguish this expression from . All three can describe the same abstract syntax tree.
Place each operator after its operands. A binary application encodes its first subtree, then its second subtree, then the operator, a postorder traversal. A stack machine evaluates the tokens in one pass, popping the right operand before the left one. Reversing a Polish notation token list also reverses operand order: prefix subtraction - a b would become b a - rather than the required a b -.
Place each operator before its operands. With known operator arities and unambiguous tokens, the abstract syntax tree is recovered recursively without precedence rules or parentheses. A binary application is encoded by its operator, the first subtree's encoding and the second subtree's encoding: this is a preorder traversal of the expression tree.

Articles by others on the same topic (2)

Mathematical notation refers to a standardized set of symbols and conventions used to represent mathematical concepts, operations, relationships, and structures. The purpose of such notation is to allow mathematicians and students to communicate ideas clearly and concisely. Here are some key aspects of mathematical notation: 1. **Symbols**: Mathematical notation includes a variety of symbols that represent numbers, operations, relations, functions, and other elements.
Mathematical notation by Ciro Santilli 40 Updated 2025-07-16
It is hard to decide what makes Ciro Santilli more sad: the usage of Greek letters, the invention of new symbols, or the fifty million alternative font styles used.
Only Chinese characters could be worse than that!