相关论文: On the polycirculant conjecture

This paper presents a solution of the polycirculant conjecture which states that every vertex-transitive graph G has an automorphism that permutes the vertices in cycles of the same length. This is done by identifying vertex-transitive…

Given a henselian pair $(R, I)$ of commutative rings, we show that the relative $K$-theory and relative topological cyclic homology with finite coefficients are identified via the cyclotomic trace $K \to \mathrm{TC}$. This yields a…

We provide two new proofs of a theorem of Cooper, Long and Reid which asserts that, apart from an explicit finite list of exceptional manifolds, any compact orientable irreducible 3-manifold with non-empty boundary has large fundamental…

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…

We show that many normal subgroups of the braid group modulo its centre, and of the mapping class group of a sphere with marked points, have the property that their automorphism and abstract commensurator groups are mapping class groups of…

We prove that the rank of the cohomology of a closed symplectic manifold with coefficients in a field of characteristic $p$ is smaller than the number of periodic orbits of any non-degenerate Hamiltonian flow. Following Floer, the proof…

The monography examines the problem of constructing a group of automorphisms of a graph. A graph automorphism is a mapping of a set of vertices onto itself that preserves adjacency. The set of such automorphisms forms a vertex group of a…

We show that, if $\Gamma$ is a point group of $\mathbb{R}^{k+1}$ of order two for some $k\geq 2$ and $\mathcal S$ is a $k$-pseudomanifold which has a free automorphism of order two, then either $\mathcal S$ has a $\Gamma$-symmetric…

We prove that the group $\mathrm{SAut}_{\mathrm{k}}(\mathbb{A}^2)$ is simple as an algebraic group of infinite dimension, over any infinite field $\mathrm{k}$, by proving that any closed normal subgroup is either trivial or the whole group.…

Let $G = GL(n)$ and $K = GL(p) \times GL(q)$ with $p+q=n$, where the groups are taken over $\C$. In this paper we study a certain family of $K$-orbit closures on the flag variety $X$ of $G$. The geometry of these orbit closures plays a…

An algebraic description of basic discrete symmetries (space inversion P, time reversal T, charge conjugation C and their combinations PT, CP, CT, CPT) is studied. Discrete subgroups {1,P,T,PT} of orthogonal groups of multidimensional…

A simple graph G is k-ordered (respectively, k-ordered hamiltonian) if, for any sequence of k distinct vertices v_1, ..., v_k of G, there exists a cycle (respectively, a hamiltonian cycle) in G containing these k vertices in the specified…

Many combinatorial properties of a point set in the plane are determined by the set of possible partitions of the point set by a line. Their essential combinatorial properties are well captured by the axioms of oriented matroids. In fact,…

Understanding the difference between group orbits and their closures is a key difficulty in geometric complexity theory (GCT): While the GCT program is set up to separate certain orbit closures, many beautiful mathematical properties are…

For an integer $k\geq 1$, a graph is called a $k$-circulant if its automorphism group contains a cyclic semiregular subgroup with $k$ orbits on the vertices. We show that, if $k$ is even, there exist infinitely many cubic arc-transitive…

We define higher polyhedral K-groups for commutative rings, starting from the stable groups of elementary automorphisms of polyhedral algebras. Both Volodin's theory and Quillen's + construction are developed. In the special case of…

A connected graph of order $n$ admitting a semiregular automorphism of order $n/k$ is called a $k$-multicirculant. Highly symmetric multicirculants of small valency have been extensively studied, and several classification results exist for…

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…

The (n,k)-arrangement graph A(n,k) is a graph with all the k-permutations of an n-element set as vertices where two k-permutations are adjacent if they agree in exactly k-1 positions. We introduce a cyclic decomposition for k-permutations…

Let G be a group of permutations of a denumerable set E. The profile of G is the function phi which counts, for each n, the number phi(n) of orbits of G acting on the n-subsets of E. Counting functions arising this way, and their associated…