Search Results for ""

Given a permutation {p_1,p_2,...,p_n} of {1,...,n}, the bumping algorithm constructs a standard Young tableau by inserting the p_i one by one into an already constructed ...

The cylinder function is defined as C(x,y)={1 for sqrt(x^2+y^2)<=a; 0 for sqrt(x^2+y^2)>a. (1) The Bessel functions are sometimes also called cylinder functions. To find the ...

The Haferman carpet is the beautiful fractal constructed using string rewriting beginning with a cell [1] and iterating the rules {0->[1 1 1; 1 1 1; 1 1 1],1->[0 1 0; 1 0 1; ...

Given a Hilbert space H, the sigma-strong operator topology is the topology on the algebra L(H) of bounded operators from H to itself defined as follows: A sequence S_i of ...

A complete bipartite graph, sometimes also called a complete bicolored graph (Erdős et al. 1965) or complete bigraph, is a bipartite graph (i.e., a set of graph vertices ...

The Doyle graph, sometimes also known as the Holt graph (Marušič et al. 2005), is the quartic symmetric graph on 27 nodes illustrated above in several embeddings. It is ...

The Grötzsch graph is smallest triangle-free graph with chromatic number four. It is identical to the Mycielski graph of order four, and is implemented as ...

Tutte's (46-vertex) graph is a cubic nonhamiltonian graph contructed by Tutte (1946) as a counterexample to Tait's Hamiltonian graph conjecture by using three copies ...

A vector is formally defined as an element of a vector space. In the commonly encountered vector space R^n (i.e., Euclidean n-space), a vector is given by n coordinates and ...

The biconjugate gradient stabilized (BCGSTAB) method was developed to solve nonsymmetric linear systems while avoiding the often irregular convergence patterns of the ...