English
Related papers

Related papers: On Integer sequences in Product sets

200 papers

Sidon sets are those sets such that the sums of two of its elements never coincide. They go back to the 30s when Sidon asked for the maximal size of a subset of consecutive integers with that property. This question is now answered in a…

Number Theory · Mathematics 2016-11-10 Laurent Habsieger , Alain Plagne

We show that essentially the Fibonacci sequence is the unique binary recurrence which contains infinitely many three-term arithmetic progressions. A criterion for general linear recurrences having infinitely many three-term arithmetic…

Number Theory · Mathematics 2010-05-21 Akos Pinter , Volker Ziegler

We show that the product of two consecutive Fibonacci (respectively Lucas) numbers is divisible by the sum of their indices if this sum is a prime number different from 5 and in the form (4r+1)(respectively (4r+3)).

Number Theory · Mathematics 2014-07-18 Vladimir Pletser

An upper bound of composition series of groups of finite order is obtained. The bound is a nontrivial bound and so far best possible.

Group Theory · Mathematics 2022-11-08 Abhijit Bhattacharjee

For an arbitrary finite set S of natural numbers greater 1, we construct an integer-valued polynomial f, whose set of lengths in Int(Z) is S. The set of lengths of f is the set of all natural numbers n, such that f has a factorization as a…

Rings and Algebras · Mathematics 2014-09-04 Sophie Frisch

Let $\mathbb{F}_p$ be a finite field of prime order $p$ and let $A \subset \mathbb{F}_p$ be a subset. In the dense regime when $|A| \geq \alpha p$ for some $\alpha \in (0,1)$, we determine the optimal constant $f(\alpha)$ in the inequality…

Number Theory · Mathematics 2026-04-21 Xuancheng Shao

We obtain a sharp upper bound for the length of arbitrary non-associative algebra and present an example demonstrating the sharpness of our bound. To show this we introduce a new method of characteristic sequences based on linear algebra…

Combinatorics · Mathematics 2019-02-25 Alexander E. Guterman , Dmitrii K. Kudryavtsev

Let $E \subseteq \mathbb{F}_q^2$ be a set in the 2-dimensional vector space over a finite field with $q$ elements, which satisfies $|E| > q$. There exist $x,y \in E$ such that $|E \cdot (y-x)| > q/2.$ In particular, $(E+E) \cdot (E-E) =…

Combinatorics · Mathematics 2017-06-20 Giorgis Petridis

We give multiple proofs of two formulas concerning the enumeration of permutations avoiding a monotone consecutive pattern with a certain value for the inverse peak number or inverse left peak number statistic. The enumeration in both cases…

Combinatorics · Mathematics 2023-01-12 Justin M. Troyka , Yan Zhuang

We prove that certain sequences of finite continued fractions associated with a 2-periodic continued fraction with period a,b>0 are moment sequences of discrete signed measures supported in the interval [-1,1], and we give necessary and…

Classical Analysis and ODEs · Mathematics 2009-02-10 Christian Berg , Antonio J. Durán

There exists an absolute constant $C$ with the following property. Let $A \subseteq \mathbb{F}_p$ be a set in the prime order finite field with $p$ elements. Suppose that $|A| > C p^{5/8}$. The set \[ (A \pm A)(A \pm A) = \{(a_1 \pm…

Combinatorics · Mathematics 2016-02-08 Giorgis Petridis

We define a sequence of positive integers recursively, where each term is determined as follows: starting with a given positive integer, if the term is odd, the next is the sum of its positive divisors; if the term is even, the subsequent…

Number Theory · Mathematics 2025-06-04 Ritesh Dwivedi , Rohit Yadav

We analyze the periodicity of optimal long products of matrices. A set of matrices is said to have the finiteness property if the maximal rate of growth of long products of matrices taken from the set can be obtained by a periodic product.…

Dynamical Systems · Mathematics 2007-05-23 Raphael M. Jungers , Vincent D. Blondel

We investigate determining the exact bounds of the frequencies of conjunctions based on frequent sets. Our scenario is an important special case of some general probabilistic logic problems that are known to be intractable. We show that…

Computational Complexity · Computer Science 2019-02-05 Nikolaj Tatti

We prove a sharp bound for the remainder term of the number of lattice points inside a ball, when averaging over a compact set of (not necessarily unimodular) lattices, in dimensions two and three. We also prove that such a bound cannot…

Number Theory · Mathematics 2013-11-13 Samuel Holmin

Let $(\mathcal{P},\leqslant)$ be a finite poset. Define the numbers $a_1,a_2,\ldots$ (respectively, $c_1,c_2,\ldots$) so that $a_1+\ldots+a_k$ (respectively, $c_1+\ldots+c_k$) is the maximal number of elements of $\mathcal{P}$ which may be…

Combinatorics · Mathematics 2020-01-14 I. A. Bochkov , F. V. Petrov

A sequence of rational numbers as a generalization of the sequence of Bernoulli numbers is introduced. Sums of products involving the terms of this generalized sequence are then obtained using an application of the Fa\`a di Bruno's formula.…

Number Theory · Mathematics 2017-03-08 Jitender Singh

A sequence of non-negative integers is called a B_k sequence if all the sums of arbitrary k elements are different. In this paper, we will present a new upper bound for B_3 sequences.

Combinatorics · Mathematics 2011-03-29 An-Ping Li

Let A be a set of integers dense in a finite interval. We establish upper and lower bounds for the longest regularly-spaced and convex subsets of A and of A-A.

Combinatorics · Mathematics 2020-09-03 Brandon Hanson

The set $\Mfib$ of fibbinary numbers is defined via a bijection between the set $\BB{N}$ of natural numbers and $\Mfib$. Since the elements of $\Mfib$ do not exhaust $\BB{N}$, the structure of the complement $\overline{\Mfib}$ of $\Mfib$ in…

Number Theory · Mathematics 2024-06-19 A. J. Macfarlane