« first day (1904 days earlier)      last day (3415 days later) » 
00:00 - 22:0022:00 - 00:00

00:09
@BalarkaSen I know that you will see this later but I think that after looking, Hatcher has way better examples that have helped me in the introductory chapters. So just a thought.
user105491
00:50
@BalarkaSen Although more adavanced than introductory algebraic topology, it suffices to prove that $S^n$ and $S^m$ are not homotopy equivalent. (Not that you don't know this, of course.)
user105491
*advanced
Hi Sanath, how are you
Hi @morphic @Sanath @Julian
Hi @TedShifrin
01:06
julian, have you done a solid undergraduate algebra, like Artin, thoroughly? You should. And you too should not be skipping rigorous calculus (Spivak + my book). You all are in too much of a hurry and jump into the deep end when you shouldn't.
Anything good today, mr eyeglasses?
@TedShifrin Nope, things getting worse every day
How about you
Aw, can I help?
If you can somehow transfer a little bit of your mathematical abilities to me, that'd be great
Well, sitting there telling yourself you can't do it is a terrible idea. I told @Anthony the same thing. Belief and love of the subject are important. I can only try to help you with approach and intuition.
Seriously, a friend is coming for dinner, but I'll be back later, unless I get banned again.
Banned D:
01:12
I was last night.
Ooh, what for?
OMG Mike Miller
For calling someone a rude a** ... Which was no lie. See Balarka's starred thing.
And hi @MikeM
I tend to prefer to avoid rude assholes, so I won't. Morning.
LOL, goodnight.
How come I got banned and you didn't?
Pedro told me that it was automated.
Disconnected ... Am I getting banned again? I want to prove
01:17
No
Doubt it's automated. I've cursed more than a few times.
Protest .. Or quit.
Someone doesn't like you and flagged you. Probably the person you called an ass.
Well, mods wouldn't have been instantaneous .
I've never seen that person before. I figured it was Alec, but Pedro told me no.
Anyhow, we need to help mr eyeglasses.
I don't really need "help" per se. I'm just slow
Nothing I can really do about that
01:20
Slow is ok, if you really learn it well.
Oh... but I just got off my bus, so my time here is over.
See ya
Aw, bye Mike
But your attitude needs improving, or else just quit after your BS.
I'll be back later, mr eyeglasses.
I don't mind taking it slow, it's just that nothing else slows down for my learning speed, which is the only frustrating part (e.g. classes moving into the next topic when I'm still behind 2 topics, etc.)
Ok, later Ted
01:23
hey chat
hugs. You need to learn to handle it. Grad school is worse.
4
@TedShifrin it really is :/
Hi @Semiclassical. See you later.
later @ted
How are you @Semiclassical
01:25
not great
i tried to get my grad school career back on track this semester, including a return to TAing
and while the concepts have come back to me, the self-discipline (and ability to overcome my grading anxiety) have not
Aww sorry
i had expected grading lab reports / quizzes to be painful, but i used to (usually) be able to actually do it in a timely manner
this semester? not so much. and you know it's gotten bad when the prof has gotten word of it
Uh oh
01:29
that's the right phrase, yes
the sad thing is, i really do like the interactions with students in lab/discussion/tutoring
but education is necessarily as much about giving feedback as giving content, and that's just kind of miserable
01:41
@TedShifrin Hi Prof Shifrin, do you by any chance have a list of homework assignments that went along with the MATH 3500-3510 course that is available on youtube?
02:02
@TedShifrin
@TedShifrin I was asking my topology prof today if I could do a review class for our topology to cover the stuff we learned since we have a midterm next week so it would be nice experience for me to make sure I have understood stuff 100 %
I think I will make it like 5 hr review class as I want to cover all of chapter 2 of munkres
quotient topology,Box topology,product topology, continuous functions, basis and subbasis of topology, etc
and do some questions with fellow students
hopefully people will be up for it
02:23
Okay guys, is there any way to do a 2D Hilbert transform in the frequency domain?
1D is easy, just zero the left half side. BUT how do we do it for a 2D signal
 
1 hour later…
03:34
someone v heard about november blackout ?
no shave november
or is it new illuminated joke besides 12/'12
@Mikhail i usually dont shave for a month
04:15
@Sanic: If you wasn't to email me, I can email you assignments, but most problems are from the text, so you'll need to get that.
what problems @TedShifrin
is that the linear algebra course I am assuming
since that is the one that you have on youtube
if so can I also get it ?
@Semiclassical, it's is important to give timely and constructive feedback. I've always tried to get stuff returned very fast. The grading is no less painful when you procrastinate.
Not linear alg, Karim. Multivariable + linear, integrated.
...and integrated very well I might add, imho.
@Sanic: Damn autocorrect. If you WANT ...
Thanks, @user685252, but stop kissing up :)
04:37
@Ted I messaged you.
@Julian: Yup.
05:21
Can somebody please help me fill in a long-standing gap in my algebraic understanding? Consider $3t^2=27$. I was never taught that I need to divide by 3 before square-rooting both sides to get the right answer of $3$, rather than $sqrt(27)/3$. I'm dying to know what this rule is (more than just operator precedence).
Do you not realize that there are two solutions to the equation, namely 3 and –3 that will make the original equation a true statement?
I don't think so because $sqrt(27)/3$ is about 1.73
To expand on my question, this works:
$3t^{2}=27$
$t^{2}=9$
$t=+/- 3$
But this does not work. Why?
$3t^{2}=27$
$3t=\sqrt{27}$
$t=\sqrt{27}/3$
05:48
@FizzledOut Why does the $3$ get the honor of not being sqrted?
You think $\sqrt{3t^2}=3\sqrt{t^2}$, but then $3t^2=(\sqrt{3t^2})^2= (3\sqrt{t^2})^2=9t^2$
So $3=9$ :)
Sometimes coefficients have weird properties and I used to get horribly, horribly confused over them (as if they were more than just a number). Some of those misinterpreted properties have propagated through my math. And I usually only apply these "properties" in the exact sort of equations where I first accidentally committed them to memory, which makes it woefully hard to hunt down. I do most of them right, but I've trained myself to do some, even basic, problems incorrectly. Huh.
At least I get to shoot down another misconception; thanks.
But you understand now that you sqrt the whole of both sides?
$$\pm \sqrt{3}\sqrt{t^2} = \sqrt{27}$$
$$\pm \sqrt{t^2} = \sqrt{27}/\sqrt{3}$$
$$\pm \sqrt{t^2} = \sqrt{9}=3$$
$$t=\pm 3$$
The idea is that both sides are equal, so they are 'the same thing', so whatever you do to one, you must change the other identically to keep them equal. So any operation must effect everythng on both sides, sorry if this is annoying
06:31
is there a notion of weak convergence in a normed space that doesn't have an inner product?
currently I know of weak convergence to mean $\lim_{n\to\infty} \langle x_n, x\rangle = \langle x,x\rangle$ for $x_n \rightharpoonup x$, so I wouldn't think so, but a classmate asked me this and I am not sure if there is some other notion
i'll ask on main soon if noone here knows
 
