相关论文: Pole Placement with Fields of Positive Characteris…
Boris Shapiro and Michael Shapiro have a conjecture concerning the Schubert calculus and real enumerative geometry and which would give infinitely many families of zero-dimensional systems of real polynomials (including families of…
Given a rank 3 real arrangement $\mathcal A$ of $n$ lines in the projective plane, the Dirac-Motzkin conjecture (proved by Green and Tao in 2013) states that for $n$ sufficiently large, the number of simple intersection points of $\mathcal…
Alt's problem, formulated in 1923, is to count the number of four-bar linkages whose coupler curve interpolates nine general points in the plane. This problem can be phrased as counting the number of solutions to a system of polynomial…
This paper concerns some spectral properties of the scalar dynamical system defined by a linear delay-differential equation with two positive delays. More precisely, the existing links between the delays and the maximal multiplicity of the…
We formulate and solve a pole placement problem by state feedback for overdetermined 2D systems modeled by commutative operator vessels. In this setting, the transfer function of the system is given by a meromorphic bundle map between two…
The classical eigenvalue assignment problem is revisited in this note. We derive an analytic expression for pole placement which represents a slight generalization of the celebrated Bass-Gura and Ackermann formulae, and also is closely…
It is well known that the bivariate polynomial interpolation problem at domain points of a triangle is correct. Thus the corresponding interpolation matrix $M$ is nonsingular. L.L. Schumaker stated the conjecture, that the determinant of…
We show that Hilbert's Nullstellensatz, the problem of deciding if a system of multivariate polynomial equations has a solution in the algebraic closure of the underlying field, lies in the counting hierarchy. More generally, we show that…
For a prime $p$ and a positive integer $s$ consider a homogeneous linear system over the ring $\mathbb{Z}_{p^s}$ (the ring of integers modulo $p^s$) described by an $n \times m$-matrix. The possible number of solutions to such a system is…
This article is the first in a series devoted to computing the class groups of real quadratic fields. We present a new relation between the class number and the index of unit groups. This relation generalizes Hilbert class field theory for…
We derive some explicit expressions for correlators on Grassmannian G_r(C^n) as well as on the moduli space of holomorphic maps, of a fixed degree d, from sphere into the Grassmannian. Correlators obtained on the Grassmannain are a first…
The Lempert function for a set of poles in a domain of $\mathbb C^n$ at a point $z$ is obtained by taking a certain infimum over all analytic disks going through the poles and the point $z$, and majorizes the corresponding multi-pole…
We consider discrete ensembles of linear, scalar control systems with single-inputs. Assuming that all the individual systems are unstable, we investigate whether there exist linear feedback control laws that can asymptotically stabilize…
In this paper, we propose a method to design state feedback harmonic control laws that assign the closed loop poles of a linear harmonic model to some desired locations. The procedure is based on the solution of an infinite-dimensional…
The notion of $\theta$-congruent numbers generalizes the classical congruent number problem. Recall that a positive integer $n$ is $\theta$-congruent if it is the area of a rational triangle with an angle $\theta$ whose cosine is rational.…
In 1935, Erd\H{o}s and Szekeres proved that every set of $n$ points in general position in the plane contains the vertices of a convex polygon of $\frac{1}{2}\log_2(n)$ vertices. In 1961, they constructed, for every positive integer $t$, a…
This paper studies the problem of pole assignment for symmetric and Hamiltonian transfer functions. A necessary and sufficient condition for pole assignment by complex symmetric output feedback transformations is given. Moreover, in the…
We provide some new necessary and sufficient conditions which guarantee arbitrary pole placement of a particular linear system over the complex numbers. We exhibit a non-trivial real linear system which is not controllable by real static…
We show that among any $n$ points in the unit cube one can find a triangle of area at most $n^{-2/3-c}$ for some absolute constant $c >0$. This gives the first non-trivial upper bound for the three-dimensional version of Heilbronn's…
The classical no-three-in-line problem is to find the maximum number of points that can be placed in the $n \times n$ grid so that no three points lie on a line. Given a set $S$ of points in an Euclidean plane, the General Position Subset…