Related papers: Matrix iterations and Cichon's diagram
We explore how the combinatorial arrangement of prescribed zeros in a matrix affects the possible eigenvalues that the matrix can obtain. We demonstrate that there are inertially arbitrary patterns having a digraph with no 2-cycle, unlike…
In this paper we study resolutions which arise as iterated mapping cones.
In this paper we deal with a classical problem in elementary number theory, namely repeating decimals. We show how the digits of the period of the decimal representation of any fraction $\frac{k}{m}$, where $k$ and $m$ are positive integers…
Given the projections of two semialgebraic sets defined by polynomial matrix inequalities, it is in general difficult to determine whether one is contained in the other. To address this issue we propose a new matrix Positivstellensatz that…
Copositive and completely positive matrices play an increasingly important role in Applied Mathematics, namely as a key concept for approximating NP-hard optimization problems. The cone of copositive matrices of a given order and the cone…
We study the statistics of Hamiltonian cycles on various families of bicolored random planar maps (with the spherical topology). These families fall into two groups corresponding to two distinct universality classes with respective central…
Correlation is a common technique for the detection of shifts. Its generalization to the multidimensional geometric correlation in Clifford algebras has proven a useful tool for color image processing, because it additionally contains…
Let A, B, C, D be given finite sets of pairs of n-by-n complex matrices. We describe an algorithm to determine, with finitely many computations, whether there is a single unitary matrix U such that each pair of matrices in A is unitarily…
We prove that when a Lozin's transformation is applied to a graph, the (Castelnuovo-Mumford) regularity of the graph increases exactly by one, as it happens to its induced matching number. As a consequence, we show that the regularity of a…
We analyze inexact fixed point iterations where the generating function contains an inexact solve of an equation system to answer the question of how tolerances for the inner solves influence the iteration error of the outer fixed point…
We build a new perspective to count perfect matchings of a given graph. This idea is motivated by a construction on the relative cohomology group of surfaces. As an application of our theory, we reprove the celebrated Aztec Diamond theorem,…
We show, that the Complex Step approximation to the Fr\'echet derivative of real matrix functions is applicable to the matrix sign, square root and polar mapping using iterative schemes. While this property was already discovered for the…
It is shown that the consistency strength of ZF + DC + "the closed unbounded ultrafilter on omega_1 is an ultrafilter" is exactly ZFC + one measurable cardinal.
The coincidence site lattice (CSL) problem and its generalization to Z-modules in Euclidean 3-space is revisited, and various results and conjectures are proved in a unified way, by using maximal orders in quaternion algebras of class…
We introduce more properties of forcing notions which imply that their lambda-support iterations are lambda-proper, where lambda is an inaccessible cardinal. This paper is a direct continuation of section A.2 of math.LO/0210205. As an…
We prove the consistency of the theory ZFC + there is a strongly compact cardinal from the existence of a cardinal preserving embedding from the universe into an inner model. The proof almost shows that under SCH, every cardinal preserving…
We prove two ZFC theorems about cardinal invariants above the continuum which are in sharp contrast to well-known facts about these same invariants at the continuum. It is shown that for an uncountable regular cardinal $\kappa$,…
A proof will be presented that the existence of a non-trivial $\Sigma_1$-elementary embedding $j: V_{\lambda+3} \prec V_{\lambda+3}$ is inconsistent with $\textsf{ZF}$. Sections 1 and 2 shall review various important contributions from the…
A dessin is a 2-cell embedding of a connected $2$-coloured bipartite graph into an orientable closed surface. A dessin is regular if its group of orientation- and colour-preserving automorphisms acts regularly on the edges. In this paper we…
In this paper we analyse convergence of projected fixed-point iteration on a Riemannian manifold of matrices with fixed rank. As a retraction method we use `projector splitting scheme'. We prove that the projector splitting scheme converges…