Search Results for ""

The Suzuki graph is an edge-transitive strongly regular graph on 1782 vertices with parameters (nu,k,lambda,mu)=(1782,416,100,96) and automorphism group Suz.2. It is an ...

The Zara graph is the unique graph on 126 vertices satisfying the properties that 1) every maximal clique (of which there are a total of 567) has six vertices, and 2) that if ...

Let {f_n} and {a_n} be sequences with f_n>=f_(n+1)>0 for n=1, 2, ..., then |sum_(n=1)^ma_nf_n|<=Af_1, where A=max{|a_1|,|a_1+a_2|,...,|a_1+a_2+...+a_m|}.

The absolute difference of two numbers n_1 and n_2 is |n_1-n_2|, where the minus sign denotes subtraction and |x| denotes the absolute value.

An acyclic graph is a graph having no graph cycles. Acyclic graphs are bipartite. A connected acyclic graph is known as a tree, and a possibly disconnected acyclic graph is ...

An additive function is an arithmetic function such that whenever positive integers a and b are relatively prime, f(ab)=f(a)+f(b). An example of an additive function is ...

A mathematical object S is said to be additively closed if a,b in S implies that a+b in S.

If a is an element of a field F over the prime field P, then the set of all rational functions of a with coefficients in P is a field derived from P by adjunction of a.

Any link can be represented by a closed braid.

An alpha value is a number 0<=alpha<=1 such that P(z>=z_(observed))<=alpha is considered "significant," where P is a P-value.