bio | website | tx.technion.ac.il/~felixg/… |
---|---|---|
location | ||
age | 30 | |
visits | member for | 2 years, 1 month |
seen | 2 days ago | |
stats | profile views | 2,823 |
Apr 22 |
awarded | Nice Question |
Apr 12 |
comment |
Number of lattice points inside a parallelogram defined by a vector on the “rhombic plane”
I think it might be easier to think about this in terms of a lattice (not the "standard" one) on the standard plane. Also, do you need an exact count or bounds or approximations? |
Apr 12 |
comment |
Laplacian matrix of a graph with negative weights
What do you mean by "calculate"? |
Apr 9 |
comment |
interpretation of generalized eigenvalue/vectors in spectral graph theory
What is the motivation for this equation? |
Apr 8 |
awarded | Popular Question |
Apr 6 |
comment |
Hitting sets (aka covers aka transversals) of Steiner triple systems
Thanks, Peter! This is a very helpful and informative answer. (Btw, I am an avid Set player :) |
Apr 6 |
accepted | Hitting sets (aka covers aka transversals) of Steiner triple systems |
Apr 6 |
comment |
What areas of pure mathematics research are best for a post-PhD transition to industry?
Right on the money! I wish I could upvote this $k$ times for a largeish $k$. |
Apr 5 |
comment |
Hitting sets (aka covers aka transversals) of Steiner triple systems
@PeterDukes Any $c<1$ would do for me... |
Apr 4 |
asked | Hitting sets (aka covers aka transversals) of Steiner triple systems |
Apr 2 |
comment |
Bound on graph domination number when min degree is 7
Actually, if the graph has nice structure, the bound can be improved. Let me know if you are still interested in this. |
Apr 2 |
revised |
Isomorphism testing in STS(13)
added 11 characters in body |
Apr 2 |
answered | Isomorphism testing in STS(13) |
Apr 2 |
revised |
NP-hard problems in linear algebra and real analysis
added 6 characters in body |
Apr 2 |
answered | NP-hard problems in linear algebra and real analysis |
Apr 2 |
comment |
What areas of pure mathematics research are best for a post-PhD transition to industry?
I am not 100% sure - this might be a bit too theoretical for them. |
Apr 2 |
comment |
NP-hard problems in linear algebra and real analysis
Can you add some references, please? |
Apr 2 |
comment |
NP-hard problems in linear algebra and real analysis
Permament is a great example of an NP-Hard problem, the Riemann hypothesis (afaik) is not. So I'd suggest you edit the question. |
Mar 30 |
accepted | Which graphs generate a matroidal independence complex? |
Mar 29 |
comment |
Which graphs generate a matroidal independence complex?
Looks like I've dropped the ball on this one. Still, I think I shan't delete as perhaps this can be useful as a "don't try that" post... |