中文
相关论文

相关论文: Limit points of Nathanson's Lambda sequences

200 篇论文

This short note answers a question raised by Nathanson \cite{Nath25} about "races" between iterated sumsets. We prove that for any integer $n$, there are finite sets of integers $A$ and $B$ with same diameter such that the signs of the…

数论 · 数学 2025-05-19 Paul Péringuey , Anne de Roton

For a set of positive integers $A$, let $p_A(n)$ denote the number of ways to write $n$ as a sum of integers from $A$, and let $p(n)$ denote the usual partition function. In the early 40s, Erd\H{o}s extended the classical Hardy--Ramanujan…

数论 · 数学 2021-04-07 Asaf Cohen Antonir , Asaf Shapira

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,…

数论 · 数学 2016-05-04 Melvyn B. Nathanson

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

In additive number theory, a finite set $A$ of integers is an $h$-basis for $n$ if every integer in $\{0,1,2,\ldots, n\}$ can be represented as the sum of exactly $h$ not necessarily distinct elements of $A$. This paper introduces a new…

数论 · 数学 2026-05-28 Melvyn B. Nathanson

In this paper, we improve the results in the author's previous paper \cite{Usu22}, which deals with the quantitative problem on Littlewood's conjecture. We show that, for any $0<\gamma<1$, any $(\alpha,\beta)\in\mathbb{R}^2$ except on a set…

数论 · 数学 2024-04-23 Shunsuke Usuki

In 1972, A. J. Hoffman proved his celebrated theorem concerning the limit points of spectral radii of non-negative symmetric integral matrices less than $\sqrt{2+\sqrt{5}}$. In this paper, after giving a new version of Hoffman's theorem, we…

组合数学 · 数学 2020-12-29 Jianfeng Wang , Jing Wang , Maurizio Brunetti

In this paper, we formalize the notion of lambda-AT-model (where $\lambda$ is a non-null integer) for a given chain complex, which allows the computation of homological information in the integer domain avoiding using the Smith Normal Form…

计算机视觉与模式识别 · 计算机科学 2011-05-24 Rocio Gonzalez-Diaz , Maria Jose Jimenez , Belen Medrano , Pedro Real

Given positive integers $h, N$ satisfying $1 \leqslant h \leqslant 2N^2$, we define $T(h,N)$ to be the number of $2\times 2$ integer matrices with determinant equal to $h$ whose entries lie in $[-N,N]$. Our main result states that for any…

数论 · 数学 2026-05-19 Jonathan Chapman , Akshat Mudgal

Let $\mathcal{B} = (B_1,\ldots, B_h)$ be an $h$-tuple of sets of positive integers. Let $g_{\mathcal{B} }(n)$ count the number of representations of $n$ in the form $n = b_1\cdots b_h$, where $b_i \in B_i$ for all $i \in \{1,\ldots, h\}$.…

数论 · 数学 2022-05-03 Melvyn B. Nathanson

Let A be a finite nonempty subset of an additive abelian group G, and let \Sigma(A) denote the set of all group elements representable as a sum of some subset of A. We prove that |\Sigma(A)| >= |H| + 1/64 |A H|^2 where H is the stabilizer…

数论 · 数学 2015-06-26 Matt DeVos , Luis Goddyn , Bojan Mohar , Robert Samal

We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…

谱理论 · 数学 2013-08-27 Evans M. Harell , Joachim Stubbe

Let $\Gamma$ be an abelian group and $g \geq h \geq 2$ be integers. A set $A \subset \Gamma$ is a $C_h[g]$-set if given any set $X \subset \Gamma$ with $|X| = k$, and any set $\{ k_1 , \dots , k_g \} \subset \Gamma$, at least one of the…

组合数学 · 数学 2013-11-14 Xing Peng , Rafael Tesoro , Craig Timmons

The existence of unimodular forms with small norms on sequence spaces is crucial in a variety of problems in modern analysis. We prove that the infimum of $\left\Vert A\right\Vert $ over all unimodular $d$-linear (complex or real) forms $A$…

泛函分析 · 数学 2019-12-16 Nacib Gurgel Albuquerque , Lisiane Rezende

A sequence of positive integers $(a_1,a_2,\ldots,a_k)$ is called $\ell$-additive if $a_1+a_2+\cdots+a_k=\ell a_1$ or $\ell a_k$. In this paper, we prove that for all $k\geq3$, if $n$ is sufficiently large, then every permutation of…

组合数学 · 数学 2026-05-29 Collier Gaiser , Paul Horn

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…

组合数学 · 数学 2025-11-12 Eric James Faust , Michael Tait

For a positive integer $h$ and a subset $A$ of a given finite abelian group, we let $hA$, $h \hat{\;} A$, and $h_{\pm}A$ denote the $h$-fold sumset, restricted sumset, and signed sumset of $A$, respectively. Here we review some of what is…

数论 · 数学 2017-05-16 Béla Bajnok

A Helson matrix (also known as a multiplicative Hankel matrix) is an infinite matrix with entries $\{a(jk)\}$ for $j,k\geq1$. Here the $(j,k)$'th term depends on the product $jk$. We study a self-adjoint Helson matrix for a particular…

谱理论 · 数学 2017-09-20 Nazar Miheisi , Alexander Pushnitski

We study the number of lines in hypergraphs in a more symmetric setting, where both the hypergraph and its complement are considered. In the general case and in some special cases, the lower bounds on the number of lines are much higher…

组合数学 · 数学 2014-11-04 Xiaomin Chen , Peihan Miao

Consider the Hales-Jewett theorem. The $k$-dimensional version of it tells us that the combinatorial space $\mathcal{U}_{M, \Lambda} = \{ \eta \mid \eta: M \to \Lambda \}$ has, under suitable assumptions, monochromatic $k$-dimensional…

组合数学 · 数学 2022-01-26 Mohammad Golshani , Saharon Shelah