Related papers: Convex-Cyclic Matrices, Convex-Polynomial Interpol…

The theory of polynomial-like maps is of fundamental importance in holomorphic dynamics. We study dynamical properties of a larger class of maps. Our main result is that, under some natural conditions, a map of this class has a completely…

We introduce circulant matrices that capture the structure of a skew-polynomial ring F[x;\theta] modulo the left ideal generated by a polynomial of the type x^n-a. This allows us to develop an approach to skew-constacyclic codes based on…

This paper presents a framework for abstracting uncertain or non-polynomial components of dynamical systems using polynomial constraints. This enables the application of polynomial-based analysis tools, such as sum-of-squares programming,…

A basic combinatorial invariant of a convex polytope $P$ is its $f$-vector $f(P)=(f_0,f_1,\dots,f_{\dim P-1})$, where $f_i$ is the number of $i$-dimensional faces of $P$. Steinitz characterized all possible $f$-vectors of $3$-polytopes and…

Let $A$ be a square complex matrix, $z_1$, ..., $z_{n}\in\mathbb C$ be (possibly repetitive) points of interpolation, $f$ be analytic in a neighborhood of the convex hull of the union of the spectrum of $A$ and the points $z_1$, ...,…

In this paper we give a matrix version of Handelman's Positivstellensatz [1], representing polynomial matrices which are positive definite on convex, compact polyhedra. Moreover, we propose also a procedure to find such a representation. As…

We study sets defined as the intersection of a rank-1 constraint with different choices of linear side constraints. We identify different conditions on the linear side constraints, under which the convex hull of the rank-1 set is polyhedral…

By a symmetry of the Julia set of a polynomial, also referred as polynomial Julia set, we mean an Euclidean isometry preserving the Julia set. Each such symmetry is in fact a rotation about the centroid of the polynomial. In this article, a…

We consider the convex quadratic optimization problem with indicator variables and arbitrary constraints on the indicators. We show that a convex hull description of the associated mixed-integer set in an extended space with a quadratic…

The present paper introduces a modified version of cyclic-monotone independence which originally arose in the context of random matrices, and also introduces its natural analogy called cyclic-Boolean independence. We investigate formulas…

We describe the canonical correspondence between set of all finite metric spaces and set of special symmetric convex polytopes, and formulate the problem about classification of the metric spaces in terms of combinatorial structure of those…

In this paper, we introduce zeta values of rational convex cones, which is a generalization of cyclotomic multiple zeta values. These zeta values have integral expressions. The main theorem asserts that zeta values of cones can be expressed…

Explicit generators are given for the ring of invariant polynomials under the coadjoint representation of certain inhomogeneous groups.

Zernike polynomials are a basis of orthogonal polynomials on the unit disk that are a natural basis for representing smooth functions. They arise in a number of applications including optics and atmospheric sciences. In this paper, we…

Let $ SM_n(\mathbb{R})^g$ denote $g$-tuples of $n \times n$ real symmetric matrices. Given tuples $X=(X_1, \dots, X_g) \in SM_{n_1}(\mathbb{R})^g$ and $Y=(Y_1, \dots, Y_g) \in SM_{n_2}(\mathbb{R})^g$, a matrix convex combination of $X$ and…

We study the cyclicity of polynomials in Poletsky-Stessin weighted Bergman spaces on various domains in $\mathbb{C}^2$, including the unit ball, the bidisk, and the complex ellipsoid. To this end, we introduce a natural extension of the…

In this note we show that the degree of the interpolation polynomial for equidistant base points is characterized by the regularity of matrices of combinatorical type.

In this paper we study sequences of vector orthogonal polynomials. The vector orthogonality presented here provides a reinterpretation of what is known in the literature as matrix orthogonality. These systems of orthogonal polynomials…

This paper surveys a comprehensive, although not exhaustive, sampling of graph polynomials with the goal of providing a brief overview of a variety of techniques defining a graph polynomial and then for decoding the combinatorial…

The circumcircle of a planar convex polygon P is a circle C that passes through all vertices of P. If such a C exists, then P is said to be cyclic. Fix C to have unit radius. While any two angles of a uniform cyclic triangle are negatively…