1 hour later…
07:36
@FunctionalAnalysis: Rather than using inner products, you can apply general linear functionals.
07:49
yesterday, by Gigili
Let the audience judge who is rude
yesterday, by Balarka Sen
@Gigili is generally rude to people.
@Gigili that^ is up to 6 stars
QED
 
1 hour later…
09:05
@user685252 stop stiring up the pot
Although a good observation, it is indeed better to let the stars do the talking
(I'll note Gigili's response you have posted was to me)
09:49
Math is vast and is continuously becoming more vast. How can a learner make sure that he is continuously growing his mathematical maturity while studying math formally?
10:17
@SanathDevalapurkar yeah, but obviously Julian would have to learn fundamental groups before homology and you cannot prove S^m and S^n are not homotopy equivalent without homology. you need to go step-by-step: jumping straight onto a certain fact would do no good for a beginner in algebraic topology.
so, I don't really see the point of stating that fact.
@JulianRachman monomorphism? epimorphism? how does that even relate to being or not being homeomorphic?
you're mixing up terminologies.
@Tien-ChengHuang Not sure how your beginning statement and the following question are related. For the latter you should be moving over the text you are reading with a critical mind. What are the implications of what you are reading etc. Most people don't have time for this admittedly
10:36
stop starring offensive posts plz
@Agawa001 Why do you care? Also aren't you now stirring the pot?
@GaloisintheField first you accused me using socks for spamming and now you seem to drum on that pot
i care because i dare, starring offensive posts is so rude to people
3
@Agawa001 ok
I suspect you are trolling now, but anyway, what are you working on?
ignoring you
11:06
Hi can anyone answer this question?Solve initial value problem Q=a cos (1/24)t + b sin (1/24)t when Q (0 )=4 and Q '(0)=0. I've tried but the answer I get is incorrect
11:56
Heya
Hey pal
How is Jonas doing?
@N3buchadnezzar
Seems good, he is running a lot and doing mathematics =)
Nice to hear :-)
12:23
How is everyone on this fine time interval
@Paradox101 I got $Q\left(t\right)=4\,\cos \left({{t}\over{24}}\right)$, but I just woke up didn't check carefully so be warned.
@GaloisintheField What is "how" in this context? If you mean feelings, I haven't booted that up yet.
@MickLH Yes it was just a lazy rephrasing of 'how is everyone on this fine evening' abstracted away from specific time period
How is everyone doing what?
I said how is everyone on this fine evening, is this not normal?
Oh yes, feeling... again I have not reached that point in my wake-up procedure as of yet.
13:26
@BalarkaSen ya I was. My bad
@JulianRachman Right.
 
