中文
相关论文

相关论文: Some New Exact van der Waerden Numbers

200 篇论文

In-place associative integer sorting technique was proposed for integer lists which requires only constant amount of additional memory replacing bucket sort, distribution counting sort and address calculation sort family of algorithms.…

数据结构与算法 · 计算机科学 2012-09-24 A. Emre Cetin

For each positive integer $r$, let $S_r$ denote the $r^{th}$ Schemmel totient function, a multiplicative arithmetic function defined by \[S_r(p^{\alpha})=\begin{cases} 0, & \mbox{if } p\leq r; \\ p^{\alpha-1}(p-r), & \mbox{if } p>r…

数论 · 数学 2014-12-10 Colin Defant

Let $m$, $k_1$, and $k_2$ be three integers with $m\ge 2$. For any set $A\subseteq \mathbb{Z}_m$ and $n\in \mathbb{Z}_m$, let $\hat{r}_{k_1,k_2}(A,n)$ denote the number of solutions of the equation $n=k_1a_1+k_2a_2$ with $a_1,a_2\in A$. In…

数论 · 数学 2014-09-16 Quan-Hui Yang , Yong-Gao Chen

For $x\geq 3$, we define $w(x)$ as the highest integer $w$ for which there exist integers $m, y\geq 1$ and $1\leq n_1<\dots<n_m\leq x$ such that $n_1\cdots n_m=y^w$. We show that \[w(x)=x\exp\big(-(\sqrt{2}+o(1))\sqrt{\log x\log\log…

数论 · 数学 2022-09-27 Élie Goudout

A classic theorem of Uchimura states that the difference between the sum of the smallest parts of the partitions of $n$ into an odd number of distinct parts and the corresponding sum for an even number of distinct parts is equal to the…

数论 · 数学 2024-02-21 Rajat Gupta , Noah Lebowitz-Lockard , Joseph Vandehey

The Carmichael lambda function $\lambda(n)$ is defined to be the smallest positive integer $m$ such that $a^m \equiv 1 \pmod{n}$ for all $(a,n)=1.$ $\lambda_k(n)$ is defined to be the $k$th iterate of $\lambda(n).$ Let L(n) be the smallest…

数论 · 数学 2012-03-22 Nick Harland

Van der Waerden's theorem asserts that if you color the natural numbers with, say, five different colors, then you can always find arbitrarily long sequences of numbers that have the same color and that form an arithmetic progression.…

泛函分析 · 数学 2012-06-06 Heinrich-Gregor Zirnstein

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 use the theory of symmetric functions to enumerate various classes of alternating permutations w of {1,2,...,n}. These classes include the following: (1) both w and w^{-1} are alternating, (2) w has certain special shapes, such as…

组合数学 · 数学 2007-05-23 Richard P. Stanley

For which positive integers $n,k,r$ does there exist a linear $[n,k]$ code $C$ over $\mathbb{F}_q$ with all codeword weights divisible by $q^r$ and such that the columns of a generating matrix of $C$ are projectively distinct? The…

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

We derive a new criterion for a real-valued function $u$ to be in the Sobolev space $W^{1,2}(\R^n)$. This criterion consists of comparing the value of a functional $\int f(u)$ with the values of the same functional applied to convolutions…

泛函分析 · 数学 2007-05-23 Mark A. Peletier , Robert Planqué , Matthias Röger

Let $n>1$ be a positive integer. Let $R$ be a henselian local ring with residue field $k$ of $n$th level $s_n(k)$. We give some upper and lower bounds for the $n$th Waring number $w_n(R)$ in terms of $w_n(k)$ and $s_n(k)$. In large number…

交换代数 · 数学 2024-08-26 Tomasz Kowalczyk , Piotr Miska

For a positive integer $N$, we define the N-rank of a non singular integer $d\times d$ matrix $A$ to be the maximum integer $r$ such that there exists a minor of order $r$ whose determinant is not divisible by $N$. Given a positive integer…

数论 · 数学 2007-05-23 Carlo Magagna

In 1851 Prouhet showed that when $N=j^{k+1}$ where $j$ and $k$ are positive integers, $j \geq 2$, the first $N$ consecutive positive integers can be separated into $j$ sets, each set containing $j^k$ integers, such that the sum of the…

数论 · 数学 2019-08-30 Ajai Choudhry

For integers a and n>0, let a(n) denote the residue class {x\in Z: x=a (mod n)}. Let A be a collection {a_s(n_s)}_{s=1}^k of finitely many residue classes such that A covers all the integers at least m times but {a_s(n_s)}_{s=1}^{k-1} does…

数论 · 数学 2007-05-23 Zhi-Wei Sun

Let $k$ be a positive integer and $m$ be an integer. Garvan's $k$-rank $N_k(m,n)$ is the number of partitions of $n$ into at least $(k-1)$ successive Durfee squares with $k$-rank equal to $m$. In this paper give some asymptotics for…

数论 · 数学 2019-10-03 Nian Hong Zhou

Let $w(n)$ be an additive non-negative integer-valued arithmetic function which is equal to $1$ on primes. We study the distribution of $n + w(n)$ $\pmod p$ and give a lower bound for the density of the set of numbers which are not…

数论 · 数学 2022-11-29 Petr Kucheriaviy

We study a W-algebra of central charge 2(k-1)/(k+2) with k a positive integer greater than 1

量子代数 · 数学 2008-09-23 Chongying Dong , Ching Hung Lam , Hiromichi Yamada

Let the integers $1,\ldots,n$ be assigned colors. Szemer\'edi's theorem implies that if there is a dense color class then there is an arithmetic progression of length three in that color. We study the conditions on the color classes forcing…

组合数学 · 数学 2016-05-25 Maria Axenovich , Ryan R. Martin
‹ 上一页 1 8 9 10 下一页 ›