English
Related papers

Related papers: Sums of triples in Abelian groups

200 papers

We present a short ultrafilter proof of the existence of monochromatic exponential triples $\{a, b, b^a\}$ in any finite coloring of the natural numbers. The proof is given from scratch and uses only Ramsey's theorem, the notion of…

Combinatorics · Mathematics 2022-07-26 Mauro Di Nasso , Mariaclara Ragosta

Let $G$ be an infinite abelian group with $|2G|=|G|$. We show that if $G$ is not the direct sum of a group of exponent 3 and the group of order 2, then $G$ possesses a perfect additive basis; that is, there is a subset $S\subseteq G$ such…

Number Theory · Mathematics 2009-01-13 Sergei V. Konyagin , Vsevolod F. Lev

In an additive group (G,+), a three-dimensional corner is the four points g, g+d(1,0,0), g+d(0,1,0), g+d(0,0,1), where g is in G^3, and d is a non-zero element of G. The Ramsey number of interest is R_3(G) the maximal cardinality of a…

Number Theory · Mathematics 2008-04-21 Michael T. Lacey , William McClain

Let N be the set of non-negative integer numbers, T the circle group and c the cardinality of the continuum. Given an abelian group G of size at most 2^c and a countable family F of infinite subsets of G, we construct "Baire many"…

Group Theory · Mathematics 2011-02-28 Dikran Dikranjan , Dmitri Shakhmatov

Let $G$ be a finite abelian group of order $n$. For any subset $B$ of $G$ with $B=-B$, the Cayley graph $G_B$ is a graph on vertex set $G$ in which $ij$ is an edge if and only if $i-j\in B.$ It was shown by Ben Green that when $G$ is a…

Number Theory · Mathematics 2009-05-20 Gyan Prakash

We disprove a 2002 conjecture of Dombi from additive number theory. More precisely, we find examples of sets $A \subset \mathbb{N}$ with the property that $\mathbb{N} \setminus A$ is infinite, but the sequence $n \rightarrow |\{ (a,b,c) \,…

Number Theory · Mathematics 2023-01-02 Jason P. Bell , Jeffrey Shallit

We characterize the computational content and the proof-theoretic strength of a Ramsey-type theorem for bi-colorings of so-called {\em exactly large} sets. An {\it exactly large} set is a set $X\subset\Nat$ such that $\card(X)=\min(X)+1$.…

Logic · Mathematics 2024-01-10 Lorenzo Carlucci , Konrad Zdanowski

A system of linear equations with integer coefficients is partition regular over a subset S of the reals if, whenever S\{0} is finitely coloured, there is a solution to the system contained in one colour class. It has been known for some…

Combinatorics · Mathematics 2018-09-05 Ben Barber , Neil Hindman , Imre Leader , Dona Strauss

We extend the scope of analytic combinatorics to classes containing objects that have irrational sizes. The generating function for such a class is a power series that admits irrational exponents (which we call a Ribenboim series). A…

Combinatorics · Mathematics 2025-12-23 David Bevan , Julien Condé

Let $\Gamma$ be an Abelian group and let $G$ be a simple graph. We say that $G$ is $\Gamma$-colorable if for some fixed orientation of $G$ and every edge labeling $\ell:E(G)\rightarrow \Gamma$, there exists a vertex coloring $c$ by the…

Combinatorics · Mathematics 2023-12-05 Bartłomiej Bosek , Jarosław Grytczuk , Grzegorz Gutowski , Oriol Serra , Mariusz Zając

For a finite abelian group $G$ with subsets $A$ and $B$, the sumset $AB$ is $\{ab \mid a\in A, b \in B\}$. A fundamental problem in additive combinatorics is to find a lower bound for the cardinality of $AB$ in terms of the cardinalities of…

Combinatorics · Mathematics 2022-07-22 Sameera Vemulapalli

Let $G=A_n$, a finite alternating group. We study the commuting graph of $G$ and establish, for all possible values of $n$ barring $13, 14, 17$ and $19$, whether or not the independence number is equal to the clique-covering number.

Group Theory · Mathematics 2015-10-21 Daniel Barrantes , Nick Gill , Jeremías Ramírez

Karasev conjectured that for any set of $3k$ lines in general position in the plane, which is partitioned into $3$ color classes of equal size $k$, the set can be partitioned into $k$ colorful 3-subsets such that all the triangles formed by…

Combinatorics · Mathematics 2018-05-15 Seunghun Lee , Kangmin Yoo

Let $A, B$ be finite subsets of a torsion-free group $G$. We prove that for every positive integer $k$ there is a $c(k)$ such that if $|B|\ge c(k)$ then the inequality $|AB|\ge |A|+|B|+k$ holds unless a left translate of $A$ is contained in…

Group Theory · Mathematics 2014-02-26 Károly J. Böröczky , Péter P. Pálfy , Oriol Serra

We prove that for any positive integer c there are at least N(c), $1\leq N(c) < \phi(c)/2$ representations of c as a sum of two positive integers a, b, with no common divisor, such that the N(c) radicals R(abc) are all greater than kc,…

Number Theory · Mathematics 2007-05-23 Constantin M. Petridi

In this article, we show that for any non-isotrivial family of abelian varieties over a rational base with big monodromy, those members that have adelic Galois representation with image as large as possible form a density-$1$ subset. Our…

Number Theory · Mathematics 2022-06-15 Aaron Landesman , Ashvin Swaminathan , James Tao , Yujie Xu

The notion of acyclic matching property was provided by Losonczy and it was proved that torsion-free groups admit this property. In this paper, we introduce a duality of acyclic matching as a tool for classification of some Abelian groups,…

Combinatorics · Mathematics 2019-01-01 M. Aliabadi , H. Jolany , M. Amin Khajehnejad , M. J. Moghaddamzadeh , H. Shahmohamad

An indecomposable decomposition of a torsion-free abelian group $G$ of rank $n$ is a decomposition $G=A_1\oplus\cdots\oplus A_t$ where $A_i$ is indecomposable of rank $r_i$ so that $\sum_i r_i=n$ is a partition of $n$. The group $G$ may…

Group Theory · Mathematics 2018-02-28 Adolf Mader , Phill Schultz

Let $A$ be an abelian variety over a number field. The connected monodromy field of $A$ is the minimal field over which the images of all the $\ell$-adic torsion representations have connected Zariski closure. We show that for all even $g…

Number Theory · Mathematics 2023-08-21 Victoria Cantoral-Farfán , Davide Lombardo , John Voight

Independently posed by Behzad and Vizing, the Total Coloring Conjecture asserts that the total chromatic number of a simple connected graph $G$ is either $\Delta(G)+1$ or $\Delta(G)+2$, where $\Delta(G)$ is the largest degree of any vertex…

Combinatorics · Mathematics 2026-05-13 I. J. Dejter
‹ Prev 1 8 9 10 Next ›