Related papers: A von Neumann theorem for uniformly distributed se…
Let \(\mathcal{P}(n)\) be the set of partitions of the positive integer \(n\). For \(\alpha=(\alpha_1,...,\alpha_t) \in \mathcal{P}(n)\) define the diagonal sequence \(\delta(\alpha)=(d_k(\alpha))_{k \geq 1}\) via \( d_k(\alpha) =…
The connection between symmetries and conservation laws as made by Noether's theorem is extended to the context of causal variational principles and causal fermion systems. Different notions of continuous symmetries are introduced. It is…
In this paper we prove that the number of partitions into squares with an even number of parts is asymptotically equal to that of partitions into squares with an odd number of parts. We further show that, for $ n $ large enough, the two…
In this paper, we present two new results of layered permutation densities. The first one generalizes theorems from H\"{a}st\"{o} (2003) and Warren (2004) to compute the permutation packing of permutations whose layer sequence…
We propose a unified framework for random locations exhibiting some probabilistic symmetries such as stationarity, self-similarity, etc. A theorem of Noether's type is proved, which gives rise to a conservation law describing the change of…
We consider approximation properties of real points by uniformly distributed sequences. Under some assumptions on the approximation functions, we prove a Khintchine-type $0$-$1$ dichotomy law. We establish a new connection between uniform…
The norm of an integer partition is defined as the product of its parts. This statistic was recently introduced by Schneider in connection to partition zeta functions. In this note, we use the method of moments to study the distribution of…
We shift the perspective on the interval fragmentation problem from division points to division spacings. This leads to a proof that is both simpler and stronger, establishing limiting distributions for partition points and spacings and,…
The many-identical-particle quantum correlations are revisited utilizing the machinery of basic group theory, especially that of the group of permutations. It is done with the purpose to obtain precise definitions of effective distinct…
We extract a precise internal description of the sequential commutation equivalence relation introduced in [KEP23] for tracial von Neumann algebras. As an application we prove that if a tracial von Neumann algebra $N$ is generated by…
We prove a central limit theorem for the length of the longest subsequence of a random permutation which follows one of a class of repeating patterns. This class includes every fixed pattern of ups and downs having at least one of each,…
We give a necessary and sufficient condition for a system of linear inhomogeneous fractional differential equations to have at least one bounded solution. We also obtain an explicit description for the set of all bounded (or decay)…
In a uniform random permutation \Pi of [n] := {1,2,...,n}, the set of elements k in [n-1] such that \Pi(k+1) = \Pi(k) + 1 has the same distribution as the set of fixed points of \Pi that lie in [n-1]. We give three different proofs of this…
In this paper we consider some results on intersection between rays and a given family of convex, compact sets. These results are similar to the center point theorem, and Tverberg's theorem on partitions of a point set.
In this paper we study the inverse of so-called unfair permutations, and explore various properties of them. Our investigation begins with comparing this class of permutations with uniformly random permutations, and showing that they behave…
New results on uniform convergence in probability for the most general classes of wavelet expansions of stationary Gaussian random processes are given.
We provide a permutation invariant version of the strong law of large numbers for exchangeable sequences of random variables. The proof consists of a combination of the Koml\'{o}s-Berkes theorem, the usual strong law of large numbers for…
The connection between the theory of permutation orbifolds, covering surfaces and uniformization is investigated, and the higher genus partition functions of an arbitrary permutation orbifold are expressed in terms of those of the original…
We establish a fixed-point theorem for the face maps that consist in deleting the $i$th entry of an ordered set. Furthermore, we show that there exists random finite sets of integers that are almost invariant under such deletions.…
This paper introduced a way of fractal to solve the problem of taking count of the integer partitions, furthermore, using the method in this paper some recurrence equations concerning the integer partitions can be deduced, including the…