English
Related papers

Related papers: Symmetric Determinantal Representations in Charact…

200 papers

Based on a theorem of Bergman we show that multivariate noncommutative polynomial factorization is deterministic polynomial-time reducible to the factorization of bivariate noncommutative polynomials. More precisely, we show the following:…

Computational Complexity · Computer Science 2023-03-13 V. Arvind , Pushkar S. Joglekar

We introduce the DeterminantalRepresentations package for Macaulay2, which computes definite symmetric determinantal representations of real polynomials. We focus on quadrics and plane curves of low degree (i.e. cubics and quartics). Our…

Algebraic Geometry · Mathematics 2020-02-12 Justin Chen , Papri Dey

Two are the objectives of the present paper. First we study properties of a differentially simple commutative ring R with respect to a set D of derivations of R. Among the others we investigate the relation between the D-simplicity of R and…

Rings and Algebras · Mathematics 2012-10-05 Michael Gr. Voskoglou

We prove a result on the representation of squares by second degree polynomials in the field of $p$-adic meromorphic functions in order to solve positively B\"uchi's $n$ squares problem in this field (that is, the problem of the existence…

Complex Variables · Mathematics 2010-03-10 Hector Pasten

We consider polynomials of bi-degree $(n,1)$ over the skew field of quaternions where the indeterminates commute with each other and with all coefficients. Polynomials of this type do not generally admit factorizations. We recall a…

Rings and Algebras · Mathematics 2022-02-21 Johanna Lercher , Daniel F. Scharler , Hans-Peter Schröcker , Johannes Siegele

There is a digraph corresponding to every square matrix over $\mathbb{C}$. We generate a recurrence relation using the Laplace expansion to calculate the characteristic, and permanent polynomials of a square matrix. Solving this recurrence…

Discrete Mathematics · Computer Science 2018-01-08 Ranveer Singh , R. B. Bapat

A formula is presented for the determinant of the second additive compound of a square matrix in terms of coefficients of its characteristic polynomial. This formula can be used to make claims about the eigenvalues of polynomial matrices,…

Commutative Algebra · Mathematics 2018-06-20 Murad Banaji

We define the second discriminant $D_2$ of a univariate polynomial $f$ of degree greater than $2$ as the product of the linear forms $2\,r_k-r_i-r_j$ for all triples of roots $r_i, r_k, r_j$ of $f$ with $i<j$ and $j\neq k, k\neq i$. $D_2$…

Commutative Algebra · Mathematics 2019-09-24 Dongming Wang , Jing Yang

Dynamical systems with quadratic or polynomial drift exhibit complex dynamics, yet compared to nonlinear systems in general form, are often easier to analyze, simulate, control, and learn. Results going back over a century have shown that…

Symbolic Computation · Computer Science 2025-02-17 Boris Kramer , Gleb Pogudin

We develop a new framework to compute the exact correlators of characteristic polynomials, and their inverses, in random matrix theory. Our results hold for general potentials and incorporate the effects of an external source. In matrix…

High Energy Physics - Theory · Physics 2021-11-04 Taro Kimura , Edward A. Mazenc

We present a short, purely algebraic proof of the Symmetric Bessmertny\u{i} Realization Theorem in the characteristic $2$ case recently proved in [EOW26]. Symmetric Bessmertny\u{i} realizations are Schur complements of affine linear…

Rings and Algebras · Mathematics 2026-05-07 Soumya Sinha Babu , Aaron Welters

Let $p$ be a multilinear polynomial in several non-commuting variables with coefficients in a quadratically closed field $K$ of any characteristic. It has been conjectured that for any $n$, the image of $p$ evaluated on the set $M_n(K)$ of…

Algebraic Geometry · Mathematics 2017-12-05 Alexey Kanel-Belov , Sergey Malev , Louis Rowen

Let $\mathcal{R} = \mathbb{K}[x_1, \dots, x_n]$ be a multivariate polynomial ring over a field $\mathbb{K}$ of characteristic 0. Consider $n$ algebraically independent elements $g_1, \dots, g_n$ in $\mathcal{R}$. Let $\mathcal{S}$ denote…

Symbolic Computation · Computer Science 2025-05-01 Thi Xuan Vu

Many reinforcement learning (RL) environments in practice feature enormous state spaces that may be described compactly by a "factored" structure, that may be modeled by Factored Markov Decision Processes (FMDPs). We present the first…

Machine Learning · Computer Science 2022-03-08 Zihao Deng , Siddartha Devic , Brendan Juba

In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects we call m-schemes. We extend the known conditional deterministic subexponential time polynomial factoring…

Computational Complexity · Computer Science 2008-04-15 Gábor Ivanyos , Marek Karpinski , Nitin Saxena

In this paper, we fix a polynomial with complex coefficients and determine the eigenforms for SL2(Z) which can be expressed as the fixed polynomial evaluated at other eigenforms. In particular, we show that when one excludes trivial cases,…

Number Theory · Mathematics 2018-10-23 Joseph Richey , Noah Shutty

We study multiple orthogonal polynomials exploiting their explicit determinantal representation in terms of moments. Our reasoning follows that applied to solve the Hermite-Pad\'{e} approximation and interpolation problems. We study also…

Exactly Solvable and Integrable Systems · Physics 2026-03-17 Adam Doliwa

In this paper we study the problem of deterministic factorization of sparse polynomials. We show that if $f \in \mathbb{F}[x_{1},x_{2},\ldots ,x_{n}]$ is a polynomial with $s$ monomials, with individual degrees of its variables bounded by…

Commutative Algebra · Mathematics 2018-08-22 Vishwas Bhargava , Shubhangi Saraf , Ilya Volkovich

Let K be a field and let M_n(K) denote the space of n x n matrices with entries in K. Let M be a subspace of M_n(K) of dimension d with the property that there are elements in M with non-zero determinant. Given a basis of M, we define the…

Rings and Algebras · Mathematics 2021-12-15 Rod Gow

The symmetric subrank of homogeneous polynomial is the largest number of terms in a diagonal form to which it can be specialized by a (typically non-invertible) linear variable substitution. Building on earlier work by Derksen-Makam-Zuiddam…

Algebraic Geometry · Mathematics 2026-04-15 Benjamin Biaggi , Jan Draisma , Koen de Nooij , Immanuel van Santen