English
Related papers

Related papers: Direct and Inverse Problems for Restricted Signed …

200 papers

Let $(G,+)$ be a countable abelian group such that the subgroup $\{g+g\colon g\in G\}$ has finite index and the doubling map $g\mapsto g+g$ has finite kernel. We establish lower bounds on the upper density of a set $A\subset G$ with respect…

Dynamical Systems · Mathematics 2025-04-14 Dimitrios Charamaras , Ioannis Kousek , Andreas Mountakis , Tristán Radić

For any fixed measure $H$ that maps graphs to real numbers, the MinH problem is defined as follows: given a graph $G$, an integer $k$, and a target $\tau$, is there a set $S$ of $k$ vertices that can be deleted, so that $H(G - S)$ is at…

Data Structures and Algorithms · Computer Science 2019-10-01 Serge Gaspers , Joshua Lau

Let $A$ be a finite subset of an arbitrary additive group $G$, and let $\phi(A)$ denote the cardinality of the largest subset $B$ in $A$ that is sum-avoiding in $A$ (that is to say, $b_1+b_2 \not \in A$ for all distinct $b_1,b_2 \in B$).…

Combinatorics · Mathematics 2017-01-18 Terence Tao , Van Vu

Let $A$ be an infinite set of nonnegative integers. For $h \geq 2$, let $hA$ be the set of all sums of $h$ not necessarily distinct elements of $A$. If every sufficiently large integer in the sumset $hA$ has at least two representations,…

Number Theory · Mathematics 2016-05-04 Melvyn B. Nathanson

Let $F_h(n)$ denote the minimum cardinality of an additive {\em $h$-fold basis} of $\{1,2,\cdots,n\}$: a set $S$ such that any integer in $\{1,2,\cdots, n\}$ can be written as a sum of at most $h$ elements from $S$. While the trivial bounds…

Combinatorics · Mathematics 2025-11-12 Eric James Faust , Michael Tait

We investigate how efficiently a well-studied family of domination-type problems can be solved on bounded-treewidth graphs. For sets $\sigma,\rho$ of non-negative integers, a $(\sigma,\rho)$-set of a graph $G$ is a set $S$ of vertices such…

Computational Complexity · Computer Science 2025-04-22 Jacob Focke , Dániel Marx , Fionn Mc Inerney , Daniel Neuen , Govind S. Sankar , Philipp Schepper , Philip Wellnitz

Let A be a subset of a finite abelian group G. We say that A is sum-free if there is no solution of the equation x + y = z, with x, y, z belonging to the set A. In this paper we shall characterise the largest possible sum-free subsets of G…

Number Theory · Mathematics 2007-05-23 R. Balasubramanian , Gyan Prakash

We discuss several questions concerning sum-free sets in groups, raised by Erd\H{o}s in his survey "Extremal problems in number theory" (Proceedings of the Symp. Pure Math. VIII AMS) published in 1965. Among other things, we give a…

Combinatorics · Mathematics 2016-03-17 Terence Tao , Van Vu

Let $A$ be a finite subset of $\mathbb{Z}^n$, which generates $\mathbb{Z}^n$ additively. We provide a precise description of the $N$-fold sumsets $NA$ for $N$ sufficiently large, with some explicit bounds on "sufficiently large."

Number Theory · Mathematics 2020-04-28 Andrew Granville , George Shakan

Suppose that A is a set of n real numbers, each at least 1 apart. Define the ``perturbed sum and product sets'' S and P to be the sums a + b + f(a,b) and products (a+g(a,b))(b+h(a,b)), where f, g, and h satisfy certain upper bounds in terms…

Combinatorics · Mathematics 2009-07-02 Spencer Backman , Ernie Croot , Derrick Hart , Mariah Hamel

In this paper we give a different approach to determining the cardinality of $h$-fold sumsets $hA$ when $A\subset \mathbb{Z}^d$ has $d+2$ elements. This enables us to provide more general result with a shorter and simpler proof. We also…

Number Theory · Mathematics 2022-11-10 Ilija Vrećica

A subset $S$ of the Boolean hypercube $\mathbb{F}_2^n$ is a sumset if $S = \{a + b : a, b\in A\}$ for some $A \subseteq \mathbb{F}_2^n$. Sumsets are central objects of study in additive combinatorics, featuring in several influential…

Data Structures and Algorithms · Computer Science 2024-02-06 Xi Chen , Shivam Nadimpalli , Tim Randolph , Rocco A. Servedio , Or Zamir

The derived functors $\lim^n$ of the inverse limit find many applications in algebra and topology. In particular, the vanishing of certain derived limits $\lim^n \mathbf{A}[H]$, parametrized by an abelian group $H$, has implications for…

Logic · Mathematics 2024-11-26 Matteo Casarosa , Chris Lambie-Hanson

Let $G$ be a finite abelian group, let $0 < \alpha < 1$, and let $A \subseteq G$ be a random set of size $|G|^\alpha$. We let $$ \mu(A) = \max_{B,C:|B|=|C|=|A|}|\{(a,b,c) \in A \times B \times C : a = b + c \}|. $$ The issue is to determine…

Discrete Mathematics · Computer Science 2014-01-07 John P Steinberger

In this paper, we solve the prescribed Hermitian-Yang-Mills tensor problem for Higgs bundles over compact complex manifolds. Let $ (E,\theta) $ be a Higgs bundle over a compact Hermitian manifold $(M,\omega_g) $. Suppose that there exists a…

Differential Geometry · Mathematics 2026-04-06 Jiaxuan Fan , Mingwei Wang , Xiaokui Yang , Shing-Tung Yau

We prove new results on the additive theory of reversed primes $\overleftarrow{p}$; that is, primes $p$ which are written backwards in a fixed base $b\geq 2$. In particular, we study a variant of Goldbach's conjecture, looking at…

Number Theory · Mathematics 2026-05-22 Michael Harm , Daniel R. Johnston

Using combinatorial techniques, we prove that the weighted sum of the inverse number of automorphisms of all finite abelian $p$-groups $\sum_G |G|^{-u} |\text{Aut}(G)|^{-1}$ is equal to $\prod_{j=u+1}^\infty\left(1-1/p^j\right)^{-1}$, where…

Number Theory · Mathematics 2014-07-14 Pritam Majumder

For any symmetry group $H$ and any appropriate matrix dilation we give an explicit method for the construction of $H$-symmetric refinable interpolatory refinable masks which satisfy sum rule of arbitrary order $n$. For each such mask we…

Functional Analysis · Mathematics 2014-09-02 A. V. Krivoshein

The \emph{sum-product phenomenon} predicts that a finite set $A$ in a ring $R$ should have either a large sumset $A+A$ or large product set $A \cdot A$ unless it is in some sense "close" to a finite subring of $R$. This phenomenon has been…

Combinatorics · Mathematics 2009-02-23 Terence Tao

In this paper we study constrained subspace approximation problem. Given a set of $n$ points $\{a_1,\ldots,a_n\}$ in $\mathbb{R}^d$, the goal of the {\em subspace approximation} problem is to find a $k$ dimensional subspace that best…

Data Structures and Algorithms · Computer Science 2025-04-30 Aditya Bhaskara , Sepideh Mahabadi , Madhusudhan Reddy Pittu , Ali Vakilian , David P. Woodruff