相关论文: Pole Placement with Fields of Positive Characteris…

We prove a complex polynomial of degree $n$ has at most $\lceil n/2 \rceil$ attractive fixed points lying on a line. We also consider the general case.

We study in this paper solutions to several kinds of linear bimatrix equations arising from pole assignment and stability analysis of complex-valued linear systems, which have several potential applications in control theory, particularly,…

Given a graph $G$, the general position problem is to find a largest set $S$ of vertices of $G$ such that no three vertices of $S$ lie on a common geodesic. Such a set is called a ${\rm gp}$-$set$ of $G$ and its cardinality is the ${\rm…

We examine quadratic surfaces in 3-space that are tangent to nine given figures. These figures can be points, lines, planes or quadrics. The numbers of tangent quadrics were determined by Hermann Schubert in 1879. We study the associated…

A criterion for determining exactly when an order of a maximal subfield of a central simple algebra over a number field can be embedded into an order of this algebra is given. Various previous results have been generalized and recovered by…

In this work, we study the Hermite interpolation on $n$-dimensional non-equally spaced, rectilinear grids over a field $\Bbbk $ of characteristic zero, given the values of the function at each point of the grid and the partial derivatives…

We systematically classify all possible poles of superconformal blocks as a function of the scaling dimension of intermediate operators, for all superconformal algebras in dimensions three and higher. This is done by working out the…

Let P be a poset with elements 1,2,...,n. We say that P is sign-balanced if exactly half the linear extensions of P (regarded as permutations of 1,2,...,n) are even permutations, i.e., have an even number of inversions. This concept first…

We present a general construction of Salem numbers via rational functions whose zeros and poles mostly lie on the unit circle and satisfy an interlacing condition. This extends and unifies earlier work. We then consider the "obvious" limit…

The origins of the notion of matchings in groups spawn from a linear algebra problem proposed by E. K. Wakeford [24] which was tackled in 1996 [10]. In this paper, we first discuss unmatchable subsets in abelian groups. Then we formulate…

Real-stable, Lorentzian, and log-concave polynomials are well-studied classes of polynomials, and have been powerful tools in resolving several conjectures. We show that the problems of deciding whether a polynomial of fixed degree is real…

In this note, we obtain a classification result for positive solutions to the critical p-Laplace equation in $\mathbb{R}^n$ with $n\ge4$ and $p>p_n$ for some number $p_n\in\left(\frac{n}{3},\frac{n+1}{3}\right)$ such that…

In this thesis we give an in-depth introduction to the General Number Field Sieve, as it was used by Buhler, Lenstra, and Pomerance, before looking at one of the modern developments of this algorithm: A randomized version with provable…

We consider the problem of bounding away from 0 the minimum value m taken by a polynomial P of Z[X_1,...,X_k] over the standard simplex, assuming that m>0. Recent algorithmic developments in real algebraic geometry enable us to obtain a…

Local holomorphic solutions z=z(a) to a univariate sparse polynomial equation p(z) =0, in terms of its vector of complex coefficients a, are classically known to satisfy holonomic systems of linear partial differential equations with…

Positivstellens{\"a}tze are a group of theorems on the positivity of involution algebras over $\mathbb{R}$ or $\mathbb{C}$. One of the most well-known Positivstellensatz is the solution to Hilbert's 17th problem given by E. Artin, which…

Recently Braga and Mello conjectured that for a given natural number n there is a piecewise linear system with two zones in the plane with exactly n limit cycles. In this paper we prove a result from which the conjecture is an immediate…

Given a graph $G$, the (graph theory) general position problem is to find the maximum number of vertices such that no three vertices lie on a common geodesic. This graph invariant is called the general position number (gp-number for short)…

This work provides a complete characterization of the solutions of a linear interpolation problem for vector polynomials. The interpolation problem consists in finding n scalar polynomials such that an equation involving a linear…

This work concerns an alignment problem that has applications in many geospatial problems such as resource allocation and building reliable disease maps. Here, we introduce the problem of optimally aligning $k$ collections of $m$ spatial…