Related papers: A generalization of Kakutani's splitting procedure
Splitting methods constitute a widely used class of numerical integrators for ordinary and partial differential equations, particularly well suited to problems that can be decomposed into simpler subproblems. High-order splitting schemes…
We explore a unified $(k_1,k_2,\ldots,k_m)$-run in multi-state trials, examining its distributional properties and waiting time distribution. Our study reveals that this particular run serves as a generalization encompassing various…
Classical jittered sampling partitions $[0,1]^d$ into $m^d$ cubes for a positive integer $m$ and randomly places a point inside each of them, providing a point set of size $N=m^d$ with small discrepancy. The aim of this note is to provide a…
Given an increasing sequence of integers a(n), it is known (due to Weyl) that for almost all reals t, the fractional parts of the dilated sequence t*a(n) are uniformly distributed in the unit interval. Some effort has been made recently to…
We prove a general lemma about partitioning the vertex set of a graph into subgraphs of bounded degree. This lemma extends a sequence of results of Lov\'asz, Catlin, Kostochka and Rabern.
We prove that each discrete set in the Euclidean space that has bounded changes under every translation is a bounded perturbation of a square lattice, i.e., a uniformly spread set in the sense of Laszkovich. In particular, the support of…
The theory of equidistribution is about hundred years old, and has been developed primarily by number theorists and theoretical computer scientists. A motivated uninitiated peer could encounter difficulties perusing the literature, due to…
In this paper we study random partitions of 1,...n, where every cluster of size j can be in any of w\_j possible internal states. The Gibbs (n,k,w) distribution is obtained by sampling uniformly among such partitions with k clusters. We…
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 notion of slicely countably determined (SCD) sets was introduced in 2010 by A.~Avil\'{e}s, V.~Kadets, M.~Mart\'{i}n, J.~Mer\'{i} and V.~Shepelska. We solve in the negative some natural questions about preserving being SCD by the…
We investigate decoupling, one of the most important primitives in quantum Shannon theory, by replacing the uniformly distributed random unitaries commonly used to achieve the protocol, with repeated applications of random unitaries…
Andrews, Lewis and Lovejoy introduced the partition function $PD(n)$ as the number of partitions of $n$ with designated summands. In a recent work, Lin studied a partition function $PD_{t}(n)$ which counts the number of tagged parts over…
Quantization for a probability distribution refers to the idea of estimating a given probability by a discrete probability supported by a finite number of points. In this paper, firstly a general approach to this process is outlined using…
Let $\kappa$ be a positive real number and $m\in\mathbb{N}\cup\{\infty\}$ be given. Let $p_{\kappa, m}(n)$ denote the number of partitions of $n$ into the parts from the Piatestki-Shapiro sequence $(\lfloor \ell^{\kappa}\rfloor)_{\ell\in…
This paper discusses a selected part of the experimental program dedicated to the study of Generalized Parton Distributions, a recently introduced concept which provides a comprehensive framework for investigations of the partonic structure…
We give a historical survey of the theory P-partitions, starting with MacMahon's work, describing Richard Stanley's contributions and his related work, and continuing with more recent developments.
In this note we present new examples of determinantal point processes with infinitely many particles. The particles live on the half-lattice {1,2,...} or on the open half-line (0,+\infty). The main result is the computation of the…
The aim of this paper is to present a first evaluation of a dynamic partition strategy associated to the recently proposed asynchronous distributed computation scheme based on the D-iteration approach. The D-iteration is a fluid diffusion…
We use sums over integer compositions analogous to generating functions in partition theory, to express certain partition enumeration functions as sums over compositions into parts that are $k$-gonal numbers; our proofs employ Ramanujan's…
The uniform structure on a differential space defined by a family of generators is considered.