中文
相关论文

相关论文: On a combinatorial problem of Asmus Schmidt

200 篇论文

This paper is concerned with finite sequences of integers that may be written as sums of squares of two nonzero integers. We first find infinitely many integers $n$ such that $n, n+h$ and $n+k$ are all sums of two squares where $h$ and $k$…

数论 · 数学 2024-04-10 Ajai Choudhry , Bibekananda Maji

Stanley, building on work of Stern, defined an array of numbers by the recurrence $s(n, 2k) = s(n-1, k)$, $s(n, 2k+1) = s(n-1, k) + s(n-1, k+1)$. Stanley showed that, for each positive integer $r$, the sequence $s_n^r:= \sum_k s(n,k)^r$…

组合数学 · 数学 2019-01-21 David E Speyer

We prove that for all integers $k \geq 1$, there exists a constant $C_k$ depending only on $k$, such that for all $q > C_k$, and for $n = 1, 2$ every matrix in $M_n(\mathbb{F}_q)$ is a sum of two $k$th powers and for all $n \geq 3$ every…

组合数学 · 数学 2021-11-24 Krishna Kishore

Let $b$ be an algebraic number with $|b|>1$ and $\mathcal{H}$ a finite set of algebraic numbers. We study the transcendence of numbers of the form $\sum_{n=0}^\infty \frac{a_n}{b^n}$ where $a_n \in \mathcal{H}$ for all $n\in\mathbb{N}$. We…

数论 · 数学 2022-06-13 Florian Luca , Joël Ouaknine , James Worrell

This paper provides a survey of results on the greatest prime factor, the number of distinct prime factors, the greatest squarefree factor and the greatest m-th powerfree part of a block of consecutive integers, both without any assumption…

数论 · 数学 2016-12-19 Tarlok N. Shorey , Rob Tijdeman

Let $\{U_n\}_{n \geq 0}$ and $\{V_m\}_{m \geq 0}$ be two linear recurrence sequences. We establish an asymptotic formula for the number of integers $c$ in the range $[-x, x]$ which can be represented as differences $ U_n - V_m$. In…

数论 · 数学 2020-08-04 Robert Tichy , Ingrid Vukusic , Daodao Yang , Volker Ziegler

For a periodic function $f$ with bounded variation and integral zero on its period interval, we show that $\sum_{k=1}^\infty c_k^2 (\log\log k)^\gamma <\infty$, $\gamma>4$ implies the almost everywhere convergence of $\sum_{k=1}^\infty c_k…

经典分析与常微分方程 · 数学 2012-11-20 Istvan Berkes

Let $n$ be a positive integer. In 1915, Theisinger proved that if $n\ge 2$, then the $n$-th harmonic sum $\sum_{k=1}^n\frac{1}{k}$ is not an integer. Let $a$ and $b$ be positive integers. In 1923, Nagell extended Theisinger's theorem by…

数论 · 数学 2018-10-09 Yulu Feng , Shaofang Hong , Xiao Jiang , Qiuyu Yin

Consider the average of the first n k-th powers. We pose and answer the following natural question: For which values of n and k is this average an integer? If k is odd the answer is easy; it is an integer as long as n is incongruent to 2…

数论 · 数学 2013-10-01 Pantelis A. Damianou , Peter Schumer

We show that for a nonnegative monotone sequence $\{c_k\}$ the condition $c_kk\to 0$ is sufficient for uniform convergence of the series $\sum_{k=1}^{\infty}c_k\sin k^{\alpha} x$ on any bounded set for $\alpha\in (0,2)$, and for an odd…

经典分析与常微分方程 · 数学 2020-12-01 Kristina Oganesyan

For an integer $q\ge 2$ and a graph $F$ with $q\mid e(F)$, let $R(F,\Z_q)$ be the least integer $n$ such that every edge-labeling $w\colon E(K_n)\to \Z_q$ contains a copy of $F$ whose edge-label sum is zero in $\Z_q$. Write $C_{qk}$ for the…

组合数学 · 数学 2026-05-19 Cheng Chi , Jialin He

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

Gy\'{a}rf\'{a}s et al. determined the asymptotic value of the diagonal Ramsey number of $\mathcal{C}^k_n$, $R(\mathcal{C}^k_n,\mathcal{C}^k_n),$ generating the same result for $k=3$ due to Haxell et al. Recently, the exact values of the…

组合数学 · 数学 2018-06-21 Maryam Shahsiah

Zeckendorf's Theorem states that every positive integer can be uniquely represented as a sum of non-adjacent Fibonacci numbers, indexed from $1, 2, 3, 5,\ldots$. This has been generalized by many authors, in particular to constant…

For a graph $L$ and an integer $k\geq 2$, $R_k(L)$ denotes the smallest integer $N$ for which for any edge-colouring of the complete graph $K_N$ by $k$ colours there exists a colour $i$ for which the corresponding colour class contains $L$…

组合数学 · 数学 2010-08-25 Tomasz Łuczak , Miklós Simonovits , Jozef Skokan

\noindent In this paper, we show that for any positive integers $r$, $k$, $\Theta$, and $\Gamma$ such that $k \geq 2$ and $r \geq k + \Gamma$, there exists a connected graph $G$ for which $$\begin{array}{llcr} \omega (G) = \chi (G) = k, &…

组合数学 · 数学 2024-02-08 Saeed Shaebani

We show that there exist real numbers $\alpha_1,\alpha_2$ linearly independent over $\mathbb{Z}$ together with 1 such that for every non-zero integer vector $(m_1,m_2)$ with $m_1\ge 0$ and $m_2\ge 0$ one has $||m_1\alpha_1+m_2\alpha_2|| \ge…

数论 · 数学 2011-08-24 Nikolay G. Moshchevitin

For non-negative integers $k\leq n$, we prove a combinatorial identity for the $p$-binomial coefficient $\binom{n}{k}_p$ based on abelian p-groups. A purely combinatorial proof of this identity is not known. While proving this identity, for…

组合数学 · 数学 2021-03-30 C P Anil Kumar

For $k \ge 4$, a loose $k$-cycle $C_k$ is a hypergraph with distinct edges $e_1, e_2, \ldots, e_k$ such that consecutive edges (modulo $k$) intersect in exactly one vertex and all other pairs of edges are disjoint. Our main result is that…

组合数学 · 数学 2025-01-29 Dhruv Mubayi , Lujia Wang

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…

数论 · 数学 2013-02-27 Sadegh Nazardonyavi , Semyon Yakubovich