相关论文: Some special property of Farey sequence

We consider sums of the form \[\sum_{j=0}^{n-1}F_1(a_1n+b_1j+c_1)F_2(a_2n+b_2j+c_2)... F_k(a_kn+b_kj+c_k),\] in which each $\{F_i(n)\}$ is a sequence that satisfies a linear recurrence of degree $D(i)<\infty$, with constant coefficients. We…

Let ${F}_{n}$ be the Farey sequence of order $n$. For $S \subseteq {F}_n$ we let $\mathcal{Q}(S) = \left\{x/y:x,y\in S, x\le y \, \, \textrm{and} \, \, y\neq 0\right\}$. We show that if $\mathcal{Q}(S)\subseteq F_n$, then $|S|\leq n+1$.…

Natural numbers satisfying an unusual property are mentioned by the author in [5], in which their infinitude is also proved. In this paper, we start with an arbitrary natural number which is not a multiple of 10 and non-palindromic, form…

We establish monotone bijections between subsequences of the Farey sequences and the halfsequences of Farey subsequences associated with elements of the Boolean lattices.

We show that, up to minor-equivalence, the Farey graph is the unique minor-minimal graph that is infinitely edge-connected but such that every two vertices can be finitely separated.

The Paley graph is a well-known self-complementary pseudo-random graph, defined over a finite field of odd order. We describe an attempt at an analogous construction using fields of even order. Some properties of the graph are noted, such…

We describe the (P)SL(2,C) character varieties of all 2-bridge knots and the diagonal character varieties for all 2-bridge links in terms of a set of polynomials defined using Farey recursion.

For a fixed positive integer d, we show the existence of the limiting gap distribution measure for the sets of Farey fractions a/q of order Q with a not divisible by d, and respectively with q relatively prime with d, as Q tends to…

Farey sequences, Stern-Brocot sequences, the Calkin-Wilf sequences are shown to be generated via almost identical second order recurrence relations. These sequences have combinatorial, computational, and geometric applications, and are…

We discuss an unusual phenomenon in (integral) positive ternary quadratic forms. We also describe an interesting pairing of genera of ternary forms.

We prove that the Fibonacci word $f$ satisfies among all characteristic Sturmian words, three interesting extremal properties. The first concerns the length and the second the minimal period of its palindromic prefixes. Each of these two…

In the present work, we investigate real numbers whose sequence of partial quotients enjoys some combinatorial properties involving the notion of palindrome. We provide three new transendence criteria, that apply to a broad class of…

In this paper, we study some properties of Sheffer sequences for the powers of Sheffer pairs under umbral composition. From our properties we derive new and interesting identities of Sheffer sequences of special polynomials for the powers…

We study the properties of the sequence of words $(B_i)$, where $B_1 = 101$ and $B_{i+1} = B_i C_i$ for $i \geq 1$, where $C_i$ is $B_i$ with the first $i$ symbols removed, and the infinite binary sequence ${\bf b} = 10101101011011101…

A survey of recent results in elementary number theory is presented in this paper. Special attention is given to structure and asymptotic properties of certain families of positive integers.

We study the set $\mathcal{L}_{F}$ of all $F$-vector spaces $L(P)$ where $P$ is monic and splits over $F$ and $L(Q)$ denotes the set of linear recurrence sequences over $F$ with characteristic polynomial $Q$. We show that $\mathcal{L}_{F}$…

This work represents an in-depth study of the structural behavior of the Collatz sequences. We consider a finite arithmetic progression with a common difference is 2 and the number of terms in the sequence is equal to 2^n . After, we…

In this article, we study the palindromic length sequences of the ruler sequence and of the period-doubling sequence. We give a precise formula of the palindromic length sequence of the first one and find a lower bound of the limit superior…

In this note, we study a family of subgraphs of the Farey graph, denoted as $\mathcal{F}_N$ for every $N\in\mathbb{N}.$ We show that $\mathcal{F}_N$ is connected if and only if $N$ is either equal to one or a prime power. We introduce a…

Let $F_Q$ be the set of Farey fractions of order $Q$. Given the integers $\d\ge 2$ and $0\le \c \le \d-1$, let $F_Q(c,d)$ be the subset of $F_Q$ of those fractions whose denominators are $\equiv c \pmod d$, arranged in ascending order. The…