Universal axion backreaction in flux compactifications

We study the backreaction effect of a large axion field excursion on the saxion partner residing in the same $$ \mathcal{N} $$ N = 1 multiplet. Such configurations are relevant in attempts to realize axion monodromy inflation in string compactifications. We work in the complex structure moduli sector of Calabi-Yau fourfold compactifications of F-theory with four-form fluxes, which covers many of the known Type II orientifold flux compactifications. Noting that axions can only arise near the boundary of the moduli space, the powerful results of asymptotic Hodge theory provide an ideal set of tools to draw general conclusions without the need to focus on specific geometric examples. We find that the boundary structure engraves a remarkable pattern in all possible scalar potentials generated by background fluxes. By studying the Newton polygons of the extremization conditions of all allowed scalar potentials and realizing the backreaction effects as Puiseux expansions, we find that this pattern forces a universal backreaction behavior of the large axion field on its saxion partner.

Analytic Continuation for Solutions to the System of Trinomial Algebraic Equations

In the paper, we deal with the problem of getting analytic continuations for the monomial function associated with a solution to the reduced trinomial algebraic system. In particular, we develop the idea of applying the Mellin-Barnes integral representation of the monomial function for solving the extension problem and demonstrate how to achieve the same result following the fact that the solution to the universal trinomial system is polyhomogeneous. As a main result, we construct Puiseux expansions (centred at the origin) representing analytic continuations of the monomial function

On Average Behaviour of Regular Expressions in Strong Star Normal Form

For regular expressions in (strong) star normal form a large set of efficient algorithms is known, from conversions into finite automata to characterisations of unambiguity. In this paper we study the average complexity of this class of expressions using analytic combinatorics. As it is not always feasible to obtain explicit expressions for the generating functions involved, here we show how to get the required information for the asymptotic estimates with an indirect use of the existence of Puiseux expansions at singularities. We study, asymptotically and on average, the alphabetic size, the size of the [Formula: see text]-follow automaton and of the position automaton, as well as the ratio and the size of these expressions to standard regular expressions.