Related papers: Feasible combinatorial matrix theory

We demonstrate that the Weihrauch lattice can be used to classify the uniform computational content of computability-theoretic properties as well as the computational content of theorems in one common setting. The properties that we study…

The concept of convex compactness, weaker than the classical notion of compactness, is introduced and discussed. It is shown that a large class of convex subsets of topological vector spaces shares this property and that is can be used in…

Let $\mathsf{KP}$ denote Kripke-Platek Set Theory and let $\mathsf{M}$ be the weak set theory obtained from $\mathsf{ZF}$ by removing the collection scheme, restricting separation to $\Delta_0$-formulae and adding an axiom asserting that…

This paper presents very simple and easy integration-free proofs in the context of Weierstrass's theory of functions, of the Maximum and Minimum Modulus Principles and Gutzmer-Parseval Inequalities for polynomials and for functions…

Recently, there has been considerable progress on designing algorithms with provable guarantees -- typically using linear algebraic methods -- for parameter learning in latent variable models. But designing provable algorithms for inference…

Let M be a closed enlargeable spin manifold. We show non-triviality of the universal index obstruction in the K-theory of the maximal $C^*$-algebra of the fundamental group of M. Our proof is independent from the injectivity of the…

This paper presents a theory of non-linear integer/real arithmetic and algorithms for reasoning about this theory. The theory can be conceived as an extension of linear integer/real arithmetic with a weakly-axiomatized multiplication…

The Smith reduction is a basic tool when analyzing integer matrices up to equivalence, and the Kannan-Bachem (KB) algorithm is the first polynomial algorithm computing such a reduction. Using this algorithm in complicated situations where…

A theorem of Kaplansky asserts that a semigroup of matrices with entries from a field whose members all have singleton spectra is triangularizable. Indeed, Kaplansky's Theorem unifies well-known theorems of Kolchin and Levitzki on…

We show that Nash-Williams' theorem asserting that the countable transfinite sequences of elements of a better-quasi-ordering ordered by embeddability form a better-quasi-ordering is provable in the subsystem of second order arithmetic…

We present a new and simple proof of a theorem due to Kaplansky which unifies theorems of Kolchin and Levitzki on triangularizability of semigroups of matrices. We also give two different extensions of the theorem. As a consequence, we…

Motivated by recent advances in solution methods for mixed-integer convex optimization (MICP), we study the fundamental and open question of which sets can be represented exactly as feasible regions of MICP problems. We establish several…

Many a concrete theorem of abstract algebra admits a short and elegant proof by contradiction but with Zorn's Lemma (ZL). A few of these theorems have recently turned out to follow in a direct and elementary way from the Principle of Open…

The theorem like Pontryagin's maximum principle for multiple integrals is proved. Unlike the usual maximum principle, the maximum should be taken not over all matrices, but only on matrices of rank one. Examples are given.

Given an arbitrary (commutative) field K, let V be a linear subspace of M_n(K) consisting of matrices of rank lesser than or equal to some r<n. A theorem of Atkinson and Lloyd states that, if dim V>nr-r+1 and #K>r, then either all the…

Let $d_i(m)$ denote the coefficients of the Boros-Moll polynomials. Moll's minimum conjecture states that the sequence $\{i(i+1)(d_i^2(m)-d_{i-1}(m)d_{i+1}(m))\}_{1\leq i \leq m}$ attains its minimum with $i=m$. This conjecture is a…

We prove that the Buchweitz-Greuel-Schreyer Conjecture on the minimal rank of a matrix factorization holds for a generic polynomial of given degree and strength. The proof introduces a notion of the secondary strength of a polynomial, and…

We give a sufficient condition for a model theoretic structure $B$ to 'inherit' quantifier elimination from another structure $A$. This yields an alternative proof of one of the main result from \cite{kle}, namely quantifier elimination for…

Using the analytic assembly map that appears in the Baum-Connes conjecture in noncommutative geometry, we generalise the $\Spin^c$-version of the Guillemin-Sternberg conjecture that `quantisation commutes with reduction' to (discrete series…

A method is introduced for constructing lattice discretizations of large classes of integrable quantum field theories. The method proceeds in two steps: The quantum algebraic structure underlying the integrability of the model is determined…