We discuss a general combinatorial framework for operator ordering problems by applying it to the normal ordering of the powers and exponential of the boson number operator. The solution of the problem is given in terms of Bell and Stirling numbers enumerating partitions of a set. This framework reveals several inherent relations between ordering problems and combinatorial objects, and displays the analytical background to Wick’s theorem. The methodology can be straightforwardly generalized from the simple example we discuss to a wide class of operators.

Based on the mathematical arguments formulated within the multifractal detrended fluctuation analysis (MFDFA) approach it is shown that, in the uncorrelated time series from the Gaussian basin of attraction, the effects resembling multifractality asymptotically disappear for positive moments when the length of time series increases. A hint is given that this applies to the negative moments as well and extends to the Lévy stable regime of fluctuations. The related effects are also illustrated and confirmed by numerical simulations. This documents that the genuine multifractality in time series may only result from the long-range temporal correlations, and the fatter distribution tails of fluctuations may broaden the width of the singularity spectrum only when such correlations are present. The frequently asked question of what makes multifractality in time series—temporal correlations or broad distribution tails—is thus ill posed. In the absence of correlations only the bifractal or monofractal cases are possible. The former corresponds to the Lévy stable regime of fluctuations while the latter to the ones belonging to the Gaussian basin of attraction in the sense of the central limit theorem.

Quantum probability theory (QPT) has provided a novel, rich mathematical framework for cognitive modelling, especially for situations which appear paradoxical from classical perspectives. This work concerns the dynamical aspects of QPT, as relevant to cognitive modelling. We aspire to shed light on how the mind's driving potentials (encoded in Hamiltonian and Lindbladian operators) impact the evolution of a mental state. Some existing QPT cognitive models do employ dynamical aspects when considering how a mental state changes with time, but it is often the case that several simplifying assumptions are introduced. What kind of modelling flexibility does QPT dynamics offer without any simplifying assumptions and is it likely that such flexibility will be relevant in cognitive modelling? We consider a series of nested QPT dynamical models, constructed with a view to accommodate results from a simple, hypothetical experimental paradigm on decision-making. We consider Hamiltonians more complex than the ones which have traditionally been employed with a view to explore the putative explanatory value of this additional complexity. We then proceed to compare simple models with extensions regarding both the initial state (e.g. a mixed state with a specific orthogonal decomposition; a general mixed state) and the dynamics (by introducing Hamiltonians which destroy the separability of the initial structure and by considering an open-system extension). We illustrate the relations between these models mathematically and numerically. This article is part of the themed issue ‘Second quantum revolution: foundational questions’.

We consider the numbers arising in the problem of normal ordering of expressions in boson creation $a^{\mathrm{†}}$ and annihilation $a$ operators $([a,a^{\mathrm{†}}]=1)$ . We treat a general form of a boson string ${\left(a^{\mathrm{†}}\right)}^{r_n}{a}^{s_n}\dots {\left(a^{\mathrm{†}}\right)}^{r_2}{a}^{s_2}{\left(a^{\mathrm{†}}\right)}^{r_1}{a}^{s_1}$ which is shown to be associated with generalizations of Stirling and Bell numbers. The recurrence relations and closed-form expressions (Dobiński-type formulas) are obtained for these quantities by both algebraic and combinatorial methods. By extensive use of methods of combinatorial analysis we prove the equivalence of the aforementioned problem to the enumeration of special families of graphs. This link provides a combinatorial interpretation of the numbers arising in this normal ordering problem.