Related papers: Critical Points, Critical Values, and a Determinan…

For each algebraic number $\alpha$ and each positive real number $t$, the $t$-metric Mahler measure $m_t(\alpha)$ creates an extremal problem whose solution varies depending on the value of $t$. The second author studied the points $t$ at…

We present a new identity involving compositions (i.e. ordered partitions of natural numbers). The Formula has its origin in complex dynamical systems and appears when counting, in the polynomial family $\{f_c:z \mapsto z^d + c \}$,…

We study the critical window of the symmetric binary perceptron, or equivalently, combinatorial discrepancy. Consider the problem of finding a binary vector $\sigma$ satisfying $\|A\sigma\|_\infty \le K$, where $A$ is an $\alpha n \times n$…

We investigate the multiplier rigidity problem for polynomial automorphisms of $\mathbf{C}^2$. A first result states that a complex H\'enon map of given degree is determined up to finitely many choices by its multiplier spectrum, or more…

In this paper we present an algorithm to obtain the parameter planes of families of root-finding methods with several free critical points. The parameter planes show the joint behaviour of all critical points. This algorithm avoids the…

In many areas of applied mathematics and statistics, it is a fundamental problem to find the best representative of a model by optimizing an objective function. This can be done by determining critical points of the objective function…

Let $A$ be an $n\times n$ real Toeplitz matrix satisfying $A+A^{\top}=2\mathbb J_n$, where $\mathbb J_n$ is the all-ones matrix.If $A_r(i,j)$ denotes the $r\times r$ contiguous submatrix of $A$ consisting of rows $i,i+1,\dots,i+r-1$ and…

Let $C$ be the attractor of the IFS $\{f_{d}(z) = (-n+i)^{-1}(z+d): d\in D\}$, $D\subset\{0, 1, \ldots, n^{2}\}$ and let $\dim$ denote the box-counting dimension. It is known that for all $\lambda\in[0, 1]$, that the set of complex numbers…

Tensor polynomial identities generalize the concept of polynomial identities on $d \times d$ matrices to identities on tensor product spaces. Here we completely characterize a certain class of tensor polynomial identities in terms of their…

Critical ideals generalize the critical group, Smith group and the characteristic polynomials of the adjacency and Laplacian matrices of a graph. We give a complete characterization of the digraphs with at most one trivial critical ideal.…

We provide a unified, elementary, topological approach to the classical results stating the continuity of the complex roots of a polynomial with respect to its coefficients, and the continuity of the coefficients with respect to the roots.…

We consider the family of dynamical modular curves associated to quadratic polynomial maps and determine precisely which of these curves have infinitely many cubic points. We use this to prove a classification statement on preperiodic…

We investigate determinants of random unitary pencils (with scalar or matrix coefficients), which generalize the characteristic polynomial of a single unitary matrix. In particular we examine moments of such determinants, obtained by…

Doubly non-negative matrices arise naturally in many setting including Markov random fields (positively banded graphical models) and in the convergence analysis of Markov chains. In this short note, we settle a recent conjecture by C.R.…

Let $F \in \R[X_1,\ldots,X_n]$ and the zero set $V=\zero(\mathcal{P},\R^n)$, where $\mathcal{P}:=\{P_1,\ldots,P_s\} \subset \R[X_1,\ldots,X_n]$ is a finite set of polynomials. We investigate existence of critical points of $F$ on an…

We are interested in solving decision problem $\exists? t \in \mathbb{N}, \cos t \theta = c$ where $\cos \theta$ and $c$ are algebraic numbers. We call this the $\cos t \theta$ problem. This is an exploration of Diophantine equations with…

In this paper we give an alternative, purely Conley index based proof of the Arnold conjecture in $\mathbb C\mathbb P^n$ asserting that a Hamiltonian diffeomorphism of $\mathbb C\mathbb P^n$ endowed with the Fubini-Study metric has at least…

J. Makowsky and B. Zilber (2004) showed that many variations of graph colorings, called CP-colorings in the sequel, give rise to graph polynomials. This is true in particular for harmonious colorings, convex colorings, mcc_t-colorings, and…

Two are the main objectives of this article: first, we introduce a method for determining and analyzing constrained local extrema that provides a different alternative to all previous works on the topic, by eliminating Lagrange multipliers…

The Gauss--Lucas and B\^{o}cher--Grace--Marden theorems are classical results in the geometry of polynomials. Proofs of the these results are available in the literature, but the approaches are seemingly different. In this work, we show…