English
Related papers

Related papers: On the $p$-adic valuation of third order linear re…

200 papers

A "truncation" of Pascal's triangle is a triangular array of numbers that satisfies the usual Pascal recurrence but with a boundary condition that declares some terminal set of numbers along each row of the array to be zero. Presented here…

Combinatorics · Mathematics 2018-07-27 Robert G. Donnelly , Molly W. Dunkum , Courtney George , Stefan Schnake

We consider equations of the form $a_{1}x_{1}^{k}+...+a_{s}x_{s}^{k}$ and when they have solutions in the primes. We define an analogue of the Hasse principle for solubility in the primes (which we call the prime Hasse principle), and prove…

Number Theory · Mathematics 2026-05-14 Philippa Holdridge

An infinite sequence $\langle{u_n}\rangle_{n\in\mathbb{N}}$ of real numbers is holonomic (also known as P-recursive or P-finite) if it satisfies a linear recurrence relation with polynomial coefficients. Such a sequence is said to be…

The Tribonacci sequence $\mathbb{T}$ is the fixed point of the substitution $\sigma(a,b,c)=(ab,ac,a)$. The main result is twofold: (1) we give the explicit expressions of the numbers of distinct squares and cubes in $\mathbb{T}[1,n]$ (the…

Dynamical Systems · Mathematics 2016-06-08 Huang Yuke , Wen Zhiying

We consider the decidability and complexity of the Ultimate Positivity Problem, which asks whether all but finitely many terms of a given rational linear recurrence sequence (LRS) are positive. Using lower bounds in Diophantine…

Computational Complexity · Computer Science 2017-04-07 Joel Ouaknine , James Worrell

In this article, we investigate the $p$-adic valuation $\nu_p$ of quantities such as the factorial $n!$, the hyperfactorial $H(n)$ or the superfactorial $\mathrm{sf}(n)$. In particular, we obtain simple bounds (both upper and lower) for…

Number Theory · Mathematics 2024-08-02 Jean-Christophe Pain

We investigate certain finiteness questions that arise naturally when studying approximations modulo prime powers of p-adic Galois representations coming from modular forms. We link these finiteness statements with a question by K. Buzzard…

Number Theory · Mathematics 2017-05-17 Ian Kiming , Nadim Rustom , Gabor Wiese

Let $n,k\in\mathbb{N}$ and let $p_{n}$ denote the $n$th prime number. We define $p_{n}^{(k)}$ recursively as $p_{n}^{(1)}:=p_{n}$ and $p_{n}^{(k)}=p_{p_{n}^{(k-1)}}$, that is, $p_{n}^{(k)}$ is the $p_{n}^{(k-1)}$th prime. In this note we…

Number Theory · Mathematics 2022-01-06 Błażej Żmija

The degree sequence of the algebraic numbers in an algebraic linear recurrence sequence is shown to be virtually periodic. This is proved using the Skolem-Mahler-Lech theorem. It has applications to the degree sequence and the minimal…

Number Theory · Mathematics 2020-10-01 Daqing Wan , Hang Yin

Denote by p_k the k-th power sum symmetric polynomial n variables. The interpretation of the q-analogue of the binomial coefficient as Hilbert function leads us to discover that n consecutive power sums in n variables form a regular…

Commutative Algebra · Mathematics 2018-08-30 Aldo Conca , Christian Krattenthaler , Junzo Watanabe

Fox's conjecture (1962) states that the sequence of absolute values of the coefficients of the Alexander polynomial of alternating links is trapezoidal. While the conjecture remains open in general, a number of special cases have been…

Combinatorics · Mathematics 2025-12-16 Karola Mészáros , Melissa Sherman-Bennett , Alexander Vidinas

The invariants of solvable triangular Lie algebras with one nilindependent diagonal element are studied exhaustively. Bases of the invariant sets of all such algebras are constructed using an original algebraic algorithm based on Cartan's…

Mathematical Physics · Physics 2018-04-03 Vyacheslav Boyko , Jiri Patera , Roman O. Popovych

Let $(U_n)_{n\geq 0}$ be a fixed linear recurrence sequence of integers with order at least two, and for any positive integer $\ell$, let $\ell \cdot 2^{\ell} + 1$ be a Cullen number. Recently in \cite{bmt}, generalized Cullen numbers in…

Number Theory · Mathematics 2020-10-21 Nabin Kumar Meher , Sudhansu Sekhar Rout

We study diophantine equations of the form ${a_1 + \ldots + a_n = 0}$ where the $a_i$'s are assumed to be coprime and to satisfy certain subsum conditions. We are interested in the limit superior of the qualities of the admissible solutions…

Number Theory · Mathematics 2025-07-17 Rupert Hölzl , Sören Kleine , Frank Stephan

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

For a fixed $p \in \mathbb{N}$, sequences of polynomials $\{P_n\}$, $n \in \mathbb{N}$, defined by a $(p+2)$-term recurrence relation are related to several topics in Approximation Theory. A $(p+2)$-banded matrix $J$ determines the…

Functional Analysis · Mathematics 2019-10-09 D. Barrios Rolanía , J. C. García-Ardila , D. Manrique

We consider Weil sums of binomials of the form $W_{F,d}(a)=\sum_{x \in F} \psi(x^d-a x)$, where $F$ is a finite field, $\psi\colon F\to {\mathbb C}$ is the canonical additive character, $\gcd(d,|F^\times|)=1$, and $a \in F^\times$. If we…

Number Theory · Mathematics 2015-03-18 Daniel J. Katz , Philippe Langevin

In 1876 Brocard, and independently in 1913 Ramanujan, asked to find all integer solutions for the equation $n!=x^2-1$. It is conjectured that this equation has only three solutions, but up to now this is an open problem. Overholt observed…

Number Theory · Mathematics 2023-09-26 Saša Novaković

The trinomial transform of a sequence is a generalization of the well-known binomial transform, replacing binomial coefficients with trinomial coefficients. We examine Pascal-like triangles under trinomial transform, focusing on the ternary…

Number Theory · Mathematics 2021-04-01 László Németh

We give an alternative proof of Faltings's theorem (Mordell's conjecture): a curve of genus at least two over a number field has finitely many rational points. Our argument utilizes the set-up of Faltings's original proof, but is in spirit…

Number Theory · Mathematics 2019-10-29 Brian Lawrence , Akshay Venkatesh