Meet and join: Difference between revisions

Revision as of 16:55, 17 February 2025 view source Lériendil (talk \| contribs) 8,044 edits mNo edit summary ← Older edit		Revision as of 18:09, 29 March 2025 view source Sintel (talk \| contribs) autopatrolled, emailconfirmed 1,632 edits -legacy Newer edit →
Line 1:		Line 1:
	~~{{Legacy}}~~
	Meet and join are a pair of binary operations which combine two [[abstract regular temperament]]s on a JI group G into another temperament on G. The operations are commutative and associative. More concretely, for any of the standard ways of representing an abstract regular temperament (normal val lists, normal comma lists, wedgies, Frobenius projection maps, and reduced row echelon form) we can regard them as taking any pair of such defined on G and producing another also defined on G.		Meet and join are a pair of binary operations which combine two [[abstract regular temperament]]s on a JI group G into another temperament on G. The operations are commutative and associative. More concretely, for any of the standard ways of representing an abstract regular temperament (normal val lists, normal comma lists, wedgies, Frobenius projection maps, and reduced row echelon form) we can regard them as taking any pair of such defined on G and producing another also defined on G.