Search Results for ""
11861 - 11870 of 13135 for dimensional analysisSearch Results

A catacaustic is a curve that is the envelope of rays emanating from a specified point (or a point at infinite distance producing parallel rays) for a given mirror shape. The ...
Based on methods developer in collaboration with M. Leclert, Catalan (1865) computed the constant K=0.915965594177... (OEIS A006752) now known as Catalans' constant to 9 ...
A catenary of revolution. The catenoid and plane are the only surfaces of revolution which are also minimal surfaces. The catenoid can be given by the parametric equations x ...
A caterpillar graph, caterpillar tree, or simply "caterpillar," is a tree in which every graph vertex is on a central stalk or only one graph edge away from the stalk (in ...
The (connected) caveman graph is a graph arising in social network theory formed by modifying a set of isolated k-cliques (or "caves") by removing one edge from each clique ...
The Cayley-Purser algorithm is a public-key cryptography algorithm that relies on the fact that matrix multiplication is not commutative. It was devised by Sarah Flannery ...
Cayley's cubic surface is the unique cubic surface having four ordinary double points (Hunt), the maximum possible for cubic surface (Endraß). The Cayley cubic is invariant ...
The function [x] which gives the smallest integer >=x, shown as the thick curve in the above plot. Schroeder (1991) calls the ceiling function symbols the "gallows" because ...
The Celmins-Swart snarks are the two snarks on 26 vertices and 39 edges illustrated above. They are implemented in the Wolfram Language as GraphData["CelminsSwartSnark1"] and ...
Let X_1,X_2,...,X_N be a set of N independent random variates and each X_i have an arbitrary probability distribution P(x_1,...,x_N) with mean mu_i and a finite variance ...

...