pith. sign in

Two notes on notation

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

The author advocates two specific mathematical notations from his popular course and joint textbook, "Concrete Mathematics". The first of these, extending an idea of Iverson, is the notation "[P]" for the function which is 1 when the Boolean condition P is true and 0 otherwise. This notation can encourage and clarify the use of characteristic functions and Kronecker deltas in sums and integrals. The second notation puts Stirling numbers on the same footing as binomial coefficients. Since binomial coefficients are written on two lines in parentheses and read "n choose k", Stirling numbers of the first kind should be written on two lines in brackets and read "n cycle k", while Stirling numbers of the second kind should be written in braces and read "n subset k". (I might say "n partition k".) The written form was first suggested by Imanuel Marx. The virtues of this notation are that Stirling partition numbers frequently appear in combinatorics, and that it more clearly presents functional relations similar to those satisfied by binomial coefficients.

fields

cs.LO 1

years

2025 1

verdicts

UNVERDICTED 1

representative citing papers

Guarded Negation Transitive Closure Logic

cs.LO · 2025-01-25 · unverdicted · novelty 7.0

GNTC satisfiability is 2ExpTime-complete and model checking is P^NP[O(log² n)]-complete via polynomial and exponential reductions to UNTC and 2-way alternating parity tree automata.

citing papers explorer

Showing 1 of 1 citing paper.

  • Guarded Negation Transitive Closure Logic cs.LO · 2025-01-25 · unverdicted · none · ref 41 · internal anchor

    GNTC satisfiability is 2ExpTime-complete and model checking is P^NP[O(log² n)]-complete via polynomial and exponential reductions to UNTC and 2-way alternating parity tree automata.