English
Related papers

Related papers: Computing a Solution of Feigenbaum's Functional Eq…

200 papers

We present a new approach to solving polynomial ordinary differential equations by transforming them to linear functional equations and then solving the linear functional equations. We will focus most of our attention upon the first-order…

Rings and Algebras · Mathematics 2008-10-18 John Michael Nahay

We address the decision problem for sentences involving univariate functions constructed from a fixed Pfaffian function of order $1$. We present a new symbolic procedure solving this problem with a computable complexity based on the…

Algebraic Geometry · Mathematics 2019-05-29 Maria Laura Barbagallo , Gabriela Jeronimo , Juan Sabia

For the quantum integer $[n]_q = 1+q+...+q^{n-1}$ there is a natural polynomial multiplication $*_q$ such that $[m]_q *_q [n]_q = [mn]_q$. This multiplication leads to the functional equation $f_{mn}(q) = f_m(q)f_n(q^m),$ defined on a given…

Number Theory · Mathematics 2016-12-30 Melvyn B. Nathanson

We present the strongest known knot invariant that can be computed effectively (in polynomial time).

Geometric Topology · Mathematics 2018-12-31 Dror Bar-Natan , Roland van der Veen

Whether the satisfiability of any formula F of propositional calculus can be determined in polynomial time is an open question. I propose a simple procedure based on some real world mechanisms to tackle this problem. The main result is the…

Logic in Computer Science · Computer Science 2010-01-20 Bernd R. Schuh

We describe algorithms for computing eigenpairs (eigenvalue--eigenvector) of a complex $n\times n$ matrix $A$. These algorithms are numerically stable, strongly accurate, and theoretically efficient (i.e., polynomial-time). We do not…

Numerical Analysis · Mathematics 2014-10-02 Peter Bürgisser , Felipe Cucker

In answer to Ko's question raised in 1983, we show that an initial value problem given by a polynomial-time computable, Lipschitz continuous function can have a polynomial-space complete solution. The key insight is simple: the Lipschitz…

Computational Complexity · Computer Science 2010-07-19 Akitoshi Kawamura

This paper settles the computational complexity of the problem of integrating a polynomial function f over a rational simplex. We prove that the problem is NP-hard for arbitrary polynomials via a generalization of a theorem of Motzkin and…

Metric Geometry · Mathematics 2013-06-27 Velleda Baldoni , Nicole Berline , Jesus De Loera , Matthias Köppe , Michèle Vergne

In the present paper, we construct an algorithm for the evaluation of real Riemann zeta function $\zeta(s)$ for all real $s$, $s>1$, in polynomial time and linear space on Turing machines in Ko-Friedman model. The algorithms is based on a…

Computational Complexity · Computer Science 2014-11-18 Sergey V. Yakhontov

We demonstrate a polynomial approach to express the decision version of the directed Hamiltonian Cycle Problem (HCP), which is NP-Complete, as the Solvability of a Polynomial Equation with a constant number of variables, within a bounded…

Computational Complexity · Computer Science 2011-11-10 Deepak Chermakani

For a Baer-local (composition) Fitting formation $\mathfrak{F}$ the polynomial time algorithm for the computation of the $\mathfrak{F}$-radical of a permutation group is suggested. In particular it is showed how one can compute the…

Group Theory · Mathematics 2024-07-18 Viachaslau I. Murashka

In this note we describe solutions of the equation: $F(A(z))=G(B(z)),$ where $A,B$ are polynomials and $F,G$ are continuous functions on the Riemann sphere.

Complex Variables · Mathematics 2019-05-01 Fedor Pakovich

We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…

Combinatorics · Mathematics 2008-01-19 Milan Janjic

An exact invariant is derived for $n$-degree-of-freedom Hamiltonian systems with general time-dependent potentials. The invariant is worked out in two equivalent ways. In the first approach, we define a special {\it Ansatz\/} for the…

Classical Physics · Physics 2023-03-23 Jürgen Struckmeier , Claus Riedel

Endowing the set of functional graphs (FGs) with the sum (disjoint union of graphs) and product (standard direct product on graphs) operations induces on FGs a structure of a commutative semiring R. The operations on R can be naturally…

Discrete Mathematics · Computer Science 2025-11-26 Alberto Dennunzio , Enrico Formenti , Luciano Margara , Sara Riva

This paper introduces a more restrictive notion of feasibility of functionals on Baire space than the established one from second-order complexity theory. Thereby making it possible to consider functions on the natural numbers as running…

Computational Complexity · Computer Science 2017-06-02 Akitoshi Kawamura , Florian Steinberg

Graphical functions are single-valued complex functions which arise from Feynman amplitudes. We study their properties and use their connection to multiple polylogarithms to calculate Feynman periods. For the zig-zag and two more families…

Number Theory · Mathematics 2014-11-12 Oliver Schnetz

A rational homogeneous (of degree one) positive real matrix-valued function is presented as the Schur complement of a block of the linear pencil with positive semidefinite matrix coefficients. The partial derivative numerators of a rational…

Complex Variables · Mathematics 2021-03-04 M. F. Bessmertnyi

We introduce the definition of conformable derivative on time scales and develop its calculus. Fundamental properties of the conformable derivative and integral on time scales are proved. Linear conformable differential equations with…

Classical Analysis and ODEs · Mathematics 2018-01-09 Benaoumeur Bayour , Ahmed Hammoudi , Delfim F. M. Torres

It is well known that the real and imaginary parts of any holomorphic function are harmonic functions of two variables. In this paper we generalize this property to finite-dimensional commutative algebras. We prove that if some basis of a…

Analysis of PDEs · Mathematics 2008-11-18 Anatoliy A. Pogorui