English
Related papers

Related papers: Some orbits of a two-vertex stabilizer in a Grassm…

200 papers

We prove that, if $\Gamma$ is a finite connected cubic vertex-transitive graph, then either there exists a semiregular automorphism of $\Gamma$ of order at least $6$, or the number of vertices of $\Gamma$ is bounded above by an absolute…

Combinatorics · Mathematics 2024-12-20 Marco Barbieri , Valentina Grazian , Pablo Spiga

While stabilizer tableaus have proven exceptionally useful as a descriptive tool for additive quantum codes, they offer little guidance for concrete constructions or coding algorithm analysis. We introduce a representation of stabilizer…

Quantum Physics · Physics 2025-01-31 Andrey Boris Khesin

Let $G$ be a finite group and let $N$ be a normal subgroup of $G$. We attach to $N$ two graphs ${\Gamma}_G(N)$ and ${\Gamma}^{\ast}_G(N)$ related to the conjugacy classes of $G$ contained in $N$ and to the set of primes dividing the sizes…

Group Theory · Mathematics 2024-02-12 Antonio Beltrán , María José Felipe , Carmen Melchor

A vertex-girth-regular $vgr(v,k,g,\lambda)$-graph is a $k$-regular graph of girth $g$ and order $v$ in which every vertex belongs to exactly $\lambda$ cycles of length $g$. While all vertex-transitive graphs are necessarily…

Combinatorics · Mathematics 2024-08-28 Robert Jajcay , Jorik Jooken , István Porupsánszki

We show that the groupoids of two directed graphs are isomorphic if and only if the two graphs are orbit equivalent by an orbit equivalence that preserves isolated eventually periodic points. We also give a complete description of the…

Dynamical Systems · Mathematics 2018-10-08 Toke Meier Carlsen , Marius Lie Winger

The goal of this paper is to better understand a family of linear degenerations of the classical Lagrangian Grassmannians $\Lambda(2n)$. It is the special case for $k=n$ of the varieties $X(k,2n)^{sp}$, introduced in previous joint work…

Representation Theory · Mathematics 2025-10-09 Matteo Micheli

We classify all the $2$-arc-transitive strongly regular graphs, and use this classification to study the family of finite $(G,3)$-geodesic-transitive graphs of girth $4$ or $5$ for some group $G$ of automorphisms. For this application we…

Combinatorics · Mathematics 2019-04-03 Wei Jin , Cheryl E. Praeger

This paper addresses the challenge of spectral analysis and structural investigation for graphs that are not distance-regular, where computing the spectrum using standard methods based on equitable and orbit partitions can be complex. Our…

Combinatorics · Mathematics 2025-11-26 Ali Zafari , Saeid Alikhani

The Terwilliger algebra $T(x)$ of a finite connected simple graph $\Gamma$ with respect to a vertex $x$ is the complex semisimple matrix algebra generated by the adjacency matrix $A$ of $\Gamma$ and the diagonal matrices…

Combinatorics · Mathematics 2021-06-25 Hajime Tanaka , Tao Wang

The stability of graphene multivacancy systems is studied using Density Functional Theory (DFT) calculations. This work describes the evolution of the energy of formation per carbon atom for zigzag and armchair complementary figures -i.e.…

Materials Science · Physics 2013-12-19 Ricardo Faccio , Alvaro W. Mombrú

Let $V$ be an $n$-dimensional left vector space over a division ring $R$. We write ${\mathcal G}_{k}(V)$ for the Grassmannian formed by $k$-dimensional subspaces of $V$ and denote by $\Gamma_{k}(V)$ the associated Grassmann graph. Let also…

Combinatorics · Mathematics 2012-03-02 Mark Pankov

Let $G=(V,E)$ be a graph with the vertex-set $V$ and the edge-set $E$. Let $N(v)$ denote the set of neighbors of the vertex $v$ of $G.$ The graph $G$ is called $ irreducible $ whenever for every $v,w \in V$ if $v \neq w$, then $N(v)\neq…

Group Theory · Mathematics 2020-09-24 S. Morteza Mirafzal

We establish a strong, geometric lower bound on the (sequential) topological complexity of the unordered configuration spaces of a general graph. As an application, we show that, for most graphs, the topological complexity eventually…

Algebraic Topology · Mathematics 2026-02-05 Ben Knudsen

In this paper we initiate the study of equivariant wave maps from 2d hyperbolic space into rotationally symmetric surfaces. This problem exhibits markedly different phenomena than its Euclidean counterpart due to the exponential volume…

Analysis of PDEs · Mathematics 2014-11-17 Andrew Lawrie , Sung-Jin Oh , Sohrab Shahshahani

If $G$ is a group acting on a set $\Omega$ and $\alpha, \beta \in \Omega$, the digraph whose vertex set is $\Omega$ and whose arc set is the orbit $(\alpha, \beta)^G$ is called an {\em orbital digraph} of $G$. Each orbit of the stabiliser…

Group Theory · Mathematics 2013-02-19 Simon M. Smith

In this paper we discuss a method for bounding the size of the stabiliser of a vertex in a $G$-vertex-transitive graph $\Gamma$. In the main result the group $G$ is quasiprimitive or biquasiprimitive on the vertices of $\Gamma$, and we…

Combinatorics · Mathematics 2011-02-09 Cheryl E. Praeger , Pablo Spiga , Gabriel Verret

A graph $\Gamma$ is said to be symmetric if its automorphism group $\rm Aut(\Gamma)$ acts transitively on the arc set of $\Gamma$. In this paper, we show that if $\Gamma$ is a finite connected heptavalent symmetric graph with solvable…

Combinatorics · Mathematics 2017-10-04 Jia-Li Du , Yan-Quan Feng , Yu-Qin Liu

In this paper we will study the action of $\mathbb{F}_{q^n}^{2 \times 2}$ on the graph of an $\mathbb{F}_q$-linear function of $\mathbb{F}_{q^n}$ into itself. In particular we will see that, under certain combinatorial assumptions, its…

Combinatorics · Mathematics 2024-01-12 Valentino Smaldore , Corrado Zanella , Ferdinando Zullo

In the $m$-dimensional affine space $AG(m,q)$ over the finite field $\mathbb{F}_q$ of odd order $q$, the analogous of the Euclidean distance gives rise to a graph $\mathfrak{G}_{m,q}$ where vertices are the points of $AG(m,q)$ and two…

Combinatorics · Mathematics 2021-02-08 Gábor Korchmáros , Federico Romaniello , Tamás Szőnyi

Let $G_{k,n}$ be the $n$-balanced $k$-partite graph, whose vertex set can be partitioned into $k$ parts, each has $n$ vertices. In this paper, we prove that if $k \geq 2,n \geq 1$, for the edge set $E(G)$ of $G_{k,n}$ $$|E(G)|…

Combinatorics · Mathematics 2023-09-04 Zongyuan Yang , Yi Zhang , Shichang Zhao