#### Filter Results:

- Full text PDF available (42)

#### Publication Year

1983

2014

- This year (0)
- Last 5 years (10)
- Last 10 years (24)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Paul Erdös, Zoltán Füredi, András Hajnal, Péter Komjáth, Vojtech Rödl, Ákos Seress
- Discrete Mathematics
- 1986

Let G be a graph, m > r ,1 integers. Suppose that it has a good-coloring with m colors which uses at most r colors in the neighborhood of every vertex. We investigate these so-called local r-colorings. One of our results (Theorem 2 .4) states : The chromatic number of G, Chr(G)-r2' 1092109 2 m (and this value is the best possible in a certain sense). We… (More)

- László Babai, Eugene M. Luks, Ákos Seress
- FOCS
- 1988

We present new algorithms for permutation group manipulation. Our methods result in an improvement of nearly an order of magnitude in the worst-case analysis for the fundamental problems of finding strong generating sets and testing membership. The normal structure of the group is brought into play even for such elementary issues. An essential element is… (More)

- AKOS SERESS
- 1999

If a black box simple group is known to be isomorphic to a classical group over a field of known characteristic, a Las Vegas algorithm is used to produce an explicit isomorphism. This is used to upgrade all nearly linear time Monte Carlo permutation group algorithms to Las Vegas algorithms when the input group has no composition factor isomorphic to an… (More)

- László Babai, Eugene M. Luks, Ákos Seress
- SIAM J. Comput.
- 1997

We introduce new Monte Carlo methods to speed up and greatly simplify the manipulation of permutation groups. The methods are of a combinatorial character and use elementary group theory only. We achieve a nearly optimal 0(n3 loge n) running time for membership testing, an improvement of two orders of magnitude compared to known elementary algorithms and… (More)

The diameter of a group G with respect to a set S of generators is the maximum over g E G of the length of the shortest word in S U S-' representing g. This concept arises in the contexts of efficient communication networks and Rubik's cube type puzzles. " Best " generators (giving minimum diameter while keeping the number of generators limited) are… (More)

- László Babai, Ákos Seress
- J. Comb. Theory, Ser. A
- 1988

Copyright and Moral Rights for the articles on this site are retained by the individual authors and/or other copyright owners. For more information on Open Research Online's data policy on reuse of materials please consult the policies page. Abstract. In this paper we are concerned with the conjecture that, for any set of generators S of the symmetric group… (More)

- Zoltán Füredi, Felix Lazebnik, Ákos Seress, Vasiliy A. Ustimenko, Andrew J. Woldar
- J. Comb. Theory, Ser. B
- 1995

We say that a bipartite graph Γ(V 1 ∪ V 2 , E) has bi-degree r, s if every vertex from V 1 has degree r and every vertex from V 2 has degree s. Γ is called an (r, s, t)–graph if, additionally, the girth of Γ is 2t. For t > 3, very few examples of (r, s, t)–graphs were previously known. In this paper we give a recursive construction of (r, s, t)–graphs for… (More)

Let w be a non-trivial word in two variables. We prove that the probability that two randomly chosen elements x, y of a nonabelian finite simple group S satisfy w(x, y) = 1 tends to 0 as |S| → ∞. As a consequence, we obtain a new short proof of a well-known conjecture of Magnus concerning free groups, as well as some applications to profinite groups.

Given a black-box group G isomorphic to some finite simple group of Lie type and the characteristic of G, we compute the standard name of G by a Monte Carlo algorithm. The running time is polynomial in the input length and in the time requirement for the group operations in G. The algorithm chooses a relatively small number of (nearly) uniformly distributed… (More)