bio | website | tx.technion.ac.il/~felixg/… |
---|---|---|
location | ||
age | 30 | |
visits | member for | 2 years, 4 months |
seen | Jul 8 at 12:23 | |
stats | profile views | 2,906 |
Jul 2 |
awarded | Inquisitive |
Jul 2 |
awarded | Curious |
Jun 17 |
comment |
Roots of modified polynomials
I am not so sure, actually. Please note that I was asking about modified rather than perturbed polynomials, for a reason: the difference between $g$ and $h$ is not assumed to be small. |
Jun 17 |
revised |
Roots of modified polynomials
edited tags |
Jun 17 |
asked | Roots of modified polynomials |
Jun 2 |
asked | Spectral lower bounds on the diameter of a graph |
Jun 1 |
comment |
Rank 1 Approximation of Elementwise Inverse Matrix
Probably something to do with scaling as in Sinkhorn-Knopp scaling. |
Jun 1 |
comment |
Rank 1 Approximation of Elementwise Inverse Matrix
What is the connection to inverses? |
May 28 |
comment |
Are all almost regular graphs obvious?
Yuster's work is my favourite example of why such irregularity measures are useful :) |
May 27 |
comment |
Are all almost regular graphs obvious?
Ah, good point about the multigraphs. But I really do want my regular graph to be simple in this instance. (Although I mind loops less). |
May 27 |
comment |
Are all almost regular graphs obvious?
But there might be some edges between the even set already in place. In other words - the subgraph induced by the even set is not necessarily empty, how are we sure it has a perfect mathching? I am not saying I think it's wrong, but I don't see how pairing them up can be enough. |
May 27 |
comment |
Are all almost regular graphs obvious?
How do you prove the first claim? ("If the size of both sets is even, then you can add a matching to the set with lower degree to get a regular graph") I don't quite get it. |
May 27 |
comment |
Are all almost regular graphs obvious?
@KetilTveiten Sorry, my mistake. $K_{2,3}$ is also non-obvious. Thanks! |
May 27 |
revised |
Are all almost regular graphs obvious?
added 1 character in body |
May 27 |
comment |
Are all almost regular graphs obvious?
$K_{2,3}$ is obvious because you can add an edge to obtain a $3$-regular graph. However, for $n >2$ this does seem to be a family of counter-examples. Are there others? |
May 27 |
asked | Are all almost regular graphs obvious? |
May 25 |
comment |
The multiplicity of the max eigenvalue in matrix multiplication
I must be missing something, but isn't the PMP more complicated than what the OP asked for? His question (1) asks for positive eigenvalues, whereas PMP apparently forces them all to be 1. His question (2) only refers to the largest eigenvalue. So - what have I missed? Thanks! |
May 14 |
comment |
adjacency matrix of a graph and lines on quartic surfaces
Your paper does not seem to mention hyperbolic graphs. Is there some other place where the connection is written up? |
May 13 |
accepted | Generalized Helly theorem for $t$-intersecting families |
May 13 |
comment |
Generalized Helly theorem for $t$-intersecting families
@MartinTancer Sorry for the confusion - I modified the text to be clearer. |