• Corpus ID: 49396407

Acyclicity in finite groups and groupoids

@article{Otto2018AcyclicityIF,
  title={Acyclicity in finite groups and groupoids},
  author={Martin Otto},
  journal={ArXiv},
  year={2018},
  volume={abs/1806.08664}
}
  • M. Otto
  • Published 22 June 2018
  • Mathematics
  • ArXiv
We expound a concise construction of finite groups and groupoids whose Cayley graphs satisfy graded acyclicity requirements. Our acyclicity criteria concern cyclic patterns formed by coset-like configurations w.r.t. subsets of the generator set rather than just by individual generators. The proposed constructions correspondingly yield finite groups and groupoids whose Cayley graphs satisfy much stronger acyclicity conditions than large girth. We thus obtain generic and canonical constructions… 

Figures from this paper

Solution to the Henckell--Rhodes problem: finite $F$-inverse covers do exist

. For a finite connected graph E with set of edges E , a finite E -generated group G is constructed such that the set of relations p = 1 satisfied by G (with p a word over E ∪ E − 1 ) is closed under

Amalgamation and Symmetry: From Local to Global Consistency in The Finite

Amalgamation patterns are specified by a finite collection of finite template structures together with a collection of partial isomorphisms between pairs of these. The template structures specify the

Comonadic semantics for guarded fragments

  • S. AbramskyDan Marsden
  • Computer Science
    2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
  • 2021
A systematic account of how a range of model comparison games which play a central role in finite model theory can be captured in terms of resource-indexed comonads on the category of relational structures, including Ehrenfeucht-Fraïssé, pebbling, and bisimulation games, is extended to quantifier-guarded fragments of first-order logic.

References

SHOWING 1-10 OF 21 REFERENCES

Highly Acyclic Groups, Hypergraph Covers and the Guarded Fragment

  • M. Otto
  • Mathematics
    2010 25th Annual IEEE Symposium on Logic in Computer Science
  • 2010
It is shown that finite groups whose Cayley graphs have large girth even w.r.t. a discounted distance measure that contracts arbitrarily long sequences of edges from the same colour class, and only counts transitions between colour classes are useful in the construction of finite bisimilar hypergraph covers.

Groupoids, Hypergraphs, and Symmetries in Finite Models

  • M. Otto
  • Mathematics
    2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
  • 2013
It is shown that reduced products with groupoids provide a generic and versatile tool towards such constructions; they are explored in applications to the construction of finite hypergraph coverings, to finite model constructions for the guarded fragment, and to extension properties for partial isomorphisms of relational structures.

Finite conformal hypergraph covers and Gaifman cliques in finite structures

An open question about a clique constrained strengthening of the extension property for partial automorphisms (EPPA) of Hrushovski, Herwig and Lascar is answered and an alternative proof of the finite model property (FMP) for the clique guarded fragment of first-order logic CGF is provided.

Amalgamation and Symmetry: From Local to Global Consistency in The Finite

Amalgamation patterns are specified by a finite collection of finite template structures together with a collection of partial isomorphisms between pairs of these. The template structures specify the

Common knowledge and multi-scale locality analysis in Cayley structures

  • Felix CanavoiM. Otto
  • Computer Science
    2017 32nd Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
  • 2017
We investigate multi-agent epistemic modal logic with common knowledge modalities for groups of agents and obtain van Benthem style model-theoretic characterisations, in terms of bisimulation

Inverse semigroups

In this note it is shown that if S is a free inverse semigroup of rank at least two and if e, f are idempotents of S such that e > f then S can be embedded in the partial semigroup eSe\fSf. The proof

On the Desirability of Acyclic Database Schemes

It is shown that this class of database schemes, called acychc, has a number of desirable properties that have been studied by other researchers and are shown to be eqmvalent to acydicity.

Cubic Graphs with Large Girth

For values of g in the range 3 I g I 12, there has been much effort devoted to finding the smallest possible graphs. It is known that the lower bound is attained only in the cases g = 3,4, 5,6, 8,

Finite F-inveres covers do exist.

We show that every finite inverse monoid has an idempotent-separating cover by a finite F-inverse monoid. This provides a positive answer to a conjecture of Henckell and Rhodes.

Herstellung von Graphen mit vorgegebener abstrakter Gruppe

© Foundation Compositio Mathematica, 1939, tous droits réservés. L’accès aux archives de la revue « Compositio Mathematica » (http: //http://www.compositio.nl/) implique l’accord avec les conditions