scholarly journals On the residual solvability of generalized free products of solvable groups

2011 ◽  
Vol Vol. 13 no. 4 ◽  
Author(s):  
Delaram Kahrobaei ◽  
Stephen Majewicz
Keyword(s):  
Free Product ◽  
Solvable Groups ◽  
60Th Birthday ◽  
Special Issue ◽  
Free Products ◽  
Generalized Free Product ◽  
Algorithms And Complexity ◽  
International Audience ◽  
Generalized Free Products

special issue in honor of Laci Babai's 60th birthday: Combinatorics, Groups, Algorithms, and Complexity International audience In this paper, we study the residual solvability of the generalized free product of solvable groups.

scholarly journals On the Root-Class Residuallity of Generalized Free Products

2015 ◽  
Vol 20 (1) ◽  
pp. 133-137 ◽  
Author(s):  
E. A. Tumanova
Keyword(s):  
Free Product ◽  
Sufficient Condition ◽  
Free Products ◽  
Generalized Free Product ◽  
Amalgamated Subgroup ◽  
Root Class ◽  
Generalized Free Products

Let K be a root class of groups. It is proved that a free product of any family of residually K groups with one amalgamated subgroup, which is a retract in all free factors, is residually K. The sufficient condition for a generalized free product of two groups to be residually K is also obtained, provided that the amalgamated subgroup is normal in one of the free factors and is a retract in another.

scholarly journals On the minimal distance of a polynomial code

2011 ◽  
Vol Vol. 13 no. 4 ◽  
Author(s):  
Peter Pal Pach ◽  
Csaba Szabo
Keyword(s):  
Finite Subset ◽  
60Th Birthday ◽  
Theoretical Problem ◽  
Minimal Distance ◽  
Distribution Of Primes ◽  
Special Issue ◽  
Theoretical Methods ◽  
Algorithms And Complexity ◽  
International Audience ◽  
Special Case

special issue in honor of Laci Babai's 60th birthday: Combinatorics, Groups, Algorithms, and Complexity International audience For a polynomial f(x) is an element of Z(2)[x] it is natural to consider the near-ring code generated by the polynomials f circle x, f circle x(2) ,..., f circle x(k) as a vectorspace. It is a 19 year old conjecture of Gunter Pilz that for the polynomial f (x) - x(n) broken vertical bar x(n-1) broken vertical bar ... broken vertical bar x the minimal distance of this code is n. The conjecture is equivalent to the following purely number theoretical problem. Let (m) under bar = \1, 2 ,..., m\ and A subset of N be an arbitrary finite subset of N. Show that the number of products that occur odd many times in (n) under bar. A is at least n. Pilz also formulated the conjecture for the special case when A = (k) under bar. We show that for A = (k) under bar the conjecture holds and that the minimal distance of the code is at least n/(log n)(0.223). While proving the case A = (k) under bar we use different number theoretical methods depending on the size of k (respect to n). Furthermore, we apply several estimates on the distribution of primes.

scholarly journals The extended equivalence and equation solvability problems for groups

2011 ◽  
Vol Vol. 13 no. 4 ◽  
Author(s):  
Gabor Horvath ◽  
Csaba Szabo
Keyword(s):  
Polynomial Time ◽  
Equivalence Problem ◽  
Nilpotent Groups ◽  
60Th Birthday ◽  
Special Issue ◽  
Algorithms And Complexity ◽  
International Audience ◽  
Solvability Problem ◽  
Np Complete ◽  
Equation Solvability

special issue in honor of Laci Babai's 60th birthday: Combinatorics, Groups, Algorithms, and Complexity International audience We prove that the extended equivalence problem is solvable in polynomial time for finite nilpotent groups, and coNP-complete, otherwise. We prove that the extended equation solvability problem is solvable in polynomial time for finite nilpotent groups, and NP-complete, otherwise.

scholarly journals Separating the k-party communication complexity hierarchy: an application of the Zarankiewicz problem

2011 ◽  
Vol Vol. 13 no. 4 ◽  
Author(s):  
Thomas P. Hayes
Keyword(s):  
Positive Integer ◽  
Open Problem ◽  
Communication Complexity ◽  
60Th Birthday ◽  
Equal Size ◽  
Special Issue ◽  
Algorithms And Complexity ◽  
International Audience ◽  
Zarankiewicz Problem ◽  
Complexity Hierarchy

special issue in honor of Laci Babai's 60th birthday: Combinatorics, Groups, Algorithms, and Complexity International audience For every positive integer k, we construct an explicit family of functions f : \0, 1\(n) -\textgreater \0, 1\ which has (k + 1) - party communication complexity O(k) under every partition of the input bits into k + 1 parts of equal size, and k-party communication complexity Omega (n/k(4)2(k)) under every partition of the input bits into k parts. This improves an earlier hierarchy theorem due to V. Grolmusz. Our construction relies on known explicit constructions for a famous open problem of K. Zarankiewicz, namely, to find the maximum number of edges in a graph on n vertices that does not contain K-s,K-t as a subgraph.

scholarly journals Near Frattini subgroups of residually finite generalized free products of groups

2001 ◽  
Vol 26 (2) ◽  
pp. 117-121
Author(s):  
Mohammad K. Azarian
Keyword(s):  
Free Product ◽  
Finite Index ◽  
Frattini Subgroup ◽  
Free Products ◽  
Residually Finite ◽  
Identical Relation ◽  
Products Of Groups ◽  
Generalized Free Product ◽  
Amalgamated Subgroup ◽  
Generalized Free Products

