中文
相关论文

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

200 篇论文

For a pair of positive integers (k,r) with r>1 such that k+1 and r-1 are relatively prime, we describe the space of symmetric polynomials in variables x_1,...,x_n which vanish at all diagonals of codimension k of the form…

量子代数 · 数学 2007-05-23 B. Feigin , M. Jimbo , T. Miwa , E. Mukhin , Y. Takeyama

We show that given any six numbers $r,s,t,u,v,w \in (0,1]$ satisfying $r \leq s \leq \min(t,u) \leq \max(t,u) \leq v \leq w$, it is possible to construct a compact subset of $[0,1]$ with Hausdorff dimension equal to $r$, lower modified box…

度量几何 · 数学 2018-12-27 Andrew Mitchell , Lars Olsen

We answer a number of questions of Erd\H{o}s on the existence of arithmetic progressions in $k$-full numbers (i.e. integers with the property that every prime divisor necessarily occurs to at least the $k$-th power). Further, we deduce a…

数论 · 数学 2023-02-08 Prajeet Bajpai , Michael A. Bennett , Tsz Ho Chan

The Ward numbers $W(n,k)$ combinatorially enumerate set partitions with block sizes $\geq 2$ and phylogenetic trees (total partition trees). We prove that $W(n,k)$ also counts \emph{increasing Schr\"oder trees} by verifying they satisfy…

组合数学 · 数学 2025-07-22 Elena L. Wang , Guoce Xin

Let $p_{-r}(n)$ denote the $r$-coloured partition function, and $\sigma(n)=\sum_{d|n}d$ denote the sum of positive divisors of $n$. The aim of this note is to prove the following $$…

综合数学 · 数学 2020-08-10 Sumit Kumar Jha

Let $k$ and $n$ be positive integers. Define $R(n,k)$ to be the minimum positive value of $$ | e_i \sqrt{s_1} + e_2 \sqrt{s_2} + ... + e_k \sqrt{s_k} -t | $$ where $ s_1, s_2, ..., s_k$ are positive integers no larger than $n$, $t$ is an…

计算几何 · 计算机科学 2015-05-13 Qi Cheng , Xianmeng Meng , Celi Sun , Jiazhe Chen

We prove a canonical polynomial Van der Waerden's Theorem. More precisely, we show the following. Let $\{p_1(x),\ldots,p_k(x)\}$ be a set of polynomials such that $p_i(x)\in \mathbb{Z}[x]$ and $p_i(0)=0$, for every $i\in \{1,\ldots,k\}$.…

组合数学 · 数学 2020-04-17 António Girão

Let $\mathcal{P}$ be the set of primes and $\mathbb{N}$ the set of positive integers. Let also $r_1,...,r_t$ be positive real numbers and $R_2(r_1,...,r_t)$ the set of odd integers which can be represented as $$ p+2^{\lfloor…

数论 · 数学 2024-12-17 Yuchen Ding , Wenguang Zhai

Let $1=d_{1}<d_{2}< \cdots < d_{\tau(n)}=n$ denote the ordered sequence of the positive divisors of an integer $n$. We are interested in estimating the arithmetic function $$ V(n) := \prod_{1 \le i < j \le \tau(n)}(d_{j}-d_{i}) \quad (n \ge…

数论 · 数学 2025-10-07 Patrick Letendre

The pentagonal numbers are the integers given by $p_5(n)=n(3n-1)/2\ (n=0,1,2,\ldots)$. Let $(b,c,d)$ be one of the triples $(1,1,2),(1,2,3),(1,2,6)$ and $(2,3,4)$. We show that each $n=0,1,2,\ldots$ can be written as $w+bx+cy+dz$ with…

数论 · 数学 2020-04-01 Dmitry Krachun , Zhi-Wei Sun

A zero-sum sequence of integers is a sequence of nonzero terms that sum to 0. Let $k>0$ be an integer and let $[-k,k]$ denote the set of all nonzero integers between $-k$ and $k$. Let $\ell(k)$ be the smallest integer $\ell$ such that any…

组合数学 · 数学 2012-12-13 Marvin Sahs , Papa Sissokho , Jordan Torf

Let $w=(w_1,\dots,w_d)$ be a $d$-tuple of positive real numbers such that $\sum_{i}w_i =1$ and $w_1\geq \cdots \geq w_d$. A $d$-dimensional vector $x=(x_1,\dots,x_d)\in\mathbb{R}^d$ is said to be $w$-singular if for every $\epsilon>0$ there…

数论 · 数学 2024-04-10 Taehyeong Kim , Jaemin Park

Let $c$ be an element of the Weyl algebra $W(d)$ which is given by a strictly positive operator in the Schr"odinger representation. It is shown that, under some conditions, there exist elements $b_1,...,b_d$ in $W(d)$ such that $b_1 c b_1^*…

代数几何 · 数学 2007-05-23 Konrad Schmuedgen

Let $n$ be an arbitrary integer, let $p$ be a prime factor of $n$. Denote by $\omega_1$ the $p^{th}$ primitive unity root, $\omega_1:=e^{\frac{2\pi i}{p}}$. Define $\omega_i:=\omega_1^i$ for $0\leq i\leq p-1$ and…

组合数学 · 数学 2016-10-10 Gábor Hegedüs

We show that there exists $k \in \bbn$ and $0 < \e \in\bbr$ such that for every field $F$ of characteristic zero and for every $n \in \bbn$, there exists explicitly given linear transformations $T_1,..., T_k: F^n \to F^n$ satisfying the…

群论 · 数学 2008-04-15 A. Lubotzky , E. Zelmanov

This paper is concerned with the function $r_{k,s}(n)$, the number of (ordered) representations of $n$ as the sum of $s$ positive $k$-th powers, where integers $k,s\ge 2$. We examine the mean average of the function, or equivalently,…

数论 · 数学 2022-11-22 Pengyong Ding

We have found maximum possible runs of consecutive positive integers each having exactly $k$ divisors for some fixed values of $k$. In addition, we exhibit the run of 10 consecutive positive integers each having exactly 12 divisors and two…

数论 · 数学 2015-10-27 Vladimir A. Letsko

In this note, we provide details of the $k$-dimensional Weisfeiler-Leman Algorithm and its analysis from Immerman-Lander (1990). In particular, we present an optimized version of the algorithm that runs in time $O(n^{k+1}\log n)$, where $k$…

计算复杂性 · 计算机科学 2019-07-24 Neil Immerman , Rik Sengupta

This paper defines multidimensional sequential optimization numbers and prove that the unsigned Stirling numbers of first kind are 1-dimensional sequential optimization numbers. This paper gives a recurrence formula and an upper bound of…

数据结构与算法 · 计算机科学 2022-06-16 Zile Hui

We study arithmetic progressions in primes with common differences as small as possible. Tao and Ziegler showed that, for any $k \geq 3$ and $N$ large, there exist non-trivial $k$-term arithmetic progressions in (any positive density subset…

数论 · 数学 2015-09-17 Xuancheng Shao