Reputation
4,262
Top tag
Next privilege 5,000 Rep.
Approve tag wiki edits
Badges
10 27
Impact
~87k people reached

Aug
28
comment Faster Algorithms for Convex Hulls
@MichaelGrant so hence I am curious and hopeful if in this specific application a polynomial time hull generating algorithm exists. Where the hull is given as a system of inequalities
Aug
28
comment Faster Algorithms for Convex Hulls
The convex hull. In the same number of dimensions, for the two polyhedra has number of (n-1) dimensional facets that is polynomially bounded on the number if (n-1) dimensional facets of the original two polyhedra. To eliminate the doubling of variables back to the original n, results in exponential amount of facets (many of which become redundant), I find it, at least odd that the convex hull, which isn't by itself very complex in MY formulation, needs an EXPTIME worst case algorithm.
Aug
28
revised A way to calculate e?
added 37 characters in body
Aug
28
asked Faster Algorithms for Convex Hulls
Aug
24
comment Determining the minimum dimension required for embedding a finite group
I didnt understand "the answer should is the minimum dimension of a faithful real representation", and when you say take a convex hull of that point along with the elements in G's orbit. I don't understand how to map the elements of G to points in $\Bbb{R}^n$. Since until we have mapped the elements to points, it doesn't make sense to take a convex hull.
Aug
24
comment Determining the minimum dimension required for embedding a finite group
As each $S_n$ corresponds to the symmetries of an (n-1)-simplex
Aug
24
comment Determining the minimum dimension required for embedding a finite group
@Nate, it should be G exactly. If it were just a subgroup then $S_n$ for a suitably large $n$ would be a straightforward solution
Aug
24
comment Determining the minimum dimension required for embedding a finite group
Also I did change the question to finite. I hope that doesn't affect your answer, sorry for the delay in noting that
Aug
24
comment Determining the minimum dimension required for embedding a finite group
what is $c$ here? Like what is an explicit value of c for example lets pretend $c = 173$ where we groups of order$2^c$ fail to exist?
Aug
24
revised Determining the minimum dimension required for embedding a finite group
added 7 characters in body; edited title
Aug
24
comment Determining the minimum dimension required for embedding a finite group
I naviely assumed that it must be the case but your right @Servaes, i do not know this to be true
Aug
24
asked Determining the minimum dimension required for embedding a finite group
Aug
11
revised How is Ramanujan's recurrence relation for his nested radical solved?
added 3 characters in body
Aug
11
answered How is Ramanujan's recurrence relation for his nested radical solved?
Aug
10
comment Determining the minimal polynomial over $\Bbb{Q}$
I liked this, its a bit ad hoc, and specific to this case, but to its advantage it is a lot more elementary.
Aug
10
accepted Determining the minimal polynomial over $\Bbb{Q}$
Aug
10
comment Determining the minimal polynomial over $\Bbb{Q}$
okay this makes sense, and Im pretty sure this is the technique our professor was intending
Aug
10
comment Determining the minimal polynomial over $\Bbb{Q}$
Can you just clarify the notation $[\Bbb{Q}(\sqrt{1+\sqrt{5}} : \Bbb{Q}]$?
Aug
10
asked Determining the minimal polynomial over $\Bbb{Q}$
Aug
4
comment When exactly are quadratic objective functions polynomial time solvable
@MichaelGrant, correct. if an integer isn't found in the QP then there is no solution to the associated 0-1 ILP