中文
相关论文

相关论文: A universal sequence of integers generating balanc…

200 篇论文

We explore the cycles and convergence of Generalized Collatz Sequence, where $3n+1$ in original collatz function is replaced with $3n+k$. We present a generating function for cycles of GCS and show a particular inheritance structure of…

数论 · 数学 2020-08-26 Anant Gupta

In this paper we present a combinatorial generalization of the fact that the number of plane partitions that fit in a $2a\times b\times b$ box is equal to the number of such plane partitions that are symmetric, times the number of such…

组合数学 · 数学 2017-02-13 Mihai Ciucu , Christian Krattenthaler

In this paper, it is proved that, for $\gamma\in(\frac{317}{320},1)$, every sufficiently large odd integer can be written as the sum of nine cubes of primes, each of which is of the form $[n^{1/\gamma}]$. This result constitutes an…

数论 · 数学 2025-11-11 Linji Long , Jinjiang Li , Min Zhang , Yankun Sui

The ternary Goldbach conjecture states that every odd number $n\geq 7$ is the sum of three primes. The estimation of the Fourier series $\sum_{p\leq x} e(\alpha p)$ and related sums has been central to the study of the problem since Hardy…

数论 · 数学 2014-04-15 H. A. Helfgott

We study additive properties of consecutive prime numbers and the primality of the sums they generate. For a given prime number $p_n$, we consider the sums \[ S_k(p_n) = p_n + p_{n+1} + \cdots + p_{n+k-1}, \] where $k \ge 3$ is an odd…

综合数学 · 数学 2026-01-23 Edwige Tolla

In this paper, we consider various theorems of P.A. MacMahon and M.V. Subbarao. For a non-negative integer $n$, MacMahon proved that the number of partitions of $n$ wherein parts have multiplicity greater than 1 is equal to the number of…

组合数学 · 数学 2022-01-20 Darlison Nyirenda , Beaullah Mugwangwavari

It is widely believed that the parity of the partition function $p(n)$ is ``random.'' Contrary to this expectation, in this note we prove the existence of infinitely many congruence relations modulo 4 among its values. For each square-free…

数论 · 数学 2022-12-15 Ken Ono

We study the existence of equilateral polygons in planar integer lattices. Maehara showed that it's sufficient to work with rectangular lattices $\Lambda(m) = L[(1,0),(0,\sqrt{m})]$ with $m \equiv 3 \pmod{4}$. Building on results of Maehara…

度量几何 · 数学 2025-12-10 Ghaura Mahabaduge

An $n\times n$ symmetric matrix $A$ is copositive if the quadratic form $x^TAx$ is nonnegative on the nonnegative orthant $\mathbb{R}^{n}_{\geq 0}$. The cone of copositive matrices contains the cone of matrices which are the sum of a…

泛函分析 · 数学 2025-02-28 Tea Štrekelj , Aljaž Zalar

Integer partitions are deeply related to many phenomena in statistical physics. A question naturally arises which is of interest to physics both on "purely" theoretical and on practical, computational grounds. Is it possible to apprehend…

计算物理 · 物理学 2007-05-23 N. M. Chase

In this work we use the number classification in families of the form 6n+1, and 6n+5 with n integer (Such families contain all odd prime numbers greater than 3 and other compound numbers related with primes). We will use this kind of…

综合数学 · 数学 2007-09-04 G. Funes , D. Gulich , L. Garvaglia , M. Garvaglia

We assume that $\mathcal{E}$ is a rank $r$ Ulrich bundle for $(P^n, \mathcal{O}(d))$. The main result of this paper is that $\mathcal{E}(i)\otimes \Omega^{j}(j)$ has natural cohomology for any integers $i \in \mathbb{Z}$ and $0 \leq j \leq…

代数几何 · 数学 2017-03-21 Zhiming Lin

Considering all possible paths that a natural number can take following the rules of the algorithm proposed in the Collatz conjecture we construct a graph that can be interpreted as an infinite network that contemplates all possible paths…

综合数学 · 数学 2021-05-11 Tobias Canavesi

The Erd\H{o}s-Mollin-Walsh conjecture, asserting the nonexistence of three consecutive powerful integers, remains a celebrated open problem in number theory. A natural line of inquiry, following recent work by Chan (2025), is to investigate…

数论 · 数学 2025-09-25 Jialai She

For each integer $m\ge3$, let $P_m(x)$ denote the generalized $m$-gonal number $\frac{(m-2)x^2-(m-4)x}{2}$ with $x\in\mathbb{Z}$. Given positive integers $a,b,c,k$ and an odd prime number $p$ with $p\nmid c$, we employ the theory of ternary…

数论 · 数学 2020-07-21 Hai-Liang Wu

For $n$-body problem with arbitrary positive masses, we prove there are regularizable collinear periodic solutions for any ordering of the masses, going from a simultaneous binary collision to another in half of a period with half of the…

动力系统 · 数学 2024-09-05 Guowei Yu

Euler showed that the number of partitions of $n$ into distinct parts equals the number of partitions of $n$ into odd parts. This theorem was generalized by Glaisher and further by Franklin. Recently, Beck made three conjectures on…

组合数学 · 数学 2020-02-20 Jia Huang

In this paper, it is established that every sufficiently large positive integer $n$ subject to $n\equiv0\pmod2$ can be represented as a sum of one square of prime and seventeen fifth powers of primes, which gives an enhancement upon the…

数论 · 数学 2024-02-06 Min Zhang , Jinjiang Li , Fei Xue

The ternary Goldbach conjecture states that every odd number n>=7 is the sum of three primes. The estimation of sums of the form \sum_{p\leq x} e(\alpha p), \alpha = a/q + O(1/q^2), has been a central part of the main approach to the…

数论 · 数学 2013-12-31 H. A. Helfgott

This paper introduces a class of extended central factorial numbers generated by a parity-dependent recurrence relation, termed the "flickering operator". We demonstrate that the resulting triangular structure, now indexed as OEIS A395021,…

综合数学 · 数学 2026-05-11 Andrii Husiev