5,249 reputation
42379
bio website
location
age
visits member for 2 years, 8 months
seen 17 hours ago

I disliked mathematics for most of my life. Then someday I decided to give it a try and I think it is beautiful now. At the moment I'm studying mathematics at an undergraduate course.

Don't mind the lack of pattern in my questions, I'm having to learn some new concepts and also some things I should have learned when I was younger.


1d
comment Is it possible to express the idea of a number bigger than any other number ($\infty$) in programming languanges?
I don't understand why the question is on hold, It is said in the help center that questions about Software that mathematicians use (except Mathematica, which has its own Stack Exchange site) are valid. I am asking about something that would help me to use software to implement these graph algorithms.
1d
asked Is it possible to express the idea of a number bigger than any other number ($\infty$) in programming languanges?
2d
comment On thinking that planarity is nothing but topology?
@quapka But I guess he's talking about the plane.
2d
comment On thinking that planarity is nothing but topology?
@quapka Yes, I've read on Bondy and Murthy's Graph Theory, page 6: Although not all graphs are planar, every graph can be drawn on some surface so that its edges intersect only at their ends. Such a drawing is called an embedding of the graph on the surface. Figure 1.21 provides an example of an embedding of a graph on the torus. Embeddings of graphs on surfaces are discussed in Chapter 3 and, more thoroughly, in Chapter 10.
2d
awarded  Popular Question
Oct
28
asked On thinking that planarity is nothing but topology?
Oct
26
accepted Finite models for Systems of Incidence and Parallelism Axioms?
Oct
26
revised Finite models for Systems of Incidence and Parallelism Axioms?
deleted 1 character in body
Oct
26
comment Finite models for Systems of Incidence and Parallelism Axioms?
I don't understand one thing: Why does he says that the equation for $AB:1X=0$, you're saying that the equation is $ax=0$. Is $a=1$?
Oct
26
revised Finite models for Systems of Incidence and Parallelism Axioms?
edited body
Oct
26
revised Finite models for Systems of Incidence and Parallelism Axioms?
edited tags
Oct
26
asked Finite models for Systems of Incidence and Parallelism Axioms?
Oct
25
comment Clarification on labelled graphs?
@bof Oh, yes. A path must take all the vertices. I confused $P_3$ with arbitrary simple graphs on $3$ vertices. I know it now.
Oct
25
asked Clarification on labelled graphs?
Oct
25
asked How to show that $at^2+bt+c$ can be written as $\displaystyle \begin{equation} a \left( t+\frac{b}{2a}\right) ^2-\frac{1}{4a}(b^2-4ac)\end{equation}$?
Oct
25
comment Showing the equality of two rook polynomials.
Oh, yes. I just saw it now. Thanks.
Oct
25
accepted Is there something that studies equivalent forms of writing and expression?
Oct
24
answered Show that if $a,k\in \mathbb{Z}$ with $0\leq k \leq a$, then $\binom ak=\frac{a!}{k!(a-k)!}=\binom {a}{a-k}$.
Oct
24
comment Showing the equality of two rook polynomials.
"If there is a rook on $S$, there cannot be any rook in the entire row or column containing $S$" - Why? I don't get it. Take for example the following chessboard: $$\begin{matrix} {\bullet }&{\underline{\bullet}}&{\bullet}&{\bullet}\\ {\underline{\bullet}}&{\star }&{\underline{\bullet}}&{\underline{\bullet}}\\ {\bullet}&{\underline{\bullet}}&{\bullet}&{\bullet}\\ {\bullet}&{\underline{\bullet}}&{\bullet}&{\bullet} \end{matrix}$$ It has a rook on $(2,2)$, it could also have rooks in all the remaining squares, no?
Oct
21
revised Showing the equality of two rook polynomials.
edited tags