[3] **viXra:1908.0481 [pdf]**
*submitted on 2019-08-23 18:06:27*

**Authors:** M. D. Sheppeard

**Comments:** 2 Pages.

This two page note summarises the quantum gravity perspective on motives for a mathematician.

**Category:** Algebra

[2] **viXra:1908.0355 [pdf]**
*submitted on 2019-08-16 08:15:44*

**Authors:** Anna Knezevic, Greg Cohen

**Comments:** 75 Pages. This research was partly supported by the School of Electrical Engineering, Computing and Mathematical Sciences of the Curtin University (Australia)

The permanent’s polynomial-time computability over fields of characteristic 3 for k-semi-unitary matrices (i.e. n×n-matrices A such that rank(AA^T-I_n )=k) in the case k ≤ 1 and its #_3P-completeness for any k > 1 (Ref. 9) is a result that essentially widens our understanding of the computational complexity boundaries for the permanent modulo 3. Now we extend this result to study more closely the case k > 1 regarding the (n-k)×(n-k)-sub-permanents (or permanent-minors) of a unitary n×n-matrix and their possible relations, because an (n-k)×(n-k)-submatrix of a unitary n×n-matrix is generically a k-semi-unitary (n-k)×(n-k)-matrix.
The following paper offers a way to receive a variety of such equations of different sorts, in the meantime also extending (in its second chapter divided into subchapters) this direction of research to reviewing all the set of polynomial-time permanent-preserving reductions and equations for a generic matrix’s sub-permanents they might yield, including a number of generalizations and formulae (valid in an arbitrary prime characteristic) analogical to the classical identities relating the minors of a matrix and its inverse. Moreover, the second chapter also deals with the Hamiltonian cycle polynomial in characteristic 2 that surprisingly demonstrates quite a number of properties very similar to the corresponding ones of the permanent in characteristic 3.
Besides, the paper’s third chapter is devoted to the computational complexity issues of the permanent and some related functions on a variety of Cauchy matrices and their certain generalizations, including constructing a polynomial-time algorithm (based on them) for the permanent of an arbitrary square matrix in characteristic 5 and conjecturing the existence of a similar scheme in characteristic 3.
Throughout the paper, we investigate various matrix compressions and transformations preserving the permanent and related functions in certain finite characteristics. And, as an auxiliary algebraic tool supposed for an application when needed in all the constructions we’re going to discuss in the present article, we’ll introduce and utilize a special principle involving a field’s extension by a formal infinitesimal and allowing, provided a number of conditions are fulfilled, to reduce the computation of a polynomial over a field to solving a system of algebraic equations in polynomial time.
greg.cohen.math@gmail.com

**Category:** Algebra

[1] **viXra:1908.0043 [pdf]**
*submitted on 2019-08-02 09:58:14*

**Authors:** Colin James III

**Comments:** 1 Page. Copyright 2019 by Colin James III All rights reserved. Respond to author by email only: info@cec-services dot com. See updated abstract at ersatz-systems.com.

We evaluate the seminal equation for Heyting algebra of a∧b≤c⇔a≤b→c. It is not tautologous, hence refuting Heyting algebra as stated, and forming another non tautologous fragment of Heyting algebra in the universal logic V�?4.

**Category:** Algebra