中文
相关论文

相关论文: Binary linear forms over finite sets of integers

200 篇论文

We present an algorithm for computing a separating linear form of a system of bivariate polynomials with integer coefficients, that is a linear combination of the variables that takes different values when evaluated at distinct (complex)…

符号计算 · 计算机科学 2014-01-21 Yacine Bouzidi , Sylvain Lazard , Marc Pouget , Fabrice Rouillier

A quadratic form f is said to have semigroup property if its values at points of the integer lattice form a semigroup under multiplication. A problem of V. Arnold is to describe all binary integer quadratic forms with semigroup property. If…

数论 · 数学 2007-05-23 Francesca Aicardi , Vladlen Timorin

We survey various classical results on invariants of polynomials, or equivalently, of binary forms, focussing on explicit calculations for invariants of polynomials of degrees 2, 3, 4.

历史与综述 · 数学 2011-02-18 Svante Janson

For a fixed integer $k \ge 0$, consider representations of positive integers as sums of binomial coefficients of the form $\binom{n}{k}$. While exact minimal bounds for the number of required summands are known only in a few low-dimensional…

组合数学 · 数学 2026-04-29 Alexander Povolotsky

In this article, we prove some factorization results for several classes of polynomials having integer coefficients, which in particular yield several classes of irreducible polynomials. Such classes of polynomials are devised by imposing…

数论 · 数学 2024-01-17 Jitender Singh , Rishu Garg

We show that for any polynomial $f$ from the integers to the integers, with positive leading coefficient and irreducible over the rationals, if $x$ is large enough then there is a string of $(\log x)(\log\log x)^{1/835}$ consecutive…

数论 · 数学 2023-11-01 Kevin Ford , Mikhail R. Gabdullin

This paper describes infinite sets of polynomial equations in infinitely many variables with the property that the existence of a solution or even an approximate solution for every finite subset of the equations implies the existence of a…

泛函分析 · 数学 2025-03-03 Melvyn B. Nathanson , David A. Ross

Our aim is to generalize the result that two generic complex line arrangements are equivalent. In fact for a line arrangement A we associate its defining polynomial, the product of a_ix+b_iy+c_i, so that A = (f=0). We prove that the…

几何拓扑 · 数学 2012-06-27 Arnaud Bodin

The expansion of bivariate polynomials is well-understood for sets with a linear-sized product set. In contrast, not much is known for sets with small sumset. In this work, we provide expansion bounds for polynomials of the form $f(x, y) =…

组合数学 · 数学 2024-10-29 Sanjana Das , Cosmin Pohoata , Adam Sheffer

In this paper, we prove that a binary definite quadratic form over F_q[t], where q is odd, is completely determined up to equivalence by the polynomials it represents up to degree 3m-2, where m is the degree of its discriminant. We also…

数论 · 数学 2011-11-15 Jean Bureau , Jorge Morales

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…

数论 · 数学 2024-04-18 Étienne Fouvry , Peter Koymans

Let $K$ be a number field, ${\mathcal O}_K$ its ring of integers, and $f(x, y) \in {\mathcal O}_K[x, y]$ a binary form with integer coefficents. For any given prime $p \in {\mathcal O}_K$ we determine explicitly a binary form $g$ (resp.…

数论 · 数学 2021-11-10 Elira Curri

Let $F(t,u)\equiv F(u)$ be a formal power series in $t$ with polynomial coefficients in $u$. Let $F\_1, ..., F\_k$ be $k$ formal power series in $t$, independent of $u$. Assume all these series are characterized by a polynomial equation $$…

组合数学 · 数学 2008-05-05 Mireille Bousquet-Mélou , Arnaud Jehanne

In 2008, M. Marshall settled a long-standing open problem by showing that if f(x,y) is a polynomial that is non-negative on the strip [0,1] x R, then there exist sums of squares s(x,y) and t(x,y) such that f(x,y) = s(x,y) + (x - x^2)…

代数几何 · 数学 2010-09-21 Ha Nguyen , Victoria Powers

A natural number N is said to be palindromic if its binary representation reads the same forwards and backwards. In this paper we study the quotients of two palindromic numbers and answer some basic questions about the resulting sets of…

数论 · 数学 2022-03-01 James Haoyu Bai , Joseph Meleshko , Samin Riasat , Jeffrey Shallit

A sequence of nonzero integers $f = (f_1, f_2, \dots)$ is ``binomid'' if every $f$-binomid coefficient $\left[\! \begin{array}{c} n \\ k \end{array}\! \right]_f$ is an integer. Those terms are the generalized binomial coefficients: \[…

数论 · 数学 2023-02-07 Daniel B. Shapiro

Let a polynomial $f \in \mathbb{Z}[X_1,\ldots,X_n]$ be given. The square sieve can provide an upper bound for the number of integral $\mathbf{x} \in [-B,B]^n$ such that $f(\mathbf{x})$ is a perfect square. Recently this has been generalized…

数论 · 数学 2026-03-25 Dante Bonolis , Lillian B. Pierce

In this article, we give a formula for the generalization of the binomial coefficient to the complex numbers as a linear combination of $\sinc$ functions. We then give a general formula to compute the integral on the real line of the…

历史与综述 · 数学 2021-04-27 Lorenzo David

For each integer $d\ge 4$, we study the sequence of positive integers which are represented by one at least of the cyclotomic binary forms $\Phi_n(X,Y)$, with $n$ a positive integer satisfying $\varphi(n)\ge d$. The case $d=2$ was studied…

数论 · 数学 2019-09-05 Etienne Fouvry , Michel Waldschmidt

In this paper we prove a characterization of continuity for polynomials on a normed space. Namely, we prove that a polynomial is continuous if and only if it maps compact sets into compact sets. We also provide a partial answer to the…