| bio | website | |
|---|---|---|
| location | Turin, Italy | |
| age | 28 | |
| visits | member for | 1 year |
| seen | May 31 at 17:18 | |
| stats | profile views | 107 |
I'm a master's student at the Turin University. My main interest is geometric, topological and combinatorial group theory and related topics such as the study of spaces with non-positive curvature. Unfortunately, I'm far from being an expert of the field.
I'm also interested in computational geometry, numerical linear algebra, gpgpu, parallel programming and mathematical typography.
|
May 31 |
awarded | Yearling |
|
Jul 3 |
awarded | Scholar |
|
Jul 3 |
accepted | Connections of Geometric Group Theory with other areas of mathematics. |
|
Jun 27 |
comment |
Book about creating geometries with programming languages I think you question is quite generic. Anyway you can consider the John Vince's books for computer graphics. |
|
Jun 26 |
comment |
Supplement to Herstein's Topics in Algebra For group theory, I suggest "Groups and Symmetry" of Armstrong. It gives you a very solid understanding of the ideas behind group theory, even if it is less formal than other. |
|
Jun 26 |
comment |
Supplement to Herstein's Topics in Algebra Herstein's book doesn't give much insight into the wide theory of groups, but I think it is a good point to start. Artin's book is more geometrical, but it still contains only the basic theory. For the exercise, you can consider 'Problems in group theory' of Dixon, even if it is not so modern. Do you simply need more examples or do you want to know more? Because in the latter case you probably can simply shift to a true group theory book. |
|
Jun 22 |
comment |
What properties of groups are needed for orbits to be well-defined under group actions? The closure under the group operation is necessary because the action hasn't any sense without it. |
|
Jun 22 |
answered | What properties of groups are needed for orbits to be well-defined under group actions? |
|
Jun 13 |
comment |
Matrix Multiplication and Function Composition Si, si può controllare scrivendo esplicitamente il prodotto matriciale. Usando la linearità è abbastanza immediato vedere che è così. |
|
Jun 7 |
comment |
Multivariable Calculus Book Reference What do you dislike of the book you use now? Do you need something on differential forms? |
|
Jun 7 |
comment |
Connections of Geometric Group Theory with other areas of mathematics. Actually, I recently read, on May's introductory book, the fundamental groupoid version of the Van Kampen Theorem, and I found it very insightful. So, do you suggest to explore the theory of Crossed modules and associated 2-groups? Or do you suggest to try to explore one of the topic presented in the future directions chapter (for example 16.1.1 or try to reformulate some of the theory presented there using crossed modules and complexes)? |
|
Jun 7 |
comment |
Connections of Geometric Group Theory with other areas of mathematics. Wonderful, a very good example of how different mathematical fields can help each other. Unfortunately, I'm not a big fan of analysis, but you surely give me a reason to study it more seriously. |
|
Jun 6 |
awarded | Student |
|
Jun 6 |
comment |
Group and left classes A group is always the union of the non-intersecting left cosets with respect to one of his subgroups. You only need to prove that the cosets have that form. |
|
Jun 5 |
comment |
Calculating formula to store location of Lower Triangular Matrix Yes. There are other methods; column-major and row-major are simply the easier one. Sometimes one is better than another, and a different choice can change heavily the performance (because of the cache misses). You, generally, have to build the implementation of a particular algorithm on the data layout. |
|
Jun 5 |
answered | Calculating formula to store location of Lower Triangular Matrix |
|
Jun 5 |
comment |
Is $f(t)=t^\alpha$ for $\alpha\in(0,1)$ a sub-additive function? Try with $0\le t\le 1$. |
|
Jun 5 |
asked | Connections of Geometric Group Theory with other areas of mathematics. |
|
Jun 5 |
comment |
Max size of the problem that can be solved in 2 hours if the algorithm takes n^2 microseconds $2h = n^2 \cdot 10^{-6} s$. Now $1h = 60\cdot 60s$... |
|
Jun 5 |
comment |
Can we distinguish $\aleph_0$ from $\aleph_1$ in Nature? Actually, we don't even know if there are an infinite number of particle in nature. |