 |
Cadabra
Computer algebra system for field theory problems
|
Definition: decompose_product.hh:14
iterator f2
Definition: decompose_product.hh:37
virtual result_t apply(iterator &) override
Definition: decompose_product.cc:94
void fill_asym_ranges(TableauBase::tab_t &tab, int offset, combin::range_vector_t &)
Definition: decompose_product.cc:74
Definition: YoungTab.hh:81
young_project::name_tab_t sibtab_t
Definition: decompose_product.hh:22
const Indices * ind2
Definition: decompose_product.hh:40
yngtab::tableaux< sibtab_t > sibtabs_t
Definition: decompose_product.hh:23
decompose_product(const Kernel &, Ex &tr)
Definition: decompose_product.cc:10
unsigned int dim
Definition: decompose_product.hh:41
std::vector< range_t > range_vector_t
Definition: Combinatorics.hh:40
yngtab::tableaux< numtab_t > numtabs_t
Definition: decompose_product.hh:25
combin::range_vector_t asym_ranges
Definition: decompose_product.hh:44
yngtab::filled_tableau< iterator > nt2
Definition: decompose_product.hh:42
const TableauBase * t1
Definition: decompose_product.hh:38
const TableauBase * t2
Definition: decompose_product.hh:38
iterator f1
Definition: decompose_product.hh:37
virtual bool can_apply(iterator) override
Definition: decompose_product.cc:29
Definition: young_project.hh:9
TableauBase::tab_t t2tab
Definition: decompose_product.hh:39
young_project::pos_tab_t numtab_t
Definition: decompose_product.hh:24
Ex::iterator iterator
Definition: Algorithm.hh:70
Definition: TableauBase.hh:9
Definition: Algorithm.hh:59
const Indices * ind1
Definition: decompose_product.hh:40
Functions to handle the exchange properties of two or more symbols in a product.
Definition: Adjform.cc:83
Definition: Storage.hh:141
void project_onto_initial_symmetries(Ex &rep, iterator rr, young_project &yp, const TableauBase *tt, iterator ff, int offset, const TableauBase::tab_t &thetab, bool remove_traces)
Definition: decompose_product.cc:266
TableauBase::tab_t t1tab
Definition: decompose_product.hh:39
result_t
Keeping track of what algorithms have done to this expression.
Definition: Storage.hh:160
Ex & tr
Definition: Algorithm.hh:151
yngtab::filled_tableau< iterator > nt1
Definition: decompose_product.hh:42
const Indices * indices_equivalent(iterator it) const
Test that all indices on the product are equivalent, that is, have the same Indices property attached...
Definition: decompose_product.cc:15