Search Results for ""

A weakly binary tree is a planted tree in which all nonroot graph vertices are adjacent to at most three graph vertices. Let g(z)=sum_(i=0)^inftyg_iz^i, (1) be the generating ...

Although Bessel functions of the second kind are sometimes called Weber functions, Abramowitz and Stegun (1972) define a separate Weber function as ...

The Weisfeiler-Leman dimension dim_(WL)(G) of a graph G, sometimes known as the WL dimension, is the smallest integer d such that the d-dimensional Weisfeiler-Leman algorithm ...

Dyson (1962abc) conjectured that the constant term in the Laurent series product_(1<=i!=j<=n)(1-(x_i)/(x_j))^(a_i) (1) is the multinomial coefficient ...

Topology

The modern definition of the q-hypergeometric function is _rphi_s[alpha_1,alpha_2,...,alpha_r; beta_1,...,beta_s;q,z] ...

There are a great many beautiful identities involving q-series, some of which follow directly by taking the q-analog of standard combinatorial identities, e.g., the ...

Let L be a nontrivial bounded lattice (or a nontrivial complemented lattice, etc.). If every nonconstant lattice homomorphism defined on L is 0,1-separating, then L is a ...

The number one (1), also called "unity," is the first positive integer. It is an odd number. Although the number 1 used to be considered a prime number, it requires special ...

The 11-cell is a regular 4-dimensional structure that cannot be represented in 3-dimensional space in any reasonable way and is highly self-intersecting even in 4-dimensional ...