Related papers: Notes and Note-Pairs in Noergaard's Infinity Serie…

In this paper, the construction of finite-length binary sequences whose nonlinear complexity is not less than half of the length is investigated. By characterizing the structure of the sequences, an algorithm is proposed to generate all…

Let $A_{s,k}(m)$ be the maximum number of distinct letters in any sequence which can be partitioned into $m$ contiguous blocks of pairwise distinct letters, has at least $k$ occurrences of every letter, and has no subsequence forming an…

The following special case of a conjecture by Loehr and Warrington was proved recently by Ekhad, Vatter, and Zeilberger: There are 10^n zero-sum words of length 5n in the alphabet {+3,-2} such that no zero-sum consecutive subword that…

In this note we study the convergence of recursively defined infinite series. We explore the role of the derivative of the defining function at the origin (if it exists), and develop a comparison test for such series which can be used even…

This is the third part of a cycle of papers devoted to the construction of a finitely presented infinite nil-semigroup satisfying the identity $x^9 = 0$. This construction answers the problem of L. N. Shevrin and M. V. Sapir, posed, for…

In this paper the notion of an EPR state for the composite S of two quantum systems S1, S2, relative to S2 and a set O of bounded observables of S2, is introduced in the spirit of classical examples of Einstein-Podolsky-Rosen and Bohm. We…

A notion of arithmetic similarity between number fields is defined by requiring equality of some arithmetic statistics over all but finitely many rational primes. The exceptional set is empty in all previously studied cases, but existing…

In 1971 Cusick proved that every real number $x\in[0,1]$ can be expressed as a sum of two continued fractions with no partial quotients equal to $1$. In other words, if we define a set $$ S(k):= \{ x\in[0,1] : a_n(x) \geq k \text{ for all }…

Let $R$ be a commutative ring with identity and $S$ a multiplicative subset of $R$. In this paper, we first introduce and study the notions of $s$-pure exact sequences and $s$-absolutely pure modules which extend the classical notions of…

We give a new characterization of biinfinite Sturmian sequences in terms of indistinguishable asymptotic pairs. Two asymptotic sequences on a full $\mathbb{Z}$-shift are indistinguishable if the sets of occurrences of every pattern in each…

The basic one in this work is the axiomatic set theory $NBG$ (von Neumann-Bernays-G{\"o}del), which is a first-order theory with its own axioms, including in particular the axiom of choice ${\bf AC}$ and the axiom of regularity ${\bf RA}$.…

Let, for r>=2, (m_r(n)),n>=0, be Moser sequence such that every nonnegative integer is the unique sum of the form s_k+rs_l. In this article we give an explicit decomposition formulas of such form and an unexpectedly simple recursion…

In this paper we study a family of polynomials $$S_n^{(m)}(x):=\sum_{i,j=0}^n\binom ni^m\binom nj^m\binom{i+j}ix^{i+j}\ \ (m,n=0,1,2,\ldots).$$ For example, we show that $$\sum_{k=0}^{p-1}S_k^{(0)}(x)\equiv\frac…

Let $S_n$ be the symmetric group of $n$ letters; Landau considered the function $g(n)$ defined as the maximal order of an element of $S_n$. This function is non-decreasing. Let us define the sequence $n_1=1, n_2=2, n_3=3, n_4=4,n_5=5,n_6=7,…

In this paper we introduce the concept of purely infinite rings, which in the simple case agrees with the already existing notion of pure infiniteness. We establish various permanence properties of this notion, with respect to passage to…

The discriminator of an integer sequence s = (s(i))_{i >=0}, introduced by Arnold, Benkoski, and McCabe in 1985, is the map D_s(n) that sends n >= 1 to the least positive integer m such that the n numbers s(0), s(1), ..., s(n-1) are…

Euler showed that the number of partitions of $n$ into distinct parts equals the number of partitions of $n$ into odd parts. This theorem was generalized by Glaisher and further by Franklin. Recently, Beck made three conjectures on…

We define a suffixient set for a text $T [1..n]$ to be a set $S$ of positions between 1 and $n$ such that, for any edge descending from a node $u$ to a node $v$ in the suffix tree of $T$, there is an element $s \in S$ such that $u$'s path…

Given a sequence of real numbers $\{\psi(n)\}_{n\in\mathbb{N}}$ with $0\leq \psi(n)<1$, let $W(\psi)$ denote the set of $x\in[0,1]$ for which $|xn-m|<\psi(n)$ for infinitely many coprime pairs $(n,m)\in\mathbb{N}\times\mathbb{Z}$. The…

For any irrational $\alpha > 0$ and any initial value $z_{-1} \in \mathbb{C}$, we define a sequence of complex numbers $(z_n)_{n=0}^{\infty}$ as follows: $z_n$ is $z_{n-1} + e^{2 \pi i \alpha n}$ or $z_{n-1} - e^{2 \pi i \alpha n}$,…