Related papers: Bounded and unbounded polynomials and multilinear …
This article is studying the roots of the reliability polynomials of linear consecutive-\textit{k}-out-of-\textit{n}:\textit{F} systems. We are able to prove that these roots are unbounded in the complex plane, for any fixed $k\ge2$. In the…
We consider the problem of extending the classical S-lemma from commutative case to noncommutative cases. We show that a symmetric quadratic homogeneous matrix-valued polynomial is positive semidefinite if and only if its coefficient matrix…
We prove several results on the multiplier spectrum of polynomials. We provide a detailed proof of the theorem stating that the multiplier spectrum morphism is generically injective on the moduli space of polynomials. We obtain a…
We study a class of chainable continua which contains, among others, all inverse limit spaces generated by a single interval bonding map which is piecewise monotone and locally eventually onto. Such spaces are realized as attractors of…
We study the maximum modulus set, $\mathcal{M}(p)$, of a polynomial $p$. We are interested in constructing $p$ so that $\mathcal{M}(p)$ has certain exceptional features. Jassim and London gave a cubic polynomial $p$ such that…
Given a multiarrangement of hyperplanes we define a series by sums of the Hilbert series of the derivation modules of the multiarrangement. This series turns out to be a polynomial. Using this polynomial we define the characteristic…
We look at spaces of infinite-by-infinite matrices, and consider closed subsets that are stable under simultaneous row and column operations. We prove that up to symmetry, any of these closed subsets is defined by finitely many equations.
A univariate polynomial f over a field is decomposable if it is the composition f = g(h) of two polynomials g and h whose degree is at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and…
In this paper we develop in detail the geometric constructions that lead to many uniqueness results for the determination of polyhedral sets, typically scatterers, by a finite minimal number of measurements. We highlight how unique…
We provide an internal characterization of those finite algebras (i.e., algebraic structures) $\mathbf A$ such that the number of homomorphisms from any finite algebra $\mathbf X$ to $\mathbf A$ is bounded from above by a polynomial in the…
The work in this paper is to initiate a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by certain economically compact structure has a multilinear monomial in its…
In this paper we describe the well studied process of renormalization of quadratic polynomials from the point of view of their natural extensions. In particular, we describe the topology of the inverse limit of infinitely renormalizable…
We compute the graded polynomial identities of the infinite dimensional upper triangular matrix algebra over an arbitrary field. If the grading group is finite, we prove that the set of graded polynomial identities admits a finite basis. We…
The class of $\mu$-compact sets can be considered as a natural extension of the class of compact metrizable subsets of locally convex spaces, to which the particular results well known for compact sets can be generalized. This class…
A finite relational structure A is called compact if for any infinite relational structure B of the same type, the existence of a homomorphism from B to A is equivalent to the existence of homomorphisms from all finite substructures of B to…
The problem of classifying tuples of nilpotent matrices over a field under simultaneous conjugation is considered "hopeless". However, for any given matrix order over a finite field, the number of concerned orbits is always finite. This…
In this paper some classes of local polynomial functions on abelian groups are characterized by the properties of their variety. For this characterization we introduce a numerical quantity depending on the variety of the local polynomial…
In a countably normed space which is a linear space equipped with a countable number of pair-wise compatible norms, we prove the existence of a common nearest point (in all norms) from a point outside a nonempty subset if this subset is…
Raimi's theorem guarantees the existence of a partition of $\mathbb{N}$ into two parts with an unavoidable intersection property: for any finite coloring of $\mathbb{N}$, some color class intersects both parts infinitely many times, after…
We give a new proof of the result that if f and g are transcendental entire functions, then the composite function f(g) has infinitely many fixed points. The method yields a number of generalization of this result. In particular, it extends…