相关论文: On cogrowth function of uniformly recurrent sequen…

For a positive integer $n \geq 2$, define $t_n$ to be the smallest number such that the additive energy $E(A)$ of any subset $A \subset \{0,1,\cdots,n-1\}^d$ and any $d$ is at most $|A|^{t_n}$. Trivially we have $t_n \leq 3$ and $$ t_n \geq…

We prove a density version of the Carlson--Simpson Theorem. Specifically we show the following. For every integer $k\geq 2$ and every set $A$ of words over $k$ satisfying \[\limsup_{n\to\infty} \frac{|A\cap [k]^n|}{k^n}>0\] there exist a…

In this undergraduate thesis, we expand on the study of statistics on restricted growth functions avoiding patterns initiated by Campbell, et. al. Restricted growth functions are of interest because they are in bijection with set…

Simon's congruence, denoted \sim_n, relates words having the same subwords of length up to n. We show that, over a k-letter alphabet, the number of words modulo \sim_n is in 2^{\Theta(n^{k-1} log n)}.

We study the reconstruction problem of permutation sequences from their $k$-minors, which are subsequences of length $k$ with entries renumbered by $1,2,\ldots,k$ preserving order. We prove that the minimum number $k$ such that any…

We bound the number of permutations with a fixed number $r$ of $321 \ominus p_0$ patterns by a constant times the number of permutations which avoid $321 \ominus p_0$. We use this new upper bound to show that the ordinary generating…

A finite word $w$ is called \emph{rich} if it contains $\vert w\vert+1$ distinct palindromic factors including the empty word. Let $q\geq 2$ be the size of the alphabet. Let $R(n)$ be the number of rich words of length $n$. Let $d>1$ be a…

In this article, we reduce the unsolved problem of convergence of Collatz sequences to convergence of Collatz sequences of odd numbers that are divisible by 3. We give an elementary proof of the fact that a Collatz sequence does not…

Let $f_1,\cdots,f_r\in k[x_1,\cdots,x_n]$ be homogeneous polynomial of degree $d$. Ananyan and Hochster (2016) proved that there exists a bound $N=N(r,d)$ where if collective strength of $f_1,\cdots,f_r\geq N$, then $f_1,\cdots,f_r$ are…

Let $(W_n(\theta))_{n\in\mathbb N_0}$ be the Biggins martingale associated with a supercritical branching random walk and denote by $W_\infty(\theta)$ its limit. Assuming essentially that the martingale $(W_n(2\theta))_{n\in\mathbb N_0}$ is…

For a linearly recurrent vector sequence P[n+1] = A(n) * P[n], consider the problem of calculating either the n-th term P[n] or L<=n arbitrary terms P[n_1],...,P[n_L], both for the case of constant coefficients A(n)=A and for a matrix A(n)…

We study universal compression of sequences generated by monotonic distributions. We show that for a monotonic distribution over an alphabet of size $k$, each probability parameter costs essentially $0.5 \log (n/k^3)$ bits, where $n$ is the…

We have developed a heuristic showing that in the Dirichlet divisor problem for the almost all $n \in \mathbb{N}^{+}$: $$ R(n) \leq O(\psi(n)n^{\frac{1}{4}}) $$ where $$ R(n) = \Big\lvert \sum_{x=1}^{n}\Big\lfloor\frac{n}{x}\Big\rfloor -…

We prove that any vertex-reinforced random walk on the integer lattice with non-decreasing reinforcement sequence $w$ satisfying $w(k) = o(k^{\alpha})$ for some $\alpha < 1/2$ is recurrent. This improves on previous results of Volkov (2006)…

It is proved that any continuous function f on the unit circle such that the sequence e^{in f}, n=1,2,... has small Wiener norm \| e^{in f} \|_A = o (\frac{\log^{1/22} |n|}{(\log \log |n|)^{3/11}}), is linear. Moreover, we get lower bounds…

We prove that with high probability over the choice of a random graph $G$ from the Erd\H{o}s-R\'enyi distribution $G(n,1/2)$, a natural $n^{O(\varepsilon^2 \log n)}$-time, degree $O(\varepsilon^2 \log n)$ sum-of-squares semidefinite program…

The Collatz Conjecture can be stated as: using the reduced Collatz function $C(n) = (3n+1)/2^x$ where $2^x$ is the largest power of 2 that divides $3n+1$, any odd integer $n$ will eventually reach 1 in $j$ iterations such that $C^j(n) = 1$.…

Let the root of the word $w$ be the smallest prefix $v$ of $w$ such that $w$ is a prefix of $vvv...$. $per(w)$ is the length of the root of $w$. For any $n\ge5$, an $n$-ary threshold word is a word $w$ such that for any factor (subword) $v$…

Let $\{X, X_{n}; n \geq 1 \}$ be a sequence of i.i.d. $\mathbf{B}$-valued random variables and set $S_{n} = \sum_{i=1}^{n}X_{i},~n \geq 1$. This note is devoted to study the classical central limitr theorem for subsequences of sums of…

Let $m$ be a positive integer larger than $1$, let $w$ be a finite word over $\left\{0,1,...,m-1\right\}$ and let $a_{m;w}(n)$ be the number of occurrences of the word $w$ in the $m$-expansion of $n$ mod $p$ for any non-negative integer…