Search Results for ""

The study, first developed by Boole, of shift-invariant operators which are polynomials in the differential operator D^~. Heaviside calculus can be used to solve any ordinary ...

How many times can a shape be completely surrounded by copies of itself without being able to tile the entire plane, i.e., what is the maximum (finite) Heesch number?

The Heisenberg group H^n in n complex variables is the group of all (z,t) with z in C^n and t in R having multiplication (w,t)(z,t^')=(w+z,t+t^'+I[w^*z]) (1) where w^* is the ...

A Hilbert basis for the vector space of square summable sequences (a_n)=a_1, a_2, ... is given by the standard basis e_i, where e_i=delta_(in), with delta_(in) the Kronecker ...

Let K be an algebraically closed field and let I be an ideal in K(x), where x=(x_1,x_2,...,x_n) is a finite set of indeterminates. Let p in K(x) be such that for any ...

Every modular system has a modular system basis consisting of a finite number of polynomials. Stated another way, for every order n there exists a nonsingular curve with the ...

A homology class in a singular homology theory is represented by a finite linear combination of geometric subobjects with zero boundary. Such a linear combination is ...

Let K be a finite complex, and let phi:C_p(K)->C_p(K) be a chain map, then sum_(p)(-1)^pTr(phi,C_p(K))=sum_(p)(-1)^pTr(phi_*,H_p(K)/T_p(K)).

A hypergraph is a graph in which generalized edges (called hyperedges) may connect more than two nodes.

Greater than any assignable quantity of the sort in question. In mathematics, the concept of the infinite is made more precise through the notion of an infinite set.