Related papers: The $k$-orbit theory and polycirculant conjecture

An oscillation formula is established for the $k$-th eigenvector (assumed to be simple and with non-zero entries) of a weighted graph operator. The formula directly attributes the number of sign changes exceeding $k-1$ to the cycles in the…

Liu and Ma [J. Combin. Theory Ser. B, 2018] conjectured that every $2$-connected non-bipartite graph with minimum degree at least $k+1$ contains $\lceil k/2\rceil $ cycles with consecutive odd lengths. In particular, they showed that this…

We show that using the cyclic group the transpose of an R-cyclic matrix can be decomposed along diagonal parts into a sum of parts which are freely independent over diagonal scalar matrices. Moreover, if the R-cyclic matrix is self-adjoint…

We prove a reduced version of the Chevalley restriction conjecture on the commuting scheme posed by T.H. Chen and B.C. Ng\^o, extending the results of Hunziker for classical groups. In particular, we prove that for any connected reductive…

We present a strong connection between quantum information and quantum permutation groups. Specifically, we define a notion of quantum isomorphisms of graphs based on quantum automorphisms from the theory of quantum groups, and then show…

We prove that the complete graph with a hole $K_{u+w}-K_u$ can be decomposed into cycles of arbitrary specified lengths provided that the obvious necessary conditions are satisfied, each cycle has length at most $\min(u,w)$, and the longest…

We provide the Krull-Remak-Schmidt decomposition of group algebras of the form $k[G]$ where $k$ is a field, which includes fields with prime characteristic, and $G$ a finite abelian group. We achieved this by studying the geometric…

In this paper we study different restrictions imposed over the set of permutations of size $n$, $S_n$, and for specific classes of restrictions study the cycle structure of corresponding permutations. More specifically, we prove that for…

Gerstenhaber showed in 1961 that any commuting pair of n x n matrices over a field k generates a k-algebra A of k-dimension \leq n. A well-known example shows that the corresponding statement for 4 matrices is false. The question for 3…

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…

In this expository paper, various properties of matrix traces, determinants and adjugate matrices are proved, including the *trace Cayley-Hamilton theorem*, which says that \[ kc_k + \sum_{i=1}^k \operatorname{Tr} (A^i) c_{k-i} = 0 \qquad…

Let $S$ be a set of transpositions that generates the symmetric group $S_n$, where $n \ge 3$. The transposition graph $T(S)$ is defined to be the graph with vertex set $\{1,\ldots,n\}$ and with vertices $i$ and $j$ being adjacent in $T(S)$…

In a simple graph, a shunt is a symmetry which sends an edge to an incident edge (without fixing their shared vertex). The orbit of this edge under the shunt forms a consistent cycle. The important theorem of Biggs and Conway says that in a…

Denote by $A(p, n, k)$ the number of commuting $p$-tuples of permutations on $[n]$ that have exactly $k$ distinct orbits. It was conjectured in~\cite{abdesselam2023log} that $A(p, n, k)$ is log-concave with respect to $k$ for every $p\geq…

This note consists of three unrelated remarks. First, we demonstrate how roughly speaking $*$-homomorphisms between matrix stable $C^*$-algebras are exactly the uniformly continuous $*$-preserving group homomorphisms between their genral…

The Isomorphism Conjecture is a conceptional approach towards a calculation of the algebraic K-theory of a group ring RG, where G is an infinite group. In this paper we prove the conjecture in dimensions n<2 for fundamental groups of closed…

In 1869, Jordan proved that the set $\mathcal{T}$ of all finite group that can be represented as the automorphism group of a tree is containing the trivial group and it is closed under taken direct product of groups of lower order in…

For a subshift over a finite alphabet, a measure of the complexity of the system is obtained by counting the number of nonempty cylinder sets of length $n$. When this complexity grows exponentially, the automorphism group has been shown to…

A recently posed question of Haggkvist and Scott's asked whether or not there exists a constant c such that if G is a graph of minimum degree ck then G contains cycles of k consecutive even lengths. In this paper we answer the question by…

Given a group, we construct a fundamental additive functor on its orbit category. We prove that any isomorphism conjecture valid for this fundamental isomorphism functor holds for all additive functors, like K-theory, cyclic homology,…