Related papers: Limitations of the Invertible-Map Equivalences

An automorphism group of an incidence structure I induces a tactical decomposition on I. It is well known that tactical decompositions of t-designs satisfy certain necessary conditions which can be expressed as equations in terms of the…

This paper is a sequel of arXiv:2109.06394. In this paper, we consider a kind of inverse problem of multipliers. The problem is to count number of isospectral correspondences, correspondences which has the same combination of multipliers.…

Complexity problems associated with finite rings and finite semigroups, particularly semigroups of matrices over a field and the Rees matrix semigroups, are examined. Let M_nF be the ring of n x n matrices over the finite field F and let…

For every square matrix $A$ over a field $\mathbb{K}$, we have the equality $\mathrm{rank}(A) + \mathrm{rank}(I-A) = \mathrm{rank}(I) + \mathrm{rank}(A-A^2)$ where $I$ denotes the identity matrix with the same dimensions as $A$. In this…

Let $G$ be a graph with adjacency matrix $A(G)$ and degree matrix $D(G)$, and let $L_\mu(G):=A(G)-\mu D(G)$. Two graphs $G_1$ and $G_2$ are called \emph{degree-similar} if there exists an invertible matrix $M$ such that $M^{-1} A(G_1) M…

In this paper we generalize the notion of a $k$-graph into (countable) infinite rank. We then define our $C^*$-algebra in a similar way as in $k$-graph $C^*$-algebras. With this construction we are able to find analogues to the Gauge…

Let $A$ be a separable, unital and exact $C^*$-algebra satisfying the universal coefficient theorem. We prove uniqueness theorems up to unitary conjugacy for unital, full and nuclear maps from $A$ into ultraproducts of finite von Neumann…

Over 50 years ago, Lov\'{a}sz proved that two graphs are isomorphic if and only if they admit the same number of homomorphisms from any graph [Acta Math. Hungar. 18 (1967), pp. 321--328]. In this work we prove that two graphs are quantum…

Constraint qualifications (CQs) are central to the local analysis of constrained optimization. In this paper, we completely determine the validity of the four classical CQs -- LICQ, MFCQ, ACQ, and GCQ -- for constraint map-germs that arise…

We define the relative Cuntz-Krieger algebras associated to finitely aligned higher-rank graphs. We prove versions of the gauge-invariant uniqueness theorem and the Cuntz-Krieger uniqueness theorem for relative Cuntz-Krieger algebras.

We consider the higher-rank graphs introduced by Kumjian and Pask as models for higher-rank Cuntz-Krieger algebras. We describe a variant of the Cuntz-Krieger relations which applies to graphs with sources, and describe a local convexity…

This article begins the study of irreducible maps involving finite-dimensional uniserial modules over finite-dimensional associative algebras. We work on the classification of irreducible maps between two uniserials over triangular…

We give an explicit description of the set of all factorization structures, or twisting maps, existing between the algebras k^2 and k^2, and classify the resulting algebras up to isomorphism. In the process we relate several different…

The individualization-refinement paradigm provides a strong toolbox for testing isomorphism of two graphs and indeed, the currently fastest implementations of isomorphism solvers all follow this approach. While these solvers are fast in…

This paper considers the length of resolution proofs when using Krishnamurthy's classic symmetry rules. We show that inconsistent linear equation systems of bounded width over a fixed finite field $\mathbb{F}_p$ with $p$ a prime have, in…

Motivated by Smith's work \cite{Smith2003, Smith2016} on maps between non-commu\-tative projective spaces of the form ${\rm Proj}_{nc} A$ in the setting of non-commutative projective geometry developed by Rosenberg and Van den Bergh, and…

Let $\Gamma$ be a connected bridgeless metric graph, and fix a point $v$ of $\Gamma$. We define combinatorial iterated integrals on $\Gamma$ along closed paths at $v$, a unipotent generalization of the usual cycle pairing and the…

This dissertation concerns the classification of groupoid and higher-rank graph C*-algebras and has two main components. Firstly, for a groupoid it is shown that the notions of strength of convergence in the orbit space and…

We study free scalar field theory on a graph, which gives rise to a modified version of discrete Green's function on a graph studied in \cite{CY}. We show that this gives rise to a graph invariant, which is closely related to the 2-dim…

Wang, Cui, and Cioab\u{a} introduced the Laplacian matching root integral variation of a graph and proved that it cannot occur in one place. They also showed that the two-place variation is impossible for connected graphs satisfying…