中文
相关论文

相关论文: New results related to a conjecture of Manickam an…

200 篇论文

It is known that for an arbitrary positive integer \(n\) the sequence \(S(x^n)=(1^n, 2^n, \ldots)\) is complete, meaning that every sufficiently large integer is a sum of distinct \(n\)th powers of positive integers. We prove that every…

数论 · 数学 2017-07-11 Doyon Kim

In this note, we show that $S(n,r):=\sum_{k=0}^{n} \binom{n}{k}\frac{k}{k+r}$ is not an integer for any positive integer $n$ and $r\in \{1,2,3,4,5,6\}$ and for $n\le r-1$. This gives a partial answer to a conjecture of [3].

数论 · 数学 2018-01-30 Daniel López-Aguayo , Florian Luca

Zaremba's conjecture (1971) states that every positive integer number $d$ can be represented as a denominator (continuant) of a finite continued fraction $\frac{b}{d}=[d_1,d_2,...,d_{k}],$ with all partial quotients $d_1,d_2,...,d_{k}$…

数论 · 数学 2013-06-04 Dmitriy Frolenkov , Igor D. Kan

Let $d(\cdot)$ denote the natural density on the positive integers. We characterize all sets $A,B$ with positive density satisfying $d(A+B)=d(A)+d(B)$, under the assumption that the two sets are not both contained in a proper finite union…

数论 · 数学 2026-04-15 Ethan Ackelsberg , Florian K. Richter

A long-standing conjecture asserts that the polynomial \[p(t) = \text{Tr}[(A+tB)^m]\] has nonnegative coefficients whenever $m$ is a positive integer and $A$ and $B$ are any two $n \times n$ positive semidefinite Hermitian matrices. The…

算子代数 · 数学 2007-05-23 Christopher J. Hillar

This article is motivated by a conjecture proposed by Sinai Robins in 2024. The conjecture asserts that two convex, centrally symmetric sets of positive measure that are not multi-tilers must coincide up to rigid motions if and only if…

泛函分析 · 数学 2025-11-18 Oleg Asipchuk

Two conjectures of Su and Wang (2008) concerning binomial coefficients are proved. For $n\geq k\geq 0$ and $b>a>0$, we show that the finite sequence $C_j=\binom{n+ja}{k+jb}$ is a P\'{o}lya frequency sequence. For $n\geq k\geq 0$ and…

组合数学 · 数学 2009-09-17 Yaming Yu

Let BS(m,n) denote the set of base sequences (A;B;C;D), with A and B of length m and C and D of length n. The base sequence conjecture (BSC) asserts that BS(n+1,n) exist (i.e., are non-empty) for all n. This is known to be true for n <= 36…

组合数学 · 数学 2010-04-27 Dragomir Z. Djokovic

A variation on the sum-product problem seeks to show that a set which is defined by additive and multiplicative operations will always be large. In this paper, we prove new results of this type. In particular, we show that for any finite…

组合数学 · 数学 2014-02-25 Antal Balog , Oliver Roche-Newton

Let $D_{1}$, $D_{2}$ be coprime odd integers with min$(D_{1},D_{2})>1$, and let $N(D_{1},D_{2})$ denote the number of positive integer solutions $(x, m, n)$ of the equation $D_{1}x^2+D_{2}^{m}=2^{n+2}$. In this paper, we prove that…

数论 · 数学 2013-04-15 Li Jianghua

In this paper we study sum-free subsets of the set $\{1,...,n\}$, that is, subsets of the first $n$ positive integers which contain no solution to the equation $x + y = z$. Cameron and Erd\H{o}s conjectured in 1990 that the number of such…

组合数学 · 数学 2014-02-26 Noga Alon , József Balogh , Robert Morris , Wojciech Samotij

We know [Rui Duarte and Ant\'onio Guedes de Oliveira, New developments of an old identity, manuscript arXiv:1203.5424, submitted.] that, for every non-negative integer numbers $n,i,j$ and for every real number $\ell$, $$ \sum_{i+j=n}…

组合数学 · 数学 2016-11-22 Rui Duarte , António Guedes de Oliveira

Let $\mathbb{N}$ be the set of all nonnegative integers. For $S\subseteq \mathbb{N}$ and $n\in \mathbb{N}$, let $R_S(n)$ denote the number of solutions of the equation $n=s_1+s_2$, $s_1,s_2\in S$ and $s_1<s_2$. Let $A$ be the set of all…

数论 · 数学 2021-11-16 Kai-Jie Jiao , Csaba Sándor , Quan-Hui Yang , Jun-Yu Zhou

We show that if A is a large subset of a box in Z^d with dimensions L_1 >= L_2 >= ... >= L_d which are all reasonably large, then |A + A| > 2^{d/48}|A|. By combining this with Chang's quantitative version of Freiman's theorem, we prove a…

数论 · 数学 2007-05-23 Ben Green

Let $f(n,k)$ be the largest number of positive integers not exceeding $n$ from which one cannot select $k+1$ pairwise coprime integers, and let $E(n,k)$ be the set of positive integers which do not exceed $n$ and can be divided by at least…

数论 · 数学 2014-09-16 Yong-Gao Chen , Xiao-Feng Zhou

Y. Manoussakis (J. Graph Theory 16, 1992, 51-59) proposed the following conjecture. \noindent\textbf{Conjecture}. {\it Let $D$ be a 2-strongly connected digraph of order $n$ such that for all distinct pairs of non-adjacent vertices $x$, $y$…

组合数学 · 数学 2023-06-22 Samvel Kh. Darbinyan

Let $P(x)$ be a polynomial of degree $m$, with nonnegative and non-decreasing coefficients. We settle the conjecture that for any positive real number $d$, the coefficients of $P(x+d)$ form a unimodal sequence, of which the special case $d$…

组合数学 · 数学 2008-09-10 Yi Wang , Yeong-Nan Yeh

Erdos and Niven proved that for any positive integers $m$ and $d$, there are only finitely many positive integers $n$ for which one or more of the elementary symmetric functions of $1/m,1/(m+d), ..., 1/(m+nd)$ are integers. Recently, Chen…

数论 · 数学 2011-12-06 Chunlin Wang , Shaofang Hong

In this paper we show that every set $A \subset \mathbb{N}$ with positive density contains $B+C$ for some pair $B,C$ of infinite subsets of $\mathbb{N}$, settling a conjecture of Erd\H{o}s. The proof features two different decompositions of…

组合数学 · 数学 2019-06-14 Joel Moreira , Florian Karl Richter , Donald Robertson

A recent conjecture by C. Carlet on the sum-freedom of the binary multiplicative inverse function can be stated as follows: For each pair of positive integers $(n,k)$ with $3\le k\le n-3$, there is a $k$-dimensional $\Bbb F_2$-subspace $E$…

数论 · 数学 2025-05-01 Xiang-dong Hou , Shujun Zhao