English
Related papers

Related papers: Generalized roundness of vertex transitive graphs

200 papers

Let G be a finite group with identity e and H \neq \{e\} be a subgroup of G. The generalized non-coprime graph GAmma_{G,H} of G with respect to H is the simple undirected graph with G - \{e \}\) as the vertex set and two distinct vertices a…

Group Theory · Mathematics 2022-08-04 S. Anukumar Kathirvel , Peter J. Cameron , T. Tamizh Chelvam

Let $G$ be a linear algebraic group over an infinite field $k$. Loosely speaking, a $G$-torsor over $k$-variety is said to be versal if it specializes to every $G$-torsor over any $k$-field. The existence of versal torsors is well-known. We…

Algebraic Geometry · Mathematics 2023-07-14 Uriya A. First

Generalized symmetry extends the usual notion of symmetry to ones that are of higher-form, acting on subsystems, non-invertible, etc. The concept was originally defined in the field theory context using the idea of topological defects. On…

Strongly Correlated Electrons · Physics 2025-07-31 Nathanan Tantivasadakarn , Xinyu Liu , Xie Chen

We study general transformation on the density matrix of two-level system that keeps the expectation value of observable invariant. We introduce a set of generators that yields hermiticity and trace preserving general transformation which…

Quantum Physics · Physics 2019-04-17 B. A. Tay

A total weighting of a graph $G$ is a mapping $f$ which assigns to each element $z \in V(G) \cup E(G)$ a real number $f(z)$ as its weight. The vertex sum of $v$ with respect to $f$ is $\phi_f(v)=\sum_{e \in E(v)}f(e)+f(v)$. A total…

Combinatorics · Mathematics 2015-10-06 Tsai-Lien Wong , Xuding Zhu

Let $S_n$ be the symmetric group on the set $[n]:=\{1,2,\ldots,n\}$. Given a permutation $\sigma=\sigma_1\sigma_2 \cdots \sigma_n \in S_n$, we say it has a descent at index $i$ if $\sigma_i>\sigma_{i+1}$. Let $\mathcal{D}(\sigma)$ be the…

Combinatorics · Mathematics 2024-05-13 Alexander Diaz-Lopez , Kathryn Haymaker , Colin McGarry , Dylan McMahon

We investigate how to find generic and globally rigid realizations of graphs in $\mathbb{R}^d$ based on elementary geometric observations. Our arguments lead to new proofs of a combinatorial characterization of the global rigidity of graphs…

Combinatorics · Mathematics 2014-08-12 Shin-ichi Tanigawa

The vertices of a $k$-token graph of a graph $G$ correspond to $k$ indistinguishable tokens placed on $k$ different vertices of $G$. Changing some conditions on both the nature of the tokens and the number of tokens allowed in each vertex…

Combinatorics · Mathematics 2026-04-07 Xiaodi Song , Cristina Dalfó , Miquel Àngel Fiol , Mercè Mora , Shenggui Zhang

We consider network models of quantum localisation in which a particle with a two-component wave function propagates through the nodes and along the edges of an arbitrary directed graph, subject to a random SU(2) rotation on each edge it…

Mathematical Physics · Physics 2009-11-10 John Cardy

The aim of this paper is to give a proof of the restriction theorems for principal bundles with a reductive algebraic group as structure group in arbitrary characteristic. Let $G$ be a reductive algebraic group over any field $k=\bar{k}$,…

Algebraic Geometry · Mathematics 2013-03-01 Sudarshan Gurjar

We consider non-commutative deformations of sheaves on algebraic varieties. We develop some tools to determine parameter algebras of versal non-commutative deformations for partial simple collections and the structure sheaves of smooth…

Algebraic Geometry · Mathematics 2021-08-31 Yujiro Kawamata

Given a compact 3-manifold N without boundary, we prove that for a bumpy metric of positive scalar curvature the space of minimal surfaces having a uniform upper bound on the Morse index is always finite unless the manifold itself contains…

Differential Geometry · Mathematics 2016-06-14 Alessandro Carlotto

A geometric grid class consists of those permutations that can be drawn on a specified set of line segments of slope \pm1 arranged in a rectangular pattern governed by a matrix. Using a mixture of geometric and language theoretic methods,…

Combinatorics · Mathematics 2012-02-06 Michael H. Albert , M. D. Atkinson , Mathilde Bouvel , Nik Ruškuc , Vincent Vatter

Given an infinite connected graph $G$, a way to randomly perturb its metric is to assign random i.i.d. lengths to the edges of the graph, a process called first-passage percolation. Assume that the graph is infinite and of bounded degree.…

Probability · Mathematics 2025-12-08 Dominic Bair , Sagnik Jana , Yulan Qing

This paper investigates a generalized hyperbolic circle packing (including circles, horocycles or hypercycles) with respect to the total geodesic curvatures on the surface with boundary. We mainly focus on the existence and rigidity of…

Geometric Topology · Mathematics 2023-11-20 Guangming Hu , Yi Qi , Yu Sun , Puchun Zhou

We find geometric and arithmetic conditions in order to characterize the irreducibility of the determinant of the generic Vandermonde matrix over the algebraic closure of any field k. We also characterize those determinants whose…

Commutative Algebra · Mathematics 2009-10-30 Carlos D'Andrea , Luis Felipe Tabera

In this article, we study the uniqueness problem for the generalized gauss maps of minimal surfaces (with the same base) immersed in $\mathbb R^{n+1}$ which have the same inverse image of some hypersurfaces in a projective subvariety…

Differential Geometry · Mathematics 2024-01-23 Si Duc Quang , Do Thi Thuy Hang

Let $M = (m_{ij})$ be an $n \times n$ square matrix of integers. For our purposes, we can assume without loss of generality that $M$ is homogeneous and that the entries are non-increasing going leftward and downward. Let $d$ be the sum of…

Algebraic Geometry · Mathematics 2010-12-16 Luca Chiantini , Juan Migliore

Starting from a short review of spaces of generalized sections of vector bundles, we give a concise systematic description, in precise geometric terms, of Leray densities, principal value densities, propagators and elementary solutions of…

Mathematical Physics · Physics 2016-01-20 Daniel Canarutto

In 1968, Erd\"os defined the Shift Graph as the graph whose vertices are the $k$-element subsets of $[n]=\{0,1,2,...,n-1\}$ such that $A=\{a_1,...,a_k\}$ and $B=\{b_1,...,b_k\}$ are neighbours iff $a_1<b_1=a_2<b_2=a_3<... <b_{n-1}=a_n<b_n$.…

Logic · Mathematics 2017-04-17 Milette Riis