Related papers: The images of multilinear polynomials on strictly …
We introduce different notions of polynomial convexity with bounds on degrees of polynomials in $\mathbb C^n$. We provide some examples in higher dimensions and show necessary and sufficient conditions for polynomial convexity with degree…
Certain types of bilinearly defined sets in $\mathbb{R}^n$ exhibit a higher degree of linearity than what is apparent by inspection.
We study maximal subalgebras of an arbitrary finite dimensional algebra over a field, and obtain full classification/description results of such algebras. This is done by first obtaining a complete classification in the semisimple case, and…
We compute the graded automorphisms of the upper triangular matrices, viewed as associative, Lie and Jordan algebras. We compute also the so called self-equivalences and Weyl and diagonal groups for every grading.
In this article we give explicit descriptions of the multiplicities of some classes of monomial ideals. For instance, we give a formula for the multiplicities of all codimension 1 monomial ideals, and another formula for the multiplicities…
We address the problem of the determination of the images of three-dimensional geometric and modular Galois representations. In the modular case the existence of these representations is only conjectural. We give conditions to ensure that…
Techniques for the evaluation of complex polynomials with one and two variables are introduced. Polynomials arise in may areas such as control systems, image and signal processing, coding theory, electrical networks, etc., and their…
This paper has a twofold purpose: to present an overview of the theory of absolutely summing operators and its different generalizations for the multilinear setting, and to sketch the beginning of a research project related to an objective…
The observational characteristics of a linear structural equation model can be effectively described by polynomial constraints on the observed covariance matrix. However, these polynomials can be exponentially large, making them impractical…
In this paper we introduce a new approach and obtain new results for the problem of studying polynomial images of affine subspaces of finite fields. We improve and generalise several previous known results, and also extend the range of such…
Motivated by some recent developments in abstract theories of quadratic forms, we start to develop in this work an expansion of Linear Algebra to multivalued structures (a multialgebraic structure is essentially an algebraic structure but…
The problem of expressing a specific polynomial as the determinant of a square matrix of affine-linear forms arises from algebraic geometry, optimisation, complexity theory, and scientific computing. Motivated by recent developments in this…
In this paper the main results in arXiv:0901.3179v3, related to the matrix representation of polynomial maps, are restated in traditional way of linear algebra assuming that variable vectors are presented as column vectors. Some new results…
This paper addresses two primary objectives in the realm of classical multiple orthogonal polynomials with an arbitrary number of weights. Firstly, it establishes new and explicit hypergeometric expressions for type I Hahn multiple…
Trilinear mappings appear naturally when performing spatial isogeometric discretizations of degree $p = 1$. Among them, birational maps are characterized by the property that both the mapping and the associated inverse map are rational and…
We describe an efficient algorithm to compute a pseudotriangulation of a finite planar family of pairwise disjoint convex bodies presented by its chirotope. The design of the algorithm relies on a deepening of the theory of visibility…
In this paper I survey the sources of inspiration for my own and co-authored work in trying to develop a general theory of graph polynomials. I concentrate on meta-theorems, i.e., theorem which depend only on the form infinite classes of…
We study the plane automorphisms given by polynomials with certain degree decompositions.
After defining convex near-polygons, a formula enumerating the number of triangulations of such configurations is derived in terms of edge-polynomials. The paper describes also a transfer-matrix approach for computing quantities related to…
The work proves that, for three-dimensional upper triangular groups over a field of odd characteristic with an abelian unipotent subgroup, the ring of invariants is polynomial if and only if the unipotent subgroup is generated by…