The schedule comprised more than 25 ordinary and problem session talks from a broad range of areas in function theory, including but not limited to: Nevanlinna theory, iteration of rational functions, dynamics of transcendental ...

We prove that for a polynomial $f \in k[x, y, z]$ equivalent are: (1)$f$ is a $k[z]$-coordinate of $k[z][x,y]$, and (2) $k[x, y, z]/(f)\cong k^[2]$ and $f(x,y,a)$ is a coordinate in $k[x,y]$ for some $a \in k$. This solves ...

Algorithms are mathematical procedures developed to solve a problem. When encoded on a computer, algorithms must be "translated" to a series of simple steps, each of which the computer knows how to do. This task is ...

Using several numerical invariants, we study a partition of the space of line arrangements in the complex projective plane, given by the intersection lattice types. We offer also a new characterization of the free plane ...

The development, analysis and implementation of efficient and robust numerical techniques for optimization problems associated with partial differential equations (PDEs) is of utmost importance for the optimal control of ...

This paper analyzes finite dimensional linear time-invariant systems with observation of a delay, where that delay satisfies a particular implicit relation with the state variables, rendering the entire problem nonlinear. ...