Related papers: Analytical aspects of matrix interpolation problem…
Near-vector spaces extend linear algebra tools to non-linear algebraic structures, enabling the study of non-linear problems. However, explicit constructions remain rare. This paper introduces a broad computable family of near-vector…
For univariate polynomials over arbitrary field the degree gives an upper bound on the number of roots (factor theorem) and as a related result for any finite point-set one can construct a polynomial of degree equal to the cardinality…
Let A be an m-dimensional vector with positive real entries. Let A_{i,j} be the vector obtained from A on deleting the entries A_i and A_j. We investigate some invariant and near invariants related to the solutions E (m-2 dimensional…
Let $\mathbf{P}^{m}_{b}(x)$ be a $2m+1$-degree polynomial in $x$ and $b \in \mathbb{R}$ \[ \mathbf{P}^{m}_{b}(x) = \sum_{k=0}^{b-1} \sum_{r=0}^{m} \mathbf{A}_{m,r} k^r (x-k)^r \] where $\mathbf{A}_{m,r}$ are real coefficients. In this…
We first give a characterization for Mathieu subspaces of univariate polynomial algebras over fields in terms of their radicals. We then deduce that for some classes of classical univariate orthogonal polynomials the Image Conjecture is…
We study the problem of generating monomials of a polynomial in the context of enumeration complexity. In this setting, the complexity measure is the delay between two solutions and the total time. We present two new algorithms for…
We give an explicit geometric way to build mixed-integer programming (MIP) formulations for unions of polyhedra. The construction is simply described in terms of spanning hyperplanes in an r-dimensional linear space. The resulting MIP…
The multiparameter matrix pencil problem (MPP) is a generalization of the one-parameter MPP: given a set of $m\times n$ complex matrices $A_0,\ldots, A_r$, with $m\ge n+r-1$, it is required to find all complex scalars…
Given the equations of the first and the second order surfaces in multidimensional space, our goal is to construct a univariate polynomial one of the zeros of which coincides with the square of the distance between these surfaces. To…
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…
For a square-free bivariate polynomial $p$ of degree $n$ we introduce a simple and fast numerical algorithm for the construction of $n\times n$ matrices $A$, $B$, and $C$ such that $\det(A+xB+yC)=p(x,y)$. This is the minimal size needed to…
The classical modular polynomial for $j$-invariants describes the relation between two elliptic curves connected by isogenies. This polynomial has been applied to various algorithms in computational number theory, such as point counting on…
In this paper we study the problem of finding explicit expressions for inner products on the space of complex square matrices $\Mn$. We show that, given an inner product $\lip \cdot, \cdot \rip$ on $\Mn$, with some conditions, there exist…
The theory of multidimensional persistence captures the topology of a multifiltration -- a multiparameter family of increasing spaces. Multifiltrations arise naturally in the topological analysis of scientific data. In this paper, we give a…
It is well known that selecting a good Mixed Integer Programming (MIP) formulation is crucial for an effective solution with state-of-the art solvers. While best practices and guidelines for constructing good formulations abound, there is…
The tensor product of props was defined by Hackney and Robertson as an extension of the Boardman-Vogt product of operads to more general monoidal theories. Theories that factor as tensor products include the theory of commutative monoids…
We investigate polynomials, called m-polynomials, whose generator polynomial has coefficients that can be arranged as a matrix, where q is a positive integer greater than one. Orthogonality relations are established and coefficients are…
Let $s_{ij}$ represent a tranposition in $S_n$. A polynomial $P$ in $\mathbb{Q}[X_n]$ is said to be $m$-quasiinvariant with respect to $S_n$ if $(x_i-x_j)^{2m+1}$ divides $(1-s_{ij})P$ for all $1 \leq i, j \leq n$. We call the ring…
We consider algebras over a field K, generated by two variables x and y subject to the single relation yx = qxy + ax + by + c for q in K^* and a, b, c in K. We prove, that among such algebras there are precisely five isomorphism classes.…
A bilinear quadrature numerically evaluates a continuous bilinear map, such as the $L^2$ inner product, on continuous $f$ and $g$ belonging to known finite-dimensional function spaces. Such maps arise in Galerkin methods for differential…