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

By using higher K-theory, we study deformation theory of K-theoretic cycles. As an application, we answer two questions posed by Mark Green and Philip Griffiths: (1). How to define tangent spaces to cycle class groups in general? (2).…

The modular decomposition of a graph is a canonical representation of its modules. Algorithms for computing the modular decomposition of directed and undirected graphs differ significantly, with the undirected case being simpler, and…

A group K is said to be a B-group if every permutation group containing K as a regular subgroup is either imprimitive or 2-transitive. In the second edition of his influential textbook on finite groups, Burnside published a proof that…

We study k-Schur functions characterized by k-tableaux, proving combinatorial properties such as a k-Pieri rule and a k-conjugation. This new approach relies on developing the theory of k-tableaux, and includes the introduction of a…

Let $S$ be a set of transpositions such that the girth of the transposition graph of $S$ is at least 5. It is shown that the automorphism group of the Cayley graph of the permutation group $H$ generated by $S$ is the semidirect product…

We prove a conjecture of Medvedev and Scanlon for endomorphisms of connected commutative linear algebraic groups $G$ defined over an algebraically closed field $\mathbb{k}$ of characteristic $0$. That is, if $\Phi\colon G\longrightarrow G$…

For a graph with edge ordering, a linear order on the edge set, we obtain a permutation of vertices by considering the edges as transpositions of endvertices. It is known from D\'enes' results that the permutation of a tree is a full cyclic…

In this article we study the K-theory of endomorphisms using noncommutative motives. We start by extending the K-theory of endomorphisms functor from ordinary rings to (stable) infinity categories. We then prove that this extended functor…

Recently Lin, Wang and Zhou have proved that every $3$-connected nonbipartite graph of minimum degree at least $k$ with $k\ge 6$ and order at least $k+2$ contains $k$ cycles of consecutive lengths. They also conjecture that this result is…

This report provides an overview of theorems and statements related to a conjecture stated by D.W. Barnette in 1969 (which is an open problem in graph theory): Every cubic, bipartite, polyhedral graph contains a Hamilton cycle.

This paper investigates the $\mathrm{K}$-theory of twisted groupoid $\mathrm{C}^*$-algebras. It is shown that a homotopy of twists on an ample groupoid satisfying the Baum-Connes conjecture with coefficients gives rise to an isomorphism…

A famous conjecture of Lov\'asz states that every connected vertex-transitive graph contains a Hamilton path. In this article we confirm the conjecture in the case that the graph is dense and sufficiently large. In fact, we show that such…

For a fixed prime $p$, we consider a filtration of the commuting complex of elements of order $p$ in the symmetric group $\mathfrak{S}_n$. The filtration is obtained by imposing successively relaxed bounds on the number of disjoint…

Recently in graph theory several authors have studied the spectrum of the Cayley graph of the symmetric group S_n generated by the transpositions (1, i) for 2 <= i <= n. Several conjectures were made and partial results were obtained. The…

We give a unified approach to analysing, for each positive integer $s$, a class of finite connected graphs that contains all the distance transitive graphs as well as the locally $s$-arc transitive graphs of diameter at least $s$. A graph…

In a recent paper by K.-H. Lee, K. Lee and M. Mills, a mutation of reflections in the universal Coxeter group is defined in association with a mutation of a quiver. A matrix representation of these reflections is determined by a linear…

Commutative $d$-torsion $K$-theory is a variant of topological $K$-theory constructed from commuting unitary matrices of order dividing $d$. Such matrices appear as solutions of linear constraint systems that play a role in the study of…

In this note, we prove the K- and L-theoretic Farrell-Jones Conjecture with coefficients in an additive category for fundamental groups of graphs of virtually cyclic groups.

We prove an interesting fact describing the location of the roots of the generating polynomials of the numbers of derangements of length $n$, counted by their number of cycles. We then use this result to prove that if $k$ is the number of…

We introduce four new elementary short proofs of the famous K\"onig's theorem which characterizes bipartite graphs by absence of odd cycles.