Related papers: Feasible combinatorial matrix theory
We show that Csanky's fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LAP from the principle of linear independence. LAP is a natural…
Let $\mathsf{TT}^2_k$ denote the combinatorial principle stating that every $k$-coloring of pairs of compatible nodes in the full binary tree has a homogeneous solution, i.e. an isomorphic subtree in which all pairs of compatible nodes have…
We introduce the intersection cohomology module of a matroid and prove that it satisfies Poincar\'e duality, the hard Lefschetz theorem, and the Hodge-Riemann relations. As applications, we obtain proofs of Dowling and Wilson's Top-Heavy…
We follow the example of Cabibbo by revising the Standard Model (SM) to present a universal mass structure for fermions. A universal Higgs coupling for each species of fundamental fermions moves the SM towards a Theory of Matter, albeit…
We will study a linear first order system, a connection $\db$ problem, on a vector bundle equipped with a connection, over a Riemann surface. We show optimal conditions on the connection forms which allow one to find a holomorphic frame, or…
The main result of this paper is to prove some type of Real Jacobian Conjecture. It is proved by the Minimax Principle and asserts if the eigenvalues of $F'(x)$ are bounded from zero and all the eigenvalues of $F'(x)+F'(x)^T$ are strictly…
K\"onig's lemma is a fundamental result about trees with countless applications in mathematics and computer science. In contrapositive form, it states that if a tree is finitely branching and well-founded (i.e. has no infinite paths), then…
Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…
Let $L$ be a linear operator on univariate polynomials of bounded degree, mapping into real symmetric matrices, such that its moment matrix is positive definite. It is known that $L$ admits a finitely atomic positive matrix-valued…
Solomonoff unified Occam's razor and Epicurus' principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field of algorithmic information theory. His central result is that the…
The sequential form of a statement $\forall\xi(B(\xi) \rightarrow \exists\zeta A(\xi,\zeta))$ is the statement $\forall\xi(\forall n B(\xi_n) \rightarrow \exists\zeta \forall n A(\xi_n,\zeta_n))$. There are many classically true statements…
The main theorem of this article is that every countable model of set theory M, including every well-founded model, is isomorphic to a submodel of its own constructible universe. In other words, there is an embedding $j:M\to L^M$ that is…
It is proved that the assembly map in algebraic K- and L-theory with respect to the family of finite subgroups is injective for groups $\Gamma$ with finite quotient finite decomposition complexity (a strengthening of finite decomposition…
Gregory McColm conjectured that positive elementary inductions are bounded in a class K of finite structures if every (FO + LFP) formula is equivalent to a first-order formula in K. Here (FO + LFP) is the extension of first-order logic with…
Let $u_\zeta(g)$ denote the small quantum group associated to the simple complex Lie algebra $g$, with parameter $q$ specialized to a primitive $\ell$-th root of unity $\zeta$ in the field $k$. Generalizing a result of Cline, Parshall and…
Let $\Lambda$ be a row-finite higher-rank graph with no sources. We identify a maximal commutative subalgebra $\mathcal{M}$ inside the Kumjian-Pask algebra ${\rm KP}_R(\Lambda)$. We also prove a generalized Cuntz-Krieger uniqueness theorem…
An operator system modulo the kernel of a completely positive linear map of the operator system gives rise to an operator system quotient. In this paper, operator system quotients and quotient maps of certain matrix algebras are considered.…
Let $\tilde{\mathfrak g}$ be an affine Lie algebra of the type $A_\ell^{(1)}$. We find a combinatorial basis of Feigin-Stoyanovsky's type subspace $W(\Lambda)$ given in terms of difference and initial conditions. Linear independence of the…
Typing of lambda-terms in Elementary and Light Affine Logic (EAL, LAL, resp.) has been studied for two different reasons: on the one hand the evaluation of typed terms using LAL (EAL, resp.) proof-nets admits a guaranteed polynomial…
In the realm of light logics deriving from linear logic, a number of variants of exponential rules have been investigated. The profusion of such proof systems induces the need for cut-elimination theorems for each logic, the proof of which…