English
Related papers

Related papers: A generalization of Gauss' triangular theorem

200 papers

Let R be an integral domain and let f(X) be a nonzero polynomial in R[X]. The content of f is the ideal c(f) generated by the coefficients of f. The polynomial f(X) is called Gaussian if c(fg)=c(f)c(g) for all g(X) in R[X]. It is well known…

Commutative Algebra · Mathematics 2007-05-23 K. Alan Loper , Moshe Roitman

Rowland found a matrix product formula for generating functions counting binomial coefficients by their $p$-adic valuations. A natural generalization of binomial coefficients was introduced by Knuth and Wilf defined by a sequence $C$. We…

Number Theory · Mathematics 2025-08-27 Arav Chand

We show that tautological integrals on Hilbert schemes of points can be written in terms of universal polynomials in Chern numbers. The results hold in all dimensions, though they strengthen known results even for surfaces by allowing…

Algebraic Geometry · Mathematics 2017-02-15 Jørgen Vold Rennemo

We resolve the Ramsey problem for $\{x,y,z:x+y=p(z)\}$ for all polynomials $p$ over $\mathbb{Z}$. In particular, we characterise all polynomials that are $2$-Ramsey, that is, those $p(z)$ such that any $2$-colouring of $\mathbb{N}$ contains…

Number Theory · Mathematics 2023-01-10 Hong Liu , Péter Pál Pach , Csaba Sándor

The functional equation f(p(z))=g(q(z)) is studied, where p,q are polynomials and f,g are trancendental meromorphic functions in C. We find all the pairs p,q for which there exist nonconstant f,g satisfying our equation and there exist no…

Dynamical Systems · Mathematics 2015-06-26 Sergei Lysenko

A generalized central trinomial coefficient $T_n(b,c)$ is the coefficient of $x^n$ in the expansion of $(x^2+bx+c)^n$ with $b,c\in\mathbb Z$. In this paper we investigate congruences and series for sums of terms related to central binomial…

Number Theory · Mathematics 2014-10-23 Zhi-Wei Sun

Given a global field $K$ and a positive integer $n$, we present a diophantine criterion for a polynomial in one variable of degree $n$ over $K$ not to have any root in $K$. This strengthens the known result that the set of non-$n$-th-powers…

Number Theory · Mathematics 2019-02-20 Philip Dittmann

In this paper, we consider the following $(A, B)$-polynomial $f$ over finite field: $$f(x_0,x_1,\cdots,x_n)=x_0^Ah(x_1,\cdots,x_n)+g(x_1,\cdots,x_n)+P_B(1/x_0),$$ where $h$ is a Deligne polynomial of degree $d$, $g$ is an arbitrary…

Number Theory · Mathematics 2021-08-31 Liping Yang , Hao Zhang

Let $K$ be a field. In this article, we derive a formula for the discriminant of a sequence $\{r_{A,n}+c r_{A,n-1}\}$ of polynomials. Here, $c \in K$ and $\{r_{A,n} \}$ is a sequence of polynomials satisfying a certain recurrence relation…

Number Theory · Mathematics 2023-03-29 Hideki Matsumura

A (positive definite integral) quadratic form is called almost 2-universal if it represents all (positive definite integral) binary quadratic forms except those in only finitely many equivalence classes. Oh [7] determined all almost…

Number Theory · Mathematics 2019-01-25 Myeong Jae Kim

The Fibonacci polynomials are defined recursively as $f_{n}(x)=xf_{n-1}(x)+f_{n-2}(x)$, where $f_0(x) = 0$ and $f_1(x)= 1$. We generalize these polynomials to an arbitrary number of variables with the $r$-Fibonacci polynomial. We extend…

Combinatorics · Mathematics 2023-09-18 Sejin Park , Etienne Phillips , Peikai Qi , Ilir Ziba , Zhan Zhan

An integral quadratic lattice is called indefinite $k$-universal if it represents all integral quadratic lattices of rank $k$ for a given positive integer $k$. For $k\geq 3$, we prove that the indefinite $k$-universal property satisfies the…

Number Theory · Mathematics 2023-06-06 Zilong He , Yong Hu , Fei Xu

Square roots $s$ of sums of $M$ consecutive integer squares starting from $a^{2}\geq1$ are integers if $M\equiv0,9,24$ or $33(mod\,72)$; or $M\equiv1,2$ or $16(mod\,24)$; or $M\equiv11(mod\,12)$ and cannot be integers if $M\equiv3,5,6,7,8$…

Number Theory · Mathematics 2014-09-30 Vladimir Pletser

Let us denote by $F_n$ the $n$-th Fibonacci number. In this paper we show that for a fixed integer $y$ there exists at most one integer exponent $a>0$ such that the Diophantine equation $F_n+F_m=y^a$ has a solution $(n,m,a)$ in positive…

Number Theory · Mathematics 2021-03-29 Volker Ziegler

Let F be a perfect field. Then the diagonal quadratic form $a_iX_i^2$ over $F$ is universal over $M_2(F)$ if and only if atleast two of the $a_i$ are non-zero.

Number Theory · Mathematics 2020-04-20 Murtuza Nullwala , Anuradha S. Garge

We present a new form and a short full proof of explicit two-sided estimates for the distribution function F_{n,p}(x) of the binomial law from the paper published by D.Alfers and H.Dinges in 1984. These inequalities are universal (valid for…

Probability · Mathematics 2012-09-03 Andrey M. Zubkov , Alexander A. Serov

Building on the works of Mordell (1952) and Schinzel (2015), we prove that cubic diophantine equations $xyz=G(x,y)$ have infinitely many solutions.

Number Theory · Mathematics 2024-12-17 János Kollár , Jennifer Li

We prove that for given integers b and c, the diophantine equation x^2+bx+c=y^2, has finitely many integer solutions(i.e. pairs in ZxZ),in fact an even number of such solutions(including the zero or no solutions case).We also offer an…

General Mathematics · Mathematics 2008-03-28 Konstantine "Hermes" Zelator

In this paper, we extend recent work of the third author and Ziegler on triples of integers $(a,b,c)$, with the property that each of $(a,b,c)$, $(a+1,b+1,c+1)$ and $(a+2,b+2,c+2)$ is multiplicatively dependent, completely classifying such…

Number Theory · Mathematics 2024-11-21 Michael A. Bennett , István Pink , Ingrid Vukusic

In a recent paper \cite{Jan}, Jankauskas proved some interesting results concerning the reducibility of quadrinomials of the form $f(4,x)$, where $f(a,x)=x^{n}+x^{m}+x^{k}+a$. He also obtained some examples of reducible quadrinomials…

Number Theory · Mathematics 2013-10-22 Andrew Bremner , Maciej Ulas