A multi-variable version of the completed Riemann zeta function and other LL-functions

We define a generalisation of the completed Riemann zeta function in several complex variables. It satisfies a functional equation, shuffle product identities, and has simple poles along finitely many hyperplanes, with a recursive structure on its residues. The special case of two variables can be written as a partial Mellin transform of a real analytic Eisenstein series, which enables us to relate its values at pairs of positive even points to periods of (simple extensions of symmetric powers of the cohomology of) the CM elliptic curve corresponding to the Gaussian integers. In general, the totally even values of these functions are related to new quantities which we call multiple quadratic sums. More generally, we cautiously define multiple-variable versions of motivic $L$-functions and ask whether there is a relation between their special values and periods of general mixed motives. We show that all periods of mixed Tate motives over the integers, and all periods of motivic fundamental groups (or relative completions) of modular groups, are indeed special values of the multiple motivic $L$-values defined here.Comment: This is the second half of a talk given in honour of Ihara's 80th birthday, and will appear in the proceedings thereo

Dispersion modeling and analysis for multilayered open coaxial waveguides

This paper presents a detailed modeling and analysis regarding the dispersion characteristics of multilayered open coaxial waveguides. The study is motivated by the need of improved modeling and an increased physical understanding about the wave propagation phenomena on very long power cables which has a potential industrial application with fault localization and monitoring. The electromagnetic model is based on a layer recursive computation of axial-symmetric fields in connection with a magnetic frill generator excitation that can be calibrated to the current measured at the input of the cable. The layer recursive formulation enables a stable and efficient numerical computation of the related dispersion functions as well as a detailed analysis regarding the analytic and asymptotic properties of the associated determinants. Modal contributions as well as the contribution from the associated branch-cut (non-discrete radiating modes) are defined and analyzed. Measurements and modeling of pulse propagation on an 82 km long HVDC power cable are presented as a concrete example. In this example, it is concluded that the contribution from the second TM mode as well as from the branch-cut is negligible for all practical purposes. However, it is also shown that for extremely long power cables the contribution from the branch-cut can in fact dominate over the quasi-TEM mode for some frequency intervals. The main contribution of this paper is to provide the necessary analysis tools for a quantitative study of these phenomena

On the enumeration of closures and environments with an application to random generation

Environments and closures are two of the main ingredients of evaluation in lambda-calculus. A closure is a pair consisting of a lambda-term and an environment, whereas an environment is a list of lambda-terms assigned to free variables. In this paper we investigate some dynamic aspects of evaluation in lambda-calculus considering the quantitative, combinatorial properties of environments and closures. Focusing on two classes of environments and closures, namely the so-called plain and closed ones, we consider the problem of their asymptotic counting and effective random generation. We provide an asymptotic approximation of the number of both plain environments and closures of size $n$. Using the associated generating functions, we construct effective samplers for both classes of combinatorial structures. Finally, we discuss the related problem of asymptotic counting and random generation of closed environemnts and closures

Recursive POD expansion for the advection-diffusion-reaction equation

This paper deals with the approximation of advection-diffusion-reaction equation solution by reduced order methods. We use the Recursive POD approximation for multivariate functions introduced in [M. AZAÏEZ, F. BEN BELGACEM, T. CHACÓN REBOLLO, Recursive POD expansion for reactiondiffusion equation, Adv.Model. and Simul. in Eng. Sci. (2016) 3:3. DOI 10.1186/s40323-016-0060-1] and applied to the low tensor representation of the solution of the reaction-diffusion partial differential equation. In this contribution we extend the Recursive POD approximation for multivariate functions with an arbitrary number of parameters, for which we prove general error estimates. The method is used to approximate the solutions of the advection-diffusion-reaction equation. We prove spectral error estimates, in which the spectral convergence rate depends only on the diffusion interval, while the error estimates are affected by a factor that grows exponentially with the advection velocity, and are independent of the reaction rate if this lives in a bounded set. These error estimates are based upon the analyticity of the solution of these equations as a function of the parameters (advection velocity, diffusion, reaction rate). We present several numerical tests, strongly consistent with the theoretical error estimates.Ministerio de Economía y CompetitividadAgence nationale de la rechercheGruppo Nazionale per il Calcolo ScientificoUE ERA-PLANE

Congruence properties of depths in some random trees

Consider a random recusive tree with n vertices. We show that the number of vertices with even depth is asymptotically normal as n tends to infinty. The same is true for the number of vertices of depth divisible by m for m=3, 4 or 5; in all four cases the variance grows linearly. On the other hand, for m at least 7, the number is not asymptotically normal, and the variance grows faster than linear in n. The case m=6 is intermediate: the number is asymptotically normal but the variance is of order n log n. This is a simple and striking example of a type of phase transition that has been observed by other authors in several cases. We prove, and perhaps explain, this non-intuitive behavious using a translation to a generalized Polya urn. Similar results hold for a random binary search tree; now the number of vertices of depth divisible by m is asymptotically normal for m at most 8 but not for m at least 9, and the variance grows linearly in the first case both faster in the second. (There is no intermediate case.) In contrast, we show that for conditioned Galton-Watson trees, including random labelled trees and random binary trees, there is no such phase transition: the number is asymptotically normal for every m.Comment: 23 page