Mathematical Analysis and Numerical Simulations for a System Modeling Acid-Mediated Tumor Cell Invasion

This work is concerned with the mathematical analysis of a model proposed by Gatenby and Gawlinski (1996) in order to support the hypothesis that tumor-induced alteration of microenvironmental pH may provide a simple but comprehensive mechanism to explain cancer invasion. We give an intuitive proof for the existence of a solution under general initial conditions upon using an iterative approach. Numerical simulations are also performed, which endorse the predictions of the model when compared with experimentally observed qualitative facts.

An intuitive proof of the data processing inequality

The data processing inequality (DPI) is a fundamental feature of information theory. Informally it states that you cannot increase the information content of a quantum system by acting on it with a local physical operation. When the smooth min-entropy is used as the relevant information measure, then the DPI follows immediately from the definition of the entropy. The DPI for the von Neumann entropy is then obtained by specializing the DPI for the smooth min-entropy by using the quantum asymptotic equipartition property (QAEP). We provide a short proof of the QAEP and therefore obtain a self-contained proof of the DPI for the von Neumann entropy.

Some Comments On: A Historical Note On The Proof Of The Area Of A Circle

In a recent paper by Wilamowsky et al. [6], an intuitive proof of the area of the circle dating back to the twelfth century was presented. They discuss challenges made to this proof and offer simple rebuttals to these challenges. The alternative solution presented by them is simple and elegant and can be explained rather easily to non-mathematics majors. As business school faculty ourselves, we are in agreement with the authors. Our article is motivated by them and we present yet another alternative method. While we do not make an argument that our proposed method is any simpler, we do feel it may be easier to communicate to business school students. In addition, we present a solution using a rectangle which could be left as an exercise for the student after a brief explanation in class. Finding the area of a stack of rectangles with a rectangle as a starting point may seem redundant at first. However, we show that it is actually an excellent algebraic exercise for students since it offers a certain challenge which a square does not. We also solve this exercise using the quicker triangular approach and feel it can be appreciated by students in an Introduction to Calculus course. We also provide two interesting links that demonstrate the work of the ancient mathematicians for this well known problem.

A linear-optical proof that the permanent is # P -hard

One of the crown jewels of complexity theory is Valiant's theorem that computing the permanent of an n × n matrix is # P -hard. Here we show that, by using the model of linear-optical quantum computing —and in particular, a universality theorem owing to Knill, Laflamme and Milburn—one can give a different and arguably more intuitive proof of this theorem.

Managing Queues with Heterogeneous Servers

We consider several versions of the job assignment problem for an M/M/m queue with servers of different speeds. When there are two classes of customers, primary and secondary, the number of secondary customers is infinite, and idling is not permitted, we develop an intuitive proof that the optimal policy that minimizes the mean waiting time has a threshold structure. That is, for each server, there is a server-dependent threshold such that a primary customer will be assigned to that server if and only if the queue length of primary customers meets or exceeds the threshold. Our key argument can be generalized to extend the structural result to models with impatient customers, discounted waiting time, batch arrivals and services, geometrically distributed service times, and a random environment. We show how to compute the optimal thresholds, and study the impact of heterogeneity in server speeds on mean waiting times. We also apply the same machinery to the classical slow-server problem without secondary customers, and obtain more general results for the two-server case and strengthen existing results for more than two servers.

Managing Queues with Heterogeneous Servers

We consider several versions of the job assignment problem for an M/M/m queue with servers of different speeds. When there are two classes of customers, primary and secondary, the number of secondary customers is infinite, and idling is not permitted, we develop an intuitive proof that the optimal policy that minimizes the mean waiting time has a threshold structure. That is, for each server, there is a server-dependent threshold such that a primary customer will be assigned to that server if and only if the queue length of primary customers meets or exceeds the threshold. Our key argument can be generalized to extend the structural result to models with impatient customers, discounted waiting time, batch arrivals and services, geometrically distributed service times, and a random environment. We show how to compute the optimal thresholds, and study the impact of heterogeneity in server speeds on mean waiting times. We also apply the same machinery to the classical slow-server problem without secondary customers, and obtain more general results for the two-server case and strengthen existing results for more than two servers.

A Historical Note On The Proof Of The Area Of A Circle

Proofs that the area of a circle is ?r2 can be found in mathematical literature dating as far back as the time of the Greeks. The early proofs, e.g. Archimedes, involved dividing the circle into wedges and then fitting the wedges together in a way to approximate a rectangle. Later more sophisticated proofs relied on arguments involving infinite sequences and calculus. Generally speaking, both of these approaches are difficult to explain to unsophisticated non-mathematics majors. This paper presents a less known but interesting and intuitive proof that was introduced in the twelfth century. It discusses challenges that were made to the proof and offers simple rebuttals to those challenges.