A triangle $T$ is given in the plane with sides $300,400,500$. A second triangle $r_l(T)$ is created by reflecting $T$ about a line $l$. Find $\min\{[r_l(T) \cup T]\}$ where $[\cdot]$ denotes area.
I actually discovered this from Green's Theorem and turned it into an exercise in one of my books ... then discovered it was classical.
Well, starting with the vertices, you can write down a formula for your reflection and compute what it does to the vertices, and then chain them all together (assuming the reflected vertices do not in fact coincide with the original ones).
A triangle $T$ is given in the plane with sides $300,400,500$. A second triangle $r_l(T)$ is created by reflecting $T$ about a line $l$. Find $\displaystyle \min_{l}\{[r_l(T) \cup T]\}$ where $[\cdot]$ denotes area.
A triangle $T$ is given in the plane with sides $3,4,5$. A second triangle $r_l(T)$ is created by reflecting $T$ about a line $l$. Find $\displaystyle \min_{l}\{[r_l(T) \cup T]\}$ where $[\cdot]$ denotes area.
On iOS, autocorrect seems often to automatically change merged words to separate capitalized words; drives me mad because on my iPad it's not easy to just change one letter and I have to retype the (long) second word without the capital.
Let's assume that $Fx=x$ is a philosophy student, $Rx=x$ is a rotten lecturer, and $Mxy=x$ admires $y$.
My translation of the sentence was $\forall x(Fx\supset\neg\forall y(Ry\supset Mxy))$, but my logic textbook translated it as $\neg\exists x(Fx\wedge\exists y(Ry\wedge Mxy))$.
As far as I kno...
I ran out of time :( I defined parallel transport, proved it's orthogonal for LC, defined holonomy, said de Rham's theorem, talked about how restricted holonomy lets you get properties like orientability, Kahler
And then I was out of time. I wanted to draw the big table of possible holonomy groups.
The shoelace formula or shoelace algorithm (also known as Gauss's area formula and the surveyor's formula) is a mathematical algorithm to determine the area of a simple polygon whose vertices are described by ordered pairs in the plane. The user cross-multiplies corresponding coordinates to find the area encompassing the polygon, and subtracts it from the surrounding polygon to find the area of the polygon within. It is called the shoelace formula because of the constant cross-multiplying for the coordinates making up the polygon, like tying shoelaces. It is also sometimes called the shoelace method...
i mean, i can see the determinant-ish nature of the integrand in green's theorem (which isn't shocking, since i can think about the area as the z-component of $\mathbf{x}\times d\mathbf{x}$)
One of my colleagues at UGA who retired just before I got there designed a round-robin tennis tournament scheduler (copyrighted) using finite fields (block designs, I guess).
You can prove it purely geometrically by dividing the polygon into triangles and using what we know about determinant and area of triangle/parallelogram.
Yes, @Semiclassic. That's basically the theorem (a version of the Residue Theorem) that if a cubic passes through 8 of the 9 points of intersection of two other cubics, then it passes through the 9th as well.
There's a beautiful paper by Griffiths called "Variations on a Theorem of Abel," too, which talks about Abel's Theorem in basic algebraic curve theory and how it generalizes the addition law for trig functions and $\wp$ functions. Both Karim and @Semiclassic should look at it sometime.
@PVAL: In total seriousness, I am to this day convinced that my Berkeley thesis (which got published in Transactions) was something Chern could have done in an afternoon. Don't put yourself down unnecessarily.
I have recently read a few papers that got published in decent places (say Topology and Geometry or even Duke or JDG) which have about 4 pages of new content (which usually proves pretty nice statements) and 16 pages everyone in the field already knows.
@Semiclassic: They want the lecture (which, presumably, you're not freaked about). The point of the paper is, presumably, to give you some practice at writing so that you can do the next step.
I don't know if I think they are poor papers or anything. It's just interesting to me how little of the work is original (now that I have a decent understanding of known things and how to read these papers).
@PVAL: At one point when I was ready to quit on my Ph.D., I went to the library and looked through some of the theses that Chern had approved. Some were pretty shabby. That emboldened me to say, "I can do better than this." And I did.
the thing that's frustrating for me is that i don't really stress out over delivering the lecture per se. or at least i don't organize my anxiety around that
i organize it around the fact that 1) i find preparing papers and presentations to be really frustrating and unpleasant, 2) i know I do, so i know i'm likely to avoid doing it, 3) knowing i'm likely to avoid doing it, i don't want to make commitments i can't fulfilll
@Semiclassic: I think you have a lot of talent. I truly think you need some help from a counselor/psychologist/psychiatrist to get over this hump ... or to get pointers.
I feel like if I tried to prepare presentations front to back they'd be really be difficult. Usually there is some small part of it that I know I need to describe and can do so easily. Then I fill in the background and the other interesting parts fall out of it.
to some extent. but i'd managed to push through it before.
grad school is just such a different environment. for the first two years i lived by myself, and for the rest with my parents. compare that to undergrad where lived with friends.
it all seems to blend together into one frustrating mess
Some grad departments are a bit more nurturing than others. But, ultimately, you have to make your life work and try to be successful. We're rooting for you, @Semiclassic.
A precise relation between homology and homotopy groups is given by the Hurewicz (who accidentally fell off a Mayan pyramid at a conference and died) theorem.
DogAteMy, if you're interested, I can send the midterm I just gave my two long-distance students back at UGA. But it's based on Munkres's book, so maybe you won't want it.
The 1st homology of the Klein bottle isnt even isomorphic to a subgroup of $\pi_1$ (which is actually torsion free). There's an answer I wrote on this site which sketches this and leads down a rabbit hole I recently sent and undergraduate down.
This sort of seems like a statistics question: if we can get the residual to be as small as possible between the area of the triangle = 6, that minimizes the union
@Ted: It was carefully prepared. I just chose it because I could write a good lesson and cover it then. I didn't read the GB proof and would be uncomfortable presenting it even with good notes.
I'm convinced I've proven something my adviser figured out, maybe even wrote in the first draft of a paper, and then decided it was something that wasn't worth publishing.
I can even point out where and in what paper it would be.
I've been trying to think about obstructions to a contact manifold being a double branched contact cover.
I think Giroux showed everyone is a triple branched contact cover, but I have no idea what are the known obstructions (if any) to being a double branched cover.
"everyone"
It seems open whether if there is a natural analogue to Montesino's trick.