English
Related papers

Related papers: Erd\H{o}s' Multiplication Table Problem for Functi…

200 papers

For systems of equations with an infinite set of roots, one can sometimes obtain Kushnirenko-Bernstein-Khovanskii type theorem if replace the number of roots by their asymptotic density. We consider systems of entire functions with…

Complex Variables · Mathematics 2023-12-12 B. Kazarnovskii

While solving a special case of a question of Erd\H{o}s and Graham Steinerberger asks for all integers $n$ with $\phi(n)=\frac{2}{3} \cdot (n+1)$. He discovered the solutions $n\in\{5, 5 \cdot 7, 5\cdot 7\cdot 37, 5\cdot 7\cdot 37\cdot…

Number Theory · Mathematics 2025-04-29 Christian Hercher

We study the complexity of polynomial multiplication over arbitrary fields. We present a unified approach that generalizes all known asymptotically fastest algorithms for this problem. In particular, the well-known algorithm for…

Computational Complexity · Computer Science 2010-10-07 Alexey Pospelov

Let m be a positive integer, and let A be the set of all positive integers that belong to a union of r distinct congruence classes modulo m. We assume that the elements of A are relatively prime, that is, gcd(A) = 1. Let p_A(n) denote the…

Number Theory · Mathematics 2007-05-23 Melvyn B. Nathanson

A positroid is a matroid realized by a matrix such that all maximal minors are non-negative. Positroid polytopes are matroid polytopes of positroids. In particular, they are lattice polytopes. The Ehrhart polynomial of a lattice polytope…

Combinatorics · Mathematics 2025-01-20 Yuhan Jiang

We consider the problem of finding a sparse multiple of a polynomial. Given f in F[x] of degree d over a field F, and a desired sparsity t, our goal is to determine if there exists a multiple h in F[x] of f such that h has at most t…

Symbolic Computation · Computer Science 2011-01-04 Mark Giesbrecht , Daniel S. Roche , Hrushikesh Tilak

Let $P$ and $T$ be disjoint sets of prime numbers with $T$ finite. A simple formula is given for the natural density of the set of square-free numbers which are divisible by all of the primes in $T$ and by none of the primes in $P$. If $P$…

Number Theory · Mathematics 2021-02-12 Ron Brown

Green and Tao famously proved in 2005 that any subset of the primes of fixed positive density contains arbitrarily long arithmetic progressions. Green had previously shown that in fact any subset of the primes of relative density tending to…

Number Theory · Mathematics 2019-06-14 Luka Rimanic , Julia Wolf

We give a conjecture for the asymptotic growth rate of the number of indecomposable summands in the tensor powers of representations of finite monoids, expressing it in terms of the (Brauer) character table of the monoid's group of units.…

Representation Theory · Mathematics 2026-04-07 David He , Daniel Tubbenhauer

We fill the gaps in A. Gica's determination of all the odd positive integers $d$ for which the number of distinct prime divisors of $f_d(x)=d+x^2$ is less than or equal to $2$ for all the positive and odd integers $x\leq\sqrt{d}$. We also…

Number Theory · Mathematics 2025-11-20 Stéphane Louboutin

The Mondrian problem consists of dissecting a square of side length $n\in \NN$ into non-congruent rectangles with natural length sides such that the difference $d(n)$ between the largest and the smallest areas of the rectangles partitioning…

Combinatorics · Mathematics 2020-07-21 C. Dalfó , M. A. Fiol , N. López

One of the most important statistics in studying the zeros of L-functions is the 1-level density, which measures the concentration of zeros near the central point. Fouvry and Iwaniec [FI] proved that the 1-level density for L-functions…

Number Theory · Mathematics 2010-03-30 Steven J. Miller , Ryan Peckner

We prove that if $f(n)$ is a Steinhaus or Rademacher random multiplicative function, there almost surely exist arbitrarily large values of $x$ for which $|\sum_{n \leq x} f(n)| \geq \sqrt{x} (\log\log x)^{1/4+o(1)}$. This is the first such…

Number Theory · Mathematics 2021-01-01 Adam J. Harper

We discuss interrelations between: Cohn localizations of full square matrices; a Leavitt localization of a row; and the Jacobson quasi-inverses of quasi-regular elements. The latter Jacobson localizations appear naturally and easily in…

Rings and Algebras · Mathematics 2025-10-07 Pham Ngoc Anh

We develop a parametric approach to study the Diophantine equation $\frac{k}{n} = \frac{1}{x} + \frac{1}{y} + \frac{1}{z}$, underlying the Erd\H{o}s--Straus ($k=4$), Sierpi\'nski ($k=5$), and related generalizations. We introduce and…

Number Theory · Mathematics 2026-03-24 Philemon Urbain Mballa

We propose a conjecture on the density of arithmetic points in the deformation space of representations of the \'etale fundamental group in positive characteristic. This? conjecture has applications to \'etale cohomology theory, for example…

Algebraic Geometry · Mathematics 2025-04-16 Hélène Esnault , Moritz Kerz

Although in general there is no meaningful concept of factorization in fields, that in free associative algebras (over a commutative field) can be extended to their respective free field (universal field of fractions) on the level of…

Rings and Algebras · Mathematics 2020-07-15 Konrad Schrempf

We consider integer recurrences of the form a_n = f(a_{n-1}), where f is a quadratic polynomial with integer coefficients. We show, for four infinite families of f, that the set of primes dividing at least one term of such a sequence must…

Number Theory · Mathematics 2014-02-26 Rafe Jones

Let $K$ be a function field of a curve in characteristic zero or a number field over which the $abc$-conjecture holds, fix $\alpha\in K$, and let $f_{d,c}(x)=x^d+c$ for some $d\geq2$ and some $c\in K$. Then for many $c$ and $d$, we prove…

Number Theory · Mathematics 2025-08-11 Wade Hindes

We use recurrence equations (alias difference equations) to enumerate the number of formula-representations of positive integers using only addition and multiplication, and using addition, multiplication, and exponentiation, where all the…

Combinatorics · Mathematics 2013-06-25 Edinah K. Gnang , Doron Zeilberger