Related papers: On Computing the Kronecker Structure of Polynomial…
The all Rota-Baxter algebra structures on the polynomial algebra $R={\bf k}[x]$ are well known. We study the finite dimensional modules of polynomial Rota-Baxter algebras $(\bfk[x],P)$ or $(x {\bf k} [x],P)$ of weight nonzero since some…
We study characteristic polynomials of symmetric matrices with entries ${i+j\choose i}$ the binomial coefficients, over finite fields.
We give an elementary introduction to some recent polyhedral techniques for understanding and solving systems of multivariate polynomial equations. We provide numerous concrete examples and illustrations, and assume no background in…
Tensor completion aims at imputing missing entries from a partially observed tensor. Existing tensor completion methods often assume either multi-linear or nonlinear relationships between latent components. However, real-world tensors have…
In the intersection of the theories of nonsymmetric Jack polynomials in $N$ variables and representations of the symmetric groups $\mathcal{S}_{N}$ one finds the singular polynomials. For certain values of the parameter $\kappa$ there are…
We consider bivariate polynomials orthogonal on the bicircle with respect to a positive linear functional. The lexicographical and reverse lexicographical orderings are used to order the monomials. Recurrence formulas are derived between…
The image of a polynomial map is a constructible set. While computing its closure is standard in computer algebra systems, a procedure for computing the constructible set itself is not. We provide a new algorithm, based on algebro-geometric…
The assumed hardness of the Linear Code Equivalence problem (LCE) lies at the core of the security of the LESS signature scheme and other signature schemes with advanced functionalities. The LCE problem asks to determine whether two linear…
In this paper, we investigate the problem of finding tight linear lower bounding functions for multivariate polynomials over boxes. These functions are obtained by the expansion of polynomials into Bernstein form and using the linear least…
Writing the values of Krawtchouk polynomials as matrices, we consider weighted partial sums along columns. For the general case, we find an identity that, in the symmetric case yields a formula for such partial sums. Complete sums of…
Using the block vec matrix, I give a necessary and sufficient condition for factorization of a matrix into the Kronecker product of two other matrices. As a consequence, I obtain an elementary algorithmic procedure to decide whether a…
The starting point for this work is an identity that relates the number of minimal matrices with prescribed 1-marginals and coefficient sequence to a linear combination of Kronecker coefficients. In this paper we provide a bijection that…
We exhibit an explicit, deterministic algorithm for finding a canonical form for a positive definite matrix under unimodular integral transformations. We use characteristic sets of short vectors and partition-backtracking graph software.…
We introduce a new algorithm computing the characteristic polynomials of hyperplane arrangements which exploits their underlying symmetry groups. Our algorithm counts the chambers of an arrangement as a byproduct of computing its…
New bounds are derived for the eigenvalues of sums of Kronecker products of square matrices by relating the corresponding matrix expressions to the covariance structure of suitable bi-linear stochastic systems in discrete and continuous…
We develop a new eigenvalue method for solving structured polynomial equations over any field. The equations are defined on a projective algebraic variety which admits a rational parameterization by a Khovanskii basis, e.g., a Grassmannian…
We introduce two novel techniques that simplify calculation of Jordan-Kronecker invariants for a Lie algebra $\mathfrak{g}$ and for a Lie algebra representation $\rho$. First, the stratification of matrix pencils under strict equivalence…
This article deals with the question of local connectivity of the Julia set of polynomials and rational maps. It essentially presents conjectures and questions.
Consider a monic linear pencil $L(x) = I - A_1x_1 - \cdots - A_gx_g$ whose coefficients $A_j$ are $d \times d$ matrices. It is naturally evaluated at $g$-tuples of matrices $X$ using the Kronecker tensor product, which gives rise to its…
Let $k$ be a field, let $A$ and $B$ be polynomial rings over $k$, and let $S= A \otimes_k B$. Let $I \subseteq A$ and $J \subseteq B$ be monomial ideals. We establish a binomial expansion for rational powers of $I+J \subseteq S$ in terms of…