|
|
 |
| found 91 articles for 0.552 sec |
  |
|
Paul,
>> Given [x,y] and [x',y'], let f : [x, y] ---> [x',y'].
>
> Bijection? I don't need to be "given" [x, y] and [x', y'] since they
> have (I hope) been previously introduced.
All my definitions (likewise my propositions and remarks) begin with 'Given
x,y'; I imagined that this would qualify the terms of the definition. Shall
I take out the 'Given x,y' from all |
|
 |
|
 |
Group: alt.algebra.help · Group Profile · Search for Application Theorem Uniqueness in alt.algebra.help
Author: Jack
Date: Jul 28, 2008 07:54
*** Apologies for multiple copies *** ************************ *** Call for POSTERS *** 3rd International Conference on Verified Software: Theories, Tools, and Experiments (VSTTE 2010) Edinburgh, Scotland August 16th-19th, 2010 http://www.macs.hw.ac.uk/vstte10 POSTER SESSION The complementary themes of Theories, Tools and Experiments makes VSTTE an unique conference. Through
|
| Show full article (4.34Kb) · Show article thread |
| "ini S." <ini2005@gmail.com> wrote in message <g5i7ui$pkb
$1@fred.mathworks.com>...
> Hi everyone,
> I am working of 3d representation of molecules and
> encountered a problem.
> I have 3 points in 3d:
> X = (xi,xj,xk) Y = (yi,yj,yk) Z = (zi,zj,zk)
> and their corresponding radius:
> Xr, Yr, Zr and another constant C.
> I want to find a point - P, if exists, that satisfies:
> distance(P,X |
|
|
|
|
Group: sci.physics.relativity · Group Profile · Search for Application Theorem Uniqueness in sci.physics.relativity
Author: Timothy Golden BandTechnology.com
Date: Sep 2, 2008 07:05
Tom Roberts wrote on Wed, 09 Jul 2008 11:52:55 -0500: Finally I see what Juan is trying to say, and what his basic error is. As showed below you continue to avoid any correction to your repeated mistakes and misreadings. Juan R. González-Álvarez wrote: It is simple, there is *two* functions R in original C&V paper, equations (37) and (38). Also noticed this fact in footnote c
|
| Show full article (12.51Kb) · Show article thread |
|
|
|
1 ·
2 ·
3 ·
4 ·
5 ·
6 ·
7 ·
8 ·
9 ·
next |
|
|
