Search Results for ""

A finite set of equations in the same unknowns of which the common solutions have to be determined. Solution of simultaneous equations in implemented in the Wolfram Language ...

Let h>=2 and let A_1, A_2, ..., A_h be sets of integers. The sumset A_1+A_2+...+A_h is the set of all integers of the form a_1+a_2+...+a_h, where a_i is a member of A_i for ...

Trials for which the Lexis ratio L=sigma/(sigma_B), satisfies L>1, where sigma is the variance in a set of s Lexis trials and sigma_B is the variance assuming Bernoulli ...

A set of circuits going along the graph edges of a graph, each with an even number of graph edges, such that just one of the circuits passes through each graph vertex (Ball ...

The triangle space T is the set of triples (a,b,c) of real numbers that are side lengths of a (Euclidean) triangle, i.e., T={(a,b,c):0<a<b+c,0<b<c+a,0<c<a+b} (Kimberling ...

For a set of positive gamma_k, k=0, 1, 2..., Turán's inequalities are given by gamma_k^2-gamma_(k-1)gamma_(k+1)>=0 for k=1, 2, ....

Let S be a set of simple polygonal obstacles in the plane, then the nodes of the visibility graph of S are just the vertices of S, and there is an edge (called a visibility ...

A convex polyhedron can be defined algebraically as the set of solutions to a system of linear inequalities mx<=b, where m is a real s×3 matrix and b is a real s-vector. ...

A set function mu is said to possess countable subadditivity if, given any countable disjoint collection of sets {E_k}_(k=1)^n on which mu is defined, mu( union ...

Let G be a group, and let S subset= G be a set of group elements such that the identity element I not in S. The Cayley graph associated with (G,S) is then defined as the ...