Related papers: Convex-Cyclic Matrices, Convex-Polynomial Interpol…
Let $P$ be a set of $n$ points in general position on the plane. A set of closed convex polygons with vertices in $P$, and with pairwise disjoint interiors is called a convex decomposition of $P$ if their union is the convex hull of $P$,…
We consider the problem of translating between irreducible closed sets and implicational bases in closure systems. To date, the complexity status of this problem is widely open, and it is further known to generalize the notorious hypergraph…
We study the Hopf monoid of convex geometries, which contains partial orders as a Hopf submonoid, and investigate the combinatorial invariants arising from canonical characters. Each invariant consists of a pair: a polynomial and a more…
A polynomial triangle is an array whose inputs are the coefficients in integral powers of a polynomial. Although polynomial coefficients have appeared in several works, there is no systematic treatise on this topic. In this paper we plan to…
Any solid object can be decomposed into a collection of convex polytopes (in short, convexes). When a small number of convexes are used, such a decomposition can be thought of as a piece-wise approximation of the geometry. This…
The "2-variable general-$\lambda$-matrix polynomials (2VG$\lambda$MP)" is a new family of matrix polynomials, introduced and studied in this article. These matrix polynomials are constructed using umbral and symbolic methods. We delve into…
A $\delta$-vector $\delta(\Pc)= (\delta_0, \delta_1, ..., \delta_d)$ is called shifted symmetric if $\delta_{d-i} = \delta_{i+1}$ for each $0 \leq i \leq [(d-1)/2]$. A natural family of $(0,1)$-polytopes with shifted symmetric…
We study the functional equation $A\circ X=X\circ B$, where $A,$ $B$, and $X$ are polynomials over $\mathbb C$. Using previous results of the author about polynomials sharing preimages of compact sets, we show that for given $B$ its…
We study the geometry, topology and Lebesgue measure of the set of monic conjugate reciprocal polynomials of fixed degree with all roots on the unit circle. The set of such polynomials of degree N is naturally associated to a subset of…
The infinite upper triangular Pascal matrix is $T = [\binom{j}{i}]$ for $0\leq i,j$. It is easy to see that any leading principle square submatrix is triangular with determinant $1$, hence invertible. In this paper, we investigate the…
This note considers the maximal positively invariant set for polynomial discrete time dynamics subject to constraints specified by a basic semialgebraic set. The note utilizes a relatively direct, but apparently overlooked, fact stating…
The purpose of this work is to present the derivation and an estimate of the degrees of the best approximation based on convex, coconvex and unconstrained polynomials, and discuss some applications. We simplify the term convex and coconvex…
A hyperbolic polygon is defined to be cyclic, horocyclic, or equidistant if its vertices lie on a metric circle, horocycle, or a component of the equidistant locus to a hyperbolic geodesic, respectively. Convex such $n$-gons are…
Motivated by the definition of the edge elimination polynomial of a graph we define the covered components polynomial counting spanning subgraphs with respect to their number of components, edges and covered components. We prove a…
We study one-dimensional algebraic families of pairs given by a polynomial with a marked point. We prove an "unlikely intersection" statement for such pairs thereby exhibiting strong rigidity features for these pairs. We infer from this…
Continuing our recent work we study polynomial masks of multivariate tight wavelet frames from two additional and complementary points of view: convexity and system theory. We consider such polynomial masks that are derived by means of the…
In this paper we investigate a spectra of the Laplacian matrix of cyclic groups using the properties of their characteristic polynomials. We have proved several assertions about the relationship between the spectra of different groups.
A polynomial is said to be unimodal if its coefficients are non-decreasing and then non-increasing. The domination polynomial of a graph $G$ is the generating function of the number of domination sets of each cardinality in $G$, and its…
This paper introduces a framework to study discrete optimization problems which are parametric in the following sense: their constraint matrices correspond to matrices over the ring $\mathbb{Z}[x]$ of polynomials in one variable. We…
Discrete dynamical systems defined by the iteration of a polynomial map of the unit simplex to itself appear in the context of population genetic systems evolving under mutation, recombination and weak selection. Although exceptional…