Search Results for ""

Consider a one-dimensional Hamiltonian map of the form H(p,q)=1/2p^2+V(q), (1) which satisfies Hamilton's equations q^. = (partialH)/(partialp) (2) p^. = ...

Computation time (also called "running time") is the length of time required to perform a computational process. Representation a computation as a sequence of rule ...

A general concept in category theory involving the globalization of topological or differential structures. The term derives from the Greek omicronlambdaomicronsigma (holos) ...

Monster-barring is a term coined by Lakatos (1976) to refer to the refining of a hypothesis to rule out nasty counterexamples (Bailey et al. 2007, p. 11).

A generalization of the product rule for expressing arbitrary-order derivatives of products of functions, where (n; k) is a binomial coefficient. This can also be written ...

A n-crossed prism graph for positive even n (a term introduced here for the first time), is a graph obtained by taking two disjoint cycle graphs C_n and adding edges ...

A Hamiltonian path, also called a Hamilton path, is a graph path between two vertices of a graph that visits each vertex exactly once. If a Hamiltonian path exists whose ...

Combinatorial matrix theory is a rich branch of mathematics that combines combinatorics, graph theory, and linear algebra. It includes the theory of matrices with prescribed ...

The detour polynomial of a graph G is the characteristic polynomial of the detour matrix of G. Precomputed detour polynomials for many named graphs are available in the ...

The middle layer graph of order n is the graph whose vertex set consists of all bitstrings of length 2n+1 that have exactly n or n+1 entries equal to 1, with an edge between ...