相关论文: The $k$-orbit theory and polycirculant conjecture

In this paper, the concept of cyclic subsets in graph theory is introduced. An interesting theorem which relates to the collective Hamiltonicity of these cyclic subsets in graphs is also presented. This paper uses this theorem to construct…

We determine the permutation groups that arise as the automorphism groups of cyclic combinatorial objects. As special cases we classify the automorphism groups of cyclic codes. We also give the permutations by which two cyclic combinatorial…

Let G be a connected real reductive group. Orbit integrals define traces on the group algebra of G. We introduce a construction of higher orbit integrals in the direction of higher cyclic cocycles on the Harish-Chandra Schwartz algebra of…

In this paper, we prove a tight minimum degree condition in general graphs for the existence of paths between two given endpoints, whose lengths form a long arithmetic progression with common difference one or two. This allows us to obtain…

Let $G$ be a permutation group on a finite set $\Omega$. The $k$-closure $G^{(k)}$ of the group $G$ is the largest subgroup of $\operatorname{Sym}(\Omega)$ having the same orbits as $G$ on the $k$-th Cartesian power $\Omega^k$ of $\Omega$.…

We prove, under some mild conditions, that the equivariant twisted K-theory group of a crossed module admits a ring structure if the twisting 2-cocycle is 2-multiplicative. We also give an explicit construction of the transgression map…

A famous theorem in polytope theory states that the combinatorial type of a simplicial polytope is completely determined by its facet-ridge graph. This celebrated result was proven by Blind and Mani in 1987, via a non-constructive proof…

We prove a conjecture by Shannon Starr regarding the asymptotics for the number of tuples of commuting permutations with given number of joint orbits. These numbers generalize unsigned Stirling numbers of the first kind which count how many…

Goodwillie's rational isomorphism between relative algebraic K-theory and relative cyclic homology, together with the lambda decomposition of cyclic homology, illustrates the close relationships among algebraic K-theory, cyclic homology,…

We study dilations of finite tuples of normal, completely positive and completely contractive maps (which we call CP-maps) acting on a von Neumann algebra, and commuting according to a graph G. We show that if G is acyclic, then a tuple…

Building on previous work by Cameron et al. in [3], we give a recurrence for computing the number of acyclic orientations of complete $k$-partite graphs, which can be implemented to obtain a dynamic programming algorithm running in time…

In the paper "Aquino, C., Jim\'enez, R., Mijangos, M., Morales Mel\'endez, Q.: On Invariant (co)homology of a group, preprint" are introduced two groups generated by the orbits of an action of a group on another group by automorphisms. One…

A $k$-uniform tight cycle is a $k$-graph with a cyclic order of its vertices such that every $k$ consecutive vertices from an edge. We show that for $k\geq 3$, every red-blue edge-coloured complete $k$-graph on $n$ vertices contains $k$…

For a finite set $S$ of points in the plane and a graph with vertices on $S$ consider the disks with diameters induced by the edges. We show that for any odd set $S$ there exists a Hamiltonian cycle for which these disks share a point, and…

Due to the work of many authors in the last decades, given an algebraic orbifold (smooth proper Deligne-Mumford stack with trivial generic stabilizer), one can construct its orbifold Chow ring and orbifold Grothendieck ring, and relate them…

An automorphism group G of a 1-factorization of the complete multipartite graph $K_{m\times n}$ consists in permutations of the vertices of the graph mapping factors to factors. In this paper, we give a complete answer to the existence or…

Comparability graphs are graphs which have transitive orientations. The dimension of a poset is the least number of linear orders whose intersection gives this poset. The dimension ${\rm dim}(X)$ of a comparability graph $X$ is the…

We examine the number of cycles of length k in a permutation, as a function on the symmetric group. We write it explicitly as a combination of characters of irreducible representations. This allows to study formation of long cycles in the…

The concept of a k-translatable groupoid is explored in depth. Some properties of idempotent k-translatable groupoids, left cancellative k-translatable groupoids and left unitary k-translatable groupoids are proved. Necessary and sufficient…

A finite graph is called a tricirculant if admits a cyclic group of automorphism which has precisely three orbits on the vertex-set of the graph, all of equal size. We classify all finite connected cubic vertex-transitive tricirculants. We…