Not signed in (Sign In)

Not signed in

Want to take part in these discussions? Sign in if you have an account, or apply for one below

  • Sign in using OpenID

Site Tag Cloud

2-category 2-category-theory abelian-categories adjoint algebra algebraic algebraic-geometry algebraic-topology analysis analytic-geometry arithmetic arithmetic-geometry book bundles calculus categorical categories category category-theory chern-weil-theory cohesion cohesive-homotopy-type-theory cohomology colimits combinatorics complex complex-geometry computable-mathematics computer-science constructive cosmology definitions deformation-theory descent diagrams differential differential-cohomology differential-equations differential-geometry digraphs duality elliptic-cohomology enriched fibration foundation foundations functional-analysis functor gauge-theory gebra geometric-quantization geometry graph graphs gravity grothendieck group group-theory harmonic-analysis higher higher-algebra higher-category-theory higher-differential-geometry higher-geometry higher-lie-theory higher-topos-theory homological homological-algebra homotopy homotopy-theory homotopy-type-theory index-theory integration integration-theory k-theory lie-theory limits linear linear-algebra locale localization logic mathematics measure-theory modal modal-logic model model-category-theory monad monads monoidal monoidal-category-theory morphism motives motivic-cohomology nforum nlab noncommutative noncommutative-geometry number-theory of operads operator operator-algebra order-theory pages pasting philosophy physics pro-object probability probability-theory quantization quantum quantum-field quantum-field-theory quantum-mechanics quantum-physics quantum-theory question representation representation-theory riemannian-geometry scheme schemes set set-theory sheaf simplicial space spin-geometry stable-homotopy-theory stack string string-theory superalgebra supergeometry svg symplectic-geometry synthetic-differential-geometry terminology theory topology topos topos-theory tqft type type-theory universal variational-calculus

Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.

