Related papers: Rational functions with maximal radius of absolute…
Let $K$ be a global function field of characteristic $p$ and degree $D$ over $\mathbb F_{p}(t)$. We consider dynamical systems over the projective line $\mathbb P^1(K)$ defined by rational maps with at most one prime of bad reduction. The…
We consider a robust formulation, introduced by Krause et al. (2008), of the classical cardinality constrained monotone submodular function maximization problem, and give the first constant factor approximation results. The robustness…
Absolutely continuous commuting row contractions admit a weak-$*$ continuous functional calculus. Building on recent work describing the first and second dual spaces of the closure of the polynomial multipliers on the Drury-Arveson space,…
We investigate the performance of a deterministic GREEDY algorithm for the problem of maximizing functions under a partition matroid constraint. We consider non-monotone submodular functions and monotone subadditive functions. Even though…
We study gradient-based optimization methods obtained by directly discretizing a second-order ordinary differential equation (ODE) related to the continuous limit of Nesterov's accelerated gradient method. When the function is smooth…
We study the ring of rational functions admitting a continuous extension to the real affine space. We establish several properties of this ring. In particular, we prove a strong Nullstelensatz. We study the scheme theoretic properties and…
Let $A_tf(x)=\int f(x+ty)d\sigma(y)$ denote the spherical means in $\Bbb R^d$ ($d\sigma$ is surface measure on $S^{d-1}$, normalized to $1$). We prove sharp estimates for the maximal function $M_E f(x)=\sup_{t\in E}|A_tf(x)|$ where $E$ is a…
Permutation rational functions over finite fields have attracted high interest in recent years. However, only a few of them have been exhibited. This article studies a class of permutation rational functions constructed using trace maps on…
We study gradient-based optimization methods obtained by direct Runge-Kutta discretization of the ordinary differential equation (ODE) describing the movement of a heavy-ball under constant friction coefficient. When the function is high…
In large-data applications, it is desirable to design algorithms with a high degree of parallelization. In the context of submodular optimization, adaptive complexity has become a widely-used measure of an algorithm's "sequentiality".…
We analyze the one-step method TR-BDF2 from the point of view of monotonicity, strong stability and positivity. All these properties are strongly related and reviewed in the common framework of absolute monotonicity. The radius of absolute…
In this paper, we study the problem of maximizing continuous submodular functions that naturally arise in many learning applications such as those involving utility functions in active learning and sensing, matrix approximations and network…
We use the relative modular operator to define a generalized relative entropy for any convex operator function g on the positive real line satisfying g(1) = 0. We show that these convex operator functions can be partitioned into convex…
In the paper we discuss two questions about smooth expanding dynamical systems on the circle. (i) We characterize the sequences of asymptotic length ratios which occur for systems with H\"older continuous derivative. The sequences of…
Let $B$ be a fixed rational function of one complex variable of degree at least two. In this paper, we study solutions of the functional equation $A\circ X=X\circ B$ in rational functions $A$ and $X$. Our main result states that, unless $B$…
We introduce completely monotonic functions of order $r>0$ and show that the remainders in asymptotic expansions of the logarithm of Barnes double gamma function and Euler's gamma function give rise to completely monotonic functions of any…
We construct optimally robust port-Hamiltonian realizations of a given rational transfer function that represents a passive system. We show that the realization with a maximal passivity radius is a normalized port-Hamiltonian one. Its…
Recent years have witnessed the introduction and development of extremely fast rational function algorithms. Many ideas in this realm arose from polynomial-based linear-algebraic algorithms. However, polynomial approximation is occasionally…
We apply the concept of effective order to strong stability preserving (SSP) explicit Runge-Kutta methods. Relative to classical Runge-Kutta methods, methods with an effective order of accuracy are designed to satisfy a relaxed set of order…
High order spatial discretizations with monotonicity properties are often desirable for the solution of hyperbolic PDEs. These methods can advantageously be coupled with high order strong stability preserving time discretizations. The…