English
Related papers

Related papers: Solving Skolem problem for negative indexed $k-$ge…

200 papers

In the present paper we consider $F_k(x)=x^{k}-\sum_{t=0}^{k-1}x^t,$ the characteristic polynomial of the $k$-th order Fibonacci sequence, the latter denoted $G(k,l).$ We determine the limits of the real roots of certain odd and even degree…

Classical Analysis and ODEs · Mathematics 2007-09-04 Xinyun Zhu , George Grossman

A Skolem sequence of order n is a sequence S_n=(s_{1},s_{2},...,s_{2n}) of 2n integers containing each of the integers 1,2,...,n exactly twice, such that two occurrences of the integer j in {1,2,...,n} are separated by exactly j-1 integers.…

Combinatorics · Mathematics 2013-03-18 Nabil Shalaby , Daniela Silvesan

Let $ a_1(x)p_1(x)^n + \cdots + a_k(x)p_k(x)^n $ as well as $ b_1(x)q_1(x)^m + \cdots + b_l(x) q_l(x)^m $ be two polynomial power sums where the complex polynomials $ p_i(x) $ and $ q_j(x) $ are all non-constant. Then in the present paper…

Number Theory · Mathematics 2025-06-05 Sebastian Heintze

In this note, we show that $S(n,r):=\sum_{k=0}^{n} \binom{n}{k}\frac{k}{k+r}$ is not an integer for any positive integer $n$ and $r\in \{1,2,3,4,5,6\}$ and for $n\le r-1$. This gives a partial answer to a conjecture of [3].

Number Theory · Mathematics 2018-01-30 Daniel López-Aguayo , Florian Luca

We extend the polynomial Pell's equation satisfied by univariate Chebyshev polynomials on [--1, 1] from one variable to several variables, using orthogonal polynomials on regular domains that include cubes, balls, and simplexes of arbitrary…

Optimization and Control · Mathematics 2024-04-03 Jean-Bernard Lasserre , Yuan Xu

We review some recent results on random polynomials and their generalizations in complex and symplectic geometry. The main theme is the universality of statistics of zeros and critical points of (generalized) polynomials of degree $N$ on…

Mathematical Physics · Physics 2007-05-23 Steve Zelditch

Given a set of $n$ real numbers, if the sum of elements of every subset of size larger than $k$ is negative, what is the maximum number of subsets of nonnegative sum? In this note we show that the answer is $\binom{n-1}{k-1} +…

Combinatorics · Mathematics 2014-01-29 Noga Alon , Harout Aydinian , Hao Huang

A zero-sum sequence of integers is a sequence of nonzero terms that sum to 0. Let $k>0$ be an integer and let $[-k,k]$ denote the set of all nonzero integers between $-k$ and $k$. Let $\ell(k)$ be the smallest integer $\ell$ such that any…

Combinatorics · Mathematics 2012-12-13 Marvin Sahs , Papa Sissokho , Jordan Torf

Denote by $\mathbb{N}$ and $\mathbb{P}$ the set of all positive integers and prime numbers, respectively. Let $\mathbb{P}=\{p_1<p_2<\dots <p_n<\dots\}$, where $p_n$ is the $n$-th prime number. For $k\in\mathbb{N}$ we recursively define…

Number Theory · Mathematics 2022-01-06 Piotr Miska , János T. Tóth , Błażej Żmija

Let s and k be integers with s \geq 2 and k \geq 2. Let g_k^{(s)}(n) denote the cardinality of the largest subset of the set {1,2,..., n} that contains no geometric progression of length k whose common ratio is a power of s. Let r_k(\ell)…

Number Theory · Mathematics 2016-05-04 Melvyn B. Nathanson , Kevin O'Bryant

Following a systematic analysis of existing results, we investigate when complete interlacing between the zeros of distinct polynomial sequences, $\{\mathcal{P}_n\}$ and $\{\mathcal{G}_n\}$ can be achieved by using a naturally arising extra…

Classical Analysis and ODEs · Mathematics 2026-04-07 Kerstin Jordaan , Vikash Kumar

The Skolem Problem asks to determine whether a given linear recurrence sequence (LRS) has a zero term. Showing decidability of this problem is equivalent to giving an effective proof of the Skolem-Mahler-Lech Theorem, which asserts that a…

Logic in Computer Science · Computer Science 2026-05-12 Piotr Bacik , Joël Ouaknine , David Purser , James Worrell

We consider a sequence of polynomials $\{P_n\}_{n \geq 0}$ satisfying a special $R_{II}$ type recurrence relation where the zeros of $P_n$ are simple and lie on the real line. It turns out that the polynomial $P_n$, for any $n \geq 2$, is…

Classical Analysis and ODEs · Mathematics 2017-03-16 Mourad E. H. Ismail , Alagacone Sri Ranga

For a sequence of polynomials $\{p_k(t)\}$ in one real or complex variable, where $p_k$ has degree $k$, for $k\ge 0$, we find explicit expressions and recurrence relations for infinite matrices whose entries are the coefficients $d(n,m,k)$,…

Rings and Algebras · Mathematics 2023-04-27 Luis Verde-Star

Consider a polynomial of large degree n whose coefficients are independent, identically distributed, nondegenerate random variables having zero mean and finite moments of all orders. We show that such a polynomial has exactly k real zeros…

Probability · Mathematics 2017-04-03 Amir Dembo , Bjorn Poonen , Qi-Man Shao , Ofer Zeitouni

We obtain several Cauchy-like and Pellet-like results for the zeros of a general complex polynomial by considering similarity transformations of the squared companion matrix and the reformulation of the zeros of a scalar polynomial as the…

Numerical Analysis · Mathematics 2016-01-05 Aaron Melman

We use Gale duality for polynomial complete intersections and adapt the proof of the fewnomial bound for positive solutions to obtain the bound (e^4+3) 2^(k choose 2) n^k/4 for the number of non-zero real solutions to a system of n…

Algebraic Geometry · Mathematics 2007-10-04 Daniel J. Bates , Frédéric Bihan , Frank Sottile

Let $ \{P_{n}\}_{n\geq 0} $ be the sequence of Padovan numbers defined by $ P_0=0 $, $ P_1 = P_2=1$ and $ P_{n+3}= P_{n+1} +P_n$ for all $ n\geq 0 $. In this paper, we find all positive square-free integers $ d $ such that the Pell…

Number Theory · Mathematics 2019-05-28 Mahadi Ddamulira

For each positive integer $n$ it is shown how to construct a finite collection of multivariable polynomials $\{F_{i}:=F_{i}(t,X_{1},..., X_{\lfloor \frac{n+1}{2} \rfloor})\}$ such that each positive integer whose squareroot has a continued…

Number Theory · Mathematics 2019-01-07 James Mc Laughlin

We compute the number of solutions to the Skolem pairings problem, S(n), and to the Langford variant of the problem, L(n). These numbers correspond to the sequences A059106, and A014552 in Sloane's Online Encyclopedia of Integer Sequences.…

Discrete Mathematics · Computer Science 2017-11-15 Ali Assarpour , Amotz Barnoy , Ou Liu
‹ Prev 1 3 4 5 6 7 10 Next ›