Welcome to nForum
If you want to take part in these discussions either sign in now (if you have an account), apply for one now (if you don't).
    • CommentRowNumber1.
    • CommentAuthorTim_Porter
    • CommentTimeNov 10th 2010
    • (edited Nov 10th 2010)

    Unshuffles are used in two places but we do not seem to have any description of them as such. (I do not know anything about them so ….)

    • CommentRowNumber2.
    • CommentAuthorUrs
    • CommentTimeNov 10th 2010
    • (edited Nov 10th 2010)

    Unshuffles are used in two places

    Please don’t tell anyone which places! ;-)

    Ah, I found one. At L-infinity-algebra. That’s just used synonymously there to shuffle. (I think some authors just use different words.) I have changed the wording there.

    Where is the other one?

    • CommentRowNumber3.
    • CommentAuthorTim_Porter
    • CommentTimeNov 10th 2010

    I deliberately did not tell people… there is a search facility that works very well;-)

    • CommentRowNumber4.
    • CommentAuthorUrs
    • CommentTimeNov 10th 2010

    I deliberately did not tell people…

    I know, you like to pose little online detective problems to us.

    • CommentRowNumber5.
    • CommentAuthorTim_Porter
    • CommentTimeNov 10th 2010

    There are still two entries with it in. (There was a second one on L-infinity algebra but it also occurs in A-infinity algebra. I fixed a typo whilst I was at it!

    • CommentRowNumber6.
    • CommentAuthorUrs
    • CommentTimeNov 10th 2010

    I think “unshuffle” is always synonymous to “shuffle”. I learned this terminology from Jim. I can check with him, he will recall the history, if any.

    • CommentRowNumber7.
    • CommentAuthorUrs
    • CommentTimeNov 10th 2010

    Here is what Jim says:

    shuffles appear in making the Bar construction BA on a commutative algebra A into a Hopf algebra at least as far back as Seminaire Cartan 54-55 i.e. on the tensor COalgebra T^c(sA) althoug Cartan said they did not have coalgebras in those days

    the ‘dual’ making the tensor algebra TV into a Hopf algebra uses what are clearly UNshuffles since a deck/string is split into two pieces keeping the relative order within the pieces

    calling the latter shuffles is an abuse of language which has caught on - linguistic laziness?

    • CommentRowNumber8.
    • CommentAuthorTim_Porter
    • CommentTimeNov 10th 2010

    That looks as if ’unshuffle’ may be what is needed BUT that a gloss needs to be put somewhere explaining the meaning. (Co-shuffle might be better.) I have some things to do before I can reword those two places– I think rewording rather than simply rolling back is needed. what do you think? I need also to think about exactly how to explain what is going on here.

    • CommentRowNumber9.
    • CommentAuthorUrs
    • CommentTimeNov 10th 2010

    It seems to me that what Jim says are “clearly UNshuffles” is precisely what our entry on shuffles calls shuffles. I still think there are just two different ways of thinking about one and the same mathematical concept in terms of decks of cards. No?

    Tell me what you would want to reword how, so that I know what you are worried about.

    • CommentRowNumber10.
    • CommentAuthorTim_Porter
    • CommentTimeNov 10th 2010
    • (edited Nov 10th 2010)

    Have a look at what I have rewritten on shuffle. I looked at one or two papers on L-infty algebras and extracted a definition. I think it is just a shuffle but viewed from the end result rather than from the input. I have no difficulty with this. I have reworked the earlier entries but have put that shuffles redirects unshuffles as it does not seem necessary to have a separate entry.

    There seemed to be a typo in L-infinity algebra in the same part of the page. The formula above the mention of unshuffles is hard to get right. (I looked just now and there is still a glitch. Please check. I will do what I think is correct but I am not sure.

    Edit: I think the formula is wrong. It should be i+j =n+1 for a start since otherwise the l il_i cannot handle the list it is to process. I checked in the old paper of Lada and Markl, and their definition is more like I suggest. Can someone debug or check this?

    • CommentRowNumber11.
    • CommentAuthorTim_Porter
    • CommentTimeNov 10th 2010
    • (edited Nov 10th 2010)

    From homotopy coherence POV are not these instances of (un)shuffles ’really’ the products of simplices aspect once again. Whether a shuffle viewpoint or an un… viewpoint is then something like ’covariance’ or ’contravariance’ of the construction???

    • CommentRowNumber12.
    • CommentAuthorTim_Porter
    • CommentTimeNov 10th 2010

    I like the improved wording.

    One thing I wonder is whether the products of simplices bit should be thought of as an ’application’ as it is really what makes the rest ’tick’. This is not important however.

    • CommentRowNumber13.
    • CommentAuthorUrs
    • CommentTimeNov 10th 2010
    • (edited Nov 10th 2010)

    Have a look at what I have rewritten on shuffle.

    You need to help me: I still don’t see a difference between the two notions. Your definition of unshuffle looks to me to be equivalent to the definition of shuffle. Up to a slight change of symbol use, it is almost verbatim the same!

    It should be i+j=n+1i+j =n+1

    Yes, I’ve fixed it.

    • CommentRowNumber14.
    • CommentAuthorTim_Porter
    • CommentTimeNov 10th 2010

    I think there is no difference between the two notions, except possibly a bottom-up as against a top down, and even that is unsure. I think Jim’s point is that in one it is a product and the other a coproduct that is the idea. Effectively the two notions coincide but in one you are taking things and building a product in the other you are showing how to decompose things. I am not sure what is best to do. Lada and Markl do use the term unshuffle.

    • CommentRowNumber15.
    • CommentAuthorUrs
    • CommentTimeNov 10th 2010

    I think for the plain notion of shuffle/unshuffle there is no difference in the definition and the page should not pretend there is one. There are different applications of the definition, though, that make some people say shuffle and some unshuffle for the same thing.

    • CommentRowNumber16.
    • CommentAuthorTim_Porter
    • CommentTimeNov 10th 2010

    I have changed the bit on ’unshuffle’, but I am not 100% happy with the wording.