English
Related papers

Related papers: The Higman-M\lowercase{c}Laughlin Theorem for the …

200 papers

A graph $\Gamma$ is $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. If $V(\Gamma)$ admits a nontrivial $G$-invariant partition ${\cal B}$ such…

Combinatorics · Mathematics 2019-08-06 Yu Qing Chen , Teng Fang , Sanming Zhou

The modified Macdonald functions $\widetilde{H}_{\mu}$ are fundamental objects in modern algebraic combinatorics. Haiman showed that there is a correspondence between the $(\mathbb{C}^{*})^2$-fixed points $I_{\mu}$ of the Hilbert schemes…

Combinatorics · Mathematics 2024-10-18 Daniel Orr , Milo Bechtloff Weising

Let $G=\mathbf{Z}_{p} \oplus \mathbf{Z}_{p^2}$, where $p$ is a prime number. Suppose that $d$ is a divisor of the order of $G$. In this paper we find the number of automorphisms of $G$ fixing $d$ elements of $G$, and denote it by…

Group Theory · Mathematics 2018-06-27 Akhtar Abbas , Umar Hayat , Daniel López-Aguayo

We examine topological terms of $(2+1)$d sigma models and their consequences in the light of classifications of invertible quantum field theories utilizing bordism groups. In particular, we study the possible topological terms for the…

High Energy Physics - Theory · Physics 2021-08-20 Ryohei Kobayashi , Yasunori Lee , Ken Shiozaki , Yuya Tanizaki

We introduce the notion of an \emph{$n$-dimensional mixed dihedral group}, a general class of groups for which we give a graph theoretic characterisation. In particular, if $H$ is an $n$-dimensional mixed dihedral group then the we…

Combinatorics · Mathematics 2022-12-01 Daniel R. Hawtin , Cheryl E. Praeger , Jin-Xin Zhou

Why withdrawn: Main theorem can only be proved, if the flag manifold F with b2=1 is additionally hermitian symmetric.Mistake made at the following place: If F is not hermitian symmetric, certain vector fields are not left invariant

Algebraic Geometry · Mathematics 2011-08-02 Norbert Kuhlmann

In this paper, we study 2-geodesic-transitive graphs of order twice an odd prime power. Classifications of corresponding basic graphs and such graphs with almost simple automorphism groups are given, and a reduction theorem for general case…

Combinatorics · Mathematics 2026-04-28 Jiangmin Pan , Cixuan Wu , Yingnan Zhang , Hanlin Zou

A graph is edge-primitive if its automorphism group acts primitively on the edge set, and 2-arc-transitive if its automorphism group acts transitively on the set of 2-arcs. In this paper, we present a classification for those edge-primitive…

Combinatorics · Mathematics 2020-10-09 Huan Han , Hong Ci Liao , Zai Ping Lu

We consider the Macdonald group $\langle x,y\,|\, x^{[x,y]}=x^{1+2^m\ell},\, y^{[y,x]}=y^{1+2^m\ell}\rangle$ and its Sylow 2-subgroup $J=\langle x,y\,|\, x^{[x,y]}=x^{1+2^m\ell},\, y^{[y,x]}=y^{1+2^m\ell},…

Group Theory · Mathematics 2024-01-31 Alexander Montoya Ocampo , Fernando Szechtman

In this note we prove the claim given in the title. A group G is noncommutatively slender if each map from the fundamental group of the Hawaiian Earring to G factors through projection to a canonical free subgroup. Graham Higman, in his…

Group Theory · Mathematics 2019-08-13 Samuel M. Corson

In 1982, Durnberger proved that every connected Cayley graph of a finite group with a commutator subgroup of prime order contains a hamiltonian cycle. In this paper, we extend this result to the infinite case. Additionally, we generalize…

Combinatorics · Mathematics 2024-12-12 Florian Lehner , Farzad Maghsoudi , Babak Miraftab

Given a free group $F_k$ of rank $k\ge 2$ with a fixed set of free generators we associate to any homomorphism $\phi$ from $F_k$ to a group $G$ with a left-invariant semi-norm a generic stretching factor, $\lambda(\phi)$, which is a…

Group Theory · Mathematics 2007-05-23 Vadim Kaimanovich , Ilya Kapovich , Paul Schupp

A graph is edge-primitive if its automorphism group acts primitively on the edge set. In this short paper, we prove that a finite 2-arc-transitive edge-primitive graph has almost simple automorphism group if it is neither a cycle nor a…

Combinatorics · Mathematics 2019-01-11 Zaiping Lu

A mixed dihedral group is a group $H$ with two disjoint subgroups $X$ and $Y$, each elementary abelian of order $2^n$, such that $H$ is generated by $X\cup Y$, and $H/H'\cong X\times Y$. In this paper, for each $n\geq 2$, we construct a…

Combinatorics · Mathematics 2023-03-02 Daniel R. Hawtin , Jin-Xin Zhou , Cheryl E. Praeger

In this paper we show that a quadratic lagrangian, with no constraints, containing ordinary time derivatives up to the order $m$ of $N$ dynamical variables, has $2mN$ symmetries consisting in the translation of the variables with solutions…

High Energy Physics - Theory · Physics 2021-06-30 Andrea Barducci , Roberto Casalbuoni

A Cayley Graph for a group $G$ is called normal edge-transitive if it admits an edge-transitive action of some subgroup of the Holomorph of $G$ (the normaliser of a regular copy of $G$ in $\operatorname{Sym}(G)$). We complete the…

Combinatorics · Mathematics 2014-01-10 Brian P. Corr , Cheryl E. Praeger

In 1951, Higman constructed a remarkable group $$H=\left\langle a,b,c,d \, \left| \, b^a = b^2, c^b = c^2, d^c = d^2, a^d = a^2 \right. \right\rangle$$ and used it to produce the first examples of infinite simple groups. By studying fixed…

Group Theory · Mathematics 2019-02-19 Owen Baker

A step forward is made in a long standing Lov\'{a}sz's problem regarding hamiltonicity of vertex-transitive graphs by showing that every connected vertex-transitive graph of order a product of two primes, other than the Petersen graph,…

Combinatorics · Mathematics 2018-08-28 Shaofei Du , Klavdija Kutnar , Dragan Marusic

For a graph $G,$ let $\alpha(G)$ denote its second smallest Laplacian eigenvalue. The Laplacian Spread Conjecture states that $\alpha(G)+\alpha(\overline{G}) \geq 1,$ where $\overline{G}$ is the complement of $G.$ In this paper, we have…

Combinatorics · Mathematics 2024-11-22 Borchen Li

This paper takes a significant step towards confirming a long-standing and far-reaching conjecture of Peter J. Cameron and Cheryl E. Praeger. They conjectured in 1993 that there are no non-trivial block-transitive 6-designs. We prove that…

Combinatorics · Mathematics 2018-07-03 Michael Huber
‹ Prev 1 3 4 5 6 7 10 Next ›