arrangementwithout

Arrangementwithout is a coined term used in combinatorics to denote a family of counting problems that seek the number of ordered arrangements of elements from a finite set under specified "without" constraints. It generalizes standard permutation problems by allowing explicit forbidden configurations, such as no repetition, no element appearing in a designated position, or forbidden adjacencies between elements. In typical formulations, one fixes a set of n distinct objects and asks for the number of k-length sequences that do not realize any of a given set of forbidden patterns F.

Formally, let X be an n-element set, and let F be a collection of forbidden configurations on X and positions {1,...,k}. An arrangementwithout is a k-tuple (x1,...,xk) with all xi distinct and xi in X, such that for every forbidden pattern p in F, p is not realized by (x1,...,xk). Special cases include arrangements without repetition (k-permutations), and derangement-like problems where certain elements are forbidden from occupying their original positions. Practical counting often uses inclusion–exclusion, recursive constructions, generating functions, or rook polynomial methods.

Applications of arrangementwithout problems appear in scheduling, seating, experimental design, and cryptography, where constraints must be counted or optimized. The concept relates closely to permutations, partial permutations, derangements, and combinatorial design, but emphasizes the explicit absence of particular configurations rather than the mere non-repetition of elements.

See also: permutations, derangements, partial permutations, rook theory, inclusion–exclusion.