Computing Valuations of the Dieudonn\'e Determinants

Taihei Oki

Home/Archive/arXiv

arXiv · 1907.04512

Computing Valuations of the Dieudonn\'e Determinants

Taihei Oki

View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper addresses the problem of computing valuations of the Dieudonn\'e determinants of matrices over discrete valuation skew fields (DVSFs). Under a reasonable computational model, we propose two algorithms for a class of DVSFs, called split. Our algorithms are extensions of the combinatorial relaxation of Murota (1995) and the matrix expansion by Moriyama--Murota (2013), both of which are based on combinatorial optimization. While our algorithms require an upper bound on the output, we give an estimation of the bound for skew polynomial matrices and show that the estimation is valid only for skew polynomial matrices. We consider two applications of this problem. The first one is the noncommutative weighted Edmonds' problem (nc-WEP), which is to compute the degree of the Dieudonn\'e determinants of matrices having noncommutative symbols. We show that the presented algorithms reduce the nc-WEP to the unweighted problem in polynomial time. In particular, we show that the nc-WEP over the rational field is solvable in time polynomial in the input bit-length. We also present an application to analyses of degrees of freedom of linear time-varying systems by establishing formulas on the solution spaces of linear differential/difference equations.

Explore related subjects

cs.DS cs.SC

Keep this discovery

BibTeX RIS

Taihei Oki. 2019-07-10. Computing Valuations of the Dieudonn\'e Determinants. https://arxiv.org/abs/1907.04512

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Quasi-Monte Carlo Beyond Hardy-Krause II: $(1 + \varepsilon)n$ Samples Suffice

Numerical integration studies how well one can estimate the integral of a function $f$ over $[0,1)^d$ using $n$ sample points. The two classical methods, Monte Carlo (MC) and quasi-Monte Carlo (QMC), have complementary strengths and weaknesses, and a fundamental question is to design an approach that combines the benefits of both. Recently, building on the transference principle in discrepancy theory, Bansal and Jiang~\cite{BJ25a} gave a randomized QMC method that bridges MC and QMC guarantees using only i.i.d.\ samples. Their method also goes beyond the classical Koksma--Hlawka inequality: it achieves integration error $\widetilde{O}_d(\sigma_{\mathsf{SO}}(f)/n)$, where the smoothed-out variation $\sigma_{\mathsf{SO}}(f)$ can be substantially smaller than the Hardy--Krause variation that governs the classical bound. However, their algorithm requires $n^2$ i.i.d.\ samples as input, and this quadratic blowup is inherent to any method based on the transference principle. In this work, we bypass the quadratic blowup: for any constant $\varepsilon > 0$, we show that $(1+\varepsilon)n$ i.i.d.\ samples suffice to both obtain the beyond-Hardy--Krause guarantee of~\cite{BJ25a}, resolving an open problem posed there, and to produce low-discrepancy point sequences. Our algorithms are variants of the online Haar-thinning method of Dwivedi, Feldheim, Gurel-Gurevich, and Ramdas~\cite{DFG+19}.

cs.DS↗

arXiv2026

A deterministic $(1+\varepsilon)^n$ approximation for the permanent of a nonnegative matrix

For every fixed $0<\varepsilon\le1$, we give a deterministic strongly polynomial algorithm that, given a nonnegative matrix $A\in\mathbb{R}_{\ge0}^{n\times n}$, returns $Q$ satisfying $\operatorname{per} A\le Q\le(1+\varepsilon)^n\operatorname{per} A$.

cs.DS↗

arXiv2026

Single-Exponential Algorithms and a Polynomial Kernel for Strong Connectivity Augmentation

Strong Connectivity Augmentation (SCA) asks whether a directed acyclic graph can be made strongly connected by adding at most $k$ prescribed links whose total weight is within a given budget. Klinkby, Misra, and Saurabh (SODA 2021) gave an $O^*(2^{O(k\log k)})$-time algorithm and asked whether the problem admits a single-exponential parameterized algorithm and a polynomial kernel. We answer both questions affirmatively: SCA can be solved in $O^*(9^k)$ time and admits a polynomial kernel with $O(k^4)$ vertices and $O(k^{16})$ bits. For unweighted SCA, we obtain $O^*(4^k)$ time and a kernel with $O(k^3)$ vertices. Our algorithms are based on a particularly simple reduction to Strongly Connected Spanning Subgraph with two edge costs.

cs.DS↗