English
Related papers

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

200 papers

In this paper, we define k-generalized order-k numbers and we obtain a relation between i-th sequences and k-th sequences of k-generalized order-k numbers. We give some determinantal and permanental representations of k-generalized order-k…

Number Theory · Mathematics 2011-11-18 Kenan Kaygisiz , Adem Sahin

The multi-variable Schmidt polynomials are defined by $$ S_n^{(r)}(x_0,\ldots,x_n):=\sum_{k=0}^n {n+k \choose 2k}^{r}{2k\choose k} x_k. $$ We prove that, for any positive integers $m$, $n$, $r$, and $\varepsilon=\pm 1$, all the coefficients…

Number Theory · Mathematics 2014-12-19 Qi-Fei Chen , Victor J. W. Guo

This paper discusses the location of zeros of polynomials in a polynomial sequence $\{P_n(z)\}$ generated by a three-term recurrence relation of the form $P_n(z)+ B(z)P_{n-1}(z) +A(z) P_{n-k}(z)=0$ with $k>2$ and the standard initial…

Complex Variables · Mathematics 2020-10-21 Innocent Ndikubwayo

Based on the concepts of a generalized critical point and the corresponding generalized P.S. condition introduced by Duong Minh Duc[1], we have proved a new $Z_2$ index theorem and get a result on multiplicity of generalized critical…

Analysis of PDEs · Mathematics 2007-05-23 Zhujun Zheng , Keping Lu , Luo Xuebo

Square roots $s$ of sums of $M$ consecutive integer squares starting from $a^{2}\geq1$ are integers if $M\equiv0,9,24$ or $33(mod\,72)$; or $M\equiv1,2$ or $16(mod\,24)$; or $M\equiv11(mod\,12)$ and cannot be integers if $M\equiv3,5,6,7,8$…

Number Theory · Mathematics 2014-09-30 Vladimir Pletser

In this paper we study the problem of counting Salem numbers of fixed degree. Given a set of disjoint intervals $I_1,\ldots, I_{k}\subset \left[0;\pi\right]$, $1\leq k\leq m$ let $Sal_{m,k}(Q,I_1,\ldots,I_{k})$ denote the set of ordered…

Number Theory · Mathematics 2021-01-28 Friedrich Götze , Anna Gusakova

Using a recent breakthrough of Smith, we improve the results of Fouvry and Kl\"uners on the solubility of the negative Pell equation. Let $\mathcal{D}$ denote the set of fundamental discriminants having no prime factors congruent to $3$…

Number Theory · Mathematics 2022-11-14 Stephanie Chan , Peter Koymans , Djordjo Milovic , Carlo Pagano

Let $z_1, \dots, z_m$ be $m$ distinct complex numbers, normalized to $|z_k| = 1$, and consider the polynomial $$ p_{m}(z) = \prod_{k=1}^{m}{(z-z_k)}.$$ We define a sequence of polynomials in a greedy fashion, $$ p_{N+1}(z) = p_{N}(z)…

Classical Analysis and ODEs · Mathematics 2021-09-16 Stefan Steinerberger

It is conjectured that the sum $$ S_r(n)=\sum_{k=1}^{n} \frac{k}{k+r}\binom{n}{k} $$ for positive integers $r,n$ is never integral. This has been shown for $r\le 22$. In this note we study the problem in the ``$n$ aspect" showing that the…

Number Theory · Mathematics 2021-06-16 Florian Luca , Carl Pomerance

Let $\Delta_{k}(x)$ be the error term in the classical asymptotic formula for the sum $\sum_{n\leq x}d_{k}(n)$, where $d_{k}(n)$ is the number of ways $n$ can be written as a product of $k$ factors. We study the analytic properties of the…

Number Theory · Mathematics 2024-12-17 T. Makoto Minamide , Yoshio Tanigawa , Nigel Watt

We study sets of integers that can be defined by the vanishing of a generalised polynomial expression. We show that this includes sets of values of linear recurrent sequences of Salem type and some linear recurrent sequences of Pisot type.…

Number Theory · Mathematics 2023-02-14 Jakub Byszewski , Jakub Konieczny

We investigate integral forms of simple modules of symmetric groups over fields of characteristic $0$ labelled by hook partitions. Building on work of Plesken and Craig, for every odd prime $p$, we give a set of representatives of the…

Representation Theory · Mathematics 2018-09-11 Susanne Danz , Tommy Hofmann

To prove that a polynomial is nonnegative on R^n one can try to show that it is a sum of squares of polynomials (SOS). The latter problem is now known to be reducible to a semidefinite programming (SDP) computation much faster than…

Algebraic Geometry · Mathematics 2010-10-27 J. Maurice Rojas , Swaminathan Sethuraman

Let $K = \mathbb{Q}(\zeta_3)$, where $\zeta_3$ is a primitive root of unity. In this paper we study the distribution of integers $\alpha \in \mathcal{O}_K$ for which the norm equation $N_{K(\sqrt[3]{\alpha})/K}(\mathbf{x}) = \zeta_3$ is…

Number Theory · Mathematics 2020-06-09 Erick Knight , Stanley Yao Xiao

As a generalization of polyominoes we consider edge-to-edge connected nonoverlapping unions of regular $k$-gons. For $n\le 4$ we determine formulas for the number $a_k(n)$ of generalized polyominoes consisting of $n$ regular $k$-gons.…

Combinatorics · Mathematics 2007-05-23 Matthias Koch , Sascha Kurz

Let ${\mathcal P}_k$ denote the set of all algebraic polynomials of degree at most $k$ with real coefficients. Let ${\mathcal P}_{n,k}$ be the set of all algebraic polynomials of degree at most $n+k$ having exactly $n+1$ zeros at $0$. Let…

Classical Analysis and ODEs · Mathematics 2018-09-21 Tamás Erdélyi

A $k$-positive matrix is a matrix where all minors of order $k$ or less are positive. Computing all such minors to test for $k$-positivity is inefficient, as there are $\sum_{\ell=1}^k \binom{n}{\ell}^2$ of them in an $n\times n$ matrix.…

Combinatorics · Mathematics 2021-01-12 Anna Brosowsky , Sunita Chepuri , Alex Mason

Let $(P_n)_{n\ge 0}$ and $(Q_n )_{n\ge 0}$ be the Pell and Pell-Lucas sequences. Let $b$ be a positive integer such that $b\ge 2.$ In this paper, we prove that the following two Diophantine equations $P_{n}=b^{d}P_{m}+Q_{k}$ and…

Number Theory · Mathematics 2024-06-25 Kouèssi Norbert Adédji , Marija Bliznac Trebješanin

We consider sequences of the type $A_n=6A_{n-1}-A_{n-2}, A_0=r, A_1=s$ ($r$ and $s$ integers) and show that all sequences that solve particular cases of the Pell generalized equation are expressible as a constant times one of four…

Combinatorics · Mathematics 2007-05-23 Mario Catalani

A Skolem sequence is a linear arrangement of the multiset, {1, 1, 2, 2, ..., n, n} such that if r in [n] appears in positions i and j, then |i-j| = r. We first translate the problem to a particular set of perfect matchings, then apply the…

Combinatorics · Mathematics 2013-01-29 Sophie Burrill , Lily Yen