English
Related papers

Related papers: On sets with small additive doubling in product se…

200 papers

Suppose that $\widetilde{\mathbb R}$ is an o-minimal expansion of the real field in which restricted power functions are definable. We show that if $\widehat{\mathbb R}$ is both a reduct (in the sense of definability) of the expansion…

Logic · Mathematics 2020-11-23 Gareth Jones , Olivier Le Gal

In the paper we prove for every finite algebra A that either it has the polynomially generated powers (PGP) property, or it has the exponentially generated powers (EGP) property. For idempotent algebras we give a simple criteria for the…

Rings and Algebras · Mathematics 2015-04-10 Dmitriy Zhuk

The aim of this paper is to present a complete description of the structure of subsets S of an orderable group G satisfying |S^2| = 3|S|-2 and <S> is non-abelian.

Group Theory · Mathematics 2015-11-11 G. A. Freiman , M. Herzog , P. Longobardi , M. Maj , A. Plagne , D. J. S. Robinson , Y. V. Stanchescu

Inspired by a question of Kra, Moreira, Richter, and Robertson, we prove two new results about infinite polynomial configurations in large subsets of the rational numbers. First, given a finite coloring of $\mathbb{Q}$, we show that there…

Combinatorics · Mathematics 2025-07-08 Ethan Ackelsberg

Let $t\geq 1$, let $A$ and $B$ be finite, nonempty subsets of an abelian group $G$, and let $A\pp{i} B$ denote all the elements $c$ with at least $i$ representations of the form $c=a+b$, with $a\in A$ and $b\in B$. For $|A|, |B|\geq t$, we…

Number Theory · Mathematics 2008-03-19 David J. Grynkiewicz

We provide a writeup of a resolution of Erd\H{o}s Problem #728; this is the first Erd\H{o}s problem (a problem proposed by Paul Erd\H{o}s which has been collected in the Erd\H{o}s Problems website) regarded as fully resolved autonomously by…

Number Theory · Mathematics 2026-01-27 Nat Sothanaphan

In this paper we study the Product Partition Problem (PPP), i.e. we are given a set of $n$ natural numbers represented on $m$ bits each and we are asked if a subset exists such that the product of the numbers in the subset equals the…

Combinatorics · Mathematics 2024-05-22 Marius Costandin

In this paper we determine the number and typical structure of sets of integers with bounded doubling. In particular, improving recent results of Green and Morris, and of Mazur, we show that the following holds for every fixed $\lambda > 2$…

Combinatorics · Mathematics 2020-10-19 Marcelo Campos , Maurício Collares , Robert Morris , Natasha Morrison , Victor Souza

Let $G =<S>$ be a solvable permutation group of the symmetric group $S_n$ given as input by the generating set $S$. We give a deterministic polynomial-time algorithm that computes an \emph{expanding generating set} of size $\tilde{O}(n^2)$…

Computational Complexity · Computer Science 2012-01-17 V. Arvind , Partha Mukhopadhyay , Prajakta Nimbhorkar , Yadu Vasudev

Freiman's theorem asserts, roughly speaking, if that a finite set in a torsion-free abelian group has small doubling, then it can be efficiently contained in (or controlled by) a generalised arithmetic progression. This was generalised by…

Combinatorics · Mathematics 2010-02-22 Terence Tao

We give explicit formulas for the asymptotic growth rate of the number of summands in tensor powers in certain monoidal categories with finitely many indecomposable objects, and related structures.

Representation Theory · Mathematics 2023-11-10 Abel Lacabanne , Daniel Tubbenhauer , Pedro Vaz

We prove a new Elekes-Szab\'o type estimate on the size of the intersection of a Cartesian product $A\times B\times C$ with an algebraic surface $\{f=0\}$ over the reals. In particular, if $A,B,C$ are sets of $N$ real numbers and $f$ is a…

Combinatorics · Mathematics 2024-02-27 Jozsef Solymosi , Joshua Zahl

Let k be an algebraically closed field. Given an extension A : B of finite-dimensional k- algebras, we establish criteria ensuring that the representation-theoretic notion of polynomial growth is preserved under ascent and descent. These…

Representation Theory · Mathematics 2012-05-09 Rolf Farnsteiner

We give a probalistic proof of the famous Meinardus' asymptotic formula for the number of weighted partitions with weakened one of the three Meinardus' conditions, and extend the resulting version of the theorem to other two classis types…

Probability · Mathematics 2007-11-29 Boris L. Granovsky , Dudley Stark , Michael Erlihson

The number of finite additive 2-bases is known to grow exponentially. While this fact has been established by Marzuola and Miller (2010) using complex analytic techniques embedded in the study of numerical sets, we provide a direct, short…

Combinatorics · Mathematics 2026-05-22 Stefan Weltge , Konrad Zyhalko

In this paper, we define a class of additive random growth models whose growth is at least and at most linear and prove an asymptotic shape theorem for these models. This proof generalizes already known proofs for the classical contact…

Probability · Mathematics 2025-11-04 Aurelia Deshayes , Pierrick Siest

We show that any second-countable \'etale groupoid with polynomial growth is topologically amenable. If its unit space is compact and metrizable, we show that the groupoid has weak $m$-comparison. Thus if the groupoid is also ample and…

Dynamical Systems · Mathematics 2026-05-18 Are Austad , Christian Bönicke

We prove a lower estimate on the increase in entropy when two copies of a conditional random variable $X | Y$, with $X$ supported on $\mathbb{Z}_q=\{0,1,\dots,q-1\}$ for prime $q$, are summed modulo $q$. Specifically, given two i.i.d copies…

Information Theory · Computer Science 2014-11-27 Venkatesan Guruswami , Ameya Velingker

For a set $A \subset \mathbb{N}$ we characterize in terms of its density when there exists an infinite set $B \subset \mathbb{N}$ and $t \in \{0,1\}$ such that $B+B \subset A-t$, where $B+B : =\{b_1+b_2\colon b_1,b_2 \in B\}$. Specifically,…

Dynamical Systems · Mathematics 2024-04-22 Ioannis Kousek , Tristán Radić

For every positive integer N and every $\alpha\in [0,1)$, let $B(N, \alpha)$ denote the probabilistic model in which a random set $A\subset \{1,\dots,N\}$ is constructed by choosing independently every element of $\{1,\dots,N\}$ with…

Number Theory · Mathematics 2020-05-15 Daniele Mastrostefano
‹ Prev 1 8 9 10 Next ›