2 hours later…
15:20
@TedShifrin see, the rational part of my brain agrees with you. alas, it's the anxiety which tends to hold the controls when i have to do it
What could we change at the following definition so that $\text{EXP}(\mathbb{C})$ is a ring?



"We define EXP($\C$) to be the the set of expressions
\begin{equation}\label{a}
a=\alpha _0+\alpha _1e^{\mu_1z}+\dots +\alpha _Ne^{\mu_Nz}
\end{equation}
(beyond the `zero function', $0$, which we will consider to be also an element of EXP($\C$)),
where $\alpha_0, \alpha _1,\dots, \alpha_N\in \C\setminus \{ 0\}$ and $\mu_i\in \C\setminus \{ 0\}$; in writing such an expression we will always assume that the $\mu_i$ are pairwise distinct."
@MickLH I got the same answer but apparently it's not correct
15:44
Can anyone answer a question?
15:59
Yo @Semiclassical
heya
hows things?
Same old, same old
Just catching up on some email
You?
trying to be productive atm
read up on OP stuff
mainly asymptotics, kernels, etc.
16:03
cool
For a compact Riemann surface $X$, let $\operatorname{Cl}^{1}(X)$ be the divisor classes of degree $1$. If the map $X \to \operatorname{Cl}^{1}(X)$ given by $P \mapsto [P]$ is injective, why then follows $X \not \cong \mathbb{P}^1$?
I tried to do this by contradiction, assuming that $X \cong \mathbb{P}^1$
Also one of the previous exercises gives that if $X \not \cong \mathbb{P}^1$ then there are no non-constant meromorphic functions $X \to \mathbb{C}$ with only 1 pole of order 1
So that may be useful
16:21
@Semiclassical, I thought maybe you'd like to talk over email? About anxiety, etc.
i'd like that, though right now in particular isn't the best moment. but let me flash my email up momentarily
REDACTED @AntonioVargas
Sure, anytime
i'll be removing that in a moment
@Semiclassical got it
feel free to send me an email on that one just to make sure
i'm trying to remember, what are you working on these days? @AntonioVargas
16:28
@Semiclassical me too!
haha
i'm kind've in the middle of projects right now, mostly because progress on what i was working on before has tapered off
But seriously, I'm trying to learn (and eventually have a working knowledge of) Riemann Hilbert methods for asymptotics
gotcha. i'd like to have the same, tbh
especially the linkage of RH with (iso)monodromy and differential equations
stuff in the direction of Painleve, i suppose
I was interested in that as well
actually, I need to put some notes together on RH. i had been compiling some basic OP notes a while back, but got caught up in other stuff
oh, and tau-functions. it'd be nice to know wth a tau-function is
16:31
(For those that have read my previous question): I have reduced it to finding is a non-constant meromorphic function $f: \mathbb{P}^1 \to \mathbb{C}$ with a root in $P$ and a zero in $Q$ for $P,Q \in \mathbb{P}^1$
at this point, though, my desire is less "find some interesting new result" so much as "put everything we've done up to know in a more precise language" a la OPs
so translation/transcription rather than creation, i guess
I might have mentioned that I went to a session at OPSFA chaired by Peter Miller on RH in relation to asymptotics for DEs, in particular nonlinear Schrödinger and related equations
I thought that stuff was fascinating, but I probably won't pursue it for a while
i remember you were at OPSFA, didn't remember Miller specifically
but yes, that linkage to integrable systems stuff
interesting as heck, but definitely on the 'obscure Russian literature' side of things rather than easy reading
It was connected to the scattering transform / inverse scattering transform methods
ahhhh
i know just enough about that stuff that i wish i knew more :/
i got interested in it a while back in the case of KdV / Schrodinger equation
with the latter being the scattering problem, if memory serves, and being used to solve KdV via inverse scattering
never really got good with it, but it was helpful
16:40
hello, I wanted some help in locating some books related to Plucker's trick in algebraic curves
is that related to the Plucker embedding? (not that i know much about it, mind)
ahh, i guess this is the same as in your question earlier this month?
It is called abridged co-ordinates. It is generally used in conics/cubics to prove interesting theorems in line co-ordinates. The idea is to write a curve as $C = C_1 + \mu C_2=0$ where $C_1$ and $C_2$ are two other algebraic curves. The curve $C$ will pass through $C_1 \cap C_2$.
I am not able to find geometry books which explain the applications of this technique.
16:56
I am currently attending an undergraduate analysis course assigning Marsden's "Elementary Classical Analysis" as the textbook. If I want to complement my study by some chapters from baby Rudin, which chapters will you recommend?
@Tien-ChengHuang is Marsden very difficult? I usually try to supplement with an easier text, not a harder one.
@AntonioVargas there's a baby Rudin study group on Reddit (r/babyrudin) I want to join. Also I don't want to miss all of the "bible" baby Rudin.
Huy
Huy
don't do it because others are doing it
17:12
well i believe i have the mathematical maturity to work through some chapters (single-variable analysis part) of baby Rudin...
Sorry @Tien-ChengHuang, I didn't mean to sound like I was trying to discourage you.
@AntonioVargas no problem. i guess complement with chapter 1-4 of baby Rudin is enough. (in fact i read through this part years before and did a few exercises)
that study group on Reddit seems want to work through all exercises
hi... can anyone please take a look at this question :
0
Q: Fourier Series of $f(x)=\pi-x$ where $0<x<\pi$ even and odd extension

sajjadPlease help me solve this Fourier series and correct my solution if it is wrong. it's a non-periodic function which we need to write its Fourier series (even and odd) : $ f(x)=\pi - x $ ; $ 0<x<\pi $ I have reached cosine extension(even) as follows: $ \phi(x)= \begin{cases} \text{$\pi-x$ ; $0<x

Huy
Huy
17:52
hi @MikeMiller, how you doin?
Wow twice in 2 days
The Math SE just makes me feel sad.
I'm in Calculus and I still don't understand a lick.
Huy
Huy
18:25
?
Most of the Math SE is theoretical math
I could never keep up with that
Huy
Huy
never?
Maybe in another univers
Give it 5 years and look at it again.
@sajjad are you sure non-periodic function can be transformed to fourrier series ?
18:29
@DeltaEscher, what kind of math do you like best?
The easy kind
But probably limits.
Those are fun
I like limits too. particularly infinite ones.
@MathMan looking over you about-me! you are my twin
How's that?
math/programming conjugation, i had the craving since childhood to program by maths and reduce execution-time by simplified math-equations
18:38
Yep!!! for sure! On math.se most people don't like programming though :/
@DeltaEscher, how about \lim_{x \to 0} {sin(x)\over x}. Do you know about that one already. It's one of my favorites!
Then @Agawa001, you might like this question I asked. math.stackexchange.com/questions/1227801/…
No answer yet! Just a lot of views.
@MathMan did you try branch and bound ?
What? I'll google that.
@MathMan its hungarian appoach to find optimal solutions using trees
So no I haven't. It looks like you find a solution to a problem and then keep looking for a better one. This problem either has a solution or doesn't. I am just looking for the whole solution set (ideally).
18:54
@MathMan how did you find the formula of permutations 2*n!
i mean is it a rule ?
Quick question. Right after the definition of topological $m$-manifold with boundary, I came across a statement: If a point $p \in M$ is mapped to the boundary in one chart, then it is true in every chart. Is this obvious? I tried to prove it and the only way I could figure it out was to take homology groups after removing the points in the images of the chart maps and showing they don't agree if one point was on the boundary and the other wasn't
Chatjax wouldn't process that.
or you are trying to extrapolate
$\lim_{x\to 0} {sin\over x}
Sorry. $\lim_{x \to 0} {sin(x)\over x}$
18:56
no
I just started calculus at 14.
It's quite a doozy.
@Robert: It's invariance of domain.
Let's try again: $\lim_{x\to 0} {sin({1\over x})}$
I saw it.
I just haven't done it yet
@TedShifrin, how does that argument work here?
Ok I think I finally got it.
19:00
I expect we use the observation that the boundary has dimension 1 less than the dimension of the space, but I'm not sure how to use that.
@MathMan how did yuo find 2*n! do you have a proof
@DeltaEscher That is probably my favorite limit because of the great things it does around 0.
What is the definition of the degree of a holomorphic map?
@Agawa001, it is from assuming that the top row is 1,2,3,4,5 and finding that there are only 2 solutions. then there are 5! ways to permute the top row.
Actually, I think it is that simple. If one chart maps the point to the boundary, the image is an $m - 1$ manifold, if it doesn't, it's an $m$-manifold. By invariance of domain, they can't be homeomorphic, contradiction.
19:03
For an even grid it can always be done in those two ways so there will be at least 2*n! solutions.
I see
I looked it up on Google Images :3
@MathMan for the first row permutaion n!, there is 3 eventualities for 5 not 2
Nevermind, I don't think that argument works.
How's that????
ah, "atleast", you would rather say that at the begining
@MathMan 5 can be in the 1st 2nd 3rd column of second row
19:06
but if in third row if will conflict with the 5 in the top row!!!
how is that ? two occurences of 5 are too far inbetween
2 columns difference atleast
Oh. sorry. well if you put it in the first row you get stuck farther down.
2nd or 3rd row are valid.
@MathMan exactly, thats why you need a sweeping statement
Hmm. Ok i'll think about that some more...
19:25
@MathMan i ll try to deal with it by graphs but wont promise to spend time further coding it
19:43
Could you take a look at my question?
0
Q: Finite difference method - Why does the relation hold?

evindaWe consider the finite difference method for the approximation $\left\{\begin{matrix} -u''(x)+q(x)u(x)=f(x)\\ u'(a)=u'(b)=0 \end{matrix}\right.$ and let $K$ be the $(N+2) \times (N+2)$ matrix of the method. Let $v \in \mathbb{R}^{N+2}, v=\begin{pmatrix} v_0\\ v_1\\ \dots\\ \dots\\ \dots\\ ...

hi @PaulPlummer
Hello @BalarkaSen
What are you up to?
@PaulPlummer Studying calculus and topology, you?
I am revisiting a problem: Looking for a "ping-pong lemma" proof that $\langle x \mapsto x+1,x \mapsto x^3 \rangle$ (as automorphisms of $\mathbb{R}$) generates a free group on two generators
ah, yeah. that's a werido problem.
19:51
Mostly coming up with ideas to investigate
@PaulPlummer Cool. You're a grad student now, aren't you?
Werido problem :) I like that. @BalarkaSen Yes I am
sigh That was a typo.
It is going okay, there is a lot more duties than I like (teaching tutoring etc) but I guess it comes with the job.
@PaulPlummer Must mean a lot of work.
Fair enough.
@PaulPlummer I have been thinking a bit about the cellular approximation theorem nowadays. It's a research problem in Kirk-Davis, chapter 1. I have a few ideas, but I can't get it to work.
Do you know the statement of that theorem?
19:57
No, I do not
$f : X \to Y$ be a map between CW-complexes. Then $f$ is homotopic to a map $g : X \to Y$ such that $g(X^n) \subseteq Y^n$, i.e., $g$ takes $n$-skeleton to $n$-skeleton for every $n$.
You can apply it to maps $S^k \to S^n$ for $n > k$ to prove that every such map is nullhomotopic, thus proving $\pi_k(S^n) \cong 0$, say.
It's a cool fact.
That is cool
Seems like a handy algebraic topology theorem
Indeed.
In fact, given any CW-complex $X$, this shows $\pi_k(X) \cong \pi_k(X^{k+1})$.
Where $x^{k+1}$ is the $k+1$-th skeleton of $X$.
It's because you can cellular approximate maps from $S^k$ to get it down to $k$-skeleton and you can cellular approximate homotopies, which are maps from $S^k \times [0,1]$, to get it down to $k+1$-skeleton.
20:03
@Agawa001 it happened to me too. I helped someone by telling them something I read in a book and what book and he didn't think it was true.
So you're really computing the homotopy group of $X^{k+1}$ anyway.
There is a seminar today on: "Quasimorphisms on right-angled Artin groups", and I guess quasimorphisms are morhpisms $\phi : G \to \mathbb{R}$ where $\sup | \phi(a)+\phi(b)-\phi(ab) | < \infty$, which just looking at it seems like it is related to bounded cohomology... It is cool to see ideas after you learn of their existence (even if I still don't know anything about it)
@BalarkaSen
You want to go to the seminar?
I will be going to it and I want to go
(I don't know anything about bounded cohomology)
@PaulPlummer Let me know what it's all about!
20:09
@AlecTeal which post you are refering to
Hopefully I will understand some of it :), I will try to explain what I get out of it. It starts in 40 minutes or so. @BalarkaSen
Nice.
Thanks in advance too :)
What is the research problem for the cellular approximation theorem? @BalarkaSen Or is it "investigate the cellular approximation theorem"
It just asks to prove the cellular approximation theorem. :P
Pretty dumb as a research problem, isn't it?
But I figured I should do it, because I have been using it a bit here and there recently, without knowing why it is true.
Haha. Is it not in Hatcher?
20:14
And using facts as blackboxes, not really knowing how to prove them, gives me guilty pangs (is that universally true?).
@PaulPlummer I guess it is. I haven't looked. Probably in chapter 4 somewhere.
I am in chapter 3 right now.
@Agawa001, I added some of the notes we talked about into my question to make it a little clearer including the important "at least"!
@Agawa001 what is your favorite problem spanning both math and programming?
I think it gives a lot of us discomfort. Sometimes it is nice though, because you get a feeling for why you would want to know the theorem in the first place without doing the hard work of proving it @BalarkaSen
@MathMan both, i cant use weapon without bullets neither bulets without gun
@PaulPlummer Agree with what you said.
@Agawa001 I don't get it??...
20:18
Why is a non-constant holom. map between compact Riemann Surfaces of degree 1 an immersion?
@Agawa001, I see your saying they go hand in hand. Yes. Just wondering if you have a favorite problem that you use them both for that you have been working on.
@Agawa001, btw my computer went dead earlier that's why I suddenly dropped the conversation. sorry.
@MathMan in artificial intelligence, my longest research was shortest hamiltonian path
see the oxymoronic statement !
@PaulPlummer Tell me about a cool geometric group theory fact.
i also was concerned in integrating function using prolog
well too many i cant remember em all
longest...shortest! got it! How does that apply to AI?
20:26
its graph theory, linking nodes until coming to shortest path that links all these nodes with minmal metric
i tried to solve n queens, labyrinths, using this technique, its widely used .
@BalarkaSen Haha. I have not been doing much geometric group theory... Sort of recently I proved that $C'(1/6)$ satisfy the linear isoperimetric inequality. That is if $w=1$ in a group then the min $n$ such that $w= u_1r_1^{\pm 1} u_1^{-1}...u_n r_n^{\pm 1} u_n^{-1}$ is called the area $A(w)$, where $r_i$ are relation in the group, satisfies the inequality $|w| \leq kA(w)$ for a fixed $k$. I got to go, maybe I can say more about it when I get back (the proof is sort of clever, but needs a bit of
machinery built)
@PaulPlummer Yeah, sure, you can ping me stuff when you come back if you want. I'll look later, I need to go too.
@Agawa001 nice.
about mathematics, most time taking research was studying flaws of rinjdael model
ummm your question seems to be impressive
20:58
Pure math is fascinating and everything, but I prefer stats over pure math in some cases... hides
21:14
@Agawa001, I'm interested in the n queens problem! My problem is kind of a generalization of it.
@MathMan so is mine
Is it on SE or do you have a good one on SE I could look at?
@MathMan no its at my college, maybe i ll think to upload an e-copy
but its in french, i need much time translating it
21:33
Well that's all right then. I was looking at some of your questions on SE. I like voters on a round table!!!
@MathMan you cant find kind like these problems in puzzling, but as long as i have time, may be i share some of my previous effort in university here
@MathMan what was your research focused on ? n queens in n by n chessboard ?
like this
I'm working on formulas for vector graphics right now actually. I am interested in a lot of areas of math though. @Agawa001
00:00 - 22:0022:00 - 00:00

« first day (1904 days earlier)      last day (3415 days later) »