4,242 reputation
1451
bio website borisbukh.org
location
age
visits member for 5 years, 10 months
seen 33 mins ago

2h
comment Probability of random geodesics on the half-sphere intersecting
@IgorRivin I misunderstood the question. I thought that the "half-sphere" referred to the fact that the geodesics (on a full sphere) must be contained in a half-sphere. Yes, it is non-trivial. I highly doubt that there is a nice answer. So, I retract my vote.
4h
comment Probability of random geodesics on the half-sphere intersecting
This is not a research-level question. Voting to migrate to math.se.
4h
reviewed Reviewed Topology Proof about a open ball
4h
reviewed Leave Closed Why should “small” P be preferred?
5h
reviewed Leave Open $\mathsf{GCD}$ in arithmetic progression
5h
reviewed Leave Open A quadrant of residues
20h
comment Any polynomial-time algorithm for hypergraph bisection?
For many versions of the problem that you ask there are NP-hardness results. That explains why you did not find a polynomial-time algorithm. Given that it is not clear which exact version you are interested in, it is impossible to provide a more specific answer. Furthermore, on this forum it is expected that the research one does before asking involves reading related papers. Your question does not demonstrate that you have done any such work.
1d
reviewed Approve Is $\mathbb{R}^3 \setminus \mathbb{Q}^3$ simply connected?
1d
reviewed Close Lebesgue-integrability of piecewise function with random variable
1d
comment Lebesgue-integrability of piecewise function with random variable
More importantly: what is your probability space? When there are uncountably many random variables, one can no longer rely on intuitive notions, and an actual definition of probability space starts to matter.
1d
reviewed Close What is number of faces in a k-ary n-dim cube?
1d
comment What is number of faces in a k-ary n-dim cube?
You defined a graph, not a simplicial complex. If you want to count faces, you should define them. The linked paper does not seem to define it either.
1d
comment A factorial related statement
@Arul Word of advice: include some motivation/discussions in your questions. Your questions are good, but they take much thinking to appreciate, which is why they do not get nearly as much attention as they deserve.
1d
comment A factorial related statement
I guess it is the total number of bits (which is basically $\log n$ unless $a$ is very large, which would only help us). The problem is that the obvious algorithm takes about $a$ steps (each of which involves arithmetic in Z/nZ).
2d
reviewed Close Avoiding the range of a bivariate integer function or Diophantine function
2d
comment Any polynomial-time algorithm for hypergraph bisection?
I vote to close for two reasons: 1) Which of the three do you want? 2) Simple Google search yields a plethora of results (including some NP hardness results). It looks like you have not done your research prior to asking the question.
Aug
27
reviewed Leave Closed How to find $B$ by solving the following linear system: $s_k$ $B$ ${s_k}^T$ $=1,$
Aug
26
reviewed Leave Open Orthogonal polynomials with respect to the lognormal distribution
Aug
26
reviewed Close A simplicial complex which is collapsible but there exist a subdivision of it does not
Aug
25
reviewed Close Undecidable set of problems