2,128 reputation
1719
bio website web.mat.bham.ac.uk/~barberba
location Birmingham, UK
age
visits member for 2 years, 10 months
seen 10 hours ago

Postdoc in Birmingham with Daniela Kühn.


11h
reviewed Reviewed Probability distribution
2d
reviewed No Action Needed Does there exist a continuous surjection?
May
20
awarded  Custodian
May
20
reviewed Approve Prescribed values for the uniform density
May
19
reviewed No Action Needed Two conjectures about zero inner products and dissociated sets
May
18
comment Does van der Waerden's Theorem hold for $\omega_1$?
Do you know if this is true in, say, $\omega^\omega$?
May
15
reviewed Looks OK Can height one maximal ideals in the normalization contract to non-height one primes in the base?
May
15
reviewed Reviewed Threshold for perfect Matchings in Bipartite graph
May
15
awarded  Cleanup
May
15
revised Expected matching in a bipartite graph
rolled back to a previous revision
May
8
reviewed Reviewed Probability of sub-sequence of exact length to occur
May
8
comment Probability of sub-sequence of exact length to occur
Is $(a, b)$ an interval of reals or something else?
May
8
revised Probability of relations in network
missing word
May
8
reviewed Looks OK formally etale deformations of algebras
May
8
reviewed No Action Needed Probability of relations in network
May
8
answered Probability of relations in network
May
7
comment Vertex expansion of the Hamming graph
The continous problem certainly provides a lower bound on the size of the neighbourhood in the discrete case. Whether that gives you useful quantitative information depends on what you can say quantitatively about the continuous problem. This appears to be discussed towards the end of Section 2, but no firm conclusion is reached.
May
5
answered Vertex expansion of the Hamming graph
Apr
10
reviewed No Action Needed Entropy inequality
Apr
8
comment Edge-disjoint cycles in graphs
If a graph is an edge-disjoint union of $p$ $k$-cycles then obviously the optimum is $p$. Are you asking about the case when the $p$ $k$-cycles overlap? Or possibly whether it's easy to find a decomposition if you know that there is one? In either case, I'm afraid I don't know.