English
Related papers

Related papers: A characterization of B\"uchi's integer sequences …

200 papers

The method of brackets is an efficient method for the evaluation of a large class of definite integrals on the half-line. It is based on a small collection of rules, some of which are heuristic. The extension discussed here is based on the…

Classical Analysis and ODEs · Mathematics 2017-07-28 Ivan Gonzalez , Karen Kohl , Lin Jiu , Victor H. Moll

Cyclic codes are an interesting class of linear codes due to their efficient encoding and decoding algorithms as well as their theoretical importance. BCH codes form a subclass of cyclic codes and are very important in both theory and…

Information Theory · Computer Science 2016-08-09 Shuxing Li , Cunsheng Ding , Hao Liu

It is known that the set of all nonnegative integers may be equipped with a total order that is chaotic in the sense that there is no monotone three-term arithmetic progressions. Such chaotic order must be so complicated that the resulting…

Combinatorics · Mathematics 2024-04-23 Minoru Hirose , Shingo Saito

The following article summarizes research where theorems and their respective demonstrations are postulated based on quadratic equations with special properties given by the Pythagorean triplets and the Fibonacci sequence given the second…

General Mathematics · Mathematics 2024-06-03 Pablo José Vega Esparza

An occurrence of a classical pattern p in a permutation \pi is a subsequence of \pi whose letters are in the same relative order (of size) as those in p. In an occurrence of a generalized pattern, some letters of that subsequence may be…

Combinatorics · Mathematics 2008-05-31 Einar Steingrimsson

We enumerate total cyclic orders on $\left\{1,\ldots,n\right\}$ where we prescribe the relative cyclic order of consecutive triples $(i,{i+1},{i+2})$, these integers being taken modulo $n$. In some cases, the problem reduces to the…

Combinatorics · Mathematics 2020-07-10 Sanjay Ramassamy

We classify all linear division sequences in the integers, a problem going back to at least the 1930s. As a corollary we also classify those linear recurrence sequences in the integers for which $(x_m,x_n)=\pm x_{(m,n)}$. We also show that…

Number Theory · Mathematics 2022-06-24 Andrew Granville

Given a sequence A=(a1,...,an) of real numbers, a block B of the A is either a set B={ai,...,aj} where i<=j or the empty set. The size b of a block B is the sum of its elements. We show that when 0<=ai<=1 and k is a positive integer, there…

Combinatorics · Mathematics 2014-06-24 Imre Bárány , Victor S. Grinberg

We define a so-called square $k$-zig-zag shape as a part of the regular square grid. Considering the shape as a $k$-zig-zag digraph, we give values of its vertices according to the number of the shortest paths from a base vertex. It…

Combinatorics · Mathematics 2021-05-14 László Németh , László Szalay

We prove a number of results related to a problem of Po-Shen Loh, which is equivalent to a problem in Ramsey theory. Let $a=(a_1,a_2,a_3)$ and $b=(b_1,b_2,b_3)$ be two triples of integers. Define $a$ to be 2-less than $b$ if $a_i<b_i$ for…

Combinatorics · Mathematics 2023-06-22 W. T. Gowers , J. Long

For a linear difference equation with the coefficients being computable sequences, we establish algorithmic undecidability of the problem of determining the dimension of the solution space including the case when some additional prior…

Symbolic Computation · Computer Science 2024-10-08 Sergei Abramov , Gleb Pogudin

An $(a,b)$-difference necklace of length $n$ is a circular arrangement of the integers $0, 1, 2, \ldots , n-1$ such that any two neighbours have absolute difference $a$ or $b$. We prove that, subject to certain conditions on $a$ and $b$,…

Combinatorics · Mathematics 2020-06-30 Ethan P. White , Richard K. Guy , Renate Scheidler

Counting integral binary quadratic forms with certain restrictions is a classical problem. In this paper, we count binary quadratic forms of fixed discriminant given restrictions on the size of their coefficients. We accomplish this by…

Number Theory · Mathematics 2015-08-10 Thomas A. Hulse , E. Mehmet Kıral , Chan Ieong Kuan , Li-Mei Lim

We present a first-order theory of sequences with integer elements, Presburger arithmetic, and regular constraints, which can model significant properties of data structures such as arrays and lists. We give a decision procedure for the…

Logic in Computer Science · Computer Science 2013-08-14 Carlo A. Furia

In recent work, M. Schneider and the first author studied a curious class of integer partitions called "sequentially congruent" partitions: the $m$th part is congruent to the $(m+1)$th part modulo $m$, with the smallest part congruent to…

Number Theory · Mathematics 2024-05-31 Robert Schneider , James A. Sellers , Ian Wagner

Based on Euclid's algorithm, we find a kind of special sequences which play an interesting role in the study of primes. We call them W Sequences. They not only ties up the distribution of primes in short interval but also enables us to give…

General Mathematics · Mathematics 2009-09-15 Shaohua Zhang

The present work deals with the characterization of parity vectors of Collatz sequences (of finite and infinite length). Such a characterization leads to the determination of several numbers (integers or non-integers) that we call the…

General Mathematics · Mathematics 2022-09-09 Raouf Rajab

The problem we are dealing with is the following: find two sequences $a_n$ and $b_n$ such that the average of the first $b_n$ triangular numbers (starting with the triangular number 1) is still a triangular number, precisely the $a_n$-th…

Number Theory · Mathematics 2007-05-23 Mario Catalani

We introduce the abstract notion of a chain, which is a sequence of $n$ points in the plane, ordered by $x$-coordinates, so that the edge between any two consecutive points is unavoidable as far as triangulations are concerned. A general…

Computational Geometry · Computer Science 2023-03-22 Daniel Rutschmann , Manuel Wettstein

In this note, we investigate some properties of the integer sequence of general term $a_n := \sum_{k = 0}^{n - 1} k! (n - k - 1)!$ ($\forall n \geq 1$) to derive a new identity of the Genocchi numbers $G_n$ ($n \in \mathbb{N}$), which…

Number Theory · Mathematics 2022-04-28 Bakir Farhi