Szabolcs Tengely, Maciej Ulas
Let $A\subset \N_{+}$ and by $P_{A}(n)$ denotes the number of partitions of an integer $n$ into parts from the set $A$. The aim of this paper is to prove several result concerning the existence of integer solutions of Diophantine equations of the form $P_{A}(x)=P_{B}(y)$, where $A, B$ are certain finite sets.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
继续探索
We show how sums of some $5th$ powers can be written as sums of some cubics
In this paper we obtain a new parametric solution of the problem of finding two triads of biquadrates with equal sums and equal products.
For a positive integer $t\geq 2$, let $b_{t}(n)$ denote the number of $t$-regular partitions of a nonnegative integer $n$. In a recent paper, Keith and Zanello investigated the parity of $b_{t}(n)$ when $t\leq 28$. They discovered new infinite families of Ramanujan type congruences modulo 2 for $b_{21}(n)$ involving every prime $p$ with $p\equiv 13, 17, 19, 23 \pmod{24}$. In this paper, we investigate the parity of $b_{21}(n)$ involving the primes $p$ with $p\equiv 1, 5, 7, 11 \pmod{24}$. We prove new infinite families of Ramanujan type congruences modulo 2 for $b_{21}(n)$ involving the odd pr…
Let $b_3(n)$ be the number of $3$-regular partitions of $n$. Recently, W. J. Keith and F. Zanello discovered infinite families of Ramanujan type congruences modulo $2$ for $b_3(2n)$ involving every prime $p$ with $p \equiv 13, 17, 19, 23 \pmod {24}$, and O. X. M. Yao provided new infinite families of Ramanujan type congruences modulo $2$ for $b_3(2n)$ involving every prime $p\geqslant 5$. In this paper, we introduce new infinite Ramanujan type congruences modulo $2$ for $b_3(2n)$. They complement naturally the results of Keith-Zanello and Yao and involve primes in $\mathcal P=\{p \text{ prime …
On the variance of the Fibonacci partition function
本文确定了斐波那契分拆函数方差的量级，发现其与朴素猜测不同，证明方法结合了丢番图系统与非齐次线性递推。
This paper is concerned with the diophantine system, $\sum_{i=1}^{s_1} x_i^r=\sum_{i=1}^{s_2} y_i^r,\, r=1,\,2,\,\ldots,\,k, $ where $s_1$ and $s_2$ are integers such that the total number of terms on both sides, that is, $s_1+s_2,$ is as small as possible. We define $β(k)$ to be the minimum value of $s_1+s_2$ for which there exists a nontrivial solution of this diophantine system. We find nontrivial integer solutions of this diophantine system when $k < 6$, and thereby show that $β(2) =4,\;\, β(3) = 6,\;\, 7 \leq β(4) \leq 8$ and $8 \leq β(5) \leq 10$.
On the Diophantine Equation Involving Elementary Symmetric Polynomials and the Decomposition of Unity
本文研究了初等对称多项式值相等的丢番图方程，证明了在特定条件下解的数量有限或趋于无穷。
Building on previous work of Di Nasso and Luperi Baglini, we provide general necessary conditions for a Diophantine equation to be partition regular. These conditions are inspired by Rado's characterization of partition regular linear homogeneous equations. We conjecture that these conditions are also sufficient for partition regularity, at least for equations whose corresponding monovariate polynomial is linear. This would provide a natural generalization of Rado's theorem. We verify that such a conjecture hold for the equations $x^{2}-xy+ax+by+cz=0$ and $x^{2}-y^{2}+ax+by+cz=0$ for $a,b,c\in…
Generalised core partitions and Diophantine equations
本文研究任意 Dynkin 型中由仿射 Grassmannian 元素产生的广义核分拆，建立扩展仿射 Weyl 群理论，并利用其给出类似 Pell 方程的丢番图方程解的新参数化。
Let $Γ= Z A +Z^n$ be a dense subgroup with rank $n+1$ in $R^n$ and let $ω(A)$ denote the exponent of uniform simultaneous rational approximation to the point $A$. We show that for any real number $v\ge ω(A)$, the Hausdorff dimension of the set $B_v$ of points in $R^n$ which are $v$-approximable with respect to $Γ$, is equal to $1/v$.
A rational Diophantine triple is a set of three nonzero rational a,b,c with the property that ab+1, ac+1, bc+1 are perfect squares. We say that the elliptic curve y^2 = (ax+1)(bx+1)(cx+1) is induced by the triple {a,b,c}. In this paper, we describe a new method for construction of elliptic curves over Q with reasonably high rank based on a parametrization of rational Diophantine triples. In particular, we construct an elliptic curve induced by a rational Diophantine triple with rank equal to 12, and an infinite family of such curves with rank >= 7, which are both the current records for that k…
A New Class of Linear Relations for Scalar Partitions
针对标量整数分拆问题，提出一种基于变量消去程序和Cayley定理将二重分拆归约为标量分拆之和的算法，用于推导有限个标量分拆的线性关系。
On a Theorem of Nathanson on Diophantine Approximation
本文改进了Nathanson关于无理数连分数逼近的定理，该定理给出了满足特定条件的无理数被有理数逼近的误差上界。
Polyhedral Omega is a new algorithm for solving linear Diophantine systems (LDS), i.e., for computing a multivariate rational function representation of the set of all non-negative integer solutions to a system of linear equations and inequalities. Polyhedral Omega combines methods from partition analysis with methods from polyhedral geometry. In particular, we combine MacMahon's iterative approach based on the Omega operator and explicit formulas for its evaluation with geometric tools such as Brion decompositions and Barvinok's short rational function representations. In this way, we connect…
On the Sylvester program and Cayley algorithm for vector partition reduction
针对向量分拆约化的Sylvester程序，本文修改了原始Cayley算法以适配其系数条件不满足的情形，并将结果推广到任意数量的丢番图方程，完成向量分拆向标量分拆组合的约化。
We study Diophantine equations of type f(x)=g(y), where both f and g have at least two distinct critical points and equal critical values at at most two distinct critical points. Some classical families of polynomials (f_n)_n are such that f_n satisfies these assumptions for all n. Our results cover and generalize several results in the literature on the finiteness of integral solutions to such equations. In doing so, we analyse the properties of the monodromy groups of such polynomials. We show that if f has coefficients in a field K, at least two distinct critical points and all distinct cri…
We consider irrational fixed points of the Minkowski question mark function $? (x)$, that is irrational solutions of the equation $? (x)=x$. It is easy to see that there exist at least two such points. Although it is not known if there are other fixed points, we prove that the smallest and the greatest fixed points have irrationality measure exponent equal to 2. We give more precise results about the approximation properties of these fixed points. Moreover, in Appendix we introduce a condition from which it follows that there are only two irrational fixed points.
We show how to adapt the Hardy--Littlewood circle method to count monochromatic solutions to diagonal Diophantine equations. This delivers a lower bound which is optimal up to absolute constants. The method is illustrated on equations obtained by setting a diagonal quadratic form equal to a linear form. As a consequence, we determine an algebraic criterion for when such equations are partition regular. Our methods involve discrete harmonic analysis and require a number of `mixed' restriction estimates, which may be of independent interest.
Diophantine Graphs
本文提出丢番图标记的概念，研究最大图的边数，并利用数论技术分析顶点度数特性。
In this paper we consider Diophantine equations of the form $f(x)=g(y)$ where $f$ has simple rational roots and $g$ has rational coefficients. We give strict conditions for the cases where the equation has infinitely many solutions in rationals with a bounded denominator. We give examples illustrating that the given conditions are necessary. It turns out that such equations with infinitely many solutions are strongly related to Prouhet-Tarry-Escott tuples. In the special, but important case when $g$ has only simple rational roots as well, we can give a simpler statement. Also we provide an app…
We prove general sufficient and necessary conditions for the partition regularity of Diophantine equations, which extend the classic Rado's Theorem by covering large classes of nonlinear equations. Sufficient conditions are obtained by exploiting algebraic properties in the space of ultrafilters betaN, grounding on combinatorial properties of positive density sets and IP sets. Necessary conditions are proved by a new technique in nonstandard analysis, based on the use of the relation of u-equivalence for the hypernatural numbers *N.
The height of a rational number $p/q$ is denoted by $h(p/q)$ and equals $\text{max}(|p|,|q|)$ provided p/q is written in lowest terms. The height of a rational tuple $(x_1,...,x_n)$ is denoted by $h(x_1,...,x_n)$ and equals $\text{max}(h(x_1),...,h(x_n))$. Let $G_n={x_i+1=x_k: i,k \in {1,...,n}} \cup {x_i \cdot x_j=x_k: i,j,k \in {1,...,n}}$. Let $f(1)=1$, and let $f(n+1)=2^{(2^{(f(n))})}$ for every positive integer n. We conjecture: (1) if a system $S \subseteq G_n$ has only finitely many solutions in rationals $x_1,...,x_n$, then each such solution $(x_1,...,x_n)$ satisfies $h(x_1,...,x_n) \…
A Quantum Diophantine Equation Solution Finder
本文提出利用Grover量子搜索算法高效暴力求解丢番图方程，将方程变量映射为索引，并以最简单方程为例展示其优于经典方法的潜力。
Diophantine approximation with primes from short intervals
本文研究了短区间中素数在丢番图逼近中的渐进行为，证明了当素数p满足||pα||<δ时，其数量渐近等于2δY/log X。
In this paper, we consider the Diophantine equation $λ_1U_{n_1}+\ldots+λ_kU_{n_k}=wp_1^{z_1} \cdots p_s^{z_s},$ where $\{U_n\}_{n\geq 0}$ is a fixed non-degenerate linear recurrence sequence of order greater than or equal to 2; $w$ is a fixed non-zero integer; $p_1,\dots,p_s$ are fixed, distinct prime numbers; $λ_1,\dots,λ_k$ are strictly positive integers; and $n_1,\dots,n_k,z_1,\dots,z_s$ are non-negative integer unknowns. We prove the existence of an effectively computable upper-bound on the solutions $(n_1,\dots,n_k,z_1,\dots,z_s)$. In our proof, we use lower bounds for linear forms in log…
Science and mathematics help people better to understand world, eliminating different fallacies and misconceptions. One of such misconception is related to arithmetic, which is so important both for science and everyday life. People think that their counting is governed by the rules of the conventional arithmetic and that other kinds of arithmetic do not exist and cannot exist. It is demonstrated in this paper that this popular image of the situation with integer numbers is incorrect. In many situations, we have to utilize different rules of counting and operating. This is a consequence of the…
We study the Frobenius problem: given relatively prime positive integers a_1,...,a_d, find the largest value of t (the Frobenius number g(a_1,...,a_d)) such that m_1 a_1 + ... m_d a_d = t has no solution in nonnegative integers m_1,...,m_d. We introduce a method to compute upper bounds for g(a_1,a_2,a_3), which seem to grow considerably slower than previously known bounds. Our computations are based on a formula for the restricted partition function, which involves Dedekind-Rademacher sums, and the reciprocity law for these sums.
Using a recent result of Salberger, we establish the paucity of non-trivial positive integer solutions to a certain system of diagonal Diophantine equations.
On Cayley algorithm for double partition
针对双分拆问题中 Cayley 原始算法因条件不满足而失效的情况，本文提出其修改版本，以完成向标量分拆之和的归约。
The DPRM (Davis-Putnam-Robinson-Matiyasevich) theorem is the main step in the negative resolution of Hilbert's 10th problem. Almost three decades of work on the problem have resulted in several equally surprising results. These include the existence of diophantine equations with a reduced number of variables, as well as the explicit construction of polynomials that represent specific sets, in particular the set of primes. In this work, we formalize these constructions in the Mizar system. We focus on the set of prime numbers and its explicit representation using 10 variables. It is the smalles…
Unbounded knapsack problem and double partitions
本文将无界背包问题视为双重划分问题的特例，探讨了Sylvester和Cayley基于消元的方法的几何解释及其在背包问题中的应用。
We establish a new connection between metric Diophantine approximation and the parametric geometry of numbers by proving a variational principle facilitating the computation of the Hausdorff and packing dimensions of many sets of interest in Diophantine approximation. In particular, we show that the Hausdorff and packing dimensions of the set of singular $m\times n$ matrices are both equal to $mn \big(1-\frac1{m+n}\big)$, thus proving a conjecture of Kadyrov, Kleinbock, Lindenstrauss, and Margulis (preprint 2014) as well as answering a question of Bugeaud, Cheung, and Chevallier (preprint 2016…
In this paper we consider the Diophantine equation \begin{align*}b^k +\left(a+b\right)^k &+ \cdots + \left(a\left(x-1\right) + b\right)^k=\\ &=d^l + \left(c+d\right)^l + \cdots + \left(c\left(y-1\right) + d\right)^l, \end{align*} where $a,b,c,d,k,l$ are given integers. We prove that, under some reasonable assumptions, this equation has only finitely many integer solutions.
The subject matter of this work is the diophantine equation x^n+y^m=c(x^k)(y^l), where n,m,k,l,c are natural numbers.We investigate this equation from the point of view of positive integer solutions.A preliminary examination of sources such as reference[1](L.E.Dickson's History of the Theory of Numbers, Vol.II) and [2](W.Sierpinski's Elementary Theory of Numbers) shows that little or no material can be found regarding this diophantine equation.Note that when c=1, (x,y)=(1,1) is a solution regardless of the values of the exponents n,m,k,and l. In Section3, five results from number theory are li…
In this paper we study the Diophantine equation \begin{align*} b^k + \left(a+b\right)^k + &\left(2a+b\right)^k + \ldots + \left(a\left(x-1\right) + b\right)^k = \\ &y\left(y+c\right) \left(y+2c\right) \ldots \left(y+ \left(\ell-1\right)c\right), \end{align*} where $a,b,c,k,\ell$ are given integers under natural conditions. We prove some effective results for special values for $c,k$ and $\ell$ and obtain a general ineffective result based on Bilu-Tichy method.
Let $K$ be a one-variable function field over a field of constants of characteristic 0. Let $R$ be a holomorphy subring of $K$, not equal to $K$. We prove the following undecidability results for $R$: If $K$ is recursive, then Hilbert's Tenth Problem is undecidable in $R$. In general, there exist $x_1,...,x_n \in R$ such that there is no algorithm to tell whether a polynomial equation with coefficients in $\Q(x_1,...,x_n)$ has solutions in $R$.
Motivated by the study of integer partitions, we consider partitions of integers into fractions of a particular form, namely with constant denominators and distinct odd or even numerators. When numerators are odd, the numbers of partitions for integers smaller than the denominator form symmetric patterns. If the number of terms is restricted to $h$, then the nonzero terms of the generating function are unimodal, with the integer $h$ having the most partitions. Such properties can be applied to a particular class of nonlinear Diophantine equations. We also examine partitions with even numerator…
Diophantine analysis and Arthur's trace formula
本文利用阿瑟迹公式稳定化中的κ-轨道积分，建立了数域上齐性空间整点计数的渐近公式，并将其应用于特征多项式固定的整数矩阵计数问题，推广了Eskin-Mozes-Shah的结果。
Let $a,b,c$ be distinct positive integers. Set $M=a+b+c$ and $N=abc$. We give an explicit description of the Mordell-Weil group of the elliptic curve $\displaystyle E_{(M,N)}:y^2-Mxy-Ny=x^3$ over $\Q$. In particular we determine the torsion subgroup of $E_{(M,N)}(\Q)$ and show that its rank is positive. Furthermore there are infinitely many positive integers $M$ that can be written in $n$ different ways, $n\in\{2,3\}$, as the sum of three distinct positive integers with the same product $N$ and $E_{(M,N)}(\Q)$ has rank at least $n$.
Lagrange spectrum for Diophantine approximations of complex numbers with real part equal to one half
该研究在A. Schmidt相关定理启发下，刻画实部为1/2的复数的受限拉格朗日谱，推导其分形性质并证明满足特定逼近下界的复数集不可数。
Core abaci and Diophantine equations I: fundamental weight
本文定义并研究了任意电荷下的经典仿射类型核心abaci，通过关联核心abaci与权重及仿射威利群元素，证明了β的高度等于原子长度，并解决了广义开放问题，同时建立了经典仿射类型的丢番图方程，并证明某些类别的解由核心abaci完全参数化。
Using previous work by Merca, we show the partition function involving parts of k different magnitudes, shifted by the triangular numbers, equals the self convolution of the unrestricted partition function. We also provide a combinatorial proof of this result.
Let $μ\geq 2$ be a real number and let $\Mcal(μ)$ denote the set of real numbers approximable at order at least $μ$ by rational numbers. More than eighty years ago, Jarní k and, independently, Besicovitch established that the Hausdorff dimension of $\Mcal(μ)$ is equal to $2/μ$. We investigate the size of the intersection of $\Mcal(μ)$ with Ahlfors regular compact subsets of the interval $[0, 1]$. In particular, we propose a conjecture for the exact value of the dimension of $\Mcal(μ)$ intersected with the middle-third Cantor set and give several results supporting this conjecture. We especiall…
Two pairs of biquadrates with equal sums
本文提出新方法求解丢番图方程 $A^4+B^4=C^4+D^4$，得到次数为 $6n+3$（21、39、75）的新参数化解，不同于已知的 $6n+1$ 次解。
A conformal partition function ${\cal P}_n^m(s)$, which arose in the theory of Diophantine equations supplemented with additional restrictions, is concerned with {\it self-dual symmetric polynomials} -- reciprocal ${\sf R}^{\{m\}}_ {S_n}$ and skew-reciprocal ${\sf S}^{\{m\}}_{S_n}$ algebraic polynomials based on the polynomial invariants of the symmetric group $S_n$. These polynomials form an infinite commutative semigroup. Real solutions $λ_n(x_i)$ of corresponding algebraic Eqns have many important properties: homogeneity of 1-st order, duality upon the action of the conformal group ${\sf W}…
Ramanujan's congruence $p(5k+4) \equiv 0 \pmod 5$ led Dyson \cite{dyson} to conjecture the existence of a measure "rank" such that $p(5k+4)$ partitions of $5k+4$ could be divided into sub-classes with equal cardinality to give a direct proof of Ramanujan's congruence. The notion of rank was extended to rank differences by Atkin and Swinnerton-Dyer \cite{atkin}, who proved Dyson's conjecture. More recently, Mao proved several equalities and inequalities, leaving some as conjectures, for rank differences for partitions modulo 10 \cite{mao10} and for $M_2$ rank differences for partitions with no …
Inequalities and asymptotics for hook numbers in restricted partitions
本文研究了受限划分中钩数的渐进行为，通过渐近公式证明了奇数部分划分在平均意义上比不同部分划分有更多钩数。
Let $N(\leq m,n)$ denote the number of partitions of $n$ with rank not greater than $m$, and let $M(\leq m,n)$ denote the number of partitions of $n$ with crank not greater than $m$. Bringmann and Mahlburg observed that $N(\leq m,n)\leq M(\leq m,n)\leq N(\leq m+1,n)$ for $m<0$ and $1\leq n\leq 100$. They also pointed out that these inequalities can be restated as the existence of a re-ordering $τ_n$ on the set of partitions of $n$ such that $|\text{crank}(λ)|-|\text{rank}(τ_n(λ))|=0$ or $1$ for all partitions $λ$ of $n$, that is, the rank and the crank are nearly equal distributions over parti…
The exponential of the triangular matrix whose entries in the diagonal at distance $n$ from the principal diagonal are all equal to the sum of the inverse of the divisors of $n$ is the triangular matrix whose entries in the diagonal at distance $n$ from the principal diagonal are all equal to the number of partitions of $n$. A similar result is true for any pair of sequences satisfying a special recurrence.
We extend recent results of Ono and Raji, relating the number of self-conjugate $7$-core partitions to Hurwitz class numbers. Furthermore, we give a combinatorial explanation for the curious equality $2\operatorname{sc}_7(8n+1) = \operatorname{c}_4(7n+2)$. We also conjecture that an equality of this shape holds if and only if $t=4$, proving the cases $t\in\{2,3,5\}$ and giving partial results for $t>5$.
Franklin's identity generalizes Euler's identity and states that the number of partitions of $n$ with $j$ different parts divisible by $r$ equals the number of partitions of $n$ with $j$ repeated parts. In this article, we give a refinement of Franklin's identity when $j=1$. We prove Franklin's identity when $j=1$, $r=2$ for partitions with fixed perimeter, i.e., fixed largest hook. We also derive a Beck-type identity for partitions with fixed perimeter: the excess in the number of parts in all partitions into odd parts with perimeter $M$ over the number of parts in all partitions into distinc…
Identities involving partitions with distinct even parts and $4$-regular partitions
本文在已知不同偶数部分分拆数与4-正则分拆数相等的基础上，证明了一类受限的不同偶数部分分拆与受限4-正则分拆之间的恒等式。
On Glaisher's Partition Theorem
本文基于Glaisher定理，扩展了Euler的划分定理至m=3情况，引入新的划分函数并证明了相应的恒等式，同时给出了Glaisher乘积的新级数形式。
Asymptotics of Reciprocal Supernorm Partition Statistics
本文研究整数划分上超范数倒数之和的统计量，在大小、周长和最大部分三个系综下，证明其累积统计量均渐近于 e^γ log n。
This paper shows that the number of hooks of length k contained in all partitions of n equals k times the number of parts of length k in all partitions of n. It contains also formulas for the moments (under uniform distribution) of k-th parts in partitions of n.
Density of the multidimensional Lagrange spectrum
本文证明多维拉格朗日谱的闭包为0与其上确界的区间，利用丢番图逼近与幺模格空间动力学的对应关系，结合horosphere膨胀平移的均匀分布完成证明。
Euler's identity equates the number of partitions of any non-negative integer n into odd parts and the number of partitions of n into distinct parts. Beck conjectured and Andrews proved the following companion to Euler's identity: the excess of the number of parts in all partitions of n into odd parts over the number of parts in all partitions of n into distinct parts equals the number of partitions of n with exactly one even part (possibly repeated). Beck's original conjecture was followed by generalizations and so-called "Beck-type" companions to other identities. In this paper, we establish…
In this paper we refine a weighted partition identity of Alladi. We write explicit formulas of generating functions for the number of partitions grouped with respect to a partition statistic other than the norm. We tie our weighted results and the different statistics with the crank of a partition. In particular, we prove that the number of partitions into even number of distinct parts whose odd-indexed parts' sum is n is equal to the number of partitions of n with non-negative crank.
The number of partitions of n into parts divisible by a or b equals the number of partitions of n in which each part and each difference of two parts is expressible as a non-negative integer combination of a or b. This generalizes identities of MacMahon and Andrews. The analogous identities for three or more integers (in place of a,b) hold in certain cases.
Define a "nuclear partition" to be an integer partition with no part equal to one. In this study we prove a simple formula to compute the partition function $p(n)$ by counting only the nuclear partitions of $n$, a vanishingly small subset by comparison with all partitions of $n$ as $n\to \infty$. Variations on the proof yield other formulas for $p(n)$, as well as Ramanujan-like congruences and an application to parity of the partition function.
扫码添加微信好友，提出您的宝贵建议 👇
💡 备注请填写：网站反馈
发表机构由 AI 从论文文本抽取，如发现错误，欢迎反馈修正建议。