bio | website | cs.mcgill.ca/~akazna |
---|---|---|
location | Montreal, Canada | |
age | 26 | |
visits | member for | 4 years, 11 months |
seen | Jun 21 at 10:10 | |
stats | profile views | 596 |
From the School of Computer Science and Department of Psychology at McGill University, I marvel at the world through algorithmic lenses. My specific interests are in quantum computing, evolutionary game theory, modern evolutionary synthesis, and theoretical cognitive science. Previously I was at the Institute for Quantum Computing and Department of Combinatorics & Optimization at the University of Waterloo and a visitor to the Centre for Quantum Technologies at the National University of Singapore.
Apr 15 |
comment |
Relations between Arboreal Group Theory and Tree Group Actions?
You've been asking lots of question with many off-topic or otherwise poor (and some of them interesting) across a number of accounts. I will migrate this question since it doesn't belong here, but please try to respect the scope of the site. If lots of users are telling you that a question is off-topic or poor then please don't ask it here; try another site. We appreciate your excitement about cstheory, but this is a formal warning that you have to stay within community norms. Continued circumventions will be met with suspensions or account deletions (since your accounts are unregistered). |
Mar 16 |
awarded | Citizen Patrol |
Mar 14 |
awarded | Booster |
Mar 14 |
awarded | Announcer |
Feb 17 |
comment |
Grover's Quantum Search Algorithm
You might be interested in this question on cstheory for a more thorough discussion which decomposes $U$ into gates of finite width. |
Feb 12 |
comment |
Separations between notions of rank for modules over commutative (semi-)rings with no zero divisors.
I don't need the three definitions to be consistent, I am happy with them being different, I just want to see if I can bound the gap that separates them by something reasonable. Your examples in P1 shows that for my initial flawed definition of linear-independence, I can't bound it at all (better than 1 versus max of $n$, $m$) if I allow arbitrarily large coefficients, and if I count the number of bits to represent coefficients, I still can't hope for a small gap. |
Feb 12 |
comment |
Separations between notions of rank for modules over commutative (semi-)rings with no zero divisors.
Yes, the ring is a module, but I was hoping for examples that really use the module-ness and not just the ring-ness. I know, I'm impossible to please! Sorry. |
Feb 12 |
comment |
Separations between notions of rank for modules over commutative (semi-)rings with no zero divisors.
I modified the definition of linear independence I use to better approximate the one you give in paragraph 2 but that will still work for what I need on semi-rings. Thanks for your counter-example in helping clarify my answer, I will give a +1 but won't accept in hopes of other answers. Sorry for the "chase the definition" edits, I am trying to formulate this precisely in my mind since it comes from specific applications. |
Feb 12 |
comment |
Separations between notions of rank for modules over commutative (semi-)rings with no zero divisors.
Your paragraph 1 example is very much like the one I tried to rule out by excluding zero-divisors, and can be generalized to give arbitrary separation by, for instance, taking the first $n$-primes with product $N = p_1\cdot...\cdot p_n$ and then taking a row matrix $M = [a_1 , ... , a_n]$ where $a_j = P/p_j$. |
Feb 12 |
comment |
Separations between notions of rank for modules over commutative (semi-)rings with no zero divisors.
Thanks for the example in paragraph 1, it still rides in on just the ring, so I need to think about my question more. Paragraph 2: I specifically don't want to use that definition of algebraic dependence (see note 1) because in semi-rings we don't have minus and so it isn't clear that it is more general but just different (same with rings with zero-divisors). Paragraph 3: I am not looking for other ranks, but specifically the ones I defined in the question (this comes from an application in CS); is there a way in which the definition of rank you give here relates to the two I list? |
Feb 12 |
asked | Separations between notions of rank for modules over commutative (semi-)rings with no zero divisors. |
Feb 8 |
awarded | Announcer |
Jan 29 |
comment |
Minimize the length of intersection of the set of intervals
This question was cross-posted to cstheory. |
Jan 27 |
comment |
Demonstrating that rigour is important
I hope I'm not flogging a dead horse, but there is a great discussion on cstheory that was spawned by this thread and fits with @gowers 'further addition' section. In particular, it is a list of cstheory results where the rigorous demonstration of an 'obviously true' statement resulted in interesting insights. |
Nov 14 |
awarded | Announcer |
Sep 4 |
awarded | Popular Question |
Jun 25 |
awarded | Suffrage |
Aug 25 |
comment |
how to use arxiv?
there is some good advice here: cstheory.stackexchange.com/q/7574/1037 |
Aug 25 |
comment |
how to use arxiv?
I asked a similar question on putting up things that don't go to journal of the theoretical CompSci version of MO: cstheory.stackexchange.com/q/7574/1037 and the consensus seemed to be that its fine as long as its not something you plan to extend and make into a future article (to avoid redundancy and confusion). |
Aug 9 |
awarded | Yearling |