English
Related papers

Related papers: Using Walnut to solve problems from the OEIS

200 papers

The aim of this paper is to construct generating functions for some families of special finite sums with the aid of the Newton-Mercator series, hypergeometric series, and $p$-adic integral (the Volkenborn integral). By using these…

Number Theory · Mathematics 2023-02-22 Yilmaz Simsek

We study the distribution of consecutive sums of two squares in arithmetic progressions. If $\{E_n\}_{n \in \mathbb{N}}$ is the sequence of sums of two squares in increasing order, we show that for any modulus $q$ and any congruence classes…

Number Theory · Mathematics 2024-11-26 Noam Kimmel , Vivian Kuperberg

Wolstenholme's type summations involve certain powers of all residues $k$ modulo some prime number $p$. We first consider the sums of double or triple products of certain powers of all residues, e.g., the sums of the terms $(a+k)^m(b+k)^n$…

Number Theory · Mathematics 2024-08-22 Zubeyir Cinkir

We study the problem of generating interesting integer sequences with a combinatorial interpretation. For this we introduce a two-step approach. In the first step, we generate first-order logic sentences which define some combinatorial…

Logic in Computer Science · Computer Science 2023-02-10 Martin Svatoš , Peter Jung , Jan Tóth , Yuyi Wang , Ondřej Kuželka

Let $G$ be an abelian group, let $S$ be a sequence of terms $s_1,s_2,...,s_{n}\in G$ not all contained in a coset of a proper subgroup of $G$, and let $W$ be a sequence of $n$ consecutive integers. Let $$W\odot S=\{w_1s_1+...+w_ns_n:\;w_i…

Number Theory · Mathematics 2011-06-29 David J. Grynkiewicz , Andreas Philipp , Vadim Ponomarenko

Unbounded SubsetSum is a classical textbook problem: given integers $w_1,w_2,\cdots,w_n\in [1,u],~c,u$, we need to find if there exists $m_1,m_2,\cdots,m_n\in \mathbb{N}$ satisfying $c=\sum_{i=1}^n w_im_i$. In its all-target version, $t\in…

Data Structures and Algorithms · Computer Science 2022-03-01 Mingyang Deng , Xiao Mao , Ziqian Zhong

We consider some bilinear recurrences that have applications in number theory. The explicit solution of a general three-term bilinear recurrence relation of fourth order is given in terms of the Weierstrass sigma function for an associated…

Exactly Solvable and Integrable Systems · Physics 2008-07-17 A. N. W. Hone

We give improved bounds for the equidistribution of (multiparameter) nilsequences subject to any degree filtration. The bounds we obtain are single exponential in dimension, improving on double exponential bounds of Green and Tao. To obtain…

Number Theory · Mathematics 2024-08-14 James Leng

We find a polynomial in three variables whose values at nonnegative integers satisfy the Erd\H{o}s-Straus Conjecture. Although the perfect squares are not covered by these values, it allows us to prove that there are arbitrarily long…

Number Theory · Mathematics 2012-05-01 Manuel Bello-Hernández , Manuel Benito , Emilio Fernández

We re-prove some results about integers whose Zeckendorf and Chung-Graham representations satisfy certain conditions. We use properties of the shift operator and use the software package {\tt Walnut}.

Number Theory · Mathematics 2025-07-09 Rob Burns

Wooley ({\em J. Number Theory}, 1996) gave an elementary proof of a Bezout like theorem allowing one to count the number of isolated integer roots of a system of polynomial equations modulo some prime power. In this article, we adapt the…

Number Theory · Mathematics 2021-02-02 Mitali Bafna , Madhu Sudan , Santhoshini Velusamy , David Xiang

This dissertation presents new results on three different themes all related to matroid polytopes. First we investigate properties of Ehrhart polynomials of matroid polytopes, independence matroid polytopes, and polymatroids. We prove that…

Combinatorics · Mathematics 2009-05-28 David C. Haws

For a hypergeometric series $\sum_k f(k,a, b, ...,c)$ with parameters $a, b, >...,c$, Paule has found a variation of Zeilberger's algorithm to establish recurrence relations involving shifts on the parameters. We consider a more general…

Classical Analysis and ODEs · Mathematics 2009-08-11 William Y. C. Chen , Qing-Hu Hou , Yan-Ping Mu

We compute the nonlinearity of Boolean functions with Groebner basis techniques, providing two algorithms: one over the binary field and the other over the rationals. We also estimate their complexity. Then we show how to improve our…

Information Theory · Computer Science 2014-04-11 E. Bellini , I. Simonetti , M. Sala

We systematically investigate the complexity of counting subgraph patterns modulo fixed integers. For example, it is known that the parity of the number of $k$-matchings can be determined in polynomial time by a simple reduction to the…

Computational Complexity · Computer Science 2021-07-02 Radu Curticapean , Holger Dell , Thore Husfeldt

Inspired by subsequential ergodic theorems, we study the validity of Wiener's lemma and the extremal behavior of a measure $\mu$ on the unit circle via the behavior of its Fourier coefficients $\hat\mu(k_n)$ along subsequences $(k_n)$. We…

Functional Analysis · Mathematics 2023-02-21 Christophe Cuny , Tanja Eisner , Bálint Farkas

In this article we present method of solving some additive problems with primes. The method may be employed to the Goldbach-Euler conjecture and the twin primes conjecture. The presented method also makes it possible to obtain some…

General Mathematics · Mathematics 2017-01-10 Andrei Allakhverdov

The nonlinear eigen-problem $ Ax+F(x)=\lambda x$ is studied where $A$ is an $n\times n$ irreducible Stieltjes matrix. Under certain conditions, this problem has a unique positive solution. We show that, starting from a multiple of the…

Numerical Analysis · Mathematics 2022-01-11 Peichang Guo

We examine the behavior of the coefficients of powers of polynomials over a finite field of prime order. Extending the work of Allouche-Berthe, 1997, we study a(n), the number of occurring strings of length n among coefficients of any power…

Combinatorics · Mathematics 2013-04-18 Kevin Garbe

We present an algorithm which, given a linear recurrence operator $L$ with polynomial coefficients, $m \in \mathbb{N}\setminus\{0\}$, $a_1,a_2,\ldots,a_m \in \mathbb{N}\setminus\{0\}$ and $b_1,b_2,\ldots,b_m \in \mathbb{K}$, returns a…

Symbolic Computation · Computer Science 2018-04-10 Marko Petkovšek
‹ Prev 1 3 4 5 6 7 10 Next ›