English
Related papers

Related papers: Maximizing the number of rational-value sums or ze…

200 papers

If $R$ is a valuation domain of maximal ideal $P$ with a maximal immediate extension of finite rank it is proven that there exists a finite sequence of prime ideals $P=L_0\supset L_1\supset...\supset L_m\supseteq 0$ such that…

Rings and Algebras · Mathematics 2010-01-12 Francois Couchot

A Direct Sum Theorem holds in a model of computation, when solving some k input instances together is k times as expensive as solving one. We show that Direct Sum Theorems hold in the models of deterministic and randomized decision trees…

Computational Complexity · Computer Science 2010-04-02 Rahul Jain , Hartmut Klauck , Miklos Santha

We show that a finite zero-sum-free sequence $\alpha$ over an abelian group has at least $c|\alpha|^{4/3}$ distinct subsequence sums, unless $\alpha$ is "controlled" by a small number of its terms; here $|\alpha|$ denotes the number of…

Number Theory · Mathematics 2022-12-21 Vsevolod F. Lev

For $n,\,d\ge1$ let $p(n,2d)$ denote the smallest number $p$ such that every sum of squares of forms of degree $d$ in $\mathbb{R}[x_1,\dots,x_n]$ is a sum of $p$ squares. We establish lower bounds for these numbers that are considerably…

Algebraic Geometry · Mathematics 2016-03-18 Claus Scheiderer

Let n be a positive integer, and let R be a finitely presented (but not necessarily finite dimensional) associative algebra over a computable field. We examine algorithmic tests for deciding (1) if every n-dimensional representation of R is…

Rings and Algebras · Mathematics 2007-05-23 Edward S. Letzter

A set A of integers is said to be sum-free if there are no solutions to the equation x + y = z with x,y and z all in A. Answering a question of Cameron and Erdos, we show that the number of sum-free subsets of {1,...,N} is O(2^(N/2)).

Number Theory · Mathematics 2007-05-23 Ben Green

A set of integers is sum-free if it contains no solution to the equation $x+y=z$. We study sum-free subsets of the set of integers $[n]=\{1,\ldots,n\}$ for which the integer $2n+1$ cannot be represented as a sum of their elements. We prove…

Combinatorics · Mathematics 2018-12-27 Ishay Haviv

The goal of this article is to give a positive answer to Rockafellar's maximality of the sum conjecture in the linear multi-valued operator case.

Functional Analysis · Mathematics 2007-05-23 M. D. Voisei

We improve a previous sum--products estimates in R, namely, we obtain that max{|A+A|,|AA|} \gg |A|^{4/3+c}, where c any number less than 5/9813. New lower bounds for sums of sets with small the product set are found. Also we prove some pure…

Combinatorics · Mathematics 2016-02-11 Sergei Konyagin , Ilya D. Shkredov

In this paper, we consider certain finite sums related to the "largest odd divisor", and we obtain, using simple ideas and recurrence relations, sharp upper and lower bounds for these sums.

Number Theory · Mathematics 2011-03-14 Omran Kouba

Let \sigma(n) be the sum of divisors of a positive integer n. Robin's theorem states that the Riemann hypothesis is equivalent to the inequality \sigma(n)<e^\gamma n\log\log n for all n>5040 (\gamma is Euler's constant). It is a natural…

Number Theory · Mathematics 2013-02-27 Sadegh Nazardonyavi , Semyon Yakubovich

A famous conjecture of Erd\H os and Straus is that for every integer $n\ge2$, $4/n$ can be represented as $1/x+1/y+1/z$, where $x,y,z$ are positive integers. This conjecture was generalized to $5/n$ by Sierpi\'nski, and then Schinzel…

Number Theory · Mathematics 2026-01-16 Carl Pomerance , Andreas Weingartner

Let $b \geq 2$ be an integer and $S$ be a finite non-empty set of primes not containing divisors of $b$. For any non-dense set $A \subset [0,1)$ such that $A \cap \mathbb{Q}$ is invariant under $\times b$ operation, we prove the finiteness…

Number Theory · Mathematics 2022-04-18 Bing Li , Ruofan Li , Yufeng Wu

We generalize the notion of Erd\H{o}s-Ginzburg-Ziv constants -- along the same lines we generalized in earlier work the notion of Davenport constants -- to a ``higher degree" and obtain various lower and upper bounds. These bounds are…

Combinatorics · Mathematics 2022-07-25 Yair Caro , John R. Schmitt

In this paper, we study the problem of splitting fairly bundles of items. We show that given $n$ bundles with $m$ kinds of items in them, it is possible to distribute the value of each kind of item fairly among $r$ persons by breaking apart…

Combinatorics · Mathematics 2025-07-21 Pablo Soberón

We show that each rational number $r$, $0\le r<1$, occurs as the fractional part of a Dedekind sum $S(m,n)$.

Number Theory · Mathematics 2013-10-15 Kurt Girstmair

Generalizing the classical result of Bohr, we show that if an n-variable power series converges in an n-circular bounded complete domain D and its sum has modulus less than 1, then the sum of the maximum of the moduli of the terms is less…

Complex Variables · Mathematics 2007-05-23 Lev Aizenberg

We convert, within polynomial-time and sequential processing, NP-Complete Problems into a problem of deciding feasibility of a given system S of linear equations with constants and coefficients of binary-variables that are 0, 1, or -1. S is…

Computational Complexity · Computer Science 2012-10-23 Deepak Ponvel Chermakani

Lagrange's Four Squares Theorem states that any positive integer can be expressed as the sum of four integer squares. We investigate the analogous question over Quaternion rings, focusing on squares of elements of Quaternion rings with…

Number Theory · Mathematics 2017-04-10 Anna Cooke , Spencer Hamblen , Sam Whitfield

Let $\gamma$ denote imaginary parts of complex zeros of the Riemann zeta-function $\zeta(s)$. Certain sums over the $\gamma$'s are evaluated, by using the function $G(s) = \sum_{\gamma>0}\gamma^{-s}$ and other techniques. Some integrals…

Number Theory · Mathematics 2007-05-23 Aleksandar Ivić