English
Related papers

Related papers: Closure Properties in the Class of Multiple Contex…

200 papers

The family of graphs of reduced words of a certain subcollection of permutations in the union $\cup_{n\geq 4}\frak{S}_{n}$ of symmetic groups is investigated. The subcollection is characterised by the hook cycle type $(n-2,1,1)$ with…

Combinatorics · Mathematics 2024-06-17 Praise Adeyemo

A group G is a vGBS group if it admits a decomposition as a finite graph of groups with all edge and vertex groups finitely generated and free abelian. We prove that the multiple conjugacy problem is solvable between two n-tuples A and B of…

Group Theory · Mathematics 2011-06-23 Benjamin Beeker

Let $S$ be a semigroup (written multiplicatively). Endowed with the operation of setwise multiplication induced by $S$ on its parts, the non-empty subsets of $S$ form themselves a semigroup, denoted by $\mathcal P(S)$. Accordingly, we say…

Rings and Algebras · Mathematics 2025-10-02 Lingxi Li , Salvatore Tringali

We prove that the family of graphs containing no cycle with exactly $k$-chords is $\chi$-bounded, for $k$ large enough or of form $\ell(\ell-2)$ with $\ell \ge 3$ an integer. This verifies (up to a finite number of values $k$) a conjecture…

Combinatorics · Mathematics 2025-09-03 Joonkyung Lee , Shoham Letzter , Alexey Pokrovskiy

We prove that, given a finitely generated subgroup $H$ of a free group $F$, the following questions are decidable: is $H$ closed (dense) in $F$ for the pro-(met)abelian topology? is the closure of $H$ in $F$ for the pro-(met)abelian…

Group Theory · Mathematics 2023-05-25 Claude Marion , Pedro V. Silva , Gareth Tracey

We prove lower bounds for the fraction of edges of an $r$-graph which can be covered by the union of $k$ 1-factors. The special case $r=3$ yields some known results for cubic graphs. Furthermore, we introduce the concept of…

Combinatorics · Mathematics 2019-10-07 Ligang Jin , Eckhard Steffen

In this paper is proved that the group of automorphisms of semigroup End(P[X]), if P is algebraically closed field, is generated by semi-inner automorphisms.

Commutative Algebra · Mathematics 2007-05-23 Aivars Berzins

In this paper, we investigate the edge-coloring number of the power graph of a finite group. We characterize which finite groups have overfull power graphs, showing that this occurs if and only if the group is cyclic of odd prime power…

Group Theory · Mathematics 2025-08-05 Elie Feinsilber

We associate to each finite presentation of a group G a compact CW-complex that is a 3-manifold in the complement of a point, and whose fundamental group is isomorphic to G. We use this complex to define a notion of genus for G and give…

Group Theory · Mathematics 2011-12-01 Iain Aitchison , Lawrence Reeves

We show that in the category of groups, every singly-generated class which is closed under isomorphisms, direct limits and extensions is also singly-generated under isomorphisms and direct limits, and in particular is co-reflective. We also…

Group Theory · Mathematics 2021-02-11 Ramón Flores , José L. Rodríguez

We reduce the classification of finite subgroups in compact Lie groups to that of quasi-simple ones, prove the number of conjugacy classes is finite and each cojugacy class is Zariski closed in mapping space, and classify "strongly…

Group Theory · Mathematics 2012-03-28 Jun Yu

Context-free language theory is a subject of high importance in computer language processing technology as well as in formal language theory. This paper presents a formalization, using the Coq proof assistant, of fundamental results related…

Formal Languages and Automata Theory · Computer Science 2015-11-02 Marcus V. M. Ramos , Ruy J. G. B. de Queiroz , Nelma Moreira , José Carlos Bacelar Almeida

In this paper, two sufficient and necessary conditions are given. The first one characterizes when the boundary path groupoid of a topological graph without singular vertices has closed interior of its isotropy group bundle, and the second…

Operator Algebras · Mathematics 2016-10-18 Jonathan Brown , Hui Li , Dilian Yang

For a graph class $\mathcal{F}$, let $ex_{\mathcal{F}}(n)$ denote the maximum number of edges in a graph in $\mathcal{F}$ on $n$ vertices. We show that for every proper minor-closed graph class $\mathcal{F}$ the function…

Combinatorics · Mathematics 2020-09-29 Rohan Kapadia , Sergey Norin

We prove the Categorified Wrapping Number Conjecture for large classes of annular links, including alternating annular links and tangle closures exhibiting plumbed link phenomena. We do so by characterizing when a resolution is sufficient…

Geometric Topology · Mathematics 2025-01-07 Benjamin Daniels , Melissa Zhang

First, an example of a 2-dependent group without a minimal subgroup of bounded index is given. Second, all infinite n-dependent fields are shown to be Artin-Schreier closed. Furthermore, the theory of any non separably closed PAC field has…

Logic · Mathematics 2015-10-01 Nadja Hempel

This paper is on the inverse parameterized differential Galois problem. We show that surprisingly many groups do not occur as parameterized differential Galois groups over K(x) even when K is algebraically closed. We then combine the method…

Commutative Algebra · Mathematics 2016-03-23 Annette Bachmayr

In this paper we study double cosets of finite rank free groups. We focus our attention on cancellation types in double cosets and their formal language properties.

Group Theory · Mathematics 2013-09-17 Elizaveta Frenkel , Vladimir N. Remeslennikov

We prove that for every prime $p$ algebraically clean graphs of groups are virtually residually $p$-finite and cohomologically $p$-complete. We also prove that they are cohomologically good. We apply this to certain $2$-dimensional Artin…

Group Theory · Mathematics 2023-12-27 Kasia Jankiewicz , Kevin Schreve

Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the notion of a recognizable set of graphs in terms of finite…

Logic in Computer Science · Computer Science 2007-05-23 Bruno Courcelle , Pascal Weil