相关论文: Perturbation of complex polynomials and normal ope…

We prove the (generalized) principal pivot transform is matrix monotone, in the sense of the L\"owner ordering, under minimal hypotheses. This improves on the recent results of J. E. Pascoe and R. Tully-Doyle, Monotonicity of the principal…

Fix an integer $n \geq 1$, and consider the set of all connected finite simple graphs on $n$ vertices. For each $G$ in this set, let $I(G)$ denote the edge ideal of $G$ in the polynomial ring $R = K[x_1,\ldots,x_n]$. We initiate a study of…

Given two one-dimensional families $f$ and $g$ of regular plane polynomial automorphisms parameterised by an algebraic curve $B$, all defined over some number field $K$, such that one of them is dissipative, we prove that at any parameter…

Polynomials which afford nonnegative, real-rooted symmetric decompositions have been investigated recently in algebraic, enumerative and geometric combinatorics. Br\"and\'en and Solus have given sufficient conditions under which the image…

Given a family of analytic functions near 0 \in C^n parametrized by a smooth space, we study the Bernstein polynomial of the fiber on an irreducible variety V of the space of parameters and we show that it is generically constant. We prove…

A matrix polynomial is a polynomial in a complex variable $\lambda$ with coefficients in $n \times n$ complex matrices. The spectral curve of a matrix polynomial $P(\lambda)$ is the curve $\{ (\lambda, \mu) \in \mathbb{C}^2 \mid…

In previous work, we proved that the continuous roots of a monic polynomial of degree $d$ whose coefficients depend in a $C^{d-1,1}$ way on real parameters belong to the Sobolev space $W^{1,q}$ for all $1\le q<d/(d-1)$. This is optimal. We…

In this text we study the regularity of matrices with special polynomial entries. Barring some mild conditions we show that these matrices are regular if a natural limit size is not exceeded. The proof draws connections to generalized…

For a sequence of polynomials $\{p_k(t)\}$ in one real or complex variable, where $p_k$ has degree $k$, for $k\ge 0$, we find explicit expressions and recurrence relations for infinite matrices whose entries are the coefficients $d(n,m,k)$,…

Growing out of the initial connections between subfactors and knot theory that gave rise to the Jones polynomial, Jones' axiomatization of the standard invariant of an extremal finite index $II_1$ subfactor as a spherical $C^*$-planar…

It is common in stability analysis to linearize a system and investigate the spectrum of the Jacobian matrix. This approach faces the challenge of determining the matrix spectrum when the coefficients depend on parameters or when the…

We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph $H$ to $n$-vertex graphs. These polynomials have received a lot of attention recently for their crucial role in several new…

We investigate Newton's method as a root finder for complex polynomials of arbitrary degree. While polynomial root finding continues to be one of the fundamental tasks of computing, with essential use in all areas of theoretical…

We consider a bounded Lipschitz domain $\Omega\subseteq\mathbb{R}^3$ with sufficiently smooth boundary and prove piecewise Sobolev regularity of vector fields that have piecewise regular curl and divergence, but may be discontinuous across…

The strong spectral order induces a natural partial ordering on the manifold $H_{n}$ of monic hyperbolic polynomials of degree $n$. We prove that twisted root maps associated with linear operators acting on $H_{n}$ are G\aa rding convex on…

Let $\mathcal{P}_{\kappa_1}^{\kappa_2}(\boldsymbol{P}, \boldsymbol{Q})$ denote the set of $C^1$ regular curves in the $2$-sphere $\mathbb{S}^2$ that start and end at given points with the corresponding Frenet frames $\boldsymbol{P}$ and…

The Tutte polynomial is a fundamental invariant of graphs and matroids. In this article, we define a generalization of the Tutte polynomial to oriented graphs and regular oriented matroids. To any regular oriented matroid $N$, we associate…

The NP-hard general factor problem asks, given a graph and for each vertex a list of integers, whether the graph has a spanning subgraph where each vertex has a degree that belongs to its assigned list. The problem remains NP-hard even if…

We argue that parameterized complexity is a useful tool with which to study global constraints. In particular, we show that many global constraints which are intractable to propagate completely have natural parameters which make them…

We analyze the performance of a variant of Newton method with quadratic regularization for solving composite convex minimization problems. At each step of our method, we choose regularization parameter proportional to a certain power of the…