相关论文: On binomial sums, additive energies, and lazy rand…

Let $X$ be the constrained random walk on $\mathbb{Z}_+^d$ $d >2$, having increments $e_1$, $-e_i+e_{i+1}$ $i=1,2,3,...,d-1$ and $-e_d$ with probabilities $\lambda$, $\mu_1$, $\mu_2$,...,$\mu_d$, where $\{e_1,e_2,..,e_d\}$ are the standard…

We provide a new proof of the abstract random tensor estimate. This estimate was initially proven by Deng, Nahmod, and Yue (2022) using the moment method. The key new tool in our proof is the direct use of the non-commutative Khintchine…

In this short note, we give a simple derivation of the strong subadditivity inequalities: S(13) + S(23) \ge S(1) + S(2) and S(12) + S(23) \ge S(2) + S(123). The simplicity is due to the way we represent the quantum systems. We make a few…

Let $A$ be a set of natural numbers. A set $B$, a set of natural numbers, is an additive complement of the set $A$ if all sufficiently large natural numbers can be represented in the form $x+y$, where $x\in A$ and $y\in B$. Erd\H{o}s…

Let G be any additive abelian group with cyclic torsion subgroup, and let A, B and C be finite subsets of G with cardinality n>0. We show that there is a numbering {a_i}_{i=1}^n of the elements of A, a numbering {b_i}_{i=1}^n of the…

Assuming that Siegel zeros exist, we prove a hybrid version of the Chowla and Hardy--Littlewood prime tuples conjectures. Thus, for an infinite sequence of natural numbers $x$, and any distinct integers $h_1,\dots,h_k,h'_1,\dots,h'_\ell$,…

This work addresses potential theoretic questions for the standard nearest neighbor random walk on the hypercube $\{-1,+1\}^N$. For a large class of subsets $A\subset\{-1,+1\}^N$ we give precise estimates for the harmonic measure of $A$,…

We show the existence of regular 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…

Gross and Smith have put forward generalizations of Hardy - Littlewood twin prime conjectures for algebraic number fields. We estimate the behavior of sums of a singular series that arises in these conjectures, up to lower order terms. More…

The mixing time of a discrete-time quantum walk on the hypercube is considered. The mean probability distribution of a Markov chain on a hypercube is known to mix to a uniform distribution in time O(n log n). We show that the mean…

We consider a discrete random walk on a diagonal lattice in two and three dimensions and obtain explicit solutions of absorption probabilities and probabilities of return in several domains. In three dimensions we consider both the cube and…

We study whether the probability distribution of a discrete quantum walk can get arbitrarily close to uniform, given that the walk starts with a uniform superposition of the outgoing arcs of some vertex. We establish a characterization of…

For any integers $k\geq 2$, $q\geq 1$ and any finite set $\mathcal{A}=\{{\boldsymbol{\alpha}}_1,\cdots,{\boldsymbol{\alpha}}_q\}$, where ${ \boldsymbol{\alpha}_t}=(\alpha_{t,1},\cdots,\alpha_{t,k})~(1\leq t\leq q)$ with…

Let $\mathcal{H}^{*}=\{h_1,h_2,\ldots\}$ be an ordered set of integers. We give sufficient conditions for the existence of increasing sequences of natural numbers $a_j$ and $n_k$ such that $n_k+h_{a_j}$ is a sum of two squares for every…

We argue that the complex numbers are an irreducible object of quantum probability. This can be seen in the measurements of geometric phases that have no classical probabilistic analogue. Having complex phases as primitive ingredient…

In this letter, we prove an inequality involving alternating binomial logarithmic sums by exploiting the variance of the logarithm of the maximum of independent and identically distributed exponential random variables. This inequality was…

In 1961, P. Erd\H{o}s, A. Ginzburg, and A. Ziv proved a remarkable theorem stating that each set of $2n-1$ integers contains a subset of size $n$, the sum of whose elements is divisible by $n$. We will prove a similar result for pairs of…

We consider the simple random walk on random graphs generated by discrete point processes. This random graph has a random subset of a cubic lattice as the vertices and lines between any consecutive vertices on lines parallel to each…

We present an extension of the famous Littlewood-Offord problem when Bernoulli distributions are replaced with discrete log-concave distributions. A variant of the Littlewood-Offord problem for arithmetic progressions, as well as an…

We consider the simple random walk in i.i.d. nonnegative potentials on the multidimensional cubic lattice. Our goal is to investigate the cost paid by the simple random walk for traveling from the origin to a remote location in a landscape…