English
Related papers

Related papers: Positivity of arbitrary-order P-recursive sequence…

200 papers

In this paper, we will show that the $p$-adic valuation (where $p$ is a given prime number) of some type of rational numbers is unusually large. This generalizes the very recent results by the author and by A. Dubickas, which are both…

Number Theory · Mathematics 2022-12-02 Bakir Farhi

We consider an extension of first-order logic with a recursion operator that corresponds to allowing formulas to refer to themselves. We investigate the obtained language under two different systems of semantics, thereby obtaining two…

Logic · Mathematics 2022-07-18 Reijo Jaakkola , Antti Kuusisto

We characterize the finite groups of minimal order that admit an irreducible complex character of degree $p$ or $p^2$, where $p$ is a prime.

Group Theory · Mathematics 2025-08-04 Asier Arranz

The initial-values problem of the following nonlinear autonomous recursion of order p , z (s + p) = c product of [z (s + l)]^a_l ; with p an arbitrary positive integer, z (s) the dependent variable (possibly a complex number), s the…

Dynamical Systems · Mathematics 2021-12-01 Francesco Calogero , Farrin Payandeh

We consider a type of long-range percolation problem on the positive integers, motivated by earlier work of others on the appearance of (in)finite words within a site percolation model. The main issue is whether a given infinite binary word…

Probability · Mathematics 2008-07-11 Geoffrey R. Grimmett , Thomas M. Liggett , Thomas Richthammer

For a 4th order 3-dimensional symmetric tensor with its some entries $1$ or $-1$, we show the analytic sufficient and necessary conditions of its positive definiteness. By applying these conclusions, several strict inequalities is bulit for…

Classical Analysis and ODEs · Mathematics 2024-08-27 Yisheng Song

We study the termination problem for probabilistic term rewrite systems. We prove that the interpretation method is sound and complete for a strengthening of positive almost sure termination, when abstract reduction systems and term rewrite…

Symbolic Computation · Computer Science 2018-02-28 Martin Avanzini , Ugo Dal Lago , Akihisa Yamada

We describe new, simple, recursive methods of construction for orientable sequences over an arbitrary finite alphabet, i.e. periodic sequences in which any sub-sequence of n consecutive elements occurs at most once in a period in either…

Combinatorics · Mathematics 2026-03-20 Abbas Alhakim , Chris J. Mitchell , Janusz Szmidt , Peter R. Wild

Let $P^+(n)$ denote the largest prime factor of the integer $n$ and $P_y^+(n)$ denote the largest prime factor $p$ of $n$ which satisfies $p\leqslant y$. In this paper, firstly we show that the triple consecutive integers with the two…

Number Theory · Mathematics 2018-04-11 Zhiwei Wang

A positive linear recurrence sequence (PLRS) is a sequence defined by a homogeneous linear recurrence relation with positive coefficients and a particular set of initial conditions. A sequence of positive integers is \emph{complete} if…

The usual stochastic order and the likelihood ratio order between probability distributions on the real line are reviewed in full generality. In addition, for the distribution of a random pair $(X,Y)$, it is shown that the conditional…

Statistics Theory · Mathematics 2023-03-08 Lutz Duembgen , Alexandre Moesching

We show that the compositions of positive integers may be interpreted in terms of powers of some power series, over arbitrary commutative ring. As consequences, several closed formulas for the compositions as well as for the generalized…

Combinatorics · Mathematics 2010-11-03 Milan Janjic

In some particular cases we give criteria for morphic sequences to be almost periodic (=uniformly recurrent). Namely, we deal with fixed points of non-erasing morphisms and with automatic sequences. In both cases a polynomial-time algorithm…

Discrete Mathematics · Computer Science 2007-05-23 Yuri Pritykin

We study the existence of infinitely many positive homoclinic solutions to a second-order difference equation on integers with $p_k$-Laplacian. To achieve our goal we use the critical point theory and the general variational principle of…

Classical Analysis and ODEs · Mathematics 2019-07-15 Robert Stegliński , Magdalena Nockowska-Rosiak

We introduce ordinal collapsing principles that are inspired by proof theory but have a set theoretic flavor. These principles are shown to be equivalent to iterated $\Pi^1_1$-comprehension and the existence of admissible sets, over weak…

Logic · Mathematics 2021-12-16 Anton Freund , Michael Rathjen

We present a common sufficient condition for the total positivity of combinatorial triangles and their reversals, as well as the real-rootedness of generating functions of the rows. The proof technique is to construct a unified planar…

Combinatorics · Mathematics 2025-12-10 Xi Chen , Lang Fu , Jiajie Ruan

Let $(x_n)_{n\geq0}$ be a linear recurrence of order $k\geq2$ satisfying $$x_n=a_1x_{n-1}+a_2x_{n-2}+\dots+a_kx_{n-k}$$ for all integers $n\geq k$, where $a_1,\dots,a_k,x_0,\dots, x_{k-1}\in \mathbb{Z},$ with $a_k\neq0$. In [`The quotient…

Number Theory · Mathematics 2022-11-22 Deepa Antony , Rupam Barman

In this paper, we study the root distribution of some univariate polynomials $W_n(z)$ satisfying a recurrence of order two with linear polynomial coefficients over positive numbers. We discover a sufficient and necessary condition for the…

Combinatorics · Mathematics 2017-12-19 David G. L. Wang , Jiarui Zhang

Following work of Musta\c{t}\u{a} and Bitoun we recently developed a notion of Bernstein-Sato roots for arbitrary ideals, which is a prime characteristic analogue for the roots of the Bernstein-Sato polynomial. Here we prove that for…

Commutative Algebra · Mathematics 2019-11-15 Eamon Quinlan-Gallego

We discuss some examples that illustrate the countability of the positive rational numbers and related sets. Techniques include radix representations, Godel numbering, the fundamental theorem of arithmetic, continued fractions, Egyptian…

History and Overview · Mathematics 2007-05-23 David M. Bradley