<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"><channel><title>Netvouz / narky / tag / bijection</title>
<link>http://netvouz.com/narky/tag/bijection?feed=rss</link>
<description>narky&#39;s bookmarks tagged &quot;bijection&quot; on Netvouz</description>
<item><title>Bijection - wikipedia</title>
<link>http://en.wikipedia.org/wiki/Bijection</link>
<description>In mathematics, a bijection, or a bijective function is a function f from a set X to a set Y with the property that, for every y in Y, there is exactly one x in X such that f(x) = y. Alternatively, f is bijective if it is a one-to-one correspondence between those sets; i.e., both one-to-one (injective) and onto (surjective).[1] (See also Bijection, injection and surjection.)</description>
<category domain="http://netvouz.com/narky?category=2161227471742930965">Educational &gt; Mathematics &gt; Ideas/Explanations/Wiki or Mathworld lookups</category>
<author>narky</author>
<pubDate>Mon, 30 Apr 2007 02:38:51 GMT</pubDate>
</item><item><title>Bijection, injection and surjection - Wikipedia</title>
<link>http://en.wikipedia.org/wiki/Bijection%2C_injection_and_surjection</link>
<description>In mathematics, injections, surjections and bijections are classes of functions distinguished by the manner in which arguments (input expressions from the domain) and images (output expressions from the codomain) are related or mapped to each other.</description>
<category domain="http://netvouz.com/narky?category=2161227471742930965">Educational &gt; Mathematics &gt; Ideas/Explanations/Wiki or Mathworld lookups</category>
<author>narky</author>
<pubDate>Tue, 01 May 2007 02:47:52 GMT</pubDate>
</item></channel></rss>