AI Chat AI Image Generator AI Video Text to Speech

Algorithm for computing semi-Fourier sequences of expressions involving exponentiations and integrations

02/23/2017

∙

by Hoon Hong, et al.

∙

∙

We provide an algorithm for computing semi-Fourier sequences for expressions constructed from arithmetic operations, exponentiations and integrations. The semi-Fourier sequence is a relaxed version of Fourier sequence for polynomials (expressions made of additions and multiplications).

Hoon Hong
10 publications
Adam Strzebonski
4 publications

page 1

page 2

page 3

page 4

research

∙ 04/17/2020

A fast algorithm for computing Bell polynomials based on index break-downs using prime factorization

Establishing an interesting connection between ordinary Bell polynomials...

0 Hamed Taghavian, et al. ∙

research

∙ 06/19/2019

Stability of the Kaczmarz Reconstruction for Stationary Sequences

The Kaczmarz algorithm is an iterative method to reconstruct an unknown ...

0 Caleb Camrud, et al. ∙

research

∙ 04/17/2018

On indefinite sums weighted by periodic sequences

For any integer q≥ 2 we provide a formula to express indefinite sums of ...

0 Jean-Luc Marichal, et al. ∙

research

∙ 12/04/2020

Connecting 3-manifold triangulations with monotonic sequences of bistellar flips

A key result in computational 3-manifold topology is that any two triang...

0 Benjamin A. Burton, et al. ∙

research

∙ 11/22/2017

Linear complexity of quaternary sequences over Z4 based on Ding-Helleseth generalized cyclotomic classes

A family of quaternary sequences over Z4 is defined based on the Ding-He...

0 Xina Zhang, et al. ∙

research

∙ 11/05/2018

Complexity Estimates for Fourier-Motzkin Elimination

In this paper, we propose a new method for removing all the redundant in...

0 Rui-Juan Jing, et al. ∙

research

∙ 05/11/2023

Simplification of General Mixed Boolean-Arithmetic Expressions: GAMBA

Malware code often resorts to various self-protection techniques to comp...

0 Benjamin Reichenwallner, et al. ∙