Package cc.redberry.core.groups.permutations

Examples of cc.redberry.core.groups.permutations.PermutationGroup

85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
        Iterator<Permutation> cosetRepresentatives;
        BigInteger factor;
        //for a simple tensors we can compute coset representatives directly:
        if (t instanceof SimpleTensor) {
            PermutationGroup t_group =
                    conjugatedSymmetriesOfSubIndices(((SimpleTensor) t).getIndices());
            PermutationGroup union = t_group.union(indicesGroup);
            Permutation[] reps = union.leftCosetRepresentatives(t_group);
            cosetRepresentatives = new ArrayIterator<>(reps);
            factor = BigInteger.valueOf(reps.length);
        } else {
            //in case of multitensor, we do not know its group of symmetries
            //if the resulting symmetries are small, then we'll just apply all of them
            if (indicesGroup.order().compareTo(SMALL_ORDER_MAX_VALUE) < 0) {
                cosetRepresentatives = indicesGroup.iterator();
                factor = indicesGroup.order();
            } else {
                //otherwise we might will be more lucky if compute it group of symmetries and then compute coset reps.
                PermutationGroup t_group = PermutationGroup.createPermutationGroup(
                        TensorUtils.findIndicesSymmetries(indices, t));
                PermutationGroup union = t_group.union(indicesGroup);
                Permutation[] reps = union.leftCosetRepresentatives(t_group);
                cosetRepresentatives = new ArrayIterator<>(reps);
                factor = BigInteger.valueOf(reps.length);
            }
        }
View Full Code Here
150
151
152
153
154
155
156
157
158
            else {
                nonStabilizedPoints[nPointer] = s;
                mapping[nPointer++] = index;
            }
        }
        PermutationGroup result = allIndices.getSymmetries().getPermutationGroup().
                pointwiseStabilizerRestricted(stabilizedPoints);
        return result.conjugate(Permutations.createPermutation(mapping));
    }
View Full Code Here
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
     *                                         calculated)
     */
    public void setSymmetric() {
        if (permutationGroup != null)
            throw new IllegalStateException("Permutation group is already in use.");
        PermutationGroup sym = null;
        int[] counts = structureOfIndices.getTypesCounts();
        for (int c : counts) {
            if (c != 0)
                if (sym == null)
                    sym = PermutationGroup.symmetricGroup(c);
                else
                    sym = sym.directProduct(PermutationGroup.symmetricGroup(c));

        }

        permutationGroup = sym;
        generators.clear();
        generators.addAll(sym.generators());
    }
View Full Code Here
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
     *                                         calculated)
     */
    public void setAntiSymmetric() {
        if (permutationGroup != null)
            throw new IllegalStateException("Permutation group is already in use.");
        PermutationGroup sym = null;
        int[] counts = structureOfIndices.getTypesCounts();
        for (int c : counts) {
            if (c != 0) {
                if (sym == null)
                    sym = PermutationGroup.antisymmetricGroup(c);
                else
                    sym = sym.directProduct(PermutationGroup.antisymmetricGroup(c));
            }

        }

        permutationGroup = sym;
        generators.clear();
        generators.addAll(sym.generators());
    }
View Full Code Here
305
306
307
308
309
310
311
312
313
314
315
    private static Map<Permutation, Boolean> getEpsilonSymmetries(int indicesSize) {
        Map<Permutation, Boolean> symmetries = cachedLeviCivitaSymmetries.get(indicesSize);
        if (symmetries != null)
            return symmetries;
        symmetries = new HashMap<>();
        PermutationGroup lc = PermutationGroup.antisymmetricGroup(indicesSize);
        for (Permutation symmetry : lc)
            symmetries.put(symmetry.toSymmetry(), symmetry.antisymmetry());
        cachedLeviCivitaSymmetries.put(indicesSize, symmetries);
        return symmetries;
    }
View Full Code Here
TOP

Related Classes of cc.redberry.core.groups.permutations.PermutationGroup

  • cc.redberry.core.combinatorics.IntTuplesPort
  • cc.redberry.core.indices.IndicesSymmetries
  • cc.redberry.core.transformations.factor.jasfactor.edu.jas.arith.BigInteger
  • cc.redberry.core.transformations.symmetrization.SymmetrizeTransformation
  • cc.redberry.physics.feyncalc.LeviCivitaSimplifyTransformation
  • gnu.trove.set.hash.TIntHashSet
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.