834 reputation
312
bio website
location
age
visits member for 2 years, 3 months
seen Jun 6 at 9:33

May
19
comment Simplifying a certain bound
Is $i$ some natural number and $C>0$?
May
19
answered Simplifying a certain bound
Apr
10
awarded  Yearling
Mar
28
comment Does $s(0) = s(1)$ define a vector subspace in $\mathbb C[X]$?
I believe you are asking whether the set $\{ s \in \mathbb{C}[x] : s(0) = s(1) \}$ is a vector space. Is that correct?
Dec
11
comment An Example of Abelian Group with exactly one maximal subgroup.
Very nice and complete answer. I enjoyed reading it. :)
Dec
10
revised An Example of Abelian Group with exactly one maximal subgroup.
deleted 86 characters in body
Dec
10
revised An Example of Abelian Group with exactly one maximal subgroup.
deleted 346 characters in body
Dec
10
revised An Example of Abelian Group with exactly one maximal subgroup.
added 45 characters in body
Dec
10
comment An Example of Abelian Group with exactly one maximal subgroup.
@Babgen: Yeah, I had a feeling there had to be a mistake in there. You are right, my point does not hold. I should get more sleep. Will try to fix it, if I can't do so I will delete this answer. I don't see what you are getting at with $\mathbb{Z}_{p^k},$ though. For finite groups, clearly every subgroup is contained in a maximal subgroup.
Dec
10
answered An Example of Abelian Group with exactly one maximal subgroup.
Nov
13
comment How many permutations (bijections) are there on the set B = {0,1}^(8) of bytes? How can there be permutations if there is no function?
@user108471 Yes. On a set of $n$ elements there are $n!$ permutations.
Nov
10
comment Group classification generated by two elements
He did, but the question very much seemed like a homework problem. This is why I did not write a detailed answer that can just be copied without giving it some thought. That being said, my answer really doesn't leave much to be done. Edit: I just noted a downvote on the answer. Is there anything wrong with it?
Nov
8
answered Group classification generated by two elements
Nov
8
comment Proving that a greedy algorithm yields the optimal solution for a problem
Also note that the easier problem obtained by setting $B=\emptyset$ is the bin packing problem which is known to be NP-hard.
Nov
8
comment Group classification generated by two elements
@user43418 Which have you seen, dihedral groups or Coxeter groups in general? Have you seen finite presentations for dihedral groups?
Nov
8
comment Group classification generated by two elements
Hint in the spirit of DonAntonio's comment: Think about the generators' product $xy$. Also, if you know finitely presented groups, they might help.
Oct
29
comment Color adjustment with reference pixel values
I see. Thanks for the explanation, I will think about it and maybe post something later (no time right now). Any answer I may offer will necessarily be heuristic, though. Basically you are asking for an appropriate distance function in your colour space so you can choose the predefined colour closest to your measured colours. Of course, you can always construct examples where such a method fails.
Oct
29
comment Color adjustment with reference pixel values
I think the colour space isn't terribly important for the question. As far as I am concerned it is just a $3$-dimensional space (a vector space over $\mathbb{F}_{256}$ or even just a set of $256^3$ elements). I'm still not sure what you want, though. Sorry. :( Why can't you just fix the colour by setting fixed := original? As I understand up to now, you want to take the values in the last three columns and compute something close to the first column. Perhaps the question is: What operations are we allowed to use for this?
Oct
29
comment Color adjustment with reference pixel values
So your Captured column consists of mean values of the piece blobs, right? I'm still not sure what your pixel colours are. Also: Is it correct that you do NOT know the original values and your goal is to extrapolate them from the other columns?
Oct
29
comment Color adjustment with reference pixel values
It's not clear to me how you obtain those values. I try to place the piece "car". I find the chunk it's placed in and look up the corresponding reference colour. Now, how do I obtain pixel colour and captured colour? Is the pixel colour the colour of the reference pixel after placing the piece?