Related papers: $ S $-unit values of $ G_n + G_m $ in function fie…

In this article, we use Pad\'{e} approximations constructed for binomial functions, to give a new upper bound for the number of the solutions of the $S$-unit equation. Combining explicit formulae of these Pad\'{e} approximants with a simple…

Let S be a subset of the unit disk, and let F(s) denote the class of completely multiplicative functions f such that f(p) is in S for all primes p. The authors' main concern is which numbers arise as mean-values of functions in F(s). More…

Let $q$ be a power of a prime and let $\mathbb{F}_q$ be the finite field consisting of $q$ elements. We establish new explicit estimates on Gauss sums of the form $S_n(a) = \sum_{x\in \mathbb{F}_q}\psi_a(x^n)$, where $\psi_a$ is a…

For a wide class of integer linear recurrence sequences $\left(u(n)\right)_{n=1}^\infty$, we give an upper bound on the number of $s$-tuples $\left(n_1, \ldots, n_s\right) \in \left(\mathbb Z\cap [M+1,M+ N]\right)^s$ such that the…

Let $\{U_n\}_{n \geqslant 0}$ and $\{G_m\}_{m \geqslant 0}$ be two linear recurrence sequences defined over the integers. We establish an asymptotic formula for the number of integers $c$ in the range $[-x, x]$ which can be represented as…

We establish uniform bounds on the multiplicities of irreducible admissible representations appearing in spaces of functions on symmetric spaces over $p$-adic fields. These multiplicities can exceed one and depend intricately on the group,…

For any field k and any integers m,n with 0 <= 2m <= n+1, let W_n be the k-vector space of sequences (x_0,...,x_n), and let H_m be the subset of W_n consisting of the sequences that satisfy a degree-m linear recursion, that is, for which…

A complex unit gain graph is a triple $\varphi=(G, \mathbb{T}, \varphi)$ (or $G^{\varphi}$ for short) consisting of a simple graph $G$, as the underlying graph of $G^{\varphi}$, the set of unit complex numbers $\mathbb{T}={z\in \mathbb{C}:…

We present a uniform description of sets of $m$ linear forms in $n$ variables over the field of rational numbers whose computation requires $m(n - 1)$ additions.

A universal process of a process calculus is one that, given the G\"{o}del index of a process of a certain type, produces a process equivalent to the encoded process. This paper demonstrates how universal processes can be formally defined…

Based on results obtained in a companion paper [MSRI preprint 1997-002], we construct groups of special $S$--units for function fields of characteristic $p>0$, and show that they satisfy Gras--type Conjectures. We use these results in order…

In this short note, we derive an upper-bound for the sum of two comparison functions, namely for the sum of a class K and an extended class K function. To the best of our knowledge, the relations derived in this note have not been…

We prove that every nonnegative continuous real-valued function on a given compact metric space is the uniform limit of some increasing sequence of nonnegative simple functions being linear combinations of indicators of open sets; here the…

Recent attempts at studying the Fermat equation over number fields have uncovered an unexpected and powerful connection with $S$-unit equations. In this expository paper we explain this connection and its implications for the asymptotic…

We study one-parameter families of S-unit equations of the form f(t)u+g(t)v=h(t), where f, g, and h are univariate polynomials over a number field, t is an S-integer, and u and v are S-units. For many possible choices of f, g, and h, we are…

Let $s_0,s_1,s_2,\ldots$ be a sequence of rational numbers whose $m$th divided difference is integer-valued. We prove that $s_n$ is a polynomial function in $n$ if $s_n \ll \theta^n$ for some positive number $\theta$ satisfying $\theta <…

Let G be a simple finite graph such that each vertex has an integer value and different vertices have different values. Let S be a finite non-empty set of primes. We call G an S-graph if any two vertices are connected by an edge if and only…

We give a short proof of polynomial recurrence with large intersection for additive actions of finite-dimensional vector spaces over countable fields on probability spaces, improving upon the known size and structure of the set of strong…

A Cullen number is a number of the form $m2^m+1$, where $m$ is a positive integer. In 2004, Luca and St\u anic\u a proved, among other things, that the largest Fibonacci number in the Cullen sequence is $F_4=3$. Actually, they searched for…

A function $f$ on a topological space is sequentially continuous at a point $u$ if, given a sequence $(x_{n})$, $\lim x_{n}=u$ implies that $\lim f(x_{n})=f(u)$. This definition was modified by Connor and Grosse-Erdmann for real functions…