Nonautonomous attractors and Young measures

Motivated by the problem of identifying a mathematical framework for the formal definition of concepts such as weather, climate and connections between them, we discuss a question of convergence of short-time time averages for random nonautonomous dynamical systems depending on a parameter. The problem is formulated by means of Young measures. Using the notion of pull-back attractor, we prove a general theorem giving a sufficient condition for the tightness of the law of the approximating problems. In a specific example, we show that the theorem applies and we characterize the unique limit point.

Sufficient conditions for the optimality of the greedy algorithm in greedoids

Greedy algorithms are among the most elementary ones in theoretical computer science and understanding the conditions under which they yield an optimum solution is a widely studied problem. Greedoids were introduced by Korte and Lovász at the beginning of the 1980s as a generalization of matroids. One of the basic motivations of the notion was to extend the theoretical background behind greedy algorithms beyond the well-known results on matroids. Indeed, many well-known algorithms of a greedy nature that cannot be interpreted in a matroid-theoretical context are special cases of the greedy algorithm on greedoids. Although this algorithm turns out to be optimal in surprisingly many cases, no general theorem is known that explains this phenomenon in all these cases. Furthermore, certain claims regarding this question that were made in the original works of Korte and Lovász turned out to be false only most recently. The aim of this paper is to revisit and straighten out this question: we summarize recent progress and we also prove new results in this field. In particular, we generalize a result of Korte and Lovász and thus we obtain a sufficient condition for the optimality of the greedy algorithm that covers a much wider range of known applications than the original one.

How to Prove Hume’s Law

This paper proves a precisification of Hume’s Law—the thesis that one cannot get an ought from an is—as an instance of a more general theorem which establishes several other philosophically interesting, though less controversial, barriers to logical consequence.

Entropic singularities give rise to quantum transmission

When can noiseless quantum information be sent across noisy quantum devices? And at what maximum rate? These questions lie at the heart of quantum technology, but remain unanswered because of non-additivity— a fundamental synergy which allows quantum devices (aka quantum channels) to send more information than expected. Previously, non-additivity was known to occur in very noisy channels with coherent information much smaller than that of a perfect channel; but, our work shows non-additivity in a simple low-noise channel. Our results extend even further. We prove a general theorem concerning positivity of a channel’s coherent information. A corollary of this theorem gives a simple dimensional test for a channel’s capacity. Applying this corollary solves an open problem by characterizing all qubit channels whose complement has non-zero capacity. Another application shows a wide class of zero quantum capacity qubit channels can assist an incomplete erasure channel in sending quantum information. These results arise from introducing and linking logarithmic singularities in the von-Neumann entropy with quantum transmission: changes in entropy caused by this singularity are a mechanism responsible for both positivity and non-additivity of the coherent information. Analysis of such singularities may be useful in other physics problems.

Undecidability in quantum thermalization

The investigation of thermalization in isolated quantum many-body systems has a long history, dating back to the time of developing statistical mechanics. Most quantum many-body systems in nature are considered to thermalize, while some never achieve thermal equilibrium. The central problem is to clarify whether a given system thermalizes, which has been addressed previously, but not resolved. Here, we show that this problem is undecidable. The resulting undecidability even applies when the system is restricted to one-dimensional shift-invariant systems with nearest-neighbour interaction, and the initial state is a fixed product state. We construct a family of Hamiltonians encoding dynamics of a reversible universal Turing machine, where the fate of a relaxation process changes considerably depending on whether the Turing machine halts. Our result indicates that there is no general theorem, algorithm, or systematic procedure determining the presence or absence of thermalization in any given Hamiltonian.

The Ru–Vojta result for subvarieties

In M. Ru and P. Vojta, A birational Nevanlinna constant and its consequences, Amer. J. Math. 142(3) (2020) 957–991, among other things, proved the so-called general theorem (arithmetic part) which can be viewed as an extension of Schmidt’s subspace theorem. In this paper, we extend their result by replacing the divisors by closed subschemes.

Stochastic Comparisons of the Smallest Claim Amounts from Two Sets of Independent Portfolios

The aim of this paper is detecting the ordering properties of the smallest claim amounts arising from two sets of independent heterogeneous portfolios in insurance. First, we prove a general theorem that it presents some sufficient conditions in the sense of the hazard rate ordering to compare the smallest claim amounts from two batches of independent heterogeneous portfolios. Then, we show that the exponentiated scale model as a famous model and the Harris family satisfy the sufficient conditions of the proven general theorem. Also, to illustrate our results, some used models in actuary are numerically applied.

Applications of Generating Functions to Stochastic Processes and to the Complexity of the Knapsack Problem

The paper describes a method of solving some stochastic processes using generating functions. A general theorem of generating functions of a particular type is derived. A generating function of this type is applied to a stochastic process yielding polynomial time algorithms for certain partitions. The method is generalized to a stochastic process describing a rather general linear transform. Finally, the main idea of the method is used in deriving a theoretical polynomial time algorithm to the knapsack problem.

Undecidability in quantum thermalization

The investigation of thermalization in isolated quantum many-body systems has a long history, dating back to the time of developing statistical mechanics. Most quantum many-body systems in nature are considered to thermalize, while some never achieve thermal equilibrium. The central problem is to clarify whether a given system thermalizes, which has been addressed previously, but not resolved. Here, we show that this problem is undecidable. The resulting undecidability even applies when the system is restricted to one-dimensional shift-invariant systems with nearest-neighbour interaction, and the initial state is a fixed product state. We construct a family of Hamiltonians encoding dynamics of a reversible universal Turing machine, where the fate of a relaxation process changes considerably depending on whether the Turing machine halts. Our result indicates that there is no general theorem, algorithm, or systematic procedure determining the presence or absence of thermalization in any given Hamiltonian.

Asymptotic Behaviour of the Empirical Distance Covariance for Dependent Data

We give two asymptotic results for the empirical distance covariance on separable metric spaces without any iid assumption on the samples. In particular, we show the almost sure convergence of the empirical distance covariance for any measure with finite first moments, provided that the samples form a strictly stationary and ergodic process. We further give a result concerning the asymptotic distribution of the empirical distance covariance under the assumption of absolute regularity of the samples and extend these results to certain types of pseudometric spaces. In the process, we derive a general theorem concerning the asymptotic distribution of degenerate V-statistics of order 2 under a strong mixing condition.