Search Results for ""

Let lambda_1, ..., lambda_n in C be linearly independent over the rationals Q, then Q(lambda_1,...,lambda_n,e^(lambda_1),...,e^(lambda_n)) has transcendence degree at least n ...

The concurrence S of the Euler lines E_n of the triangles DeltaXBC, DeltaXCA, DeltaXAB, and DeltaABC where X is the incenter. It has equivalent triangle center functions ...

A polynomial given in terms of the Neumann polynomials O_n(x) by S_n(x)=(2xO_n(x)-2cos^2(1/2npi))/n.

The Schröder-Bernstein theorem for numbers states that if n<=m<=n, then m=n. For sets, the theorem states that if there are injections of the set A into the set B and of B ...

The Schur decomposition of a complex square matrix A is a matrix decomposition of the form Q^(H)AQ=T=D+N, (1) where Q is a unitary matrix, Q^(H) is its conjugate transpose, ...

The Schwarz triangles are spherical triangles which, by repeated reflection in their indices, lead to a set of congruent spherical triangles covering the sphere a finite ...

The scramble number sn(G) of a graph G is a graph invariant developed to aid in the study of gonality of graphs. The scramble number is NP-hard to compute (Echavarria et al. ...

Searching refers to locating a given element or an element satisfying certain conditions from some (usually ordered or partially ordered) table, list, tree, etc.

A root-finding algorithm which assumes a function to be approximately linear in the region of interest. Each improvement is taken as the point where the approximating line ...

Consider the circles centered on the midpoints of the sides of a reference triangle and passing though the orthocenter H. These circles cut the sides in six points lying on a ...