中文
相关论文

相关论文: On the Elementary Proof of the Inverse Erd\H{o}s-H…

200 篇论文

Additive combinatorics asks for lower bounds on sumsets and restricted sumsets over finite fields. Central examples are the Cauchy-Davenport theorem and the Erd\H{o}s-Heilbronn conjecture. In this note, we develop Das's linear algebraic…

组合数学 · 数学 2026-05-20 Guanzhong Yang

We provide a survey of results concerning both the direct and inverse problems to the Cauchy-Davenport theorem and Erdos-Heilbronn problem in Additive Combinatorics. We prove a slight extension to an inverse theorem of Dias da…

组合数学 · 数学 2013-09-27 Suren Jayasuriya , Steve Reich , Jeffrey Paul Wheeler

We prove the following variant of the Erd\H{o}s distinct subset sums problem. Given $t \ge 0$ and sufficiently large $n$, every $n$-element set $A$ whose subset sums are distinct modulo $N=2^n+t$ satisfies $$\max A \ge…

组合数学 · 数学 2023-08-08 Stijn Cambie , Jun Gao , Younjin Kim , Hong Liu

Given two subsets $A, B \subseteq \mathbb{F}_p$ and a binary relation $\mathcal{R} \subseteq A \times B$, the restricted sumset of $A, B$ with respect to $\mathcal{R}$ is defined as $A +_{\mathcal{R}} B = \{ a+b \colon (a,b) \notin…

组合数学 · 数学 2025-09-05 Minghui Ouyang

We present two short proofs giving the best known asymptotic lower bound for the maximum element in a set of $n$ positive integers with distinct subset sums.

组合数学 · 数学 2020-07-21 Quentin Dubroff , Jacob Fox , Max Wenqiang Xu

We provide a survey of results concerning both the direct and inverse problems to the Cauchy-Davenport theorem and Erdos-Heilbronn problem in Additive Combinatorics. We formulate an open conjecture concerning the inverse Erdos-Heilbronn…

组合数学 · 数学 2013-10-08 Suren M. Jayasuriya , Steven D. Reich , Jeffrey Paul Wheeler

Let $G$ be an additive abelian group. Let $A=\{a_{0}, a_{1},\ldots, a_{k-1}\}$ be a nonempty finite subset of $G$. For a positive integer $h$ satisfying $1\leq h\leq k$, we let \[h\hat{}_{\underline{+}}A:=\{\Sigma_{i=0}^{k-1}\lambda_{i}…

数论 · 数学 2019-08-02 Jagannath Bhanja , Takao Komatsu , Ram Krishna Pandey

Let $A$ be a finite set of $k$ integers. For $h \leq k$, the restricted $h$-fold sumset $h^{\wedge} A$ is the set of all sums of $h$ distinct elements of $A$. In additive combinatorics, much of the focus has traditionally been on finite…

组合数学 · 数学 2025-05-13 Debyani Manna , Mohan , Ram Krishna Pandey

This paper investigates the Erd\H{o}s distinct subset sums problem in $\mathbb{Z}^k$. Beyond the classical variance method, using alternative statistical quantities like $\mathbb{E}[\|X\|_1]$ and $\mathbb{E}[\|X\|_3^3]$ can yield better…

组合数学 · 数学 2025-10-08 Zijie Gu

This paper presents an expository reverse-mathematical analysis of two fundamental theorems in commutative algebra: Hilbert's Nullstellensatz and Basis Theorem. In addition to its profound significance in commutative algebra and algebraic…

逻辑 · 数学 2024-06-04 Dhruv Kulshreshtha

Let $G$ be an additive abelian group and $h$ be a positive integer. For a nonempty finite subset $A=\{a_0, a_1,\ldots, a_{k-1}\}$ of $G$, we let \[h_{\underline{+}}A:=\{\Sigma_{i=0}^{k-1}\lambda_{i} a_{i}: (\lambda_{0}, \ldots,…

数论 · 数学 2018-10-08 Jagannath Bhanja , Ram Krishna Pandey

An inverse boundary value problem for the Helmholtz equation in a bounded domain is considered. The problem is to extract information about an unknown obstacle embedded in the domain with unknown impedance boundary condition (the Robin…

偏微分方程分析 · 数学 2010-02-16 Masaru Ikehata

Given a set of integers W, the Partition problem determines whether W can be divided into two disjoint subsets with equal sums. We model the Partition problem as a system of polynomial equations, and then investigate the complexity of a…

代数几何 · 数学 2014-11-12 Susan Margulies , Shmuel Onn , Dmitrii Pasechnik

An elementary proof of the two-sidedness of the matrix-inverse is given using only linear independence and the reduced row-echelon form of a matrix. In addition, it is shown that a matrix is invertible if and only if it is row-equivalent to…

历史与综述 · 数学 2018-08-15 Pietro Paparella

The Erd\H{o}s discrepancy problem, now a theorem by T. Tao, asks whether every sequence with values plus or minus one has unbounded discrepancy along all homogeneous arithmetic progressions. We establish weighted variants of this problem,…

数论 · 数学 2020-07-16 Nikos Frantzikinakis

The basic theme of this paper is the fact that if $A$ is a finite set of integers, then the sum and product sets cannot both be small. A precise formulation of this fact is Conjecture 1 below due to Erd\H os-Szemer\'edi [E-S]. (see also…

组合数学 · 数学 2007-05-23 Mei-Chu Chang

We prove elementary recursive bounds in the degrees for Positivstellensatz and Hilbert 17-th problem, which is the expression of a nonnegative polynomial as a sum of squares of rational functions. We obtain a tower of five exponentials. A…

代数几何 · 数学 2017-04-12 Henri Lombardi , Daniel Perrucci , Marie-Françoise Roy

Let $\{a_1, . . . , a_n\}$ be a set of positive integers with $a_1 < \dots < a_n$ such that all $2^n$ subset sums are distinct. A famous conjecture by Erd\H{o}s states that $a_n>c\cdot 2^n$ for some constant $c$, while the best result known…

组合数学 · 数学 2022-10-31 Simone Costa , Marco Dalai , Stefano Della Fiore

A simple theorem on proportionality of indefinite real quadratic forms is proved, and is used to clarify the proof of the invariance of the interval in Special Relativity from Einstein's postulate on the universality of the speed of light;…

综合数学 · 数学 2009-08-04 John H. Elton

The paper deals with the {\it infinitesimal Hilbert 16th problem}: to find an upper estimate of the number of zeros of an Abelian integral regarded as a function of a parameter. In more details, consider a real polynomial $ H$ of degree $…

动力系统 · 数学 2007-05-23 A. A. Glutsyuk , Yu. S. Ilyashenko
‹ 上一页 1 2 3 10 下一页 ›