Cyclic permutation

In mathematics, and in particular in group theory, a cyclic permutation is a permutation of the elements of some set X which maps the elements of some subset S of X to each other in a cyclic fashion, while fixing all other elements of X. If S has k elements, the cycle is called a k-cycle. Cycles are often denoted by the list of their elements enclosed with parentheses, in the order to which they are permuted.

Sylvester–Gallai configuration

In geometry, a Sylvester–Gallai configuration consists of a finite subset of the points of a projective space with the property that the line through any two of the points in the subset also passes through at least one other point of the subset

Wilf equivalence

In the study of permutations and permutation patterns, Wilf equivalence is an equivalence relation on permutation classes. Two permutation classes are Wilf equivalent when they have the same numbers of permutations of each possible length, or equivalently

Garsia–Wachs algorithm

The Garsia–Wachs algorithm is an efficient method for computers to construct optimal binary search trees and alphabetic Huffman codes, in linearithmic time. It is named after Adriano Garsia and Michelle L. Wachs

Stanley sequence

In mathematics, a Stanley sequence is an integer sequence generated by a greedy algorithm that chooses the sequence members to avoid arithmetic progressions. If is a finite set of non-negative integers on which no three elements form an arithmetic

Point Processes

Point Processes is a book on the mathematics of point processes, randomly located sets of points on the real line or in other geometric spaces. It was written by David Cox and Valerie Isham, and published in 1980 by Chapman & Hall in their Monographs on

Isosceles set

In discrete geometry, an isosceles set is a set of points with the property that every three of them form an isosceles triangle. More precisely, each three points should determine at most two distances; this also allows degenerate isosceles triangles

Parameter word

In the mathematical study of combinatorics on words, a parameter word is a string over a given alphabet having some number of wildcard characters. The set of strings matching a given parameter word is called a parameter set or combinatorial cube

Young–Fibonacci lattice

In mathematics, the Young–Fibonacci graph and Young–Fibonacci lattice, named after Alfred Young and Leonardo Fibonacci, are two closely related structures involving sequences of the digits 1 and 2. Any digit sequence of this type can be assigned a

Sylvester matroid

In matroid theory, a Sylvester matroid is a matroid in which every pair of elements belongs to a three-element circuit of the matroid

Della Dumbaugh

Della Jeanne Dumbaugh is an American mathematician and historian of mathematics, focusing on the history of algebra and number theory. She is a professor of mathematics at the University of Richmond, and the editor-in-chief of The American Mathematical