Related papers: Algorithm for studying polynomial maps and reducti…

This is a short note that explains a problem on polynomial maps over finite fields for non-experts. The problem is: Do there exist odd polynomial automorphisms over the finite fields with 4,8,16,32,64,... elements? The explanation is very,…

Bernstein polynomials, long a staple of approximation theory and computational geometry, have also increasingly become of interest in finite element methods. Many fundamental problems in interpolation and approximation give rise to…

Generalizing the method of Faltings-Serre, we rigorously verify that certain abelian surfaces without extra endomorphisms are paramodular. To compute the required Hecke eigenvalues, we develop a method of specialization of Siegel…

Univariate polynomial root-finding is a classical subject, still important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the…

Given a finite field $\F_q$ and $n\in \N^*$, one could try to compute all polynomial endomorphisms $\F_q^n\lp \F_q^n$ up to a certain degree with a specific property. We consider the case $n=3$. If the degree is low (like 2,3, or 4) and the…

Let $I(X,R)$ be the incidence algebra of the preordered set $X$ over the ring $R$. In the case of a finite connected partially ordered set $X$, we prove that the subgroup of inner multiplicative automorphisms is a direct factor of the group…

We establish how the coefficients of a sparse polynomial system influence the sum (or the trace) of its zeros. As an application, we develop numerical tests for verifying whether a set of solutions to a sparse system is complete. These…

In this note, we investigate Jacobian conjecture through investigation of automorphisms of polynomial rings in characteristic $p$. Making use of the technique of inverse limits, we show that under Jacobian condition for a given homomorphism…

The computational complexity of simultaneous inference methods in high-dimensional linear regression models quickly increases with the number variables. This paper proposes a computationally efficient method based on the Moore-Penrose…

We present a comprehensive analysis of an algorithm for evaluating high-dimensional polynomials that are invariant under permutations and rotations. The key bottleneck is the contraction of a high-dimensional symmetric and sparse tensor…

Matrix congruence extends naturally to the setting of tensors. We apply methods from tensor decomposition, algebraic geometry and numerical optimization to this group action. Given a tensor in the orbit of another tensor, we compute a…

Numerical algebraic geometry revolves around the study of solutions to polynomial systems via numerical methods. The polyhedral homotopy of Huber and Sturmfels for computing isolated solutions and the concept of witness sets as numerical…

In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…

Let $F: C^n \rightarrow C^m$ be a polynomial map with $degF=d \geq 2$. We prove that $F$ is invertible if $m = n$ and $\sum^{d-1}_{i=1} JF(\alpha_i)$ is invertible for all $i$, which is trivially the case for invertible quadratic maps. More…

In this paper, we study the MapReduce framework from an algorithmic standpoint and demonstrate the usefulness of our approach by designing and analyzing efficient MapReduce algorithms for fundamental sorting, searching, and simulation…

In this work, we prove a general version of the reduction lemmas for eigenfunctions of graphs admitting involutive automorphisms of a special type.

We present a framework for solving a broad class of ill-posed inverse problems governed by partial differential equations (PDEs), where the target coefficients of the forward operator are recovered through an iterative regularization scheme…

The concept of descent algebras over a field of characteristic zero is extended to define descent algebras over a field of prime characteristic. Some basic algebraic structure of the latter, including its radical and irreducible modules, is…

Vladimir Shpilrain and Jie-Tai Yu have asked for an effective algorithm to decide if two elements of C[x,y] are related by an automorphism of C[x,y]. We describe here an efficient algorithm that decides this question and finds the…

We introduce the notion of semi-characteristic polynomial for a semi-linear map of a finite- dimensional vector space over a field of characteristic p. This polynomial has some properties in common with the classical characteristic…