Related papers: On the Ingleton-Violations in Finite Groups
While there has been a plethora of approaches for detecting disjoint communities from real-world complex networks, some methods for detecting overlapping community structures have also been recently proposed. In this work, we argue that,…
In Stochastic blockmodels, which are among the most prominent statistical models for cluster analysis of complex networks, clusters are defined as groups of nodes with statistically similar link probabilities within and between groups. A…
A perfect code in a graph $\Gamma = (V, E)$ is a subset $C$ of $V$ such that no two vertices in $C$ are adjacent and every vertex in $V \setminus C$ is adjacent to exactly one vertex in $C$. A subgroup $H$ of a group $G$ is called a…
Let $\alpha(n)$ be the least number $k$ for which there exists a simple graph with $k$ vertices having precisely $n \geq 3$ spanning trees. Similarly, define $\beta(n)$ as the least number $k$ for which there exists a simple graph with $k$…
An identifying code of a graph is a subset of its vertices such that every vertex of the graph is uniquely identified by the set of its neighbours within the code. We show a dichotomy for the size of the smallest identifying code in classes…
The setting of projective systems can be used to study the parameters of a projective linear code $\mathcal{C}$. This can be done by considering the intersections of the point set $\Omega$ defined by the columns of a generating matrix for…
We introduce a mathematical framework for symmetry-resolved entanglement entropy with a non-abelian symmetry group. To obtain a reduced density matrix that is block-diagonal in the non-abelian charges, we define subsystems operationally in…
We spot a hole in the area of succinct data structures for graph classes from a universe of size at most $n^n$. Very often, the input graph is labeled by the user in an arbitrary and easy-to-use way, and the data structure for the graph…
This paper presents several versions of the Ancona inequality for finitely supported, irreducible random walks on non-amenable groups. We first study a class of Morse subsets with narrow points and prove the Ancona inequality around these…
Let $m \geq 2$ be an integer, and let $\mathbb{F}_q$ be the finite field of prime power order $q.$ Let $\mathcal{R}=\frac{\mathbb{F}_q[u]}{\langle u^2 \rangle}\times \mathbb{F}_q$ be the mixed-alphabet ring, where…
The problem of error correction in both coherent and noncoherent network coding is considered under an adversarial model. For coherent network coding, where knowledge of the network topology and network code is assumed at the source and…
Given a group $G$ and an integer $n\geq 0$ we consider the family $\mathcal{F}_n$ of all virtually abelian subgroups of $G$ of rank at most $n$. In this article we prove that for each $n\ge2$ the Bredon cohomology, with respect to the…
A connected undirected graph is called \emph{geodetic} if for every pair of vertices there is a unique shortest path connecting them. It has been conjectured that for finite groups, the only geodetic Cayley graphs are odd cycles and…
We present an elementary derivation of the "intrinsic" symmetry groups for knots and links of 8 or fewer crossings. The standard symmetry group for a link is the mapping class group $\MCG(S^3,L)$ or $\Sym(L)$ of the pair $(S^3,L)$. Elements…
Trellises are crucial graphical representations of codes. While conventional trellises are well understood, the general theory of (tail-biting) trellises is still under development. Iterative decoding concretely motivates such theory. In…
In this paper, we investigate the computational complexity of isomorphism testing for finite groups and quasigroups, given by their multiplication tables. We crucially take advantage of their various decompositions to show the following: -…
Let $G$ be a finite group, $S\subseteq G\setminus\{1\}$ be a set such that if $a\in S$, then $a^{-1}\in S$, where $1$ denotes the identity element of $G$. The undirected Cayley graph $Cay(G,S)$ of $G$ over the set $S$ is the graph whose…
We construct an infinite family of two-Lee-weight and three-Lee-weight codes over the chain ring $\mathbb{F}_p+u\mathbb{F}_p.$ They have the algebraic structure of abelian codes. Their Lee weight distribution is computed by using Gauss…
The article is devoted to the representation theory of locally compact infinite-dimensional group $\mathbb{GLB}$ of almost upper-triangular infinite matrices over the finite field with $q$ elements. This group was defined by S.K., A.V., and…
Given a graph and one of its weighted Laplacian matrix, a Fiedler vector is an eigenvector with respect to the second smallest eigenvalue. The Fiedler vectors have been used widely for graph partitioning, graph drawing, spectral clustering,…