Results 71 to 80 of about 238 (165)
Quasi‐convex surface subgroups in some one‐relator groups with torsion
Abstract We find surface subgroups in certain one‐relator groups with torsion and use this to deduce a profinite criterion for a word in the free group to be primitive.
Andrew Ng
wiley +1 more source
Homomorphisms of signed planar graphs
Signed graphs are studied since the middle of the last century. Recently, the notion of homomorphism of signed graphs has been introduced since this notion captures a number of well known conjectures which can be reformulated using the definitions of signed homomorphism.
Pascal Ochem +2 more
openaire +2 more sources
On the theories classified by an étendue
Abstract We give a model‐theoretic characterisation of the geometric theories classified by étendues—the ‘locally localic’ topoi. They are the theories where each model is determined, syntactically and semantically, by any witness of a fixed collection of formulae.
Joshua L. Wrigley
wiley +1 more source
Generalised spin Calogero–Moser systems from Cherednik algebras
Abstract Integrable spin Calogero–Moser type systems with non‐symmetric configurations of the singularities of the potential appeared in the work of Chalykh, Goncharenko and Veselov in 1999. We obtain various generalisations of these examples by making use of the representation theory of Cherednik algebras.
Misha Feigin +2 more
wiley +1 more source
Graph Similarity and Homomorphism Densities
48th International Colloquium on Automata, Languages, and Programming : ICALP 2021, July 12-16, 2021, Glasgow, Scotland (virtual conference) / edited by Nikhil Bansal, Emanuela Merelli, James Worrell 48th International Colloquium on Automata, Languages, and Programming, ICALP 2021, online, 12 Jul 2021 - 16 Jul 2021; Saarbrücken/Wadern : Schloss ...
openaire +5 more sources
The complexity of tropical graph homomorphisms
27 pages, 13 figures, 1 table.
Foucaud, Florent +5 more
openaire +3 more sources
Many real-life problems present multiple options necessitating modern researchers to identify the most suitable choice or decision. In this context, fuzzy sets have proven to be valuable tools for addressing such problems.
Waheed Ahmad Khan +4 more
doaj +1 more source
Dual graph homomorphism functions
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
L. Lovász (László) +1 more
openaire +3 more sources
In this work, we construct a homotopy theory for a class of intersection graphs arising from topological monoids. We introduce the M-intersection graph of a τe-monoid, where the vertices correspond to proper τe-submonoids and adjacency is defined by ...
Maryam F. Alshammari +2 more
doaj +1 more source
In this article, we study the homotopy aspects of intersection graphs of topological semigroups. We begin by defining the top intersection graph TGX and investigating how the algebraic and topological properties of a topological semigroup are reflected ...
Maryam F. Alshammari +2 more
doaj +1 more source

