CHChristian Henriksen

Christian Henriksen

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Christian Henriksen has a total of 48 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Roots of polynomial sequences in root‐sparse regions

    by Christian Henriksen, Carsten Lunde Petersen, Eva Uhre

    Given a family of polynomials, we call an open set root‐sparse if the number of zeros of is locally uniformly bounded on . We study the interplay between the individual zeros of the polynomials and those of the th derivatives in a root‐sparse open set , as . More precisely, if the root distributions of converge weak* to some compactly supported measure , whose potential is nowhere locally constant on a root‐sparse open set , then we link the roots of the th derivative , for an arbitrary , to the roots of and the critical points of the potential on compact subsets of . We apply this result in a polynomial dynamics setting to obtain convergence results for the roots of the th derivative of the iterates of a polynomial outside the filled‐in Julia set. We also apply our result in the setting of extremal polynomials.


  • Open Access

    Zero Distributions of Derivatives of Polynomial Families Centering on a Set

    by Christian Henriksen, Carsten Lunde Petersen, Eva Uhre

    Suppose $$C \subset {\mathbb {C}}$$ C ⊂ C is compact. Let $$q_k$$ q k be a sequence of polynomials of degree $$n_k \rightarrow \infty $$ n k → ∞ , such that the locus of roots of all the polynomials is bounded, and the number of roots of $$q_k$$ q k in any closed set L disjoint from C is uniformly bounded. Supposing that $$(q_k)_k$$ ( q k ) k has an asymptotic root distribution $$\mu $$ μ we provide conditions on C and $$\mu $$ μ assuring the sequence of m th derivatives $$(q_k^{(m)})_k$$ ( q k ( m ) ) k has the same asymptotic root distribution $$\mu $$ μ for any $$m\ge 1$$ m ≥ 1 . This complements recent results of Totik, [19].


  • Value distributions of derivatives of K -regular polynomial families

    by Christian Henriksen, Carsten Lunde Petersen, Eva Uhre

    Let $\Omega \in \mathbb C$ be a domain such that $K:= \mathbb C \setminus \Omega $ is compact and non-polar. Let $(q_k)_{k>0}$ be a sequence of polynomials with $n_k$ , the degree of $q_k$ satisfying $n_k \to \infty $ , and let $(q_k^{(m)})_k$ denote the sequence of m th derivatives. We provide conditions which ensure that the preimages $(q_k^{(m)})^{-1}(\{a\})$ uniformly equidistribute on $\partial \Omega $ , as $k \to \infty $ , for every $a \in \mathbb C$ and every $m = 0, 1, \ldots .$


  • Student learning in the age of AI: principles and practices for using AI in higher education

    by Christian Hendriksen

    This chapter explores the transformative potential of generative AI in higher education, particularly its promise in addressing Bloom’s “two-sigma problem.” The chapter discusses the capabilities of state-of-the-art AI models like GPT-4 in providing virtual tutoring that rivals human tutors in knowledge, empathy, and availability. It emphasizes the necessity for critical engagement with AI to enhance learning, rather than merely offloading tasks. Key principles for effective AI interaction - context provision, iteration, and human-like communication - are outlined. The chapter also presents practical use cases for AI, demonstrating its application in explaining complex concepts, conducting low-stakes testing, and bridging disciplinary gaps.


  • Open Access

    Roots of polynomial sequences in root-sparse regions

    by Christian Henriksen, Carsten Lunde Petersen, Eva Uhre

    Given a family $(q_k)_k$ of polynomials, we call an open set $U$ root-sparse if the number of zeros of $q_k$ is locally uniformly bounded on $U$. We study the interplay between the individual zeros of the polynomials $q_k$ and those of the $m$th derivatives $q_k^{(m)}$, in a root-sparse open set $U$, as $k\to\infty$. More precisely, if the root distributions $μ_k$ of $q_k$ converge weak* to some compactly supported measure $μ$, whose potential is nowhere locally constant on a root-sparse open set $U$, then we link the roots of the $m$th derivative $q_k^{m}$, for an arbitrary $m>0$, to the roots of $q_k$ and the critical points of the potential $p_μ$ on compact subsets of $U$. We apply this result in a polynomial dynamics setting to obtain convergence results for the roots of the $m$th derivative of iterates of a polynomial outside the filled-in Julia set. We also apply our result in the setting of extremal polynomials.

  • Open Access

    Preventing food waste: Forecasting the number of meals for canteen kitchens

    by Poul Hjorth, Tobias Boklund, Jacqueline Christmas, Christian Henriksen, Adam Milke, Michail Kubiak

    \textbf{Cheffr ApS} is a Danish development company that focuses on minimizing food and resource waste in canteen kitchens. Currently, %up to one-third of the produced food ends up in the trash [reference?] up to 20\% of food served in the food service sector is wasted which has negative consequences for both the environment and the economy. To address this issue, Cheffr has developed \texttt{CheffrBook}, a digital application for booking and cancelling meals which assists kitchen managers in reducing daily food waste. The Study Group is asked to propose optimal algorithms to turn existing user data into more reliable predictions which can help kitchen managers minimise food waste at the cooking and serving stage of food delivery. The goal is to develop forecasting functionality for the \texttt{CheffrBook} application based historical information such as bookings and attendance, as well as related data like vacations, seasons, and individual diner profiles.

  • Open Access

    Zero distributions of derivatives of polynomial families centering on a set

    by Christian Henriksen, Carsten Lunde Petersen, Eva Uhre

    Suppose $C \subset \mathbb{C}$ is compact. Let $q_k$ be a sequence of polynomials of degree $n_k \to \infty$, such that the locus of roots of all the polynomials is bounded, and the number of roots of $q_k$ in any closed set $L$ not meeting $C$ is uniformly bounded. Supposing that $(q_k)_k$ has an asymptotic root distribution $μ$ we provide conditions on $C$ and $μ$ assuring the sequence of $m$th derivatives $(q_k^{(m)})_k$ also has asymptotic root distribution $μ$ for any $m\geq 1$. This complements recent results of Totik.

  • Geometric limits of mixed families

    by Christian Henriksen, Carsten Lunde Petersen

    Letting f and h denoting rational maps of degree at least 2 and 1 respectively, and denote by fn the nth iterate of f. We give upper and lower bounds on the set of accumulation points of the Julia sets J(h∘fn) with respect to the Hausdorff metric on non-empty compact subsets of the sphere.


  • Open Access

    Correction of Fluorescent Probe Degradation in Biodistribution Studies

    by Christian Henriksen, Tobias Idor Boklund, Laurits Fromberg, Benjamin Jüttner, Peder Jørgensgaard Olesen, Andreas Plesner, Kenneth Scheel

    Fluorescence microscopy can be used for evaluating distribution of medical compounds in animal tissue. Fluorescence intensity decays in time and due to scanning, but correcting for this can improve accuracy. We present a mixed-effects model for fluorescence microscopy intensity reconstruction. Model parameters are estimated via maximum likelihood estimation, taking into account biological variability between animals and measurement uncertainty. The initial fluorescence intensity is reconstructed by decay correction. The model is tested using different data sets. When estimating initial intensities from intensities measured on samples subjected to chemical degradation, decay rate estimates are found to be robust against variation in the ratio of measurement-induced variance to biological variance. Photobleaching rates are found to have only modest significance. A synthetic data set consistent with previously determined parameters is generated, and a forward model is applied; the maximum likelihood estimates accurately recover the parameters, demonstrating the consistency of the model.