English
Related papers

Related papers: Arithmetical structure of sumset intersections

200 papers

We present an elementary proof that if $A$ is a finite set of numbers, and the sumset $A+_GA$ is small, $|A+_GA|\leq c|A|$, along a dense graph $G$, then $A$ contains $k$-term arithmetic progressions.

Number Theory · Mathematics 2007-05-23 Jozsef Solymosi

A given subset $A$ of natural numbers is said to be complete if every element of $\N$ is the sum of distinct terms taken from $A$. This topic is strongly connected to the knapsack problem which is known to be NP complete. The main goal of…

Combinatorics · Mathematics 2024-06-07 Norbert Hegyvári , Máté Pálfy , Erfei Yue

Let $K$ be a number field, $k\geq 2$ an integer, $(K^*)^k$ the $k$-fold direct product of $K^*$ with coordinatewise multiplication, and $\Gamma$ a finitely generated subgroup of rank $r$ of $(K^*)^k$. Further, let $H(\alpha )$ denote the…

Number Theory · Mathematics 2026-05-29 Jan-Hendrik Evertse , Kálmán Győry , Lajos Hajdu , Florian Luca , László Remete

Let $A$ be a set of natural numbers. A set $B$, a set of natural numbers, is said to be an additive complement of the set $A$ if all sufficiently large natural numbers can be represented in the form $x+y$, where $x\in A$ and $y\in B$. This…

Number Theory · Mathematics 2024-02-06 Mohan , Bhuwanesh Rao Patil , Ram Krishna Pandey

A covering system of the integers is a finite collection of modular residue classes $\{a_m \bmod{m}\}_{m \in S}$ whose union is all integers. Given a finite set $S$ of moduli, it is often difficult to tell whether there is a choice of…

Number Theory · Mathematics 2017-05-15 Jackson Hopper

This paper is concerned with finite sequences of integers that may be written as sums of squares of two nonzero integers. We first find infinitely many integers $n$ such that $n, n+h$ and $n+k$ are all sums of two squares where $h$ and $k$…

Number Theory · Mathematics 2024-04-10 Ajai Choudhry , Bibekananda Maji

Let $M$ be a compact hyperkaehler manifold. The hyperkaehler structure equips $M$ with a set $R$ of complex structures parametrized by $CP^1$, called "the set of induced complex structures". It was known previously that induced complex…

alg-geom · Mathematics 2008-02-03 Misha Verbitsky

In the several contexts such as combinatorial number theory, families of sets of positive integers closed under taking subsets have been investigated. Then it is sometimes useful to give bijections between the set of the one-sided infinite…

Combinatorics · Mathematics 2024-12-31 Shoichi Kamada

In this paper we introduce a technique to determine the sumset $A+A$, where $A$ is the indicator function of the 0's occurring in a fixed point $x$ of a substitution on the alphabet $\{0,1\}$.

Combinatorics · Mathematics 2021-05-12 F. Michel Dekking

This paper presents results on structures in P based on tools developed from subjects of elementary number theory. Key findings are: The arithmetical sequence H = (+-3*2; 1) is in Z the smallest superset of P \ {3, 2}. H is a semigroup. A…

General Mathematics · Mathematics 2018-12-27 Michael H. Hebert

The aim of this paper is to study the structures of split regular Hom-Lie Rinehart algebras. Let $(L,A)$ be a split regular Hom-Lie Rinehart algebra. We first show that $L$ is of the form $L=U+\sum_{[\gamma]\in\Gamma/\thicksim}I_{[\gamma]}$…

Rings and Algebras · Mathematics 2019-04-29 Shengxiang Wang , Xiaohui Zhang , Shuangjian Guo

We study the length of the gaps between consecutive members in the sumset sA when A is a pseudo s-th power sequence, with s>1. We show that, almost surely, limsup (b_{n+1}-b_{n})/log (b_n) = s^s s!/\Gamma^s(1/s), where b_n are the elements…

Number Theory · Mathematics 2014-05-07 Javier Cilleruelo , Jean-Marc Deshouillers

A construction sequence for a graph is a listing of the elements of the graph (the set of vertices and edges) such that each edge follows both its endpoints. The construction number of the graph is the number of such sequences. We determine…

Combinatorics · Mathematics 2024-12-03 Paul C. Kainen

For finite sets of integers $A_1, A_2 ... A_n$ we study the cardinality of the $n$-fold sumset $A_1+... +A_n$ compared to those of $n-1$-fold sumsets $A_1+... +A_{i-1}+A_{i+1}+... A_n$. We prove a superadditivity and a submultiplicativity…

Combinatorics · Mathematics 2007-07-19 Katalin Gyarmati , Imre Z. Ruzsa , Mate Matolcsi

Given a finite abelian group $G$, consider the complete graph on the set of all elements of $G$. Find a Hamiltonian cycle in this graph and for each pair of consecutive vertices along the cycle compute their sum. What are the smallest and…

Combinatorics · Mathematics 2007-05-23 Vsevolod F. Lev

A topological group $X$ is called connected if the only subsets which are both open and closed are the whole space $X$ and the null set $\emptyset$. A subset of a topological group is connected if the subspace is connected. We say that a…

General Topology · Mathematics 2012-01-24 Huseyin Cakalli

Let $H$ be a finite abelian (commutative) group of order $n \geq 2$, and $m >1$ be an integer. We define the $m$-graph of $H$, denoted by $m-G(H)$, as a simple undirected graph with vertex set $H$, and two distinct vertices, $a, b \in H$,…

Combinatorics · Mathematics 2026-01-19 Ayman Badawi

Let $G$ be a finite abelian group, written additively, and $H$ a subgroup of~$G$. The \emph{subgroup sum graph} $\Gamma_{G,H}$ is the graph with vertex set $G$, in which two distinct vertices $x$ and $y$ are joined if $x+y\in…

Combinatorics · Mathematics 2021-11-11 Peter J. Cameron , R. Raveendra Prathap , T. Tamizh Chelvam

An algebraic structure underlying the quantity calculus is proposed consisting in an algebraic fiber bundle, that is, a base structure which is a free Abelian group together with fibers which are one dimensional vector spaces, all of them…

General Mathematics · Mathematics 2016-11-07 Alvaro P. Raposo

Applying the enumeration of sparse set partitions, we show that the number of set systems H such that the emptyset is not in H, the total cardinality of edges in H is n, and the vertex set of H is {1, 2, ..., m}, equals (1/log(2)+o(1))^nb_n…

Combinatorics · Mathematics 2007-05-23 Martin Klazar
‹ Prev 1 4 5 6 7 8 10 Next ›