Related papers: Determinant majorization and the work of Guo-Phong…

Let ${\mathfrak g}$ be a Garding-Dirichlet operator on the set S(n) of symmetric $n\times n$ matrices. We assume that ${\mathfrak g}$ is $I$-central, that is, $D_I {\mathfrak g} = k I$ for some $k>0$. Then $$ {\mathfrak g}(A)^{1\over N} \…

We obtain estimates on the supremum, infimum and oscillation of solutions for a wide class of inhomogeneous fully nonlinear elliptic equations on Euclidean domains where the differential operator is an I-central Garding-Dirichlet operator…

Given a square, nonsingular matrix of univariate polynomials $\mathbf{F}\in\mathbb{K}[x]^{n\times n}$ over a field $\mathbb{K}$, we give a deterministic algorithm for finding the determinant of $\mathbf{F}$. The complexity of the algorithm…

Let $p$ be a prime and $n$ a positive integer. As the first main result, we present a deterministic algorithm for deciding whether the matrix algebra $\mathbb{F}_p[A_1,\dots,A_t]$ with $A_1,\dots,A_t \in \mathrm{GL}(n,\mathbb{F}_p)$ is a…

The current work generalizes the author's previous work on the infinite-dimensional Alpha Log-Determinant (Log-Det) divergences and Alpha-Beta Log-Det divergences, defined on the set of positive definite unitized trace class operators on a…

We attach a certain $n \times n$ matrix $A_n$ to the Dirichlet series $L(s)=\sum_{k=1}^{\infty}a_k k^{-s}$. We study the determinant, characteristic polynomial, eigenvalues, and eigenvectors of these matrices. The determinant of $A_n$ can…

We consider the problem of deterministically factoring a univariate polynomial over a finite field under the assumption of the Extended Riemann Hypothesis (ERH). This work builds upon the line of approach first explored by Gao in $2001$.…

We extend the notion of the determinant function $\Lambda$, originally introduced by T.Fack for $\tau$-compact operators, to a natural algebra of $\tau$-measurable operators affiliated with a semifinite von Neumann algebra which coincides…

The problem of expressing a specific polynomial as the determinant of a square matrix of affine-linear forms arises from algebraic geometry, optimisation, complexity theory, and scientific computing. Motivated by recent developments in this…

Let $f_n$ be a random polynomial of degree $n$, whose coefficients are independent and identically distributed random variables with mean-zero and variance one. Let $\Delta(f_n)$ denote the discriminant of $f_n$, that is $\Delta(f_n) =…

In this paper, we present an improvement for the problem of deterministically finding an element of large multiplicative order modulo some integer $N$. This problem arises as a key subroutine in current deterministic factoring algorithms,…

The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…

Let $X^N = (X_1^N,\dots, X^N_d)$ be a d-tuple of $N\times N$ independent GUE random matrices and $Z^{NM}$ be any family of deterministic matrices in $\mathbb{M}_N(\mathbb{C})\otimes \mathbb{M}_M(\mathbb{C})$. Let $P$ be a self-adjoint…

We consider recent work linking majorization and trumping, two partial orders that have proven useful with respect to the entanglement transformation problem in quantum information, with general Dirichlet polynomials, Mellin transforms, and…

An explicit formula is obtained for the generalized Macdonald functions on the $N$-fold Fock tensor spaces, calculating a certain matrix element of a composition of several screened vertex operators. As an application, we prove the…

The unpolarized and polarized massive operator matrix elements $A_{Qg}^{(3)}$ and $\Delta A_{Qg}^{(3)}$ contain first-order factorizable and non-first-order factorizable contributions in the determining difference or differential equations…

Root separation bounds play an important role as a complexity measure in understanding the behaviour of various algorithms in computational algebra, e.g., root isolation algorithms. A classic result in the univariate setting is the…

The aim of this paper is to study the Harnack type logarithmic submajorisation and Fuglede-Kadison determinant inequalities for operators in a finite von Neumann algebra. In particular, the Harnack type determinant inequalities due to…

One tuple of probability vectors is more informative than another tuple when there exists a single stochastic matrix transforming the probability vectors of the first tuple into the probability vectors of the other. This is called matrix…

In this paper, we investigate the determinants involving some trigonometric functions. We establish a connection between these determinants and the special values of Dirichlet L-functions, thereby extending Guo's results to arbitrary…