Related papers: Using Walnut to solve problems from the OEIS

A classical theorem of Wendroff shows that one may reconstructs a sequence of orthogonal polynomials on the real line from two non-constant polynomials of consecutive degrees whose zeros strictly interlace on the real line. In this note we…

In this paper we use the Vandermonde matrices and their properties to give a new proof of the classical result of Karl Weierstrass about the approximation of continuous functions $f$ on closed intervals, using a sequence of polynomials. The…

In this work we resolve several conjectures stated in the On-Line Encyclopedia of Integer sequences.

We give a combinatorial interpretation in terms of bicolored ordered trees for the sequence (a_n)_{n>=1}=(1, 1, 1, 2, 3, 6, 10, 20, 36, 73,... ), A345973 in OEIS, whose generating function satisfies the defining identity Sum_{n>=1}a_n x^n =…

We introduce an algebra model to study higher order sum rules for orthogonal polynomials on the unit circle. We build the relation between the algebra model and sum rules, and prove an equivalent expression on the algebra side for the sum…

The starting point of our paper is Kashihara's open problem number $30$, concerning the sequence $A001292$ of the OEIS, asking how many terms are powers of integers. We confirm his last conjecture up to the $100128$-th term and provide a…

We evaluate the nested sum $\sum_{a_{n - 1} = c}^{a_n } {\sum_{a_{n - 2} = c}^{a_{n - 1} } { \cdots \sum_{a_0 = c}^{a_1 } {x^{a_0 } } } }$ where $a_n$ and $c$ are any integers and $x$ is a real or complex variable. Consequently, we evaluate…

The sequence A000975 in OEIS can be defined by $A_1=1$, $A_{n+1}=2A_n$ if $n$ is odd, and $A_{n+1}=2A_n+1$ if $n$ is even. This sequence satisfies other recurrence relations, admits some closed formulas, and is known to enumerate several…

With the aid of Hensel Lemma, we refine the 2-adic Newton polygon algorithm proposed by Magron, Koprowski, and Vaccon at ISSAC 2023 to express computationally a given positive univariate polynomial with rational coefficients as a sum of…

Given $(a_1, \dots, a_n, t) \in \mathbb{Z}_{\geq 0}^{n + 1}$, the Subset Sum problem ($\mathsf{SSUM}$) is to decide whether there exists $S \subseteq [n]$ such that $\sum_{i \in S} a_i = t$. There is a close variant of the $\mathsf{SSUM}$,…

We develop a self-learning approach for conjecturing of induction predicates on a dataset of 16197 problems derived from the OEIS. These problems are hard for today's SMT and ATP systems because they require a combination of inductive and…

Let h \subset g be an inclusion of Lie algebras with quotient h-module n. There is a natural degree filtration on the h-module U(g)/U(g)h whose associated graded h-module is isomorphic to S(n). We give a necessary and sufficient condition…

This work is motivated by the long-standing open problem of designing asymptotically order-optimal aperiodic polyphase sequence sets with respect to the celebrated Welch bound. Attempts were made by Mow over 30 years ago, but a…

We investigate pseudo-polynomial time algorithms for Subset Sum. Given a multi-set $X$ of $n$ positive integers and a target $t$, Subset Sum asks whether some subset of $X$ sums to $t$. Bringmann proposes an $\tilde{O}(n + t)$-time…

I consider the power series expansion of Lame function in the Weierstrass's form and its integral forms applying three term recurrence formula[1]. I investigate asymptotic expansions of Lame function for the cases of infinite series and…

Recently several authors have proved results on Ehrhart series of free sums of rational polytopes. In this note we treat these results from an algebraic viewpoint. Instead of attacking combinatorial statements directly, we derive them from…

This paper focuses on the study of the order of power series that are linear combinations of a given finite set of power series. The order of a formal power series, known as $\textrm{ord}(f)$, is defined as the minimum exponent of $x$ that…

The Sum-of-Squares (SoS) hierarchy, also known as Lasserre hierarchy, has emerged as a promising tool in optimization. However, it remains unclear whether fixed-degree SoS proofs can be automated [O'Donnell (2017)]. Indeed, there are…

We improve on the first fall degree bound of polynomial systems that arise from a Weil descent along Semaev's summation polynomials relevant to the solution of the Elliptic Curve Discrete Logarithm Problem via Gr\"obner basis algorithms.

Polynomial system solving is a classical problem in mathematics with a wide range of applications. This makes its complexity a fundamental problem in computer science. Depending on the context, solving has different meanings. In order to…