Giter VIP home page Giter VIP logo

Comments (4)

LSartore avatar LSartore commented on July 30, 2024

Hi Tom. Thank you very much for your question and suggestions.
Overall, specifying indices 'by hand' is something that I would prefer to avoid. However, I agree that there might be cases where this is necessary, or at least convenient. In your case, one possible alternative solution would be to express the determinant as a polynomial of traces of the matrix, using the Cayley-Hamilton theorem. In the case of a 3x3 matrix, one has:

det

For larger matrices however, I expect this 'trick' to have poor performance. Implementing a way of computing the determinant of a 2-index tensor could be a good idea of improvement for future versions. I am also currently working on a possible new feature, allowing the user to implement arbitrarily complicated tensor objects and contractions using Python functions that can be directly called from the model file. With such a feature, the user would be able to either specify indices by hand, or create its own 'determinant' function.

I hope this helps!

Cheers,
Lohan

from pyrate.

TomSteu avatar TomSteu commented on July 30, 2024

Hi Lohan,

yes, that is a very nice trick, I didn't think of that one! A little followup question: since M is bidoublet in a SU(3) x SU(3) gauge group, and your ansatz requires to write down contractions between left and right indices of M. Will such a contraction actually work, since it is between different gauge groups?

Good to know you are looking into a possible enhancement, I'll stay tuned.

cheers,
Tom

from pyrate.

LSartore avatar LSartore commented on July 30, 2024

Hi Tom,

Yes. In principle the consistency checks only require indices to have the same range, so the above trick should work. However I didn't anticipate this and must say that I don't really like the idea of indices of different nature being contracted together.

Thinking a bit further about your cubic term, a more elegant solution would be to use the (built-in) 3-index Levi-Civita tensor to produce invariants out of three fundamental SU(3) reps. Namely, the following expression should in principle work :

t : 1/6 * Eps[i,j,k] Eps[a,b,c] H[i,a] H[j,b] H[k,c]

where the 1/6 factor is only needed to match the expression of the determinant.

Cheers,
Lohan

from pyrate.

TomSteu avatar TomSteu commented on July 30, 2024

Ah, very good! I think my student was convinced Eps is only the rank two Levi-Civita symbol, I can convince him otherwise now.

Thanks!

from pyrate.

Related Issues (6)

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.