7 December, 2015
Sometimes you want to explain changes you did to a text in (La)TeX, or perhaps to source code, as a coloured diff produced by your favourite VCS, such as git in my case, by attaching it to an email. The net is full of various scripts to do so, with various degree of success; however, all you need is an installation of enscript, something that is standard on most Linux systems, or at least used to be so.
enscript understands a lot of different programming languages, and can highlight them, and not only them, but also various diff files, e.g., something that git normally produces, unified diffs. Now if your diff is saved in a file blah.diff, you can do
enscript -o blah.ps --color -Ediffu blah.diff
to create Postscript file blah.ps with nicely coloured diff. (And you can also produce HTML instead, or convert Postscript to PDF.)
28 November, 2013
The program announced at this post is finally happening, here is
the official schedule etc.
Two of my graduate students at NTU, Svetlana Obraztsova and Nick Gravin, received their PhDs in the past 12 months.
And, on a personal note, there is Jacob Victor, a.k.a. Yasha, born in August 2012
20 August, 2012
Weak Nullstellensatz says, that for an algebraically closed field each maximal ideal in has form , for , i.e. , the ideal of an one-element subset of . Its proof in this generality needs quite a bit of commutative algebra. However, if we futher assume that is uncountable (thus covering a very important case ) we can give a much quicker proof.
Theorem 1 Let be an uncountable algebraically closed field, e.g. , and a proper maximal ideal in . Then there exists such that .
Proof: The first step is to show that . To see this, we will show that every is algebraic, i.e. a root a nonzero polynomial . Note that the dimension of as a vectorspace over is at most countable, as is generated by the images of the monomials under the ring homomorphism , and the exponents form a countable set. Thus for the set
is linearly dependent, i.e. there exist such that Thus
where and . As is algebraically closed, we have that is linear, i.e. .
Next, we observe that maps to , and set , for . As , we see that , for . By maximality of , we obtain , as claimed.
Here one can find reduction of the general case (not assuming non-countability of ) to this one.
28 May, 2012
One cannot always triangulate a non-convex polyhedron using only its vertices, sometimes one need to add more of them. A simple example of this phenomenon is Schonhardt polyhedron. Here is a picture illustrating how one builds it that I drew for a forthcoming paper, using Tikz LaTeX package, which is awesome, but totally overwhelming.
It fact, it’s easy to see that the 6 vertices and 12 edges it has are not enough. Indeed, each pair of non-intersecting edges determines a simplex, but it’s easy to observe that any such selection will include one the forbidden pairs of vertices AC, A’B, or B’C’. (The LaTeX source of the picture is here).
The paper I mention is related to a topic of the program on inverse moment problems at IMS (NUS/Singapore) in late 2013-early 2014 which I co-organize.
19 March, 2012
Sage (not the accounting software, but sagemath.org) is accepted to Google Summer of Code 2012, and I will be one of many mentors.
7 August, 2011
We are to embark upon teaching a 2nd year undergraduate course Experimental Mathematics, which will cover computer algebra basics, and refresh concepts from 1st year linear algebra, calculus, and combinatoris, with few more advanced things thrown in. The course will be based on Sage, with the actual software running on dedicated servers, and accessible via Sage web notebook interface (i.e. basically nothing but a web browser running on the student’s computer/laptop/ipad, etc).
Given the enrollment of about 120, this will be interesting…
PS. Most students did not appreciate the freedom given, and complained, complained, complained…