TOPICS
Search

Search Results for ""


10321 - 10330 of 13135 for Computational GeometrySearch Results
Let (x_1,x_2) and (y_1,y_2,y_3) be two sets of complex numbers linearly independent over the rationals. Then at least one of ...
In algebraic topology, a p-skeleton is a simplicial subcomplex of K that is the collection of all simplices of K of dimension at most p, denoted K^((p)). The graph obtained ...
Consider a formula in prenex normal form, Q_1x_1...Q_nx_nN. If Q_i is the existential quantifier (1<=i<=n) and x_k, ..., x_m are all the universal quantifier variables such ...
For a braid with M strands, R components, P positive crossings, and N negative crossings, {P-N<=U_++M-R if P>=N; P-N<=U_-+M-R if P<=N, (1) where U_+/- are the smallest number ...
A knot K in S^3=partialD^4 is a slice knot if it bounds a disk Delta^2 in D^4 which has a tubular neighborhood Delta^2×D^2 whose intersection with S^3 is a tubular ...
A mechanical device consisting of a sliding portion and a fixed case, each marked with logarithmic axes. By lining up the ticks, it is possible to do multiplication by taking ...
Slovin's formula, somtimes also spelled "Sloven's forumula (e.g., Altares et al. 2003, p. 13), is an ad hoc formula lacking mathematical rigor (Ryan 2013) that gives an ...
Guy's "strong law of small numbers" states that there aren't enough small numbers to meet the many demands made of them. Guy (1988) also gives several interesting and ...
Given the left factorial function Sigma(n)=sum_(k=1)^nk!, SK(p) for p prime is the smallest integer n such that p|1+Sigma(n-1). The first few known values of SK(p) are 2, 4, ...
Given the sum-of-factorials function Sigma(n)=sum_(k=1)^nk!, SW(p) is the smallest integer for p prime such that Sigma[SW(p)] is divisible by p. If pSigma(n) for all n<p, ...

...