MHB Solve Exponential Fraction Equation for $α$ ($C$, $m$)

Stijn
Messages
2
Reaction score
0
I want to create a binary matrix (${X}_{m*n}$) containing $C$ ones ($||X|| = C$). Additionally I want to have the number of elements of each row ($m$) to have an exponential form. This is: for each row the number elements needs to be equal to $e^{alpha * i}$ or in symbols: ||${X}_{i}$|| = $e^{alpha*i}$.

As the total number of ones is known ($C$), we can say that: $||X|| =\sum_{i=1}^{m}e^{alpha*i} = C$
Based on the function of the sum of geometric series ($\sum_{a=0}^{A-1} {b}^{a}=\d{1-{b}^{A}}{1-b}$) we can rewrite the equation as:

$\frac{1-e^{(m+1)*\alpha}}{1-e^{\alpha}}= C + 1$

Is there a way to solve alpha out of this function and write the equation as: $\alpha = f(C, m)$?

Thanks in advance!
 
Last edited:
Physics news on Phys.org
Hi Stijn! Welcome to MHB! ;)

Let me restrict myself to your immediate question:
Stijn said:
$\frac{1-e^{(m+1)*\alpha}}{1-e^{\alpha}}= C + 1$

Is there a way to solve alpha out of this function and write the equation as: $\alpha = f(C, m)$?

We can rewrite it as:
$$x^{m+1} - (C+1)x + C = 0$$
where $x = e^\alpha$.
Such a polynomial only has closed form solutions when $m+1 \le 4$.
We do have the solution $x=1$ or $\alpha=0$ though, meaning we can reduce the polynomial by one degree, so we can solve it up to $m=4$.
Beyond that we need approximation algorithms.
 
Hi,

Thank you for your quick response. As I was suspecting, no exact solution exists (other than $\alpha = 0$). I am able to estimate the values for different m and C values.
 
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
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...
##\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...
Back
Top