English
Related papers

Related papers: Representation of Unity by Binary Forms

200 papers

Let $\rho: SL(2,\mathbb{Z})\to GL(2,\mathbb{C})$ be an irreducible representation of the modular group such that $\rho(T)$ has finite order $N$. We study holomorphic vector-valued modular forms $F(\tau)$ of integral weight associated to…

Number Theory · Mathematics 2010-09-07 Geoffrey Mason

The present work includes some of the author's original researches on integer solutions of Diophantine liner equations and systems. The notion of "general integer solution" of a Diophantine linear equation with two unknowns is extended to…

General Mathematics · Mathematics 2007-11-28 Florentin Smarandache

Given a binary form $F \in \mathbb{Z}[X, Y]$, we define its value set to be $\{F(x, y) : (x, y) \in \mathbb{Z}^2\}$. Let $F, G \in \mathbb{Z}[X, Y]$ be two binary forms of degree $d \geq 3$ and with non-zero discriminant. In a series of…

Number Theory · Mathematics 2024-04-18 Étienne Fouvry , Peter Koymans

We provide upper bounds on the total number of irreducible factors, and in particular irreducibility criteria for some classes of bivariate polynomials $f(x,y)$ over an arbitrary field $\mathbb{K}$. Our results rely on information on the…

Number Theory · Mathematics 2025-03-04 Nicolae Ciprian Bonciocat , Rishu Garg , Jitender Singh

We study connections between linear equations over various semigroups and recursively enumerable sets of positive integers. We give variants of the universal Diophantine representation of recursively enumerable sets of positive integers…

Formal Languages and Automata Theory · Computer Science 2024-06-04 Juha Honkala

A Thue-Mahler equation is a Diophantine equation of the form $$F(X,Y) = a\cdot p_1^{z_1}\cdots p_v^{z_v}, \qquad \gcd(X,Y)=1$$ where $F$ be an irreducible homogeneous binary form of degree at least $3$ with integer coefficients, $a$ is a…

Number Theory · Mathematics 2025-03-26 Adela Gherga , Samir Siksek

Given a suitable arithmetic function h, we investigate the average order of h as it ranges over the values taken by an integral binary form F. A general upper bound is obtained for this quantity, in which the dependence upon the…

Number Theory · Mathematics 2015-06-26 R. de la Breteche , T. D. Browning

Let k => 1, m => 1 be small fixed integers, gcd(k, m) = 1. This note develops some techniques for proving the existence of infinitely many primes solutions x = p, and y = q of the linear Diophantine equation y = mx + k.

General Mathematics · Mathematics 2014-04-04 N. A. Carella

Let $F(x)$ be an irreducible polynomial with integer coefficients and degree at least 2. For $x\ge z\ge y\ge 2$, denote by $H_F(x, y, z)$ the number of integers $n\le x$ such that $F(n)$ has at least one divisor $d$ with $y<d\le z$. We…

Number Theory · Mathematics 2022-07-05 Kevin Ford , Guoyou Qian

We present a concept of uniform encodability of theories and develop tools related to this concept. As an application we obtain general undecidability results which are uniform for large families of structures. In the way, we define…

Logic · Mathematics 2010-12-07 Hector Pasten , Thanases Pheidas , Xavier Vidaux

In this paper, we prove that a Thue equation F(x,y) = h, where h is an integer and F is a polynomial of degree n with integer coefficients and without repeated roots, has at most 2n^3 - 2n - 3 solutions provided that the Mordell-Weil rank…

Number Theory · Mathematics 2007-05-23 Dino Lorenzini , Thomas J. Tucker

In this paper, we solve Diophantine equation in the tittle in nonnegative integers m,n, and a. In order to prove our result, we use lower bounds for linear forms in logarithms and and a version of the Baker-Davenport reduction method in…

Number Theory · Mathematics 2018-01-01 Zafer Şiar , Refik Keskin

Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…

Symbolic Computation · Computer Science 2026-01-14 Louis Gaillard

Binary quadratic Diophantine equations are of interest from the viewpoint of computational complexity theory. They contain as special cases many examples of natural problems apparantly occupying intermediate stages in the P-NP hierarchy,…

Number Theory · Mathematics 2011-08-02 J. C. Lagarias

Recently, the authors showed that for every irrational number $\alpha$, there exist infinitely many positive integers $n$ represented by any given positive definite binary quadratic form $Q$, satisfying $||\alpha n||<n^{-(1/2-\varepsilon)}$…

Number Theory · Mathematics 2026-02-04 Stephan Baier , Habibur Rahaman

Let Q be a non-singular quadratic form with integer coefficients. When Q is indefinite we provide new upper bounds for the least non-trivial integral solution to the equation Q=0. When Q is positive definite we provide improved upper bounds…

Number Theory · Mathematics 2014-02-26 T. D. Browning , R. Dietmann

Let $q$ be a power of a prime $p$, $G$ be a finite abelian group, where $p$ does not divide $|G|$,and let $n$ be a positive integer. In this paper we find a formula for the number of irreducible representations of $G$ of a given dimension…

Group Theory · Mathematics 2025-04-18 Thomas Breuer , Prashun Kumar , Geetha Venkataraman

Let $K$ be a totally real number field of degree $n$ over $\mathbb{Q}$, with discriminant and regulator $\Delta_K, R_K$ respectively. In this paper, using a similar method to van Woerden, we prove that the number of classes of perfect unary…

Number Theory · Mathematics 2022-08-08 Christian Porter , Andrew Mendelsohn

Let F(x_1,...,x_m) = u_1 x_1 + ... + u_m x_m be a linear form with nonzero, relatively prime integer coefficients u_1,..., u_m. For any set A of integers, let F(A) = {F(a_1,...,a_m) : a_i in A for i=1,...,m}. The representation function…

Number Theory · Mathematics 2021-01-06 Melvyn B. Nathanson

Let $A,B,C,D$ be rational numbers such that $ABC \neq 0$, and let $n_1>n_2>n_3>0$ be positive integers. We solve the equation $$ Ax^{n_1}+Bx^{n_2}+Cx^{n_3}+D = f(g(x)),$$ in $f,g \in \mathbb{Q}[x]$. In sequel we use Bilu-Tichy method to…

Number Theory · Mathematics 2015-12-10 Maciej Gawron
‹ Prev 1 4 5 6 7 8 10 Next ›