Related papers: Morse numbers of complex polynomials

For a Morse function f on a compact oriented manifold M, we show that f has more critical points than the number required by the Morse inequalities if and only if there exists a certain class of link in M whose components have nontrivial…

The Morse-Smale complex is an important tool for global topological analysis in various problems of computational geometry and topology. Algorithms for Morse-Smale complexes have been presented in case of piecewise linear manifolds.…

We establish basic facts about the varieties of homogeneous polynomials divisible by powers of linear forms, and explain consequences for geometric complexity theory. This includes quadratic set-theoretic equations, a description of the…

In this paper, we study deformations of Brieskorn polynomials of two variables obtained by adding linear terms consisting of the conjugates of complex variables and prove that the deformed polynomial maps have only indefinite fold and cusp…

The analysis of solutions to algebraic equations is further simplified. A couple of functions and their analytic continuation or root findings are required.

The paper concerns a result in linear algebra motivated by ideas from tropical geometry. Let $A(t)$ be an $n \times n$ matrix whose entries are Laurent series in $t$. We show that, as $t \to 0$, logarithms of singular values of $A(t)$…

We consider different generalizations of the Euler formula and discuss the properties of the associated trigonometric functions. The problem is analyzed from different points of view and it is shown that it can be formulated in a natural…

We present a few factorizations of polynomials over finite fields. These factorizations are related to traces, compositions of polynomials and binomial coefficients. As a corollary we obtain a description of all irreducible polynomials…

We compute the asymptotic number of monic trace-one integral polynomials with Galois group $C_3$ and bounded height. For such polynomials we compute a height function coming from toric geometry and introduce a parametrization using the…

The Fibonacci polynomials are defined recursively as $f_{n}(x)=xf_{n-1}(x)+f_{n-2}(x)$, where $f_0(x) = 0$ and $f_1(x)= 1$. We generalize these polynomials to an arbitrary number of variables with the $r$-Fibonacci polynomial. We extend…

We provide a generalization of an algebraic linear combination for the trace of certain elliptic modular forms, and through specializing the expression at a suitable pair consisting of an elliptic curve over algebraic number fields and its…

Let $\mathbb{F}$ be a finite field and let $f$ be a linear polynomial in $\mathbb{F}[x]$. We investigate the number of polynomials of degree $d$ which commute with $f$ under composition. In so doing, we rediscover a result of Park, but with…

Following the author's previous works, we continue to consider the problem of counting the number of affine conjugacy classes of polynomials of one complex variable when its unordered collection of holomorphic fixed point indices is given.…

Some important properties of the chromatic polynomial also hold for any polynomial set map satisfying p_S(x+y)=\sum_{T\uplus U=S}p_T(x)p_U(y). Using umbral calculus, we give a formula for the expansion of such a set map in terms of any…

For affine algebraic plane curves we reduce a calculation of its invariants to calculation of the intersection of kernels of some derivations.

Given a smooth closed manifold M, the Morse-Witten complex associated to a Morse function f and a Riemannian metric g on M consists of chain groups generated by the critical points of f and a boundary operator counting isolated flow lines…

We study codimension one smooth foliations with Morse type singularities on closed ma-nifolds. We obtain a description of the manifold in case the number of centers in greater then the number of saddles. This result relies on and extends…

We define and study the Tutte polynomial of a hyperplane arrangement. We introduce a method for computing it by solving an enumerative problem in a finite field. For specific arrangements, the computation of Tutte polynomials is then…

A classical problem in dynamical systems is to measure the complexity of a map in terms of their orbits. One of the main tools we have to achieve this goal is entropy. However, many interesting families of dynamical systems have every…

This paper discusses the split feasibility problem with polynomials. The sets are semi-algebraic, defined by polynomial inequalities. They can be either convex or nonconvex, either feasible or infeasible. We give semidefinite relaxations…