Let $a$ and $b\in \mathbb{N}$. Denote by $R_{a,b}$ the set of all integers $n>1$ whose canonical prime representation $n=p_1^{{\alpha }_1}{p}_2^{{\alpha }_2}\cdots p_r^{{\alpha }_r}$ has all exponents ${\alpha }_i$ $(1\le i\le r)$ being a multiple of $a$ or belonging to the arithmetic progression $at+b$, $t\in {\mathbb{N}}_0:=\mathbb{N}\cup \left\{0\right\}$. All integers in $R_{a,b}$ are called generalized square-full integers. Using the exponent pair method, an upper bound for character sums over generalized square-full integers is derived. An application on the distribution of generalized square-full integers in an arithmetic progression is given. ...

A homothetic arithmetic function of ratio $K$ is a function $f:\mathbb{N}\to R$ such that $f\left(Kn\right)=f\left(n\right)$ for every $n\in \mathbb{N}$. Periodic arithmetic funtions are always homothetic, while the converse is not true in general. In this paper we study homothetic and periodic arithmetic functions. In particular we give an upper bound for the number of elements of $f\left(\mathbb{N}\right)$ in terms of the period and the ratio of $f$.

A geometric progression of length k and integer ratio is a set of numbers of the form $a,ar,...,a{r}^{k-1}$ for some positive real number a and integer r ≥ 2. For each integer k ≥ 3, a greedy algorithm is used to construct a strictly decreasing sequence ${\left(a_i\right)}_{i=1}^{\infty }$ of positive real numbers with a₁ = 1 such that the set $G^{\left(k\right)}={\bigcup }_{i=1}^{\infty }(a_{2i},a_{2i-1}]$ contains no geometric progression of length k and integer ratio. Moreover, $G^{\left(k\right)}$ is a maximal subset of (0,1] that contains no geometric progression of length k and integer ratio. It is also proved that...

In this paper, we give a numerical characterization of nef arithmetic $ℝ$-Cartier divisors of $C^0$-type on an arithmetic surface. Namely an arithmetic $ℝ$-Cartier divisor $\overline{D}$ of $C^0$-type is nef if and only if $\overline{D}$ is pseudo-effective and $\widehat{\mathrm{deg}}\left({\overline{D}}^2\right)=\widehat{\mathrm{vol}}\left(\overline{D}\right)$.

We consider random walk on a discrete torus $E$ of side-length $N$, in sufficiently high dimension $d$. We investigate the percolative properties of the vacant set corresponding to the collection of sites which have not been visited by the walk up to time $u{N}^d$. We show that when $u$ is chosen small, as $N$ tends to infinity, there is with overwhelming probability a unique connected component in the vacant set which contains segments of length const $logN$. Moreover, this connected component occupies a...

General position properties play a crucial role in geometric and infinite-dimensional topologies. Often such properties provide convenient tools for establishing various universality results. One of well-known general position properties is DDⁿ, the property of disjoint n-cells. Each Polish $L{C}^{n-1}$-space X possessing DDⁿ contains a topological copy of each n-dimensional compact metric space. This fact implies, in particular, the classical Lefschetz-Menger-Nöbeling-Pontryagin-Tolstova embedding...

Take a centered random walk $S_n$ and consider the sequence of its partial sums $A_n:={\sum }_{i=1}^n{S}_i$. Suppose $S_1$ is in the domain of normal attraction of an $\alpha$-stable law with $1lt;\alpha \le 2$. Assuming that $S_1$ is either right-exponential (i.e. $\mathbb{P}(S_{1}gt;x|S_{1}gt;0)={\mathrm{e}}^{-ax}$ for some $agt;0$ and all $xgt;0$) or right-continuous (skip free), we prove that $$\mathbb{P}\{A_{1}gt;0,\cdots ,A_{N}gt;0\}\sim C_{\alpha }{N}^{1/\left(2\alpha \right)-1/2}$$ as $N\to \infty$, where $C_{\alpha }gt;0$ depends on the distribution of the walk. We also consider a conditional version of this problem and study positivity of integrated discrete bridges.

In this paper, we study the size of the giant component $C_G$ in the random geometric graph $G=G(n,r_n,f)$ of $n$ nodes independently distributed each according to a certain density $f(·)$ in ${[0,1]}^2$ satisfying ${inf}_{x\in {[0,1]}^2}f\left(x\right)gt;$ $0$. If $\frac{c_1}{n}\le r_n^2\le c_2\frac{logn}{n}$ for some positive constants $c_1$, $c_2$ and $n{r}_n^2⟶\infty$ as $n\to \infty$, we show that the giant component of $G$ contains at least $n-\mathrm{o}\left(n\right)$ nodes with probability at least $1-{\mathrm{e}}^{-\beta n{r}_n^2}$ for all $n$ and for some positive constant $\beta$. We also obtain estimates on the diameter and number of the non-giant components of $G$.

