English
Related papers

Related papers: Algebraic Diagonals and Walks: Algorithms, Bounds,…

200 papers

We study the decomposition of multivariate polynomials as sums of powers of linear forms. We give a randomized algorithm for the following problem: If a homogeneous polynomial $f \in K[x_1 , . . . , x_n]$ (where $K \subseteq \mathbb{C}$) of…

Computational Complexity · Computer Science 2021-10-12 Pascal Koiran , Subhayan Saha

We present the Polar framework for fully automating the analysis of classical and probabilistic loops using algebraic reasoning. The central theme in Polar comes with handling algebraic recurrences that precisely capture the loop semantics.…

Programming Languages · Computer Science 2026-02-17 Marcel Moosbrugger , Julian Müllner , Ezio Bartocci , Laura Kovács

Spherically symmetric random walks in arbitrary dimension $D$ can be described in terms of Gegenbauer (ultraspherical) polynomials. For example, Legendre polynomials can be used to represent the special case of two-dimensional spherically…

High Energy Physics - Lattice · Physics 2010-11-19 Carl M. Bender , Peter N. Meisinger , Fred Cooper

Motion polynomials are a specific type of polynomial over a Clifford algebra that can conveniently describe rational motions. There exists an algorithm for the factorization of motion polynomials that works in generic cases. It hinges on…

Rings and Algebras · Mathematics 2025-08-29 Daren A. Thimm , Zijia Li , Hans-Peter Schröcker , Johannes Siegele

We investigate solutions to the functional equation $f(f(x)) = e^x$, which can be interpreted as the problem of finding a half iterate of the exponential map. While no elementary solution exists, we construct and analyze non-elementary…

Numerical Analysis · Mathematics 2025-09-30 Sanay Nesargi , Gregory Roudenko

We study the Excluded Grid Theorem of Robertson and Seymour. This is a fundamental result in graph theory, that states that there is some function $f: Z^+\rightarrow Z^+$, such that for all integers $g>0$, every graph of treewidth at least…

Discrete Mathematics · Computer Science 2016-02-09 Julia Chuzhoy

We consider a family of integer linear programs in which the coefficients of the constraints and objective function are polynomials of an integer parameter $t.$ For $\ell$ in $\mathbb{Z}_+,$ we define $f_\ell(t)$ to be the…

Combinatorics · Mathematics 2017-04-27 Bobby Shen

We study the approximation capabilities of two families of univariate polynomials that arise in applications of quantum signal processing. Although approximation only in the domain $[0,1]$ is physically desired, these polynomial families…

Classical Analysis and ODEs · Mathematics 2022-04-11 Rahul Sarkar , Theodore J. Yoder

I consider differential of mapping $f$ of continuous division ring as linear mapping the most close to mapping $f$. Different expressions which correspond to known deffinition of derivative are supplementary. I explore the Gateaux…

General Mathematics · Mathematics 2012-07-26 Aleks Kleyn

In this paper we present an algorithmic procedure that transforms, if possible, a given system of ordinary or partial differential equations with radical dependencies in the unknown function and its derivatives into a system with polynomial…

Classical Analysis and ODEs · Mathematics 2024-04-23 Sebastian Falkensteiner , Rafael Sendra

Let f be a real or complex polynomial. We give an algorithm to compute the set of generalized critical values. The algorithm uses a finite dimensional space of rational arcs along which we can reach all generalized critical values of f.

Algebraic Geometry · Mathematics 2016-03-10 Zbigniew Jelonek , Krzysztof Kurdyka

We introduce power term polynomial algebra, a representation language for Boolean formulae designed to bridge conjunctive normal form (CNF) and algebraic normal form (ANF). The language is motivated by the tiling mismatch between these…

Logic in Computer Science · Computer Science 2026-03-17 Emanuele Sansone , Armando Solar-Lezama

Let $q$ be an odd prime power. Let $f\in \mathbb{F}_q[x]$ be a polynomial having degree at least $2$, $a\in \mathbb{F}_q$, and denote by $f^n$ the $n$-th iteration of $f$. Let $\chi$ be the quadratic character of $\mathbb{F}_q$, and…

Number Theory · Mathematics 2024-03-29 Vefa Goksel , Giacomo Micheli

We study a natural complexity measure of Boolean functions known as the rational degree. Denoted $\textrm{rdeg}(f)$, it is the minimal degree of a rational function that is equal to $f$ on the Boolean hypercube. For total functions $f$, it…

Computational Complexity · Computer Science 2025-04-16 Vishnu Iyer , Siddhartha Jain , Robin Kothari , Matt Kovacs-Deak , Vinayak M. Kumar , Luke Schaeffer , Daochen Wang , Michael Whitmeyer

We study Loewner chains in $\mathcal{H}_0(\mathbb{D})$ without assuming univalence of each element. We prove a decomposition: every chain admits a factorization $f_t=F\circ g_t$, where $F$ is analytic on $\mathbb{D}(0,r)$ with $r=\lim_{t…

Complex Variables · Mathematics 2025-11-12 Hiroshi Yanagihara

A general solution is found for a large class of time continuous autonomous nonlinear dynamical systems, the so-called quasi-polynomial systems. This solution is expressed in terms of a new type of special functions defined via their Taylor…

Classical Analysis and ODEs · Mathematics 2009-10-15 Leon Brenig

Let $\mathbb{F}_q(T)$ be the field of rational functions in one variable over a finite field. We introduce the notion of a totally $T$-adic function: one that is algebraic over $\mathbb{F}_q(T)$ and whose minimal polynomial splits…

Number Theory · Mathematics 2020-08-28 Xander Faber , Clayton Petsche

A rationally dynamically algebraic (RDA) power series is one that arises as (a component of) the solution of a system of differential equations of the form $\boldsymbol{y}' = F(\boldsymbol{y})$, where $F$ is a vector of rational functions…

Formal Languages and Automata Theory · Computer Science 2025-01-29 Rida Ait El Manssour , Vincent Cheval , Mahsa Shirmohammadi , James Worrell

Here we follow the basic analysis that is common for real and complex variables and find how it can be applied to a quaternionic variable. Non-commutativity of the quaternion algebra poses obstacles for the usual manipulations; but we show…

Functional Analysis · Mathematics 2008-04-02 Charles Schwartz

Fractional calculus is the calculus of differentiation and integration of non-integer orders. In a recently paper (Annals of Physics 323 (2008) 2756-2778), the Fundamental Theorem of Fractional Calculus is highlighted. Based on this…

Mathematical Physics · Physics 2009-10-30 Ming-Fan Li , Ji-Rong Ren , Tao Zhu