Related papers: Inverting the wedge map and Gauss composition
In this paper we analyze a simple spectral method (EIG1) for the problem of matrix alignment, consisting in aligning their leading eigenvectors: given two matrices $A$ and $B$, we compute $v_1$ and $v'_1$ two corresponding leading…
The inversion formula is given for automorphisms of the Weyl algebras with polynomial coefficients over a field of characteristic zero. The theorem of Gabber on the degree of polynomial automorphism is extended. It is proved that any…
This paper is a documentation of author's reseach, focusing on the topic Grassmann Algebra spanning over July, August 2025 under mentorship provided by DRP Turkiye 2025. Grassmann algebra is a fundamental structure in mathematics with…
Matroids generalize the familiar notion of linear dependence from linear algebra. Following a brief discussion of founding work in computability and matroids, we use the techniques of reverse mathematics to determine the logical strength of…
The string world sheet, regarded as Riemann surface, in background $R^3$ and $R^4$ is described by the generalised Gauss map. When the Gauss map is harmonic or equivalently for surfaces of constant mean scalar curvature, we obtain an…
We present an algorithmic equivalent statement to the Jacobian conjecture. Given a polynomial map F on an affine space of dimension n, our algorithm constructs n sequences of polynomials such that F is invertible if and only if the zero…
With the aim of completing the previous study by A. Or{\l}owski and the author concerning intertwining maps between induced representations and conjugation representation, termed here weighted class operators, we compute the latter…
We introduce here a rewrite system in the group of unimodular matrices, \emph{i.e.}, matrices with integer entries and with determinant equal to $\pm 1$. We use this rewrite system to precisely characterize the mechanism of the Gaussian…
We study the inversion analog of the well-known Gauss algorithm for multiplying complex matrices. A simple version is $(A + iB)^{-1} = (A + BA^{-1}B)^{-1} - i A^{-1}B(A+BA^{-1} B)^{-1}$ when $A$ is invertible, which may be traced back to…
In this paper, we describe a reliable symbolic computational algorithm for inverting general cyclic heptadiagonal matrices by using parallel computing along with recursion. The algorithm is implementable to the Computer Algebra System(CAS)…
A gaussoid is a combinatorial structure that encodes independence in probability and statistics, just like matroids encode independence in linear algebra. The gaussoid axioms of Lnenicka and Mat\'us are equivalent to compatibility with…
The modular $j$-function is a bijective map from $X_0(1) \setminus \{\infty\}$ to $\mathbb{C}$. A natural question is to describe the inverse map. Gauss offered a solution to the inverse problem in terms of the arithmetic-geometric mean.…
The path integral description of the Wess-Zumino-Witten $\to$ Liouville reduction is formulated in a manner that exhibits the conformal invariance explicitly at each stage of the reduction process. The description requires a conformally…
It is shown that the sl(2,C) KZ equation for (half-) integer isospins recovers, up to a gauge transformation, the matrix system for Virasoro algebra singular vectors of Bauer et al. In the case of Kac-Kazhdan spins the general (infinite…
The paper "Sorting with Bialgebras and Distributive Laws" by Hinze et al. uses the framework of bialgebraic semantics to define sorting algorithms. From distributive laws between functors they construct pairs of sorting algorithms using…
The Gaussian process (GP) is a nonparametric prior distribution over functions indexed by time, space, or other high-dimensional index set. The GP is a flexible model yet its limitation is given by its very nature: it can only model…
After an introduction to the problem of cosmological structure formation, we develop gauge invariant cosmological perturbation theory. We derive the first order perturbation equations of Einstein's equations and energy momentum…
Using connections to random matrix theory and orthogonal polynomials, we develop a framework for obtaining explicit closed-form formulae for the number, $\mathscr{N}_{g}(2\nu,j)$, of connected $2\nu$-valent labeled graphs with $j$ vertices…
For an endomorphism s of R with s^{t}=1 we prove that the truncated polynomial ring (algebra) R[w,s]/(w^{t}) embeds into M_{t}(R[z]/(z^{t})). For an involution we exhibit an embedding of R into M_{2,1}^{s}(R), where M_{2,1}^{s}(R) is the…
The symmetries described by Pin groups are the result of combining a finite number of discrete reflections in (hyper)planes. The current work shows how an analysis using geometric algebra provides a picture complementary to that of the…