On the residual solvability of generalized free products of solvable groups

On the residual solvability of generalized free products of solvable groups

special issue in honor of Laci Babai's 60th birthday: Combinatorics, Groups, Algorithms, and Complexity

Bibliographic Details
Main Authors:	Delaram Kahrobaei, Stephen Majewicz
Format:	Article
Language:	English
Published:	Discrete Mathematics & Theoretical Computer Science 2011-11-01
Series:	Discrete Mathematics & Theoretical Computer Science
Subjects:	[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]
Online Access:	https://dmtcs.episciences.org/540/pdf

Similar Items

The extended equivalence and equation solvability problems for groups
by: Gabor Horvath, et al.
Published: (2011-11-01)

Some results on stable sets for k-colorable P₆-free graphs and generalizations
by: Raffaele Mosca
Published: (2012-08-01)

On quadratic residue codes and hyperelliptic curves
by: David Joyner
Published: (2008-01-01)

Extremal K_(s,t)-free bipartite graphs
by: Camino Balbuena, et al.
Published: (2008-01-01)

The Magnus-Derek game in groups
by: Dániel Gerbner
Published: (2013-11-01)

Independent sets in (P₆, diamond)-free graphs
by: Raffaele Mosca
Published: (2009-01-01)

Latin square Thue-Morse sequences are overlap-free
by: C. Robinson Tompkins
Published: (2007-01-01)

Computing tensor decompositions of finite matrix groups
by: Nurullah Ankaralioglu, et al.
Published: (2011-11-01)

On the critical exponent of generalized Thue-Morse words
by: Alexandre B. Massé, et al.
Published: (2007-01-01)

Multidimensional cellular automata and generalization of Fekete's lemma
by: Silvio Capobianco
Published: (2008-01-01)

Krausz dimension and its generalizations in special graph classes
by: Olga Glebova, et al.
Published: (2013-03-01)

String pattern avoidance in generalized non-crossing trees
by: Yidong Sun, et al.
Published: (2009-01-01)

"Trivializing'' generalizations of some Izergin-Korepin-type determinants
by: Tewodros Amdeberhan, et al.
Published: (2007-01-01)

Addition and multiplication of beta-expansions in generalized Tribonacci base
by: Petr Ambrož, et al.
Published: (2007-01-01)

The competition number of a generalized line graph is at most two
by: Boram Park, et al.
Published: (2012-08-01)

Combinatorics, Groups, Algorithms, and Complexity: Conference in honor of Laci Babai's 60th birthday
by: Akos Seress, et al.
Published: (2010-03-01)

Controllability of affine right-invariant systems on solvable Lie groups
by: Yuri L. Sachkov
Published: (1997-01-01)

Colouring the Square of the Cartesian Product of Trees
by: David R. Wood
Published: (2011-08-01)

On the number of factors in codings of three interval exchange
by: Petr Ambrož, et al.
Published: (2011-11-01)

Separating the k-party communication complexity hierarchy: an application of the Zarankiewicz problem
by: Thomas P. Hayes
Published: (2011-11-01)

On the complexity of vertex-coloring edge-weightings
by: Andrzej Dudek, et al.
Published: (2011-11-01)

On the minimal distance of a polynomial code
by: Peter Pal Pach, et al.
Published: (2011-11-01)

Clustered Spanning Tree - Conditions for Feasibility
by: Nili Guttmann-Beck, et al.
Published: (2019-08-01)

Detection number of bipartite graphs and cubic graphs
by: Frederic Havet, et al.
Published: (2014-12-01)

Strong parity vertex coloring of plane graphs
by: Tomas Kaiser, et al.
Published: (2014-03-01)

The Cerný conjecture for automata respecting intervals of a directed graph
by: Mariusz Grech, et al.
Published: (2013-11-01)

A variant of Niessen’s problem on degreesequences of graphs
by: Jiyun Guo, et al.
Published: (2014-05-01)

Clique cycle transversals in graphs with few P₄'s
by: Raquel Bravo, et al.
Published: (2013-09-01)

A new characterization and a recognition algorithm of Lucas cubes
by: Andrej Taranenko
Published: (2013-10-01)

The resolving number of a graph Delia
by: Delia Garijo, et al.
Published: (2013-12-01)

Strong parity vertex coloring of plane graphs
by: Tomas Kaiser, et al.
Published: (2014-01-01)

On the complexity of distributed BFS in ad hoc networks with non-spontaneous wake-ups
by: Dariusz Kowalski, et al.
Published: (2013-11-01)

1-local 33/24-competitive Algorithm for Multicoloring Hexagonal Graphs
by: Rafal Witkowski, et al.
Published: (2013-11-01)

Two player game variant of the Erd\H os-Szekeres problem
by: Parikshit Kolipaka, et al.
Published: (2013-11-01)

Surjective cellular automata far from the Garden of Eden
by: Silvio Capobianco, et al.
Published: (2013-10-01)

Computing the number of h-edge spanning forests in complete bipartite graphs
by: Rebecca Stones
Published: (2014-05-01)

On the connectedness and diameter of a geometric Johnson graph
by: Crevel Bautista-Santiago, et al.
Published: (2013-09-01)

Robot's hand and expansions in non-integer bases
by: Paola Loreti, et al.
Published: (2014-06-01)

The b-chromatic number of powers of cycles
by: Anja Kohl
Published: (2013-03-01)

Note on the weighted internal path length of b-ary trees
by: Ludger Rüschendorf, et al.
Published: (2007-01-01)