Search Results for ""
991 - 1000 of 13135 for Discrete SetSearch Results
A transformation x^'=Ax is unimodular if the determinant of the matrix A satisfies det(A)=+/-1. A necessary and sufficient condition that a linear transformation transform a ...
The set of n quantities v_j are components of an n-dimensional vector v iff, under rotation, v_i^'=a_(ij)v_j (1) for i=1, 2, ..., n. The direction cosines between x_i^' and ...
A compact set W_infty with area mu(W_infty)=8/9(24)/(25)(48)/(49)...=pi/4 created by punching a square hole of length 1/3 in the center of a square. In each of the eight ...
The singleton set {0}, with respect to the trivial group structure defined by the addition 0+0=0. The element 0 is the additive identity element of the group, and also the ...
The constant polynomial P(x)=0 whose coefficients are all equal to 0. The corresponding polynomial function is the constant function with value 0, also called the zero map. ...
A group is called k-transitive group if there exists a set of elements on which the group acts faithfully and k-transitively. It should be noted that transitivity computed ...
The n-crown graph for an integer n>=3 is the graph with vertex set {x_0,x_1,...,x_(n-1),y_0,y_1,...,y_(n-1)} (1) and edge set {(x_i,y_j):0<=i,j<=n-1,i!=j}. (2) It is ...
The metric dimension beta(G) (Tillquist et al. 2021) or dim(G) (Tomescu and Javid 2007, Ali et al. 2016) of a graph G is the smallest number of nodes required to identify all ...
A symmetric polynomial on n variables x_1, ..., x_n (also called a totally symmetric polynomial) is a function that is unchanged by any permutation of its variables. In other ...
Hardy and Littlewood (1914) proved that the sequence {frac(x^n)}, where frac(x) is the fractional part, is equidistributed for almost all real numbers x>1 (i.e., the ...
...
View search results from all Wolfram sites (47352 matches)

