Find Best Combinations of Non-Overlapping Matrix Elements

JeffreyP
Messages
1
Reaction score
0
Algorithm for finding best (or combinations of) "non-overlapping" matrix elements.

I'm looking for the best general way to find the "best" combination for a list of non-overlapping matrix elements. For example, given the matrix

AE BE CE DE
AF BF CF DF
AG BG CG DG
AH BH CH DH

The combination of values that results in the highest sum, but where no letter appears more than once.
 
Physics news on Phys.org


JeffreyP said:
The combination of values that results in the highest sum, but where no letter appears more than once.

Sum of what? Are you talking about a situation where the matrix really has 3 items per entry, these being a number and two letters? - such a (93.6,A,E)
 

Thread 'Trouble understanding an online solution to an exercise in Dummit & Foote'

##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
View full post »

Thread 'Questions about non existence of GCDs vs (coimages, cokernels)'

The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
View full post »

Thread 'Decomposition into irreps of compact Lie group'

When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
View full post »

Similar threads

MHB Prove the statements : Vectors/Matrices
Replies
5
Views
2K
Matrix multiplication vs dot product
Replies
4
Views
21K
Prove that quaternions are associative
Replies
5
Views
7K
Program to find combination of letters associated with phone
Replies
3
Views
1K
What is the Dot Product of Two 2x2 Matrices?
Replies
3
Views
34K
Abstract Algebra: M(R) 2x2, units, where does the determinant come from?
Replies
12
Views
3K

Hot Threads

Recent Insights

Back
Top