<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Libres pensées d&#039;un mathématicien ordinaire</title>
	<atom:link href="http://djalil.chafai.net/blog/feed/" rel="self" type="application/rss+xml" />
	<link>http://djalil.chafai.net/blog</link>
	<description>Blog-notes de Djalil Chafaï</description>
	<lastBuildDate>Fri, 03 Feb 2012 10:36:48 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.5</generator>
		<item>
		<title>Publications: science, money, and human comedy</title>
		<link>http://djalil.chafai.net/blog/2012/02/01/publications-science-money-and-human-comedy/</link>
		<comments>http://djalil.chafai.net/blog/2012/02/01/publications-science-money-and-human-comedy/#comments</comments>
		<pubDate>Tue, 31 Jan 2012 23:00:59 +0000</pubDate>
		<dc:creator>Djalil Chafaï</dc:creator>
				<category><![CDATA[Mathematicians]]></category>

		<guid isPermaLink="false">http://djalil.chafai.net/blog/?p=3965</guid>
		<description><![CDATA[In principle, a mathematician can communicate to the others his own work using solely public free access Internet academic sites (either personal or global). A famous example is the work of the Fields Medalist Grisha Perelman on Thurston&#8217;s geometrization conjecture published on arXiv.org. Even if arXiv.org is moderated, it does not provide a peer reviewing [...]]]></description>
			<content:encoded><![CDATA[<div id="attachment_3966" class="wp-caption aligncenter" style="width: 260px"><a rel="attachment wp-att-3966" href="http://djalil.chafai.net/blog/2012/02/01/publications-science-money-and-human-comedy/euleragnesi/"><img class="size-full wp-image-3966" title="Euler, on a Swiss bank note" src="http://djalil.chafai.net/blog/wp-uploads/2012/01/euleragnesi.jpg" alt="" width="250" height="166" /></a><p class="wp-caption-text">Euler, on a Swiss bank note</p></div>
<p style="text-align: justify;">In principle, a mathematician can communicate to the others his own work using solely public free access Internet academic sites (either personal or global). A famous example is the work of the Fields Medalist <a href="http://en.wikipedia.org/wiki/Grigori_Perelman">Grisha Perelman</a> on <a href="http://en.wikipedia.org/wiki/Geometrization_conjecture">Thurston&#8217;s geometrization conjecture</a> published on <a href="http://en.wikipedia.org/wiki/Arxiv.org">arXiv.org</a>. Even if arXiv.org is moderated, it does not provide a peer reviewing process. For historical and sociological reasons, most professional mathematicians publish their results in peer reviewed mathematical journals. Many of these journals are handled by capitalistic companies such as Elsevier, Springer, Taylor and Francis, etc. The aim of these companies is to make profit, and some of them are not willing to make knowledge freely accessible. Basically, the mathematical publications rely on three pillars: science, money, and human comedy:</p>
<ul>
<li style="text-align: justify;"><strong>Science.</strong> Mathematicians use peer reviewing in order to improve science quality and to reduce pollution. Peer reviewing is the first step in the long transformation of live mathematics into &#8220;dead&#8221; mathematics which can be considered as true and certified. This does not mean that peer reviewing is good for everything. Mathematicians need also media and space to discuss ideas. Internet has good tools for such live interactions, such as <a href="http://en.wikipedia.org/wiki/Mathoverflow">MathOverflow</a>, a sort of modern version of the venerable sci.math <a href="http://en.wikipedia.org/wiki/Usenet">usenet</a> newsgroup. Actually, MathOverflow implements some kind of peer rating, while keeping freedom.</li>
<li style="text-align: justify;"><strong>Money.</strong> Everything has a cost. Non free journals are actually paied by readers via their institution. Freely accessible journals or sites have also a cost, but the circuit of money is different. For instance, the cost of arXiv.org is supported mostly by North American and European Universities and Research Centers. Other circuits of money are possible. For instance, some journals are freely accessible but the authors have to pay at publication time (some private companies such as Springer propose this scheme to the authors of non free journals in order to make their papers freely accessible).  Many prestigious journals are handled by capitalistic companies, asking for  high prices to make profit. On the other hand, being handled by an academic institution does not guarantee a low price.</li>
<li style="text-align: justify;"><strong>Human comedy.</strong> Mathematicians are first of all humans, members of an academic community. The academic community needs a way to measure the merits of each individual in order to decide recognition (and thus promotion and funding). In general,  recognition is gained by obtaining good or influential results, published in respected journals. Publishing in respected journals can be seen as a way to obtain a label of quality, a sort of delegation of evaluation. The respect or prestige of a journal comes from its history, its editorial board, and its content. The editorial and peer reviewing job of most peer reviewed mathematical  journals (free or  not) is done for free by mathematicians (they gain social recognition).</li>
</ul>
<p style="text-align: justify;">Many aspects are not specific to mathematics. Ideally, one can imagine the <b>introduction of editorial labels in arXiv.org</b>, attributed by editorial boards to papers at author request and after peer reviewing (these boards may leave completely capitalistic publishers). One can also imagine to <b>make arXiv.org less static</b> by adding on top of it a dynamic collaborative <a href="http://en.wikipedia.org/wiki/Stack_Exchange_Network">stack-exchange</a> structure such as MathOverflow, allowing the discussion of each paper. These ideas are floating around for a while. Unfortunately, discussing these matters with many colleagues and with the Editors of certain leading journals reveals that the mathematical community is a bit conservative. However, it is remarkable that some few scientific leaders such as the Fields Medalist <a href="http://en.wikipedia.org/wiki/Timothy_Gowers">Tim Gowers</a> are promoting such a revolution.</p>
<p><strong>Some related reading:</strong></p>
<ul>
<li><a href="http://gowers.wordpress.com/2012/01/21/elsevier-my-part-in-its-downfall/">Elsevier — my part in its downfall</a> by Tim Gowers</li>
<li><a href="http://terrytao.wordpress.com/2012/01/26/the-cost-of-knowledge/">The Cost of Knowledge</a> by Terry Tao</li>
<li><a href="http://gowers.wordpress.com/2012/01/29/whats-wrong-with-electronic-journals/">What&#8217;s wrong with electronic journals?</a> by Tim Gowers</li>
<li><a href="http://nuit-blanche.blogspot.com/2011/11/tim-gowers-model-of-mathematical.html">Tim Gowers&#8217; Model of Mathematical Publishing</a> by NuitBlanche</li>
<li><a href="/blog/2010/04/28/science-fiction">Science fiction ?</a> (in French) by the author of this blog</li>
<li><a href="http://people.ccmr.cornell.edu/~ginsparg/blurb/pg02pr.html">Can Peer Review be better Focused?</a> by Paul Ginsparg</li>
</ul>
<p>&nbsp;</p>
<p style="text-align: center;">
<p><a href="http://www.youtube.com/watch?v=XP9cfQx2OZY">http://www.youtube.com/watch?v=XP9cfQx2OZY</a></p></p>
]]></content:encoded>
			<wfw:commentRss>http://djalil.chafai.net/blog/2012/02/01/publications-science-money-and-human-comedy/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Diff-icile de faire plus simple</title>
		<link>http://djalil.chafai.net/blog/2012/01/27/3929/</link>
		<comments>http://djalil.chafai.net/blog/2012/01/27/3929/#comments</comments>
		<pubDate>Fri, 27 Jan 2012 19:57:06 +0000</pubDate>
		<dc:creator>Djalil Chafaï</dc:creator>
				<category><![CDATA[Combinatorics]]></category>
		<category><![CDATA[Computers]]></category>
		<category><![CDATA[IT]]></category>

		<guid isPermaLink="false">http://djalil.chafai.net/blog/?p=3929</guid>
		<description><![CDATA[Diff is a standard utility from the Unix world outputting the differences between two files. Even if diff can handle binary files, it is used mostly to compare two versions of a text file. For mathematicians, diff is helpful for the comparison of $\LaTeX$ files written with co-authors, in particular via its graphical user interface [...]]]></description>
			<content:encoded><![CDATA[<p style="text-align: justify;"><a href="http://sourceforge.net/projects/tkdiff/"><img class="aligncenter size-medium wp-image-3930" title="tkdiff" src="http://djalil.chafai.net/blog/wp-uploads/2012/01/tkdiff-300x125.jpg" alt="tkdiff" width="300" height="125" /></a></p>
<p style="text-align: justify;"><strong><a href="http://en.wikipedia.org/wiki/Diff">Diff</a></strong> is a standard utility from the Unix world outputting the differences between two files. Even if diff can handle binary files, it is used mostly to compare two versions of a text file. For mathematicians, diff is helpful for the comparison of <a href="http://en.wikipedia.org/wiki/LaTeX">$\LaTeX$</a> files written with co-authors, in particular via its graphical user interface <strong><a href="http://sourceforge.net/projects/tkdiff/">tkdiff</a></strong> written in <a href="http://en.wikipedia.org/wiki/Tcl">Tcl</a>/<a href="http://en.wikipedia.org/wiki/Tk_%28framework%29">Tk</a>. The is also <strong><a href="http://www.qtrac.eu/diffpdf.html">diffpdf</a></strong>, which is very convenient to compare two versions of a PDF file. There is another well known utility called <strong><a href="http://en.wikipedia.org/wiki/Patch_%28Unix%29">patch</a></strong>, a sort of reversed diff, used millions of times a day for software development, worldwide. On the technical side, diff relies on an <a href="http://en.wikipedia.org/wiki/Diff#Algorithm">algorithm</a> for solving the <strong><a href="http://en.wikipedia.org/wiki/Longest_common_subsequence_problem">longest common subsequence problem</a></strong>. By the way, if you are curious about text algorithms, you may take a look at the (free!) books written by <a href="http://igm.univ-mlv.fr/~mac/">Maxime Crochemore</a>,  from <a href="http://en.wikipedia.org/wiki/Marne-la-Vall%C3%A9e">Marne-la-Vallée</a>.</p>
]]></content:encoded>
			<wfw:commentRss>http://djalil.chafai.net/blog/2012/01/27/3929/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>A couple of recent programming languages</title>
		<link>http://djalil.chafai.net/blog/2012/01/23/a-couple-of-recent-programming-languages/</link>
		<comments>http://djalil.chafai.net/blog/2012/01/23/a-couple-of-recent-programming-languages/#comments</comments>
		<pubDate>Mon, 23 Jan 2012 08:09:26 +0000</pubDate>
		<dc:creator>Djalil Chafaï</dc:creator>
				<category><![CDATA[Computers]]></category>
		<category><![CDATA[IT]]></category>

		<guid isPermaLink="false">http://djalil.chafai.net/blog/?p=3881</guid>
		<description><![CDATA[Have you heard about the Go and the Rust system programming languages? Both are statically typed with a syntax not so far from the one of C/C++. They come with garbage collector, generic programming, and modules. They implement polymorphism without classes and support Unicode (UTF-8) by default. Go was created in 2007 and is supported [...]]]></description>
			<content:encoded><![CDATA[<p style="text-align: justify;"><a rel="attachment wp-att-2151" href="http://djalil.chafai.net/blog/2011/08/22/the-new-c-standard-and-its-extensible-random-number-facility/cplusplus/"><img class="aligncenter size-medium wp-image-2151" title="C/C++" src="http://djalil.chafai.net/blog/wp-uploads/2011/08/cplusplus-300x300.jpg" alt="C/C++" width="300" height="300" /></a>Have you heard about the <strong><a href="http://en.wikipedia.org/wiki/Go_%28programming_language%29">Go</a></strong> and the <strong><a href="http://en.wikipedia.org/wiki/Rust_%28programming_language%29">Rust</a></strong> <a href="http://en.wikipedia.org/wiki/System_programming">system programming languages</a>? Both are statically typed with a syntax not so far from the one of <a href="http://en.wikipedia.org/wiki/C_%28programming_language%29">C</a>/<a href="http://en.wikipedia.org/wiki/C%2B%2B">C++</a>. They come with <a href="http://en.wikipedia.org/wiki/Garbage_collection_%28computer_science%29">garbage collector</a>, <a href="http://en.wikipedia.org/wiki/Generic_programming">generic programming</a>, and modules. They implement <a href="http://en.wikipedia.org/wiki/Polymorphism_%28computer_science%29">polymorphism</a> without <a href="http://en.wikipedia.org/wiki/Class_%28computer_programming%29">classes</a> and support <a href="http://en.wikipedia.org/wiki/Unicode">Unicode</a> (<a href="http://en.wikipedia.org/wiki/UTF-8">UTF-8</a>) by default. <strong>Go</strong> was created in 2007 and is supported by Google, while <strong>Rust</strong> was created in 2006 and is supported by the Mozilla Labs. The programming languages C/C++ are Industry standards. Writing in C/C++ provides high portability and access to a wide range of libraries and optimized compilers.  However, it is quite easy to write buggy and/or unmaintainable code in C/C++. The aim of recent programming languages such as Go and Rush is to make system programming easier and smarter by retaining the good aspects of C/C++ while borrowing other good ideas from some other languages.</p>
]]></content:encoded>
			<wfw:commentRss>http://djalil.chafai.net/blog/2012/01/23/a-couple-of-recent-programming-languages/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Martingales which are not Markov chains</title>
		<link>http://djalil.chafai.net/blog/2012/01/20/martingales-which-are-not-markov-chains/</link>
		<comments>http://djalil.chafai.net/blog/2012/01/20/martingales-which-are-not-markov-chains/#comments</comments>
		<pubDate>Fri, 20 Jan 2012 19:48:52 +0000</pubDate>
		<dc:creator>Djalil Chafaï</dc:creator>
				<category><![CDATA[Probability]]></category>

		<guid isPermaLink="false">http://djalil.chafai.net/blog/?p=3867</guid>
		<description><![CDATA[Yesterday, a colleague of mine asked during a dinner &#8220;is there an elementary way to construct martingales which are not Markov chains?&#8221; Let us show that the answer is positive, by using a recursive recipe. Let \( {{(f_n)}_{n\geq1}} \) be a sequence of functions where \( {f_n:\mathbb{R}^{n+1}\rightarrow\mathbb{R}} \). Let \( {{(\varepsilon_n)}_{n\geq1}} \) be a sequence [...]]]></description>
			<content:encoded><![CDATA[<p><a href="http://en.wikipedia.org/wiki/Martingale_%28probability_theory%29"><img class="aligncenter size-medium wp-image-3876" title="Martingales" src="http://djalil.chafai.net/blog/wp-uploads/2012/01/martingales-300x225.jpg" alt="Martingales" width="300" height="225" /></a></p>
<p style="text-align: justify;">Yesterday, a colleague of mine asked during a dinner &#8220;<em>is there an elementary way to construct martingales which are not Markov chains?</em>&#8221; Let us show that the answer is positive, by using a recursive recipe. Let \( {{(f_n)}_{n\geq1}} \) be a sequence of functions where \( {f_n:\mathbb{R}^{n+1}\rightarrow\mathbb{R}} \). Let \( {{(\varepsilon_n)}_{n\geq1}} \) be a sequence of i.i.d. real random variables of zero mean, independent of a real random variable \( {X_0} \). We now define the sequence \( {{(X_n)}_{n\geq0}} \) by setting, for every \( {n\geq0} \),</p>
<p style="text-align: center;">\[ X_{n+1}:=f_{n+1}(X_0,\ldots,X_n,\varepsilon_{n+1}). \]</p>
<p style="text-align: justify;">We may safely assume that our ingredients \( {X_0} \), \( {{(f_n)}_{n\geq1}} \), and \( {{(\varepsilon_n)}_{n\geq1}} \) are chosen in such a way that \( {X_n} \) is integrable for every \( {n\geq0} \). The stochastic process \( {{(X_n)}_{n\geq0}} \) is a martingale for its natural filtration as soon as for every \( {n\geq0} \) and \( {x_0,\ldots,x_n\in\mathbb{R}} \),</p>
<p style="text-align: center;">\[ \mathbb{E}(f_{n+1}(x_0,\ldots,x_n,\varepsilon_{n+1}))=x_n. \]</p>
<p style="text-align: justify;">However, if for instance \( {f_{n+1}} \) depends on the first variable \( {x_0} \) for every \( {n\geq0} \) then \( {{(X_n)}_{n\geq0}} \) is not a Markov chain (of any order). This is clearly the case if we take</p>
<p style="text-align: center;">\[ f_{n+1}(x_0,\ldots,x_n,\varepsilon) =\varepsilon g_{n+1}(x_0,\ldots,x_n)+x_n \]</p>
<p style="text-align: justify;">where \( {g_{n+1}:\mathbb{R}^{n+2}\rightarrow\mathbb{R}} \) depends on its first variable for every \( {n\geq0} \). This leads to the following simple example of a martingale which is not a Markov chain (of any order):</p>
<p style="text-align: center;">\[ X_{n+1}=\varepsilon_{n+1}X_0+X_n. \]</p>
<p style="text-align: justify;">Another way to construct martingales which are not Markov chains (of any order) consists in perturbing a martingale. Namely, let \( {{(M_n)}_{n\geq0}} \) be a martingale. Let \( {{(\varepsilon_n)}_{n\geq1}} \) be a sequence of i.i.d. random variables of zero mean, independent of \( {{(M_n)}_{n\geq0}} \). Let \( {{(g_n)}_{n\geq1}} \) be a sequence of functions with \( {g_n:\mathbb{R}^n\rightarrow\mathbb{R}} \). Then one may define the sequence \( {{(Y_n)}_{n\geq0}} \) by \( {Y_0=M_0} \), and for every \( {n\geq0} \),</p>
<p style="text-align: center;">\[ Y_{n+1}=\varepsilon_{n+1}g_{n+1}(Y_0,\ldots,Y_n)+M_{n+1}. \]</p>
<p style="text-align: justify;">The stochastic process \( {{(Y_n)}_{n\geq0}} \) is a martingale (one can easily guess the filtration), but is not a Markov chain (of any order) if \( {g_{n+1}} \) depends on the first variable.</p>
<p style="text-align: justify;"><b>Note:</b> a Markov chain (of any order) is a stochastic recursive sequence of finite order, or equivalently an auto-regressive process of finite order (possibly nonlinear). In contrast, the martingale property does not put constraints on the order of recursion, while imposing a linear projection condition. If \( {{(M_n)}_{n\geq0}} \) and \( {{(M_n&#8217;)}_{n\geq0}} \) are two martingales for the same filtration then \( {{(M_n+M_n&#8217;)}_{n\geq0}} \) is a martingale. In contrast, the sum of two Markov chains is not a Markov chain in general (delicate counter examples are available).</p>
<p style="text-align: justify;"><b>Converse:</b> the converse is well known. Namely, if \( {{(M_n)}_{n\geq0}} \) is a Markov chain with state space \( {E} \) and kernel \( {P} \), and if \( {f:E\rightarrow\mathbb{R}} \) is such that \( {f(M_n)} \) is integrable for every \( {n\geq0} \), then \( {{(f(M_n))}_{n\geq0}} \) is a martingale as soon as \( {f} \) is harmonic, i.e. \( {Pf=f} \). In particular, if \( {E=\mathbb{R}} \) then \( {{(M_n)}_{n\geq0}} \) is a martingale as soon as \( {P(x,\cdot)} \) has mean \( {x} \) for every \( {x} \).</p>
]]></content:encoded>
			<wfw:commentRss>http://djalil.chafai.net/blog/2012/01/20/martingales-which-are-not-markov-chains/feed/</wfw:commentRss>
		<slash:comments>2</slash:comments>
		</item>
	</channel>
</rss>

