Related papers: Algebraic Diagonals and Walks: Algorithms, Bounds,…
Newton iteration (NI) is an almost 350 years old recursive formula that approximates a simple root of a polynomial quite rapidly. We generalize it to a matrix recurrence (allRootsNI) that approximates all the roots simultaneously. In this…
We study deep neural networks with polynomial activations, particularly their expressive power. For a fixed architecture and activation degree, a polynomial neural network defines an algebraic map from weights to polynomials. The image of…
We reconsider the theory of Lagrange interpolation polynomials with multiple interpolation points and apply it to linear algebra. For instance, $A$ be a linear operator satisfying a degree $n$ polynomial equation $P(A)=0$. One can see that…
A new version of the Graeffe algorithm for finding all the roots of univariate complex polynomials is proposed. It is obtained from the classical algorithm by a process analogous to renormalization of dynamical systems. This iteration is…
Let X be an affine irreducible variety over an algebraically closed field k of characteristic zero. Given an automorphism F, we denote by k(X)^F its field of invariants, i.e. the set of rational functions f on X such that f(F)=f. Let n(F)…
The concept of polynomials in the sense of algebraic analysis, for a single right invertible linear operator, was introduced and studied originally by D. Przeworska-Rolewicz \cite{DPR}. One of the elegant results corresponding with that…
The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…
In the past 20 years, the enumeration of plane lattice walks confined to a convex cone -- normalized into the first quadrant -- has received a lot of attention, stimulated the development of several original approaches, and led to a rich…
The functional equation f(p(z))=g(q(z)) is studied, where p,q are polynomials and f,g are trancendental meromorphic functions in C. We find all the pairs p,q for which there exist nonconstant f,g satisfying our equation and there exist no…
In this paper we characterize the set of polynomials $f\in\mathbb F_q[X]$ satisfying the following property: there exists a positive integer $d$ such that for any positive integer $\ell$ less or equal than the degree of $f$, there exists…
Can the cross product be generalized? Why are the trace and determinant so important in matrix theory? What do all the coefficients of the characteristic polynomial represent? This paper describes a technique for `doodling' equations from…
In this work we continue to study the properties of polynomials of binomial type and their canonical continuations to the complex index by exploring the properties of transformation T:=1/dlog which acts on formal power series $f(x)$ of the…
Marginalization -- summing a function over all assignments to a subset of its inputs -- is a fundamental computational problem with applications from probabilistic inference to formal verification. Despite its computational hardness in…
We introduce a subexponential algorithm for geometric solving of multivariate polynomial equation systems whose bit complexity depends mainly on intrinsic geometric invariants of the solution set. From this algorithm, we derive a new…
Let $f(q)=a_rq^r+\cdots+a_sq^s$, with $a_r\neq 0$ and $a_s\neq 0$, be a real polynomial. It is a palindromic polynomial of darga $n$ if $r+s=n$ and $a_{r+i}=a_{s-i}$ for all $i$. Polynomials of darga $n$ form a linear subspace…
Let $P$ be a commutative Noetherian ring and $F$ be a self-dual acyclic complex of finitely generated free $P$-modules. Assume that $F$ has length four and $F_0$ has rank one. We prove that $F$ can be given the structure of a Differential…
General factors are a generalization of matchings. Given a graph $G$ with a set $\pi(v)$ of feasible degrees, called a degree constraint, for each vertex $v$ of $G$, the general factor problem is to find a (spanning) subgraph $F$ of $G$…
We develop a linear-algebraic framework for dimensional analysis in systems with constraints, particularly when variables are numerous or related by implicit relations so that direct elimination is impractical. By expressing both…
In this work we present a power series method for solving ordinary and partial differential equations. To demonstrate our method we solve a system of ordinary differential equations describing the movement of a random walker on a…
Symmetric tensor decomposition is an important problem with applications in several areas for example signal processing, statistics, data analysis and computational neuroscience. It is equivalent to Waring's problem for homogeneous…