中文
相关论文

相关论文: Low discrepancy sequences failing Poissonian pair …

200 篇论文

We consider representations of general non-overlapping placements of rectangles by spatial relations (west, south, east, north) of pairs of rectangles. We call a set of representations complete if it contains a representation of every…

组合数学 · 数学 2017-09-01 Jannik Silvanus , Jens Vygen

Let $B(n,p)$ denote a binomial random variable with parameters $n$ and $p$. Vas\v{e}k Chv\'{a}tal conjectured that for any fixed $n\geq 2$, as $m$ ranges over $\{0,\ldots,n\}$, the probability $q_m:=P(B(n,m/n)\leq m)$ is the smallest when…

概率论 · 数学 2023-04-05 Fu-Bo Li , Kun Xu , Ze-Chun Hu

In this paper, we shed new light on the spectrum of the relation algebra we call $A_{n}$, which is obtained by splitting the non-flexible diversity atom of $6_{7}$ into $n$ symmetric atoms. Precisely, we show that the minimum value in…

Partially ordered sets of type (k, n) are the sets such that a) cardinality of each set is n, b) dimension of each set is two, c) length of the maximal antichain in each set is k. Let \alpha_k(n) be the number of partially ordered sets of…

组合数学 · 数学 2013-09-27 Mikhail Kharitonov

Niederreiter and Halton sequences are two prominent classes of multi-dimensional sequences which are widely used in practice for numerical integration methods because of their excellent distribution qualities. In this paper, we show that…

数论 · 数学 2019-11-12 Roswitha Hofer , Lisa Kaltenböck

\noindent In this article, we determine all the integers $c$ having at least two representations as difference between two linear recurrent sequences. This is a variant of the Pillai's equation. This equation is an exponential Diophantine…

数论 · 数学 2022-08-12 Pagdame Tiebekabe , Serge Adonsou , Ismaïla Diouf

Let $\{X_{k,i};i\geq 1,k\geq 1\}$ be an array of i.i.d. random variables and let $\{p_n;n\geq 1\}$ be a sequence of positive integers such that $n/p_n$ is bounded away from 0 and $\infty$. For $W_n=\max_{1\leq i<j\leq…

概率论 · 数学 2007-05-23 Deli Li , Andrew Rosalsky

We consider the problem of finding a low discrepancy coloring for sparse set systems where each element lies in at most t sets. We give an efficient algorithm that finds a coloring with discrepancy O((t log n)^{1/2}), matching the best…

数据结构与算法 · 计算机科学 2016-09-13 Nikhil Bansal , Daniel Dadush , Shashwat Garg

We consider finite Bernoulli convolutions with a parameter $1/2 < r < 1$ supported on a discrete point set, generically of size $2^N$. These sequences are uniformly distributed with respect to the infinite Bernoulli convolution measure…

数论 · 数学 2011-07-20 Itai Benjamini , Boris Solomyak

The results for the fractional sequence $\left \{[x/n]+1:n \leq x\right \}$, and the fractional sequence in arithmetic progression $\left \{q[x/n]+a:n \leq x\right \}$, where $a<q$ are integers such that $\gcd(a,q)=1$, prove that these…

综合数学 · 数学 2019-04-02 N. A. Carella

Suppose $P_n=\{1,2,...,n\}$ is a partially ordered set with the partial order defined by divisibility, that is, for any two distinct elements $i,j\in P_n$ satisfying $i$ divides $j$, $i<_{P_n} j$. A table $A_n=\{a_i|i=1,2,...,n\}$ of…

离散数学 · 计算机科学 2007-05-23 Yongxi Cheng , Xi Chen , Yiqun Lisa Yin

In this paper, we introduce a weakening of the Freiman isomorphisms between subsets of non necessarily abelian groups. Inspired by the breakthrough result of Kravitz, [14], on cyclic groups, as a first application, we prove that any subset…

组合数学 · 数学 2024-07-30 Simone Costa , Stefano Della Fiore

We show that if $\{U_n\}_{n\geq 0}$ is a Lucas sequence, then the largest $n$ such that $|U_n|=C_{m_1}C_{m_2}\cdots C_{m_k}$ with $1\leq m_1\leq m_2\leq \cdots\leq m_k$, where $C_m$ is the $m$th Catalan number satisfies $n<6500$. In case…

数论 · 数学 2020-06-03 Shanta Laishram , Florian Luca , Mark Sias

Let $(f_n)_{n=1}^{\infty}$ be a sequence of polynomials and $\alpha>1$. In this paper we study the distribution of the sequence $(f_n(\alpha))_{n=1}^{\infty}$ modulo one. We give sufficient conditions for a sequence $(f_n)_{n=1}^{\infty}$…

数论 · 数学 2020-03-05 Simon Baker

A tree $T$ on $2^n$ vertices is called set-sequential if the elements in $V(T)\cup E(T)$ can be labeled with distinct nonzero $(n+1)$-dimensional $01$-vectors such that the vector labeling each edge is the component-wise sum modulo $2$ of…

组合数学 · 数学 2021-11-09 Emily Eckels , Ervin Gyori , Junsheng Liu , Sohaib Nasir

In this paper, we find all integers $c$ having at least two representations as a difference between linear recurrent sequences. This problem is a pillai problem involving Padovan and Fibonacci sequence. The proof of our main theorem uses…

数论 · 数学 2022-07-28 Pagdame Tiebekabe , Serge Adonsou

Although a generic uniformly distributed sequence has Poissonian pair correlations, only one explicit example has been found up to now. Additionally, it is even known that many classes of uniformly distributed sequences, like van der Corput…

数论 · 数学 2021-02-09 Christian Weiß , Thomas Skill

In this paper, we present a method for estimating the least common multiple of a large class of binary linear recurrence sequences. Let $P,Q,R_0$, and $R_1$ be fixed integers and let $\boldsymbol{R}=\left(R_n\right)_{n}$ be the recurrence…

数论 · 数学 2020-11-10 Sid Ali Bousla

The exponential correlation function is theoretically incorrect in the entire frequency range of interest for processes described in terms of linear response theory. The Lorentzian lineshape results from an inconsistent assumption of…

统计力学 · 物理学 2016-08-31 T. R. S. Prasanna

We study the minimal gap statistic for sequences of the form $\left( \alpha x_n \right)_{n = 1}^{\infty}$ where $\left( x_n \right)_{n = 1}^{\infty}$ is a sequence of real numbers, and its connection to the additive energy of $\left( x_n…

数论 · 数学 2021-08-24 Shvo Regavim