English
Related papers

Related papers: On oriented $m$-semiregular representations of fin…

200 papers

A digraph is called an $n$-Cayley digraph if its automorphism group has an $n$-orbit semiregular subgroup. We determine the splitting fields of $n$-Cayley digraphs over abelian groups and compute a bound on their algebraic degrees, before…

Combinatorics · Mathematics 2024-01-17 Hao Li , Xiaogang Liu

For a digraph $\Gamma$, if $F$ is the smallest field that contains all roots of the characteristic polynomial of the adjacency matrix of $\Gamma$, then $F$ is called the splitting field of $\Gamma$. The extension degree of $F$ over the…

Combinatorics · Mathematics 2023-08-08 Shixin Wang , Majid Arezoomand , Tao Feng

A linear algebraic group G over a field k is called a Cayley group if it admits a Cayley map, i.e., a G-equivariant birational isomorphism over k between the group variety G and the Lie algebra Lie(G). A Cayley map can be thought of as a…

Algebraic Geometry · Mathematics 2021-01-05 M. Borovoi , B. Kunyavskii , N. Lemire , Z. Reichstein

Suppose that $R$ is a finite commutative ring with identity. The involutory Cayley graph $\G(R)$ of $R$ is the graph whose vertices are the elements of $R$, and two distinct vertices $x$ and $y$ are adjacent if and only if $(x-y)^2=1$. In…

Combinatorics · Mathematics 2025-08-05 Hamide Keshavarzi , Babak Amini , Afshin Amini , Shahin Rahimi

Let $S_\infty$ denote the topological group of permutations of the natural numbers. We study the complexity of the isomorphism relation on classes of closed subgroups $S_\infty$ in the setting of Borel reducibility between equivalence…

Logic · Mathematics 2022-09-28 Andre Nies , Philipp Schlicht , Katrin Tent

The purpose of this paper is to study the generalization of inverse semigroups (without order). An ordered semigroup S is called an inverse ordered semigroup if for every a 2 S, any two inverses of a are H-related. We prove that an ordered…

Group Theory · Mathematics 2019-05-13 A. Jamadar , K. Hansda

A group has the (D)CI ((Directed) Cayley Isomorphism) property, or more commonly is a (D)CI group, if any two Cayley (di)graphs on the group are isomorphic via a group automorphism. That is, $G$ is a (D)CI group if whenever…

Combinatorics · Mathematics 2023-11-22 Joy Morris

Let S be a finite generating set of a torsion-free, nilpotent group G. We show that every automorphism of the Cayley graph Cay(G;S) is affine. (That is, every automorphism of the graph is obtained by composing a group automorphism with…

Combinatorics · Mathematics 2016-03-14 Dave Witte Morris , Joy Morris , Gabriel Verret

From a generalization to $Z^n$ of the concept of congruence we define a family of regular digraphs or graphs called multidimensional circulants, which turn out to be Cayley (di)graphs of Abelian groups. This paper is mainly devoted to show…

Combinatorics · Mathematics 2012-09-25 M. A. Fiol

We prove a quantitative refinement of the statement that groups of polynomial growth are finitely presented. Let $G$ be a group with finite generating set $S$ and let $\operatorname{Gr}(r)$ be the volume of the ball of radius $r$ in the…

Group Theory · Mathematics 2025-07-22 Philip Easo , Tom Hutchcroft

Let $G$ be a complex semisimple algebraic group and $X$ be a complex symmetric homogeneous $G$-variety. Assume that both $G$, $X$ as well as the $G$-action on $X$ are defined over real numbers. Then $G(\mathbb{R})$ acts on $X(\mathbb{R})$…

Algebraic Geometry · Mathematics 2017-12-13 Stéphanie Cupit-Foutou , Dmitry A. Timashev

A non-complete graph is \emph{$2$-distance-transitive} if, for $i=1,2$ and for any two vertex pairs $(u_1,v_1)$ and $(u_2,v_2)$ with the same distance $i$ in the graph, there exists an element of the graph automorphism group that maps…

Combinatorics · Mathematics 2025-04-29 Wei Jin , Pingshan Li , Li Tan

We study algebraic properties of the semigroup $\mathscr{O\!\!I\!}_n(L)$ of finite partial order isomorphisms of the rank $\leq n$ of an infinite linearly ordered set $(L,\leqslant)$. In particular we describe its idempotents, the natural…

Group Theory · Mathematics 2024-12-31 Oleg Gutik , Maksym Shchypel

We introduce and study a variant of Ramsey numbers for edge-ordered graphs, that is, graphs with linearly ordered sets of edges. The edge-ordered Ramsey number $\overline{R}_e(\mathfrak{G})$ of an edge-ordered graph $\mathfrak{G}$ is the…

Combinatorics · Mathematics 2021-04-16 Martin Balko , Máté Vizer

A Cayley (di)graph $Cay(G,S)$ of a group $G$ with respect to a subset $S$ of $G$ is called normal if the right regular representation of $G$ is a normal subgroup in the full automorphism group of $Cay(G,S)$, and is called a CI-(di)graph if…

Combinatorics · Mathematics 2021-05-18 Jin-Hua Xie , Yan-Quan Feng , Grigory Ryabov , Ying-Long Liu

To any finite group $G$, we may associate a graph whose vertices are the elements of $G$ and where two distinct vertices $x$ and $y$ are adjacent if and only if the order of the subgroup $\langle x, y\rangle$ is divisible by at least 3…

Group Theory · Mathematics 2023-09-12 Karmele Garatea-Zaballa , Andrea Lucchini

This is the second installment of an exposition of an ACL2 formalization of finite group theory. The first, which was presented at the 2022 ACL2 workshop, covered groups and subgroups, cosets, normal subgroups, and quotient groups,…

Discrete Mathematics · Computer Science 2023-11-16 David M. Russinoff

A classification is given for factorizations of almost simple groups with at least one factor solvable, and it is then applied to characterize $s$-arc-transitive Cayley graphs of solvable groups, leading to a striking corollary: Except the…

Group Theory · Mathematics 2016-02-29 Cai Heng Li , Binzhou Xia

Let $m$ be an integer greater than three and $\ell$ be an odd prime. In this paper, we prove that at least one of the following groups: $\mbox{P}\Omega^\pm_{2m}(\mathbb{F}_{\ell^s})$, $\mbox{PSO}^\pm_{2m}(\mathbb{F}_{\ell^s})$,…

Number Theory · Mathematics 2021-01-08 Adrian Zenteno

We use the \emph{unit-graphs} and the \emph{special unit-digraphs} on matrix rings to show that every $n \times n$ nonzero matrix over $\Bbb F_q$ can be written as a sum of two $\operatorname{SL}_n$-matrices when $n>1$. We compute the…

Combinatorics · Mathematics 2017-10-25 Yeşim Demiroğlu Karabulut
‹ Prev 1 8 9 10 Next ›