Finding operators (and, possibly, exponents) in a system

hansaaa
Messages
2
Reaction score
0
Hi, I have an algorithm that I have to test, and it gives me certain variables at different stages of time. I also have a "result" (I guess you can call it that), that these variables are supposed to amount to, in some mathematical fashion, at those equal points in time.

This gives me a system of equations:

Code:
Var a   Var b  Var c    r (result)
1          3          2           1
2          2          2           0
0          4          2           0

I realize how to solve this, if this were a system of linear equations (I.e. "linear" algebra). But, the thing is, I DON'T know the OPERANDS. And, it could also be a non-linear system, but I don't know the exponents either.

I.e., the operands could be "+" or "-", but they could also be "%" (mod), "/", division, etc. and the exponents could be 1, 5, or 365

Of course, the operands and exponents would have to be the same in each column of a respective row, i.e. Var a, would always be, for example, "modded" (%), with Var b, and, Var b, could always be, say multiplied (x) with Var C, to get result "r".


So, again, row reduction for linear algebra wouldn't be that great of a deal, I've done it plenty of times before and even have algorithms for it, BUT, this is a different case, trying to find the operands (and possibly exponents, if they are not 1, which I do assume, but DON'T KNOW) for each column (IF ANY), that make this system of equations valid, I guess.

Is there some kind of mathematical fashion/algorithm for finding this out? Or is the only solution I have "plug 'n chug" (i.e. plug in operators and exponents into the columns, and see what I get)??

Thanks! C:)
 
Last edited:
Physics news on Phys.org
You have to guess there, and see how well those guesses fit. If you know something about the "result", this can help to make better guesses.
Oh, and you need much more data. 3 Rows are not sufficient, as there are so many possible algorithms.
 
yap, that was only a sample output. I guess there is no other way but "Guessing", oh my ^^
 
##\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...
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...
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...
Back
Top