arXiv subjects

Jasmin Fiedler

Publications and source records attributed to Jasmin Fiedler.

3 recordsLinked to original sources

arXiv2025

Weak Poissonian box correlations of higher order

Poissonian pair correlations have sparked interest within the mathematical community, because of their number theoretic properties, and their connections to quantum physics and probability theory, particularly uniformly distributed random numbers. Rather recently, several generalizations of the concept have been introduced, including weak Poissonian pair correlations and $k$-th order Poissonian correlations. In this paper, we propose a new generalized concept called $(k,m,β)$-Poissonian box correlations. We study their properties and more specifically their relation to uniform distribution theory, discrepancy theory, random numbers and gap distributions.

math.NT↗

arXiv2025

On the Pair Correlation Statistic of Sequences with Finite Gap Property

The limiting function $f(s)$ of the pair correlation \[ \frac{1}{N} \# \left\{ 1 \leq i\neq j\leq N \middle\vert \left\lVert x_i - x_j \right\rVert \leq \frac{s}{N} \right\} \] for a sequence $(x_N)_{N \in \mathbb{N}}$ on the torus $\mathbb{T}^1$ is said to be Poissonian if it exists and equals $2s$ for all $s \geq 0$. For instance, independent, uniformly distributed random variables generically have this property. Obviously $f(s)$ is always a monotonic function if existent. There are only few examples of sequences where $f(s) \neq 2s$, but where the limit can still be explicitly calculated. Therefore, it is an open question which types of functions $f(s)$ can or cannot appear here. In this note, we give a partial answer on this question by addressing the case that the number of different gap lengths in the sequence is finite and showing that $f$ cannot be continuous then.

math.NT↗

arXiv2023

New Bounds for the Extreme and the Star Discrepancy of Double-Infinite Matrices

According to Aistleitner and Weimar, there exist two-dimensional (double) infinite matrices whose star-discrepancy $D_N^{*s}$ of the first $N$ rows and $s$ columns, interpreted as $N$ points in $[0,1]^s$, satisfies an inequality of the form $$D_N^{*s} \leq \sqrtα \sqrt{A+B\frac{\ln(\log_2(N))}{s}}\sqrt{\frac{s}{N}}$$ with $α= ζ^{-1}(2) \approx 1.73, A=1165$ and $B=178$. These matrices are obtained by using i.i.d sequences, and the parameters $s$ and $N$ refer to the dimension and the sample size respectively. In this paper, we improve their result in two directions: First, we change the character of the equation so that the constant $A$ gets replaced by a value $A_s$ dependent on the dimension $s$ such that for $s>1$ we have $A_s<A$. Second, we generalize the result to the case of the (extreme) discrepancy. The paper is complemented by a section where we show numerical results for the dependence of the parameter $A_s$ on $s$.

math.NT↗