Search Results for ""

A graph that can be reduced to another graph with the same degree sequence by edge-switching is known as a switchable graph. Conversely, a graph that cannot be reduced to ...

Given a Lucas sequence with parameters P and Q, discriminant D!=0, and roots a and b, the Sylvester cyclotomic numbers are Q_n=product_(r)(a-zeta^rb), (1) where ...

The symmedial triangle DeltaK_AK_BK_C (a term coined here for the first time), is the triangle whose vertices are the intersection points of the symmedians with the reference ...

The lines AK_A, BK_B, and CK_C which are isogonal to the triangle medians AM_A, BM_B, and CM_C of a triangle are called the triangle's symmedian. The symmedians are ...

The set of elements belonging to one but not both of two given sets. It is therefore the union of the complement of A with respect to B and B with respect to A, and ...

A symmetric function on n variables x_1, ..., x_n is a function that is unchanged by any permutation of its variables. In most contexts, the term "symmetric function" refers ...

Any square matrix A can be written as a sum A=A_S+A_A, (1) where A_S=1/2(A+A^(T)) (2) is a symmetric matrix known as the symmetric part of A and A_A=1/2(A-A^(T)) (3) is an ...

A second-tensor rank symmetric tensor is defined as a tensor A for which A^(mn)=A^(nm). (1) Any tensor can be written as a sum of symmetric and antisymmetric parts A^(mn) = ...

Symmetry operations include the improper rotation, inversion operation, mirror plane, and rotation. Together, these operations create 32 crystal classes corresponding to the ...

A fundamental structural result in extremal graph theory due to Szemerédi (1978). The regularity lemma essentially says that every graph can be well-approximated by the union ...