中文
相关论文

相关论文: Waring's problem in the natural numbers with binar…

200 篇论文

The occurrence and the distribution of patterns of trees associated to natural numbers are investigated. Bounds from above and below are proven for certain natural quantities.

数论 · 数学 2024-01-09 Roberto Conti , Pierluigi Contucci , Vitalii Iudelevich

We motivate and study an infinite sequence of binary operations on the ordinal numbers, extending the standard arithmetic on the ordinals to higher degrees of iteration. Connections to the hyperoperations on the natural numbers are…

逻辑 · 数学 2025-08-26 Adrian Ducourtial

In a classic paper Schr\"oder posed four combinatorial problems about the number of certain types of bracketings of words and sets. Here we address what these bracketings look like on average. For each of the four problems we prove that a…

概率论 · 数学 2013-09-24 Jim Pitman , Douglas Rizzolo

We will describe a combinatorial game that models the problem of resolution of singularities of algebraic varieties over a field of characteristic zero. By giving a winning strategy for this game, we give another proof of the existence of…

代数几何 · 数学 2014-01-31 Josef Schicho

The resolvability of equations in integers containing truncated Newton's binomial, is determined by the divisibility of the binomial by the characteristic parameters of the equation, which most often is the binomial exponent. Two types of…

综合数学 · 数学 2014-06-23 Anatoly A. Grinberg

In the paper, the occurrence of zeros and ones in the binary expansion of the primes is studied. In particular the statement in the title is established. The proof is unconditional.

数论 · 数学 2012-11-16 Jean Bourgain

Let $s(n)$ denote the sum of digits in the binary expansion of the integer $n$. Hare, Laishram and Stoll (2011) studied the number of odd integers such that $s(n)=s(n^2)=k$, for a given integer $k\geq 1$. The remaining cases that could not…

In this note, we try to understand the recent development on the Waring-Goldbach problem involving cubes of primes. Especially, we want to determine whether integers that are either primes, squares of primes, cubes of primes, or a cube of…

综合数学 · 数学 2022-01-20 Zhichun Zhai

The Bin Packing Problem involves efficiently packing items into a limited number of bins without exceeding their capacity. In this paper, we try to answer a specific question in this field. Mathematically the combinatorial optimization…

综合数学 · 数学 2025-08-25 Angshuman Robin Goswami

Let $\mathbb{N}_0$ be a class of natural numbers whose binary decompositions has even number of 1. We estimate of the sum $\sum\limits_{n\in \mathbf{N}_0,n\le X}\exp(2\pi i \alpha n^2)$.

数论 · 数学 2008-05-27 Karen M. Eminyan

Let $G(k)$ denote the least number $s$ such that every sufficiently large natural number is the sum of at most $s$ positive integral $k$th powers. We show that $G(7)\le 31$, $G(8)\le 39$, $G(9)\le 47$, $G(10)\le 55$, $G(11)\le 63$,…

数论 · 数学 2024-08-14 Trevor D. Wooley

Let $w$ be a finite word over the alphabet $\{0,1\}$. For any natural number $n$, let $s_w(n)$ denote the number of occurrence of $w$ in the binary expansion of $n$ as a scattered subsequence. We study the behavior of the partial sum…

数论 · 数学 2024-11-18 Pranjal Jain , Shuo Li

In this paper, we study the "sum composition problem" between two lists $A$ and $B$ of positive integers. We start by saying that $B$ is "sum composition" of $A$ when there exists an ordered $m$-partition $[A_1,\ldots,A_m]$ of $A$ where $m$…

数据结构与算法 · 计算机科学 2020-02-10 Mario Pennacchioni , Emanuele Munarini , Marco Mesiti

In this work we look at the original fractional calculus of variations problem in a somewhat different way. As a simple consequence, we show that a fractional generalization of a classical problem has a solution without any restrictions on…

最优化与控制 · 数学 2019-08-27 Rui A. C. Ferreira

In this paper we introduce the open Waring rank of a form of degree d in n variables and prove the that this rank in bounded from above by \binom{n+d-2}{d-1} - \binom{n+d-6}{d-3} whenever n, d >= 3. This proves the same upper bound for the…

交换代数 · 数学 2013-05-31 Joachim Jelisiejew

In this paper we discourse basises of representable algebras. This question lead to arithmetic problems. We prove algorithmical solvability of exponential-Diophantine equations in rings represented by matrices over fields of positive…

环与代数 · 数学 2020-05-12 A. A. Chilikov , A. Ya. Belov

The paper deals with the following system of nonlinear difference equations \begin{equation*} x_{n+1}=ax_{n}^{2}y_{n}+bx_{n}y_{n}^{2},\ y_{n+1}=cx_{n}^{2}y_{n}+dx_{n}y_{n}^{2},\ n\in \mathbb{N}_{0}, \end{equation*} where the initial values…

动力系统 · 数学 2021-11-01 Durhasan Turgut Tollu

Two permutations of the natural numbers diverge if the absolute value of the difference of their elements in the same position goes to infinity. We show that there exists an infinite number of pairwise divergent permutations of the…

组合数学 · 数学 2019-04-11 Emanuela Fachini , János Körner

We study a generalization of Pell's equation, whose coefficients are certain algebraic integers. Let $X_0=0$ and $X_n=\sqrt{2+X_{n-1}}$ for each $n\in \mathbb{Z}_{\ge 1}$. We study the $\mathbb{Z}[X_{n-1}]$-solutions of the equation…

数论 · 数学 2022-11-28 Hyuga Yoshizaki

Let $\mathcal{P}$ and $\mathbb{N}$ be the sets of all primes and natural numbers, respectively. In this article, it is proved that there has a positive lower density of the natural numbers which can be represented by the form…

数论 · 数学 2022-04-25 Yuchen Ding