TOPICS
Search

Search Results for ""


511 - 520 of 1004 for Generalized polygonSearch Results
A stacked (or generalized) prism graph Y_(m,n) is a simple graph given by the graph Cartesian product Y_(m,n)=C_m square P_n (Gallian 2007) for positive integers m,n with ...
The tangent numbers, also called a zag number, and given by T_n=(2^(2n)(2^(2n)-1)|B_(2n)|)/(2n), (1) where B_n is a Bernoulli number, are numbers that can be defined either ...
A codimension one foliation F of a 3-manifold M is said to be taut if for every leaf lambda in the leaf space L of F, there is a circle gamma_lambda transverse to F (i.e., a ...
Multiple series generalizations of basic hypergeometric series over the unitary groups U(n+1). The fundamental theorem of U(n) series takes c_1, ..., c_n and x_1, ..., x_n as ...
A self-avoiding walk is a path from one point to another which never intersects itself. Such paths are usually considered to occur on lattices, so that steps are only allowed ...
The Mittag-Leffler function (Mittag-Leffler 1903, 1905) is an entire function defined by the series E_alpha(z)=sum_(k=0)^infty(z^k)/(Gamma(alphak+1)) (1) for alpha>0. It is ...
A k-regular simple graph G on nu nodes is strongly k-regular if there exist positive integers k, lambda, and mu such that every vertex has k neighbors (i.e., the graph is a ...
The third prime number, which is also the second Fermat prime, the third Sophie Germain prime, and Fibonacci number F_4. It is an Eisenstein prime, but not a Gaussian prime, ...
The area moment of inertia is a property of a two-dimensional plane shape which characterizes its deflection under loading. It is also known as the second moment of area or ...
Combinatorial geometry is a blending of principles from the areas of combinatorics and geometry. It deals with combinations and arrangements of geometric objects and with ...
1 ... 49|50|51|52|53|54|55 ... 101 Previous Next

...