Related papers: The least common multiple of consecutive arithmeti…

For relatively prime positive integers $u_0$ and $r$ and for $0\le k\le n$, define $u_k:=u_0+kr$. Let $L_n:={\rm lcm}(u_0, u_1, ..., u_n)$ and let $a, l\ge 2$ be any integers. In this paper, we show that, for integers $\alpha \geq a$ and…

Kosaraju in ``Computation of squares in a string'' briefly described a linear-time algorithm for computing the minimal squares starting at each position in a word. Using the same construction of suffix trees, we generalize his result and…

Let $\psi_1,...,\psi_k$ be maps from Z to an additive abelian group with positive periods $n_1,...,n_k$ respectively. We show that the function $\psi=\psi_1+...+\psi_k$ is constant if $\psi(x)$ equals a constant for |S| consecutive integers…

Fix $k$ a positive integer, and let $\ell$ be coprime to $k$. Let $p(k,\ell)$ denote the smallest prime equivalent to $\ell \pmod{k}$, and set $P(k)$ to be the maximum of all the $p(k,\ell)$. We seek lower bounds for $P(k)$. In particular,…

For relatively prime positive integers $u_0$ and $r$, we consider the least common multiple $L_n:=\mathrm{lcm}(u_0,u_1,\ldots, u_n)$ of the finite arithmetic progression $\{u_k:=u_0+kr\}_{k=0}^n$. We derive new lower bounds on $L_n$ which…

Let $I\subseteq{\mathbb{R_+}}$ be a non empty and non singleton interval where ${\mathbb{R_+}}$ denotes the set of all non negative numbers. A function $\Phi: I\to {\mathbb{R_+}}$ is said to be subadditive if for any $x,y$ and $x+y\in I$,…

Let $N(n,r,k)$ denote the number of binary words of length $n$ that begin with $0$ and contain exactly $k$ runs (i.e., maximal subwords of identical consecutive symbols) of length $r$. We show that the generating function for the sequence…

The aim of this paper is to study distributional properties of integers without large or small prime factors. Define an integer to be $[y',y]$-smooth if all of its prime factors belong to the interval $[y',y]$. We identify suitable weights…

Let $K$ be an arbitrary field. Let $\a = (a_1< ... <a_n)$ be a sequence of positive integers. Let $C(\a)$ be the affine monomial curve in ${\mathbb A}^n$ parametrized by $t\to (t^{a_1}, ..., t^{a_n})$. Let $I(\a)$ be the defining ideal of…

Let $A, B\subseteq \mathbb{Z}$ be finite, nonempty subsets with $\min A=\min B=0$, and let $$\delta(A,B)={\begin{array}{ll} 1 & \hbox{if} A\subseteq B, 0 & \hbox{otherwise.} If $\max B\leq \max A\leq |A|+|B|-3$ and \label{one}|A+B|\leq…

We prove the following: there is a primitive recursive function f_-^*(-,-), in the three variables, such that: for every natural numbers t,n>0, and c, for any natural number k>=f^*_t(n,c) the following holds. Assume L is an alphabet with…

Roughly ten years ago, the following "Gorenstein Interval Conjecture" (GIC) was proposed: Whenever $(1,h_1,\dots,h_i,\dots,h_{e-i},\dots,h_{e-1},1)$ and $(1,h_1,\dots,h_i+\alpha,\dots,h_{e-i}+\alpha,\dots,h_{e-1},1)$ are both Gorenstein…

The main objective of this study is fractionally integrated fractional Brownian noise, I(t/a,H) where a>0 is the 'multiplicity' of integration, and H is the Hurst parameter . The subject of the analysis is the persistence exponent e(a,H)…

In 1962, R. C. Lyndon and M. P. Shutzenberger established that for any positive integers r and s, any sequence of length at least r+s that is both r-periodic and s-periodic is then (r,s)-periodic. Shortly thereafter (1965), N. J. Fine and…

By a classical result of Gauss and Kuzmin, the frequency with which a string $\mathbf{a}=(a_1,\dots,a_n)$ of positive integers appears in the continued fraction expansion of a random real number is given by $\mu_{GK}({I(\mathbf{a})})$,…

For $d \ge 1$, $s \ge 0$ a $(d, d+s)$-{\em graph} is a graph whose degrees all lie in the interval $\{d, d+1, \ldots, d + s\}$. For $r \ge 1$, $a \ge 0$, an $(r, r+a)$-{\em factor} of a graph $G$ is a spanning $(r, r+a)$-subgraph of $G$. An…

In 1851 Prouhet showed that when $N=j^{k+1}$ where $j$ and $k$ are positive integers, $j \geq 2$, the first $N$ consecutive positive integers can be separated into $j$ sets, each set containing $j^k$ integers, such that the sum of the…

A new generalisation of Goldbach's conjecture (GGC) - also generalising that of Lemoine - is tested, introduced by the first author. It states that for every pair of positive integers $m_1, m_2$, every sufficiently large integer $n$…

The usual division algorithms on $\mathbb{Z}$ and $\mathbb{Z}[i]$ measure the size of remainders using the norm function. These rings are Euclidean with respect to several functions. The pointwise minimum of all Euclidean functions $f: R…

Let $G$ be an additive finite abelian group and let $k\in [\exp(G),\mathsf{D}(G)-1]$ be a positive integer. Denote by $\mathsf{s}_{\leq k}(G)$ the smallest positive integer $l\in \mathbb{N}\cup \{+\infty\}$ such that each sequence of length…