中文
相关论文

相关论文: Fire retainment on Cayley graphs

200 篇论文

Let G be a finitely presented group, and let {G_i} be a collection of finite index normal subgroups that is closed under intersections. Then, we prove that at least one of the following must hold: 1. G_i is an amalgamated free product or…

群论 · 数学 2007-05-23 Marc Lackenby

We study how the spectral gap and diameter of Cayley graphs depend strongly on the choice of generating set. We answer a question of Pyber and Szab\'o (2013) by exhibiting a sequence of finite groups $G_n$ with $|G_n| \to \infty$ admitting…

群论 · 数学 2026-02-17 Sean Eberhard , Luca Sabatini

In this paper we introduce a concept of an evacuation scheme on the Cayley graph of an infinite finitely generated group. This is a collection of infinite simple paths bringing all vertices to infinity. We impose a restriction that every…

群论 · 数学 2021-12-21 Victor Guba

Given a group $\Gamma$, we establish a connection between the unitarisability of its uniformly bounded representations and the asymptotic behaviour of the isoperimetric constants of Cayley graphs of $\Gamma$ for increasingly large…

泛函分析 · 数学 2018-02-19 Maria Gerasimova , Dominik Gruber , Nicolas Monod , Andreas Thom

The largest order $n(d,k)$ of a graph of maximum degree $d$ and diameter $k$ cannot exceed the Moore bound, which has the form $M(d,k)=d^k - O(d^{k-1})$ for $d\to\infty$ and any fixed $k$. Known results in finite geometries on generalised…

组合数学 · 数学 2017-09-29 Martin Bachratý , Jana Šiagiová , Jozef Širáň

Consider a model of fire spreading through a graph; initially some vertices are burning, and at every given time-step fire spreads from burning vertices to their neighbours. The firefighter problem is a solitaire game in which a player is…

离散数学 · 计算机科学 2021-05-11 Arye Deutch , Ohad Noy Feldheim , Rani Hod

We introduce a method for analyzing the convex hull of a set in non-positively curved piecewise Euclidean polygonal complexes and we apply this method to prove that, with the usual action of Fm x Zn on the metric product of the Cayley graph…

群论 · 数学 2025-12-08 Jordan A. Sahattchieve

This paper represents a significant leap forward in the problem of enumerating vertex-transitive graphs. Recent breakthroughs on symmetry of Cayley (di)graphs show that almost all finite Cayley (di)graphs have the smallest possible…

组合数学 · 数学 2025-11-25 Yunsong Gan , Pablo Spiga , Binzhou Xia

By now, we have a product theorem in every finite simple group $G$ of Lie type, with the strength of the bound depending only in the rank of $G$. Such theorems have numerous consequences: bounds on the diameters of Cayley graphs, spectral…

群论 · 数学 2018-11-22 Harald A. Helfgott

It is shown that the comment by Costa and Meneses [1] did not point any technical or conceptual flaw in our paper titled ``Conservative Force Fields in Nonextensive Kinetic Theory" (Physica A 316, 289 (2002)). In particular, the application…

统计力学 · 物理学 2007-05-23 J. A. S. Lima , J. R. Bezerra , R. Silva

We prove the monotonic normalized heat diffusion property on distance-regular graphs with classical parameters of diameter $3$. Regev and Shinkar found a Cayley graph for which this property fails. On the other hand, this property has been…

组合数学 · 数学 2025-08-26 Shiping Liu , Heng Zhang

We study groups acting by length-preserving transformations on spaces equipped with asymmetric, partially-defined distance functions. We introduce a natural notion of quasi-isometry for such spaces and exhibit an extension of the…

群论 · 数学 2009-06-03 Robert Gray , Mark Kambites

This paper explores Iwasawa theory from a graph theoretic perspective, focusing on the algebraic and combinatorial properties of Cayley graphs. Using representation theory, we analyze Iwasawa-theoretic invariants within…

数论 · 数学 2024-12-04 Sohan Ghosh , Anwesh Ray

One of the most elementary spreading models on graphs can be described by a fire spreading from a burning vertex in discrete time steps. At each step, all neighbors of burning vertices catch fire. A well-studied extension to model fire…

数据结构与算法 · 计算机科学 2025-12-22 Jannis Blauth , Christian Nöbel , Rico Zenklusen

We study the complexity of graph problems on graphs defined on groups, especially power graphs. We observe that an isomorphism invariant problem, such as Hamiltonian Path, Partition into Cliques, Feedback Vertex Set, Subgraph Isomorphism,…

计算复杂性 · 计算机科学 2025-07-09 Bireswar Das , Dipan Dey , Jinia Ghosh

We disprove a strong form of the Regular Inverse Galois Problem: there exist finite groups $G$ which do not have a realization $F/\Qq(T)$ that induces all Galois extensions $L/\Qq(U)$ of group $G$ by specializing $T$ to $f(U) \in \Qq(U)$.…

数论 · 数学 2016-05-31 Pierre Dèbes

We survey the known group properties that a sequence of finite groups or group actions needs to satisfy to admit subsets of bounded cardinality producing expander Cayley or Schreier graphs. We prove that an infinite amenable group and…

群论 · 数学 2025-11-21 Luca Sabatini

We find a generating function expressed as a continued fraction that enumerates ordered trees by the number of vertices at different levels. Several Catalan problems are mapped to an ordered-tree problem and their generating functions also…

组合数学 · 数学 2007-05-23 Mahendra Jani , Robert G. Rieper

Motivated by expansion in Cayley graphs, we show that there exist infinitely many groups $G$ with a nontrivial irreducible unitary representation whose average over every set of $o(\log\log|G|)$ elements of $G$ has operator norm $1 - o(1)$.…

组合数学 · 数学 2017-05-15 Yufei Zhao

In the setting of Carnot groups, we are concerned with the rectifiability problem for subsets that have finite sub-Riemannian perimeter. We introduce a new notion of rectifiability that is, possibly, weaker than the one introduced by…

偏微分方程分析 · 数学 2023-10-05 Sebastiano Don , Enrico Le Donne , Terhi Moisala , Davide Vittone