LetG=A★HBbe the generalized free product of the groupsAandBwith the amalgamated subgroupH. Also, letλ(G)andψ(G)represent the lower near Frattini subgroup and the near Frattini subgroup ofG, respectively. IfGis finitely generated and residually finite, then we show thatψ(G)≤H, providedHsatisfies a nontrivial identical relation. Also, we prove that ifGis residually finite, thenλ(G)≤H, provided: (i)Hsatisfies a nontrivial identical relation andA,Bpossess proper subgroupsA1,B1of finite index containingH; (ii) neitherAnorBlies in the variety generated byH; (iii)H<A1≤AandH<B1≤B, whereA1andB1each satisfies a nontrivial identical relation; (iv)His nilpotent.

scholarly journals On the metric dimension of Grassmann graphs

2012 ◽  
Vol Vol. 13 no. 4 ◽  
Author(s):  
Robert F. Bailey ◽  
Karen Meagher
Keyword(s):  
Upper Bound ◽  
60Th Birthday ◽  
Metric Dimension ◽  
Special Issue ◽  
Resolving Set ◽  
Grassmann Graph ◽  
Algorithms And Complexity ◽  
International Audience

special issue in honor of Laci Babai's 60th birthday: Combinatorics, Groups, Algorithms, and Complexity International audience The metric dimension of a graph Gamma is the least number of vertices in a set with the property that the list of distances from any vertex to those in the set uniquely identifies that vertex. We consider the Grassmann graph G(q)(n, k) (whose vertices are the k-subspaces of F-q(n), and are adjacent if they intersect in a (k 1)-subspace) for k \textgreater= 2. We find an upper bound on its metric dimension, which is equal to the number of 1-dimensional subspaces of F-q(n). We also give a construction of a resolving set of this size in the case where k + 1 divides n, and a related construction in other cases.

On the Frattini Subgroups of Generalized Free Products with Cyclic Amalgamations(1)

1972 ◽  
Vol 15 (4) ◽  
pp. 569-573 ◽  
Author(s):  
C. Y. Tang
Keyword(s):  
Free Product ◽  
Free Groups ◽  
Maximal Subgroups ◽  
Finitely Generated ◽  
Frattini Subgroup ◽  
Free Products ◽  
Generalized Free Product ◽  
Special Cases ◽  
Amalgamated Subgroup ◽  
Generalized Free Products

In [1] Higman and Neumann asked the questions whether the Frattini subgroup of a generalized free product can be larger than the amalgamated subgroup and whether such groups necessarily have maximal subgroups. In [4] Whittemore gave answers to the special cases of generalized free products of finitely many free groups with cyclic amalgamation and of generalized free products of finitely many finitely generated abelian groups. In this paper we shall study the Frattini subgroups of generalized free products of any groups with cyclic amalgamation.

scholarly journals Computing tensor decompositions of finite matrix groups

2011 ◽  
Vol Vol. 13 no. 4 ◽  
Author(s):  
Nurullah Ankaralioglu ◽  
Akos Seress
Keyword(s):  
Tensor Decomposition ◽  
60Th Birthday ◽  
Special Issue ◽  
Matrix Groups ◽  
Tensor Decompositions ◽  
Products Of Groups ◽  
Finite Matrix ◽  
Algorithms And Complexity ◽  
International Audience ◽  
Central Products

special issue in honor of Laci Babai's 60th birthday: Combinatorics, Groups, Algorithms, and Complexity International audience We describe an algorithm to compute tensor decompositions of central products of groups. The novelty over previous algorithms is that in the case of matrix groups that are both tensor decomposable and imprimitive, the new algorithm more often outputs the more desirable tensor decomposition.

Cyclic Subgroup Separability of Generalized Free Products

1993 ◽  
Vol 36 (3) ◽  
pp. 296-302 ◽  
Author(s):  
Goansu Kim
Keyword(s):  
Free Product ◽  
Cyclic Subgroup ◽  
Free Products ◽  
Cyclic Subgroups ◽  
Products Of Groups ◽  
Generalized Free Product ◽  
Subgroup Separability ◽  
Free Product Of Groups ◽  
Generalized Free Products ◽  
Product Of Groups

AbstractWe derive a criterion for a generalized free product of groups to be cyclic subgroup separable. We see that most of the known results for cyclic subgroup separability are covered by this criterion, and we apply the criterion to polygonal products of groups. We show that a polygonal product of finitely generated abelian groups, amalgamating cyclic subgroups, is cyclic subgroup separable.

scholarly journals On the sensitivity of cyclically-invariant Boolean functions

2011 ◽  
Vol Vol. 13 no. 4 ◽  
Author(s):  
Sourav Chakraborty
Keyword(s):  
Boolean Function ◽  
Boolean Functions ◽  
Transitive Group ◽  
60Th Birthday ◽  
Special Issue ◽  
Natural Class ◽  
Algorithms And Complexity ◽  
International Audience ◽  
Class Of Functions ◽  
Block Sensitivity

special issue in honor of Laci Babai's 60th birthday: Combinatorics, Groups, Algorithms, and Complexity International audience In this paper we construct a cyclically invariant Boolean function whose sensitivity is Theta(n(1/3)). This result answers two previously published questions. Turan (1984) asked if any Boolean function, invariant under some transitive group of permutations, has sensitivity Omega(root n). Kenyon and Kutin (2004) asked whether for a "nice" function the product of 0-sensitivity and 1-sensitivity is Omega(n). Our function answers both questions in the negative. We also prove that for minterm-transitive functions (a natural class of Boolean functions including our example) the sensitivity is Omega(n(1/3)). Hence for this class of functions sensitivity and block sensitivity are polynomially related.

Sign in / Sign up

Export Citation Format

Share Document