cyclic ordering
41Serialization — This article is about data structure encoding. For other uses, see Serialization (disambiguation). In computer science, in the context of data storage and transmission, serialization is the process of converting a data structure or object state… …
42Flexagon — In geometry, flexagons are flat models made from folded strips of paper that can be folded, or flexed , to reveal a number of hidden faces. They are amusing toys but have also caught the interest of mathematicians.Flexagons are usually square or… …
43Dining philosophers problem — In computer science, the dining philosophers problem is an example problem often used in concurrent algorithm design to illustrate synchronization issues and techniques for resolving them. It was originally formulated in 1965 by Edsger Dijkstra… …
44Binary Golay code — In mathematics and computer science, a binary Golay code is a type of error correcting code used in digital communications. The binary Golay code, along with the ternary Golay code, has a particularly deep and interesting connection to the theory …
45Suffix array — In computer science, a suffix array is an array giving the suffixes of a string in lexicographical order.DetailsConsider the string abracadabra , of length 11. It has eleven suffixes: abracadabra , bracadabra , racadabra , and so on down to a .… …
46Discrete Poisson equation — In mathematics, the discrete Poisson equation is the finite difference analog of the Poisson equation. In it, the discrete Laplace operator takes the place of the Laplace operator. The discrete Poisson equation is frequently used in numerical… …
47rite of passage — 1. Anthropol. a ceremony performed to facilitate or mark a person s change of status upon any of several highly important occasions, as at the onset of puberty or upon entry into marriage or into a clan. 2. any important act or event that serves… …
48Clique complex — “Whitney complex” redirects here. For the Mississippi sports facility, see Davey Whitney Complex. Clique complexes, flag complexes, and conformal hypergraphs are closely related mathematical objects in graph theory and geometric topology that… …
49Minimal counterexample — In mathematics, the method of considering a minimal counterexample (or minimal criminal) combines the ideas of inductive proof and proof by contradiction. Abstractly, in trying to prove a proposition P, one assumes that it is false, and that… …
50Abstract index notation — is a mathematical notation for tensors and spinors that uses indices to indicate their types, rather than their components in a particular basis. The indices are mere placeholders, not related to any fixed basis, and in particular are non… …
