Related papers: Visualization of Abel's Impossibility Theorem
The theory of the Kauffman bracket, which describes the Jones polynomial as a sum over closed circles formed by the planar resolution of vertices in a knot diagram, can be straightforwardly lifted from sl(2) to sl(N) at arbitrary N -- but…
We develop a unified analytical and computational framework for the generalized Abel ordinary differential equation $y^{\prime }(x)=a_n(x)\bigl(% y^n+\lambda_{n-1}(x)y^{n-1}+\dots+\lambda_0(x)\bigr)$ of arbitrary degree $% n\ge1$ on the…
From the theory of finite dimensional Lie algebras it is known that every finite dimensional Lie algebra is decomposed into a semidirect sum of semisimple subalgebra and solvable radical. Moreover, due to work of Mal'cev the study of…
We report on a verification of the Fundamental Theorem of Algebra in ACL2(r). The proof consists of four parts. First, continuity for both complex-valued and real-valued functions of complex numbers is defined, and it is shown that…
A famous result due to Ko and Friedman (1982) asserts that the problems of integration and maximisation of a univariate real function are computationally hard in a well-defined sense. Yet, both functionals are routinely computed at great…
Using Abel summation the paper proves a weak form of the Wiener-Khinchin formula for arithmetic functions with point-wise convergent Ramanujan-Fourier expansions. The main result is that the convolution of most arithmetic functions…
We present a novel perspective on the universal approximation theorem for rough path functionals, introducing a polynomial-based approximation class. We extend universal approximation to non-geometric rough paths within the tensor algebra.…
In these notes we collect some results about finite dimensional representations of $U_q(\mathfrak{gl}(1|1))$ and related invariants of framed tangles which are well-known to experts but difficult to find in the literature. In particular, we…
The content of this paper is a generalization of a the theorem 9.2 of the paper arXiv:1007.2665 written by Joseph Rabinoff : if $\mathcal{P}$ is a finite family of polyhedra in $N_{\mathbb{R}}$ such that there exists a fan in…
Two problems are addressed: reduction of an arbitrary degree non-special divisor to the equivalent divisor of the degree equal to genus of a curve, and addition of divisors of arbitrary degrees. The hyperelliptic case is considered as the…
We explore a new route toward a non-perturbative quantization of gravity based on a purely affine formulation, where the affine connection is the fundamental field and the metric, when it exists, emerges as a derived quantity. Starting from…
The Abel-Plana formula is a widely used tool for calculations in Casimir type problems. In this note we present a particular explicit modification of the Generalized Abel-Plana formula for the functions with non-integrable branch-point…
In part I we reduced the arithmetic (characteristic zero) version of the P \not \subseteq NP conjecture to the problem of showing that a variety associated with the complexity class NP cannot be embedded in the variety associated the…
We consider the function $x^{-1}$ that inverses a finite field element $x \in \mathbb{F}_{p^n}$ ($p$ is prime, $0^{-1} = 0$) and affine $\mathbb{F}_{p}$-subspaces of $\mathbb{F}_{p^n}$ such that their images are affine subspaces as well. It…
Blind and Mani (1987) proved that the entire combinatorial structure (the vertex-facet incidences) of a simple convex polytope is determined by its abstract graph. Their proof is not constructive. Kalai (1988) found a short, elegant, and…
An old conjecture of Erd\H{o}s and R\'enyi, proved by Schinzel, predicted a bound for the number of terms of a polynomial $g(x) \in \mathbb{C}[x]$ when its square $g(x)^2$ has a given number of terms. Further conjectures and results arose,…
Artin solved Hilbert's $17^{th}$ problem by showing that every positive semidefinite polynomial can be realized as a sum of squares of rational functions. Pfister gave a bound on the number of squares of rational functions: if $p$ is a…
We consider the average-case complexity of some otherwise undecidable or open Diophantine problems. More precisely, consider the following: (I) Given a polynomial f in Z[v,x,y], decide the sentence \exists v \forall x \exists y f(v,x,y)=0,…
We conjecture that bounded generalised polynomial functions cannot be generated by finite automata, except for the trivial case when they are periodic away from a finite set. Using methods from ergodic theory, we are able to partially…
Classical primal-dual affine programming takes place over finite dimensional real vector spaces. This results in beautiful duality theory, connecting the optimal solu- tions of the primal maximization problem and the dual minimization…