中文
相关论文

相关论文: Using Walnut to solve problems from the OEIS

200 篇论文

We perform certain alternating binomial summations with parameters that occur in the analysis of algorithms. A combination of integral and special function and special number representations is used. The results are sufficiently general to…

数学物理 · 物理学 2007-05-23 Mark W. Coffey

The first author introduced a sequence of polynomials (\cite{8}, sequence A174531) defined recursively. One of the main results of this study is proof of the integrality of its coefficients.

数论 · 数学 2011-12-30 Vladimir Shevelev , Peter J. C. Moses

We present a comprehensive analysis of the convergence properties of the frame operators of Weyl-Heisenberg systems and shift-invariant systems, and relate these to the convergence of the Walnut representation. We give a deep analysis of…

泛函分析 · 数学 2007-05-23 Peter G. Casazza , Ole Christensen , A. J. E. M. Janssen

For the OEIS sequence A176677, defined by the quadratic convolution recurrence $a(0) = a(1) = 1$ and $a(n+1) = \sum_{p=0}^n a(p) a(n-p) - 1$ for $n \ge 1$, R.~J.~Mathar contributed in March 2016 the conjectured order-4 P-recursive…

组合数学 · 数学 2026-05-07 Tong Niu

In this paper, we study some supercongruences involving the sequence $$ t_n(x)=\sum_{k=0}^n\binom{n}{k}\binom{x}{k}\binom{x+k}{k}2^k $$ and solve some open problems. For any odd prime $p$ and $p$-adic integer $x$, we determine…

数论 · 数学 2025-10-14 Hui-Li Han , Chen Wang

The On-Line Encyclopedia Of Integer Sequences , that wonderful resource that most combinatorialists, and many other mathematicians and scientists, use at least once a day, is a treasure trove of mathematical information, and, one of its…

历史与综述 · 数学 2017-10-24 Shalosh B. Ekhad , Mingjia Yang , Doron Zeilberger

The aims of this work are to study Rees algebras of filtrations of monomial ideals associated to covering polyhedra of rational matrices with non-negative entries and non-zero columns using combinatorial optimization and integer…

交换代数 · 数学 2024-02-12 Gonzalo Grisalde , Alexandra Seceleanu , Rafael H. Villarreal

We establish asymptotic formulas for sums of reciprocals of primes in arithmetic progressions, generalizing recent results on multiple Mertens evaluations by Tenenbaum, Qi, and Hu. Specifically, for any fixed constant $K>0$, we derive…

数论 · 数学 2025-12-09 Zhen Chen , Junrong Luo

The purpose of this paper is to discuss the relationship between prime numbers and sums of Fibonacci numbers. One of our main results says that for every sufficiently large integer $k$ there exists a prime number that can be represented as…

数论 · 数学 2022-08-17 Michael Drmota , Clemens Müllner , Lukas Spiegelhofer

We introduce a new method with spectral accuracy to solve linear non-autonomous ordinary differential equations (ODEs) of the kind $ \frac{d}{dt}\tilde{u}(t) = \tilde{f}(t) \tilde{u}(t)$, $\tilde{u}(-1)=1$, with $\tilde{f}(t)$ an analytic…

数值分析 · 数学 2023-03-21 Stefano Pozza , Niel Van Buggenhout

We develop a theory of arithmetic Newton polygons of higher order, that provides the factorization of a separable polynomial over a $p$-adic field, together with relevant arithmetic information about the fields generated by the irreducible…

数论 · 数学 2008-10-31 Jordi Guardia , Jesus Montes , Enric Nart

We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are interpreted over constructor terms (representing data values),…

计算机科学中的逻辑 · 计算机科学 2008-12-01 Adel Bouhoula , Florent Jacquemard

This article considers the problem of solving a system of $n$ real polynomial equations in $n+1$ variables. We propose an algorithm based on Newton's method and subdivision for this problem. Our algorithm is intended only for nondegenerate…

计算几何 · 计算机科学 2009-12-21 Gun Srijuntongsiri , Stephen A. Vavasis

Zeckendorf's theorem states every positive integer has a unique decomposition as a sum of non-adjacent Fibonacci numbers. This result has been generalized to many sequences $\{a_n\}$ arising from an integer positive linear recurrence, each…

The material presented in this paper contributes to establishing a basis deemed essential for substantial progress in Automated Deduction. It identifies and studies global features in selected problems and their proofs which offer the…

人工智能 · 计算机科学 2021-07-14 Christoph Wernhard , Wolfgang Bibel

For a linearly recurrent vector sequence P[n+1] = A(n) * P[n], consider the problem of calculating either the n-th term P[n] or L<=n arbitrary terms P[n_1],...,P[n_L], both for the case of constant coefficients A(n)=A and for a matrix A(n)…

符号计算 · 计算机科学 2007-05-23 Martin Ziegler

We build bounded solutions to a linear integral equation. Our functions are built as limit of iterated Birkhoff sums over auto-similar dynamical systems. Nous construisons des solutions born\'ees \`a une \'equation int\'egrale. Notre…

动力系统 · 数学 2015-06-03 Vincent Delecroix , Jean-François Bertazzon

We formulate Witten index problems for theories with two supercharges in a Majorana doublet, as in $d=3$ $\mathcal N=1$ theories and dimensional reduction thereof. Regardless of spacetime dimensions, the wall-crossing occurs generically, in…

高能物理 - 理论 · 物理学 2020-04-22 Dongwook Ghim , Chiung Hwang , Piljin Yi

We use an interpolative technique from \cite{abps} to introduce the notion of multiple $N$-separately summing operators. Our approach extends and unifies some recent results; for instance we recover the best known estimates of the…

泛函分析 · 数学 2015-07-02 N. Albuquerque , D. Núñez-Alarcón , J. Santos , D. M. Serrano-Rodríguez

We introduce an algorithmic approach based on generating tree method for enumerating the inversion sequences with various pattern-avoidance restrictions. For a given set of patterns, we propose an algorithm that outputs either an accurate…

组合数学 · 数学 2023-09-28 Toufik Mansour , Gökhan Yıldırım