English
Related papers

Related papers: Direct and Inverse Problems for Restricted Signed …

200 papers

A subset $A$ of a given finite abelian group $G$ is called $(k,l)$-sum-free if the sum of $k$ (not necessarily distinct) elements of $A$ does not equal the sum of $l$ (not necessarily distinct) elements of $A$. We are interested in finding…

Combinatorics · Mathematics 2008-04-01 Bela Bajnok

The Subset Sum problem asks whether a given set of $n$ positive integers contains a subset of elements that sum up to a given target $t$. It is an outstanding open question whether the $O^*(2^{n/2})$-time algorithm for Subset Sum by…

Data Structures and Algorithms · Computer Science 2015-08-26 Per Austrin , Mikko Koivisto , Petteri Kaski , Jesper Nederlof

Let $\varepsilon>0$ be a fixed small constant, ${\mathbb F}_p$ be the finite field of $p$ elements for prime $p$. We consider additive and multiplicative problems in ${\mathbb F}_p$ that involve intervals and arbitrary sets. Representative…

Number Theory · Mathematics 2023-04-19 Moubariz Z. Garaev , Igor E. Shparlinski

A classical problem in real geometry concerns the representation of positive semidefinite elements of a ring $A$ as sums of squares of elements of $A$. If $A$ is an excellent ring of dimension $\geq3$, it is already known that it contains…

Algebraic Geometry · Mathematics 2024-01-24 José F. Fernando

The Subset Sum problem is a classical NP-complete problem with a long-standing $O^*(2^{n/2})$ deterministic bound due to Horowitz and Sahni. We present results at two distinct levels of generality. First (instance-sensitive bound), we…

Computational Complexity · Computer Science 2025-08-29 Jesus Salas

Let G be a finite abelian group. For g in G and i an integer we define N(i,g) to be the number of subsets of G of size i which sum up to g. We will give a short proof, using character theory, of a formula for these N(i,g) due to Li and Wan.…

Combinatorics · Mathematics 2015-09-08 Michiel Kosters

Let $v_1$, $v_2$, ..., $v_n$ be real numbers whose squares add up to 1. Consider the $2^n$ signed sums of the form $S = \sum \pm v_i$. Boppana and Holzman (2017) proved that at least 13/32 of these sums satisfy $|S| \le 1$. Here we improve…

Combinatorics · Mathematics 2021-06-07 Ravi B. Boppana , Harrie Hendriks , Martien C. A. van Zuijlen

Given positive integers $a_1,..., a_n, t$, the fixed weight subset sum problem is to find a subset of the $a_i$ that sum to $t$, where the subset has a prescribed number of elements. It is this problem that underlies the security of modern…

Combinatorics · Mathematics 2012-01-16 Andrew Shallue

The main result of this paper is the following: for all $b \in \mathbb Z$ there exists $k=k(b)$ such that \[ \max \{ |A^{(k)}|, |(A+u)^{(k)}| \} \geq |A|^b, \] for any finite $A \subset \mathbb Q$ and any non-zero $u \in \mathbb Q$. Here,…

Number Theory · Mathematics 2020-09-22 Brandon Hanson , Oliver Roche-Newton , Dmitrii Zhelezov

We investigate additive properties of sets $A,$ where $A=\{a_1,a_2,\ldots ,a_k\}$ is a monotone increasing set of real numbers, and the differences of consecutive elements are all distinct. It is known that $|A+B|\geq c|A||B|^{1/2}$ for any…

Combinatorics · Mathematics 2021-07-01 Imre Ruzsa , Jozsef Solymosi

We present an extension of the Prouhet-Tarry-Escott problem by demonstrating that signed sums of noninteger powers of consecutive integers can be made arbitrarily close to zero.

History and Overview · Mathematics 2025-03-27 David Treeby , Edward Wang

In this paper, as a main theorem, we prove that the decision version of the Frobenius problem is Sigma_2^P-complete under Karp reductions.Given a finite set A of coprime positive integers, we call the greatest integer that cannot be…

Computational Complexity · Computer Science 2016-11-16 Shunichi Matsubara

In this paper, we prove the local uniqueness of an inverse problem arising in the nonstationary flow of a nonhomogeneous incompressible asymmetric fluid in a bounded domain with smooth boundary. The direct problem is an initial-boundary…

Analysis of PDEs · Mathematics 2014-12-17 Aníbal Coronel , Marko Rojas-Medar

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

We call a subset $A$ of an abelian topological group $G$: (i) $absolutely$ $Cauchy$ $summable$ provided that for every open neighbourhood $U$ of $0$ one can find a finite set $F\subseteq A$ such that the subgroup generated by $A\setminus F$…

General Topology · Mathematics 2016-03-28 Dikran Dikranjan , Dmitri Shakhmatov , Jan Spěvák

Let $\left\{a_1, \dots, a_n\right\} \subset \mathbb{N}$ be a set of positive integers, $a_n$ denoting the largest element, so that for any two of the $2^n$ subsets the sum of all elements is distinct. Erd\H{o}s asked whether this implies…

Number Theory · Mathematics 2023-01-03 Stefan Steinerberger

In this paper we discuss inverse medium problems. We develop the direct sampling method based on probing indices using the saddle point formulation. The medium is constructed by solutions of saddle point problems. The method improves the…

Numerical Analysis · Mathematics 2024-12-31 Kazufumi Ito

Let $g$ be a Riemannian metric for $\mathbf{R}^d$ ($d\geq 3$) which differs from the Euclidean metric only in a smooth and strictly convex bounded domain $M$. The lens rigidity problem is concerned with recovering the metric $g$ inside $M$…

Differential Geometry · Mathematics 2017-02-28 Gang Bao , Hai Zhang

We are interested in an inverse medium problem with internal data. This problem is originated from multi-waves imaging. We aim in the present work to study the well-posedness of the inversion in terms of the boundary conditions. We…

Analysis of PDEs · Mathematics 2018-06-12 Mourad Choulli , Faouzi Triki

Let A,B,S be finite subsets of an abelian group G. Suppose that the restricted sumset C={a+b: a in A, b in B, and a-b not in S} is nonempty and some c in C can be written as a+b with a in A and b in B in at most m ways. We show that if G is…

Combinatorics · Mathematics 2007-05-23 Hao Pan , Zhi-Wei Sun