Search Results for ""

A block diagonal matrix, also called a diagonal block matrix, is a square diagonal matrix in which the diagonal elements are square matrices of any size (possibly even 1×1), ...

A prime number (or prime integer, often simply called a "prime" for short) is a positive integer p>1 that has no positive integer divisors other than 1 and p itself. More ...

For {M_i}_(i in I) a family of R-modules indexed by a directed set I, let sigma_(ji):M_j->M_i i<=j be an R-module homomorphism. Call (M_i,sigma_(ji)) an inverse system over I ...

A number n with prime factorization n=product_(i=1)^rp_i^(a_i) is called k-almost prime if it has a sum of exponents sum_(i=1)^(r)a_i=k, i.e., when the prime factor ...

The conjecture that the number of alternating sign matrices "bordered" by +1s A_n is explicitly given by the formula A_n=product_(j=0)^(n-1)((3j+1)!)/((n+j)!). This ...

The Andrews-Gordon identity (Andrews 1974) is the analytic counterpart of Gordon's combinatorial generalization of the Rogers-Ramanujan identities (Gordon 1961). It has a ...

The Barnes-Wall lattice is a d-dimensional lattice that exists when d is a power of 2. It is implemented in the Wolfram Language as LatticeData[{"BarnesWall", n}]. Special ...

Let T(m) denote the set of the phi(m) numbers less than and relatively prime to m, where phi(n) is the totient function. Define f_m(x)=product_(t in T(m))(x-t). (1) Then a ...

Use the definition of the q-series (a;q)_n=product_(j=0)^(n-1)(1-aq^j) (1) and define [N; M]=((q^(N-M+1);q)_M)/((q;q)_m). (2) Then P. Borwein has conjectured that (1) the ...

The nth central fibonomial coefficient is defined as [2n; n]_F = product_(k=1)^(n)(F_(n+k))/(F_k) (1) = ...