Search Results for ""

An m-gonal n-cone graph, also called the n-point suspension of C_m or generalized wheel graph (Buckley and Harary 1988), is defined by the graph join C_m+K^__n, where C_m is ...

An additive category is a category for which the morphism sets have the structure of Abelian groups. It satisfies some, but not all the properties of an Abelian category.

Arrow's paradox, also called Arrow's impossibility theorem or the general possibility theorem, states that perfect democratic voting is impossible, not just in practice but ...

Axiomatic set theory is a version of set theory in which axioms are taken as uninterpreted rather than as formalizations of pre-existing truths.

A logical system which possesses an explicitly stated set of axioms from which theorems can be derived.

A matching is a maximum matching iff it contains no augmenting path.

Let T be a tree defined on a metric over a set of paths such that the distance between paths p and q is 1/n, where n is the number of nodes shared by p and q. Let A be a ...

Given a point lattice, a cluster is a group of filled cells which are all connected to their neighbors vertically or horizontally.

Code 177 is a totalistic cellular automaton that yields patterns with seemingly random features. The rules and 300 steps of this automaton are illustrated above.

Code 2040 is a totalistic cellular automaton that yields patterns with seemingly random features. The rules and 300 steps of this automaton are illustrated above.