Search Results for ""

A conjecture concerning primes.

Let L=<L, v , ^ > and K=<K, v , ^ > be lattices, and let h:L->K. Then h is a lattice homomorphism if and only if for any a,b in L, h(a v b)=h(a) v h(b) and h(a ^ b)=h(a) ^ ...

Zygmund (1988, p. 192) noted that there exists a number alpha_0 in (0,1) such that for each alpha>=alpha_0, the partial sums of the series sum_(n=1)^(infty)n^(-alpha)cos(nx) ...

A maximum clique of a graph G is a clique (i.e., complete subgraph) of maximum possible size for G. Note that some authors refer to maximum cliques simply as "cliques." The ...

The double covering group of the (linear) symplectic group.

A term in social choice theory meaning a change favorable for X does not hurt X.

Moving medians are implemented in the Wolfram Language as MovingMedian[data, n].

If a prime number divides a norm but not the bases of the norm, it is itself a norm.

An estimator of the actual values of population.

A very useful active feedback method for controlling things like temperature control systems, servo motors, and flow control valves.