Related papers: Meinardus' theorem on weighted partitions: extensi…

Probabilistic algorithms are applied to prove theorems about the finite general linear and unitary groups which are typically proved by techniques such as character theory and Moebius inversion. Among the theorems studied are Steinberg's…

We study the asymptotic properties of the trajectories of a discrete-time random dynamical system in an infinite-dimensional Hilbert space. Under some natural assumptions on the model, we establish a multiplica-tive ergodic theorem with an…

We present combinatorial rules (one theorem and two conjectures) concerning three bases of Z[x1,x2,....]. First, we prove a "splitting" rule for the basis of key polynomials [Demazure '74], thereby establishing a new positivity theorem…

We show the existence of rigid combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, $t$-designs, and $t$-wise…

We prove that the coefficients of certain weight -1/2 harmonic Maass forms are traces of singular moduli for weak Maass forms. To prove this theorem, we construct a theta lift from spaces of weight -2 harmonic weak Maass forms to spaces of…

In this paper, we develop the method of circle of partitions and associated statistics. As an application we prove conditionally the binary Goldbach conjecture. We develop a series of steps to prove the binary Goldbach conjecture in full.…

Based on a bijection due to Fu and Tang, we provide combinatorial proofs of several partition identities of Andrews and Merca. We also introduce two weights for partitions to extend one of these identities.

We establish asymptotic normality of weighted sums of periodograms of a stationary linear process where weights depend on the sample size. Such sums appear in numerous statistical applications and can be regarded as a discretized versions…

We examine doing probabilistic descent over manifolds implicitly defined by a set of polynomials with rational coefficients. The system of polynomials is assumed to be triangularized. An application of Whitney's embedding theorem allows us…

This paper studies majorization of high tensor powers of finitely supported probability distributions. Viewing probability distributions as a resource with majorization as a means of transformation corresponds to the resource theory of pure…

Asymptotic formulas of the number of various partitions are studied, like 3-colored partitions, concave partitions, certain plane partitions, partitions without small parts, the number of p-rings.

In this paper, we use the former of the authors developed theory of \emph{circles of partition} to investigate possibilities to prove the binary Goldbach and Lemoine conjectures. We state the \emph{squeeze principle} and its consequences…

In probabilistic logic entailments, even moderate size problems can yield linear constraint systems with so many variables that exact methods are impractical. This difficulty can be remedied in many cases of interest by introducing a three…

As suggested by Currie, we apply the probabilistic method to problems regarding pattern avoidance. Using techniques from analytic combinatorics, we calculate asymptotic pattern occurrence statistics and use them in conjunction with the…

To solve MHD problems within the framework of the theory of two-scale mean fields, it is important to study the invariants of magnetic lines. Such invariants are constructed on the basis of invariants of classical links, which must satisfy…

We present a quantitative basis-independent analysis of combinatory logic. Using a general argument regarding plane binary trees with labelled leaves, we generalise the results of David et al. and Bendkowski et al. to all Turing-complete…

In this paper, we establish a multi-parameter version of Bellow and Losert's Wiener-Wintner type ergodic theorem for dynamical systems not necessarily being commutative. More precisely, we introduce a weight class $\mathcal{D}$, which is…

We study the distribution of partition parts in arithmetic progressions and find asymptotic results that capture all exponentially growing terms. This is accomplished by studying the behavior of non-modular Eisenstein series that appear in…

We describe an equivalent formulation of algebraic weak factorisation systems, not involving monads and comonads, but involving double categories of morphisms equipped with a lifting operation satisfying lifting and factorisation axioms.

We prove specific biases in the number of occurrences of parts belonging to two different residue classes $a$ and $b$, modulo a fixed non-negative integer $m$, for the sets of unrestricted partitions, partitions into distinct parts, and…