Related papers: Algorithm for studying polynomial maps and reducti…
The goal of this paper is to study the path-following method for univariate polynomials. We propose to study the complexity and condition properties when the Newton method is applied as a correction operator. Then we study the geodesics and…
Motivated by graphical models, we consider the "Sparse Plus Low-rank" decomposition of a positive definite concentration matrix -- the inverse of the covariance matrix. This is a classical problem for which a rich theory and numerical…
We consider binomial and inverse binomial sums at infinity and rewrite them in terms of a small set of constants, such as powers of $\pi$ or $\log(2)$. In order to perform these simplifications, we view the series as specializations of…
The purpose of this paper is to analyze the Moore-Penrose pseudo-inversion of symmetric real matrices with application in the graph theory. We introduce a novel concept of positively and negatively pseudo-inverse matrices and graphs. We…
We show that all permutations in $S_n$ can be generated by affine unicritical polynomials. We use the $\operatorname{PGL}$ group structure to compute the cycle structure of permutations with low Carlitz rank. The tree structure of the group…
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…
Given a real closed polytope $P$, we first describe the Fourier transform of its indicator function by using iterations of Stokes' theorem. We then use the ensuing Fourier transform formulations, together with the Poisson summation formula,…
We consider the numerical irreducible decomposition of a positive dimensional solution set of a polynomial system into irreducible factors. Path tracking techniques computing loops around singularities connect points on the same irreducible…
We give an efficient algorithm for the enumeration up to isomorphism of the inverse semigroups of order n, and we count the number S(n) of inverse semigroups of order n<=15. This improves considerably on the previous highest-known value…
Coxeter polynomials are important homological invariants that are defined for a large class of finite-dimensional algebras. It is of particular interest to develop methods to compute these polynomials. We define the notion of insertion of a…
The graph isomorphism problem looks deceptively simple, but although polynomial-time algorithms exist for certain types of graphs such as planar graphs and graphs with bounded degree or eigenvalue multiplicity, its complexity class is still…
In this article we provide a fast computational method in order to calculate the Moore-Penrose inverse of singular square matrices and of rectangular matrices. The proposed method proves to be much faster and has significantly better…
In solving Bayesian inverse problems, it is often desirable to use a common density parameterization to denote the prior and posterior. Typically we seek a density from the same family as the prior which closely approximates the true…
We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…
We investigate graded retracts of polytopal algebras (essentially the homogeneous rings of affine cones over projective toric varieties) as polytopal analogues of vector spaces. In many cases we show that these retracts are again polytopal…
This paper describes a method for computing all F-pure ideals for a given Cartier map of a polynomial ring over a finite field.
We focus on two central themes in this dissertation. The first one is on decomposing polytopes and polynomials in ways that allow us to perform nonlinear optimization. We start off by explaining important results on decomposing a polytope…
Given a permutation polynomial of a large finite field, finding its inverse is usually a hard problem. Based on a piecewise interpolation formula, we construct the inverses of cyclotomic mapping permutation polynomials of arbitrary finite…
We study the algebraic dynamical systems generated by triangular systems of rational functions and estimate the height growth of iterations generated by such systems. Further, using a result on the reduction modulo primes of systems of…
In this paper, we first give formulas for the order polynomial $\Omega (\Pw; t)$ and the Eulerian polynomial $e(\Pw; \lambda)$ of a finite labeled poset $(P, \omega)$ using the adjacency matrix of what we call the $\omega$-graph of $(P,…