We show that, given an n-dimensional normed space X, a sequence of $N={(8/\epsilon )}^{2n}$ independent random vectors ${\left(X_i\right)}_{i=1}^N$, uniformly distributed in the unit ball of X*, with high probability forms an ε-net for this unit ball. Thus the random linear map $\Gamma :ℝ\to {ℝ}^N$ defined by $\Gamma x={(⟨x,X_i⟩)}_{i=1}^N$ embeds X in ${\ell }_{\infty }^N$ with at most 1 + ε norm distortion. In the case X = ℓ₂ⁿ we obtain a random 1+ε-embedding into ${\ell }_{\infty }^N$ with asymptotically best possible relation between N, n, and ε.

We consider the behavior of the power series ${}_0\left(z\right)={\sum }_{n=1}^{\infty }{\mu }^2\left(n\right)z^n$ as z tends to $e\left(\beta \right)=e^{2\pi i\beta }$ along a radius of the unit circle. If β is irrational with irrationality exponent 2 then ${}_0\left(e\left(\beta \right)r\right)=O\left({(1-r)}^{-1/2-\epsilon }\right)$. Also we consider the cases of higher irrationality exponent. We prove that for each δ there exist irrational numbers β such that ${}_0\left(e\left(\beta \right)r\right)=\Omega \left({(1-r)}^{-1+\delta }\right)$.

Let $S_n^{\left(2\right)}$ denote the iterated partial sums. That is, $S_n^{\left(2\right)}=S_1+S_2+\cdots +S_n$, where $S_i=X_1+X_2+\cdots +X_i$. Assuming $X_1,X_2,...,X_n$ are integrable, zero-mean, i.i.d. random variables, we show that the persistence probabilities $$p_n^{\left(2\right)}:=\mathbb{P}\left(\underset{1\le i\le n}{max}{S}_i^{\left(2\right)}lt;0\right)\le c\sqrt{\frac{𝔼|S_{n+1}|}{(n+1)𝔼|X_1|}},$$ with $c\le 6\sqrt{30}$ (and $c=2$ whenever $X_1$ is symmetric). The converse inequality holds whenever the non-zero $min(-X_1,0)$ is bounded or when it has only finite third moment and in addition $X_1$ is squared integrable. Furthermore, $p_n^{\left(2\right)}\asymp n^{-1/4}$ for any non-degenerate squared integrable, i.i.d., zero-mean $X_i$. In contrast, we show that for any $0lt;\gamma lt;1/4$ there exist integrable,...

Let ${ₙ}^{\left(k\right)}$ be a family of random independent k-element subsets of [n] = 1,2,...,n and let $({ₙ}^{\left(k\right)},\ell )={ₙ}^{\left(k\right)}\left(\ell \right)$ denote a family of ℓ-element subsets of [n] such that the event that S belongs to ${ₙ}^{\left(k\right)}\left(\ell \right)$ depends only on the edges of ${ₙ}^{\left(k\right)}$ contained in S. Then, the edges of ${ₙ}^{\left(k\right)}\left(\ell \right)$ are ’weakly dependent’, say, the events that two given subsets S and T are in ${ₙ}^{\left(k\right)}\left(\ell \right)$ are independent for vast majority of pairs S and T. In the paper we present some results on the structure of weakly dependent families of subsets obtained in this way. We...

We study a continuous time growth process on the $d$-dimensional hypercubic lattice ${𝒵}^d$, which admits a phenomenological interpretation as the combustion reaction $A+B\to 2A$, where $A$ represents heat particles and $B$ inert particles. This process can be described as an interacting particle system in the following way: at time 0 a simple symmetric continuous time random walk of total jump rate one begins to move from the origin of the hypercubic lattice; then, as soon as any random walk visits a site...

In this paper we establish a decoupling feature of the random interlacement process ${ℐ}^u\subset {\mathbb{Z}}^d$ at level $u$, $d\ge 3$. Roughly speaking, we show that observations of ${ℐ}^u$ restricted to two disjoint subsets $A_1$ and $A_2$ of ${\mathbb{Z}}^d$ are approximately independent, once we add a sprinkling to the process ${ℐ}^u$ by slightly increasing the parameter $u$. Our results differ from previous ones in that we allow the mutual distance between the sets $A_1$ and $A_2$ to be much smaller than their diameters. We then provide an important application...

Suppose that $𝒢$ is a finite, connected graph and $X$ is a lazy random walk on $𝒢$. The lamplighter chain $X^{\diamond }$ associated with $X$ is the random walk on the wreath product ${𝒢}^{\diamond }={𝐙}_2\wr 𝒢$, the graph whose vertices consist of pairs $(\underline{f},x)$ where $f$ is a labeling of the vertices of $𝒢$ by elements of ${𝐙}_2=\{0,1\}$ and $x$ is a vertex in $𝒢$. There is an edge between $(\underline{f},x)$ and $(\underline{g},y)$ in ${𝒢}^{\diamond }$ if and only if $x$ is adjacent to $y$ in $𝒢$ and $f_z=g_z$ for all $z\ne x,y$. In each step, $X^{\diamond }$ moves from a configuration $(\underline{f},x)$ by updating $x$ to $y$ using the transition rule of $X$ and then...