English
Related papers

Related papers: Tur\'an's theorem for Dowling geometries

200 papers

Global control offers a promising route to scalable quantum computing. A recent conjecture by Hu et al. (arXiv:2508.19075) proposes that any connected qubit graph equipped with global Ising-type interactions and tunable global transverse…

Quantum Physics · Physics 2026-04-22 Roberto Gargiulo , Roberto Menta , Vittorio Giovannetti , Robert Zeier

We introduce a notion of Q-algebra that can be considered as a generalization of the notion of Q-manifold (a supermanifold equipped with an odd vector field obeying {Q,Q} =0). We develop the theory of connections on modules over Q-algebras…

High Energy Physics - Theory · Physics 2007-05-23 Albert Schwarz

Let $\Gamma$ denote the Hamming graph $H(D,r)$ with $r \geq 3$. Consider the distance matrices $\{A_i\}_{i=0}^{D}$ of $\Gamma$. Fix a vertex $x$ of $\Gamma$, and consider the dual distance matrices $\{A_i^{*}\}_{i=0}^{D}$ of $\Gamma$ with…

Combinatorics · Mathematics 2018-01-18 Siwaporn Mamart

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

The spectral Tur\'an theorem states that the $k$-partite Tur\'an graph is the unique graph attaining the maximum adjacency spectral radius among all graphs of order $n$ containing no the complete graph $K_{k+1}$ as a subgraph. This result…

Combinatorics · Mathematics 2024-08-07 Lele Liu , Zhenyu Ni , Jing Wang , Liying Kang

Seymour's Decomposition Theorem for regular matroids states that any matroid representable over both GF(2) and GF(3) can be obtained from matroids that are graphic, cographic, or isomorphic to R10 by 1-, 2-, and 3-sums. It is hoped that…

Combinatorics · Mathematics 2015-03-13 Dillon Mayhew , Geoff Whittle , Stefan H. M. van Zwam

We give a proof, based on thermodynamic formalism, of a theorem in bounded cohomology extending a foundational result of Burger and Monod: if $\Gamma$ is an irreducible uniform lattice in a non-compact connected semisimple Lie group of real…

Dynamical Systems · Mathematics 2026-03-31 Pablo D. Carrasco , Federico Rodriguez-Hertz

The problem of combinatorially determining the rank of the 3-dimensional bar-joint {\em rigidity matroid} of a graph is an important open problem in combinatorial rigidity theory. Maxwell's condition states that the edges of a graph $G=(V,…

Computational Geometry · Computer Science 2015-03-17 Jialong Cheng , Meera Sitharam

The nilpotent graph of a group $G$ is the simple and undirected graph whose vertices are the elements of $G$ and two distinct vertices are adjacent if they generate a nilpotent subgroup of $G$. Here we discuss some topological properties of…

Group Theory · Mathematics 2025-02-11 Costantino Delizia , Michele Gaeta , Mark L. Lewis , Carmine Monetta

Given a residually connected incidence geometry $\Gamma$ that satisfies two conditions, denoted $(B_1)$ and $(B_2)$, we construct a new geometry $H(\Gamma)$ with properties similar to those of $\Gamma$. This new geometry $H(\Gamma)$ is…

Combinatorics · Mathematics 2024-05-30 Claudio Alexandre Piedade , Philippe Tranchida

The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…

Group Theory · Mathematics 2015-06-11 Montserrat Casals-Ruiz

For every positive integer $t$ we construct a finite family of triple systems ${\mathcal M}_t$, determine its Tur\'{a}n number, and show that there are $t$ extremal ${\mathcal M}_t$-free configurations that are far from each other in…

Combinatorics · Mathematics 2021-02-17 Xizhi Liu , Dhruv Mubayi , Christian Reiher

Given a graph $\Gamma$, one may conside the set $X$ of its vertices as a metric space by assuming that all edges have length one. We consider two versions of homology theory of $\Gamma$ and their $K$-theory counterparts -- the $K$-theory of…

K-Theory and Homology · Mathematics 2024-01-30 V. Manuilov

The topological symmetry group $\mathrm{TSG}(\Gamma)$ of an embedding $\Gamma$ of a graph in $S^3$ is the subgroup of the automorphism group of the graph which is induced by homeomorphisms of $(S^3,\Gamma)$. If we restrict to orientation…

Geometric Topology · Mathematics 2026-01-21 A. Álvarez , E. Flapan , M. Hunnell , J. Hutchens , E. Lawrence , P. Lewis , C. Price , R. Vanderpool

We study criteria for deciding when the normal subgroup generated by a single polynomial automorphism of $\mathbb{A}^n$ is as large as possible, namely equal to the normal closure of the special linear group in the special automorphism…

Algebraic Geometry · Mathematics 2018-01-26 Drew Lewis

We introduce a unified theory of Cartan subgroups and maximal toroids - defined as connected multiplicative type subgroups that are maximal amongst all such subgroups - which holds for all affine algebraic groups over a field, regardless of…

Group Theory · Mathematics 2026-01-23 Damian Sercombe

A graph $\Gamma$ is said to be a semi-Cayley graph over a group $G$ if it admits $G$ as a semiregular automorphism group with two orbits of equal size. We say that $\Gamma$ is normal if $G$ is a normal subgroup of ${\rm Aut}(\Gamma)$. We…

Combinatorics · Mathematics 2020-04-22 Majid Arezoomand , Mohsen Ghasemi

The family $\Sigma_r$ consists of all $r$-graphs with three edges $D_1,D_2,D_3$ such that $|D_1\cap D_2|=r-1$ and $D_1 \triangle D_2 \subseteq D_3$. A generalized triangle, $\mathcal{T}_r \in \Sigma_r$ is an $r$-graph on…

Combinatorics · Mathematics 2015-08-24 Sergey Norin , Liana Yepremyan

Let $\Gamma$ denote a finite, simple and connected graph. Fix a vertex $x$ of $\Gamma$ which is not a leaf and let $T=T(x)$ denote the Terwilliger algebra of $\Gamma$ with respect to $x$. Assume that the unique irreducible $T$-module with…

Combinatorics · Mathematics 2023-01-25 Blas Fernández

Let $\mathcal{H}$ be a family of graphs. The generalized Tur\'an number $ex(n, K_r, \mathcal{H})$ is the maximum number of copies of the clique $K_r$ in any $n$-vertex $\mathcal{H}$-free graph. In this paper, we determine the value of…

Combinatorics · Mathematics 2024-09-17 Xiaona Fang , Xiutao Zhu , Yaojun Chen