Related papers: Compressed commuting graphs of matrix rings
A transitive graph is 2-dimensional if it can be represented as the intersection of two linear orders. Such representations make answering of reachability queries trivial, and allow many problems that are NP-hard on arbitrary graphs to be…
The recently developed theory of higher--rank numerical ranges originated in problems of error correction in quantum information theory but its mathematical implications now include a quite satisfactory understanding of \emph{scalar}…
This paper proposes a novel representation of decomposable graphs based on semi-latent tree-dependent bipartite graphs. The novel representation has two main benefits. First, it enables a form of sub-clustering within maximal cliques of the…
Graph coarsening aims to diminish the size of a graph to lighten its memory footprint, and has numerous applications in graph signal processing and machine learning. It is usually defined using a reduction matrix and a lifting matrix,…
Lifting is an efficient technique to scale up graphical models generalized to relational domains by exploiting the underlying symmetries. Concurrently, neural models are continuously expanding from grid-like tensor data into structured…
Graphs defined over a finite ring are well-studied in the literature. Due to their nature, these types of graphs connect several branches of mathematics, including algebra, number theory, matrix theory, and representation theory. In recent…
Matrices are exceptionally useful in various fields of study as they provide a convenient framework to organize and manipulate data in a structured manner. However, modern matrices can involve billions of elements, making their storage and…
Let $\mathcal{R}$ be a $2$-torsion free commutative ring with unity, $X$ a locally finite pre-ordered set and $I(X,\mathcal{R})$ the incidence algebra of $X$ over $\mathcal{R}$. If $X$ consists of a finite number of connected components, in…
A shape of a combinatorial polytope is a convex embedding into Euclidean space. We provide necessary and sufficient conditions for a piecewise linear map between two shapes of the same polytope to be a compression (respectively a weak…
Graph matching refers to finding node correspondence between graphs, such that the corresponding node and edge's affinity can be maximized. In addition with its NP-completeness nature, another important challenge is effective modeling of…
We investigate properties which ensure that a given finite graph is the commuting graph of a group or semigroup. We show that all graphs on at least two vertices such that no vertex is adjacent to all other vertices is the commuting graph…
Let $S$ be a subring of a finite ring $R$ and $C_R(S) = \{r \in R : rs = sr \;\forall\; s \in S\}$. The relative non-commuting graph of the subring $S$ in $R$, denoted by $\Gamma_{S, R}$, is a simple undirected graph whose vertex set is $R…
We study the commuting graph on elements of odd prime order in finite simple groups. The results are used in a forthcoming paper describing the structure of Bruck loops and Bol loops of exponent 2.
Theory of matrix factorizations is useful to study hypersurfaces in commutative algebra. To study noncommutative hypersurfaces, which are important objects of study in noncommutative algebraic geometry, we introduce a notion of…
A $\textit{compression scheme}$ $A$ for a class $\mathbb{G}$ of graphs consists of an encoding algorithm $\textit{Encode}_A$ that computes a binary string $\textit{Code}_A(G)$ for any given graph $G$ in $\mathbb{G}$ and a decoding algorithm…
Any permutation in the finite symmetric group can be written as a product of simple transpositions $s_i = (i~i+1)$. For a fixed permutation $\sigma \in \mathfrak{S}_n$ the products of minimal length are called reduced decompositions or…
For a given graph $\mathcal{G}$ of order $n$ with $m$ edges, and a real symmetric matrix associated to the graph, $M\left(\mathcal{G}\right)\in\mathbb{R}^{n\times n}$, the interlacing graph reduction problem is to find a graph…
Model compression is generally performed by using quantization, low-rank approximation or pruning, for which various algorithms have been researched in recent years. One fundamental question is: what types of compression work better for a…
Using particle-scale models to accurately describe property enhancements and phase transitions in macroscopic behavior is a major engineering challenge in composite materials science. To address some of these challenges, we use the graph…
Let $G$ be a finite group and let $\tilde{G}$ be a Schur cover of $G$. The deep commuting graph $\Delta_D(G)$ of $G$ is a simple graph with vertex set $G$, where two distinct vertices are adjacent if their pre-images commute in $\tilde{G}$.…