TOPICS
Search

Search Results for ""


4781 - 4790 of 13134 for complexity theorySearch Results
A generalization of the Fibonacci numbers defined by 1=G_1=G_2=...=G_(c-1) and the recurrence relation G_n=G_(n-1)+G_(n-c). (1) These are the sums of elements on successive ...
Given a compact manifold M and a transversely orientable codimension-one foliation F on M which is tangent to partialM, the pair (M,F) is called a generalized Reeb component ...
There are no fewer than two closely related but somewhat different notions of gerbe in mathematics. For a fixed topological space X, a gerbe on X can refer to a stack of ...
If n>1 and n|1^(n-1)+2^(n-1)+...+(n-1)^(n-1)+1, is n necessarily a prime? In other words, defining s_n=sum_(k=1)^(n-1)k^(n-1), does there exist a composite n such that s_n=-1 ...
The golden triangle, sometimes also called the sublime triangle, is an isosceles triangle such that the ratio of the hypotenuse a to base b is equal to the golden ratio, ...
A googol is a large number equal to 10^(10^2)=10^(100) (i.e., a 1 with 100 zeros following it). Written out explicitly, ...
Let theta(t) be the Riemann-Siegel function. The unique value g_n such that theta(g_n)=pin (1) where n=0, 1, ... is then known as a Gram point (Edwards 2001, pp. 125-126). An ...
The Gram series is an approximation to the prime counting function given by G(x)=1+sum_(k=1)^infty((lnx)^k)/(kk!zeta(k+1)), (1) where zeta(z) is the Riemann zeta function ...
Let a tree S be a subgraph of a cubic graph G. The graph excision G circleminus S is the graph resulting from removing the tree, then merging the edges. For example, if in ...
The graph tensor product, also called the graph cardinal product (Imrich 1998), graph categorical product, graph conjunction, graph direct product (Hammack et al. 2016), ...
1 ... 476|477|478|479|480|481|482 ... 1314 Previous Next

...