Ákos Seress
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Ákos Seress has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- Cheryl E. Praeger
The University of Western Australia
5 shared publications - Alice C. Niemeyer
RWTH Aachen University Germany
4 shared publications - Cai Heng Li
School of Mathematics and Statistics, Yunnan University, Kunming, Yunnan 650091, PR China
2 shared publications - Charles R. Leedham-Green
School of Mathematical Sciences, Queen Mary and Westfield College, London E1 4NS, United Kingdom
2 shared publications - Eric Swartz
Department of Mathematics William & Mary Williamsburg VA USA
2 shared publications - Harald Andrés Helfgott
Département de mathématiques et applications, École normale supérieure, 45 rue d’Ulm, F-75230 Paris, France
2 shared publications
Latest Publications
- 3 February 2015
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 367 (8) , 5633-5651
On Pyber’s base size conjecture
Let be a permutation group on a finite set . A subset of is a base for if its pointwise stabilizer in is trivial. The base size of , denoted , is the smallest size of a base. A well-known conjecture of Pyber from the early 1990s asserts that there exists an absolute constant such that <!-- MATH $b(G) \leqslant c\log |G|/\log n$ --> for any primitive permutation group of degree . Several special cases have been verified in recent years, including the almost simple and diagonal cases. In this paper, we prove Pyber's conjecture for all non-affine primitive groups.- 3 February 2015
- Published by American Mathematical Society (AMS) in Transactions of the American Mathematical Society
- Vol. 367 (8) , 5633-5651
On Pyber’s base size conjecture
Let be a permutation group on a finite set . A subset of is a base for if its pointwise stabilizer in is trivial. The base size of , denoted , is the smallest size of a base. A well-known conjecture of Pyber from the early 1990s asserts that there exists an absolute constant such that <!-- MATH $b(G) \leqslant c\log |G|/\log n$ --> for any primitive permutation group of degree . Several special cases have been verified in recent years, including the almost simple and diagonal cases. In this paper, we prove Pyber's conjecture for all non-affine primitive groups.- 20 April 2014
- Published by Springer Nature in Annals of Combinatorics
- Vol. 18 (2) , 313-325
Local 2-Geodesic Transitivity of Graphs
- 20 April 2014
- Published by Springer Nature in Annals of Combinatorics
- Vol. 18 (2) , 313-325
Local 2-Geodesic Transitivity of Graphs
- Open Access
Random generators of the symmetric group: diameter, mixing time and spectral gap
Let $g$, $h$ be a random pair of generators of $G=Sym(n)$ or $G=Alt(n)$. We show that, with probability tending to $1$ as $n\to \infty$, (a) the diameter of $G$ with respect to $S = \{g,h,g^{-1},h^{-1}\}$ is at most $O(n^2 (\log n)^c)$, and (b) the mixing time of $G$ with respect to $S$ is at most $O(n^3 (\log n)^c)$. (Both $c$ and the implied constants are absolute.) These bounds are far lower than the strongest worst-case bounds known (in Helfgott--Seress, 2013); they roughly match the worst known examples. We also give an improved, though still non-constant, bound on the spectral gap. Our results rest on a combination of the algorithm in (Babai--Beals--Seress, 2004) and the fact that the action of a pair of random permutations is almost certain to act as an expander on $\ell$-tuples, where $\ell$ is an arbitrary constant (Friedman et al., 1998).Open AccessRandom generators of the symmetric group: diameter, mixing time and spectral gap
Let $g$, $h$ be a random pair of generators of $G=Sym(n)$ or $G=Alt(n)$. We show that, with probability tending to $1$ as $n\to \infty$, (a) the diameter of $G$ with respect to $S = \{g,h,g^{-1},h^{-1}\}$ is at most $O(n^2 (\log n)^c)$, and (b) the mixing time of $G$ with respect to $S$ is at most $O(n^3 (\log n)^c)$. (Both $c$ and the implied constants are absolute.) These bounds are far lower than the strongest worst-case bounds known (in Helfgott--Seress, 2013); they roughly match the worst known examples. We also give an improved, though still non-constant, bound on the spectral gap. Our results rest on a combination of the algorithm in (Babai--Beals--Seress, 2004) and the fact that the action of a pair of random permutations is almost certain to act as an expander on $\ell$-tuples, where $\ell$ is an arbitrary constant (Friedman et al., 1998). - Open Access
On Pyber's base size conjecture
Let $G$ be a permutation group on a finite set $\Omega$. A subset $B \subseteq \Omega$ is a base for $G$ if the pointwise stabilizer of $B$ in $G$ is trivial. The base size of $G$, denoted $b(G)$, is the smallest size of a base. A well known conjecture of Pyber from the early 1990s asserts that there exists an absolute constant $c$ such that $b(G) \le c\log |G| / \log n$ for any primitive permutation group $G$ of degree $n$. Some special cases have been verified in recent years, including the almost simple and diagonal cases. In this paper, we prove Pyber's conjecture for all non-affine primitive groups.Open AccessOn Pyber's base size conjecture
Let $G$ be a permutation group on a finite set $\Omega$. A subset $B \subseteq \Omega$ is a base for $G$ if the pointwise stabilizer of $B$ in $G$ is trivial. The base size of $G$, denoted $b(G)$, is the smallest size of a base. A well known conjecture of Pyber from the early 1990s asserts that there exists an absolute constant $c$ such that $b(G) \le c\log |G| / \log n$ for any primitive permutation group $G$ of degree $n$. Some special cases have been verified in recent years, including the almost simple and diagonal cases. In this paper, we prove Pyber's conjecture for all non-affine primitive groups. - 3 October 2013
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 40 (1) , 1-22
Bounds on the diameter of Cayley graphs of the symmetric group
- 3 October 2013
- Published by Springer Nature in Journal of Algebraic Combinatorics
- Vol. 40 (1) , 1-22
Bounds on the diameter of Cayley graphs of the symmetric group
- Open Access
Characterising star-transitive and st(edge)-transitive graphs
Recent work of Lazarovich provides necessary and sufficient conditions on a graph L for there to exist a unique simply-connected (k,L)-complex. The two conditions are symmetry properties of the graph, namely star-transitivity and st(edge)-transitivity. In this paper we investigate star-transitive and st(edge)-transitive graphs by studying the structure of the vertex and edge stabilisers of such graphs. We also provide new examples of graphs that are both star-transitive and st(edge)-transitive.
Open AccessCharacterising star-transitive and st(edge)-transitive graphs
Recent work of Lazarovich provides necessary and sufficient conditions on a graph L for there to exist a unique simply-connected (k,L)-complex. The two conditions are symmetry properties of the graph, namely star-transitivity and st(edge)-transitivity. In this paper we investigate star-transitive and st(edge)-transitive graphs by studying the structure of the vertex and edge stabilisers of such graphs. We also provide new examples of graphs that are both star-transitive and st(edge)-transitive.
- 26 November 2012
- Published by Springer Nature
- Vol. 2070, 35-82
Estimation Problems and Randomised Group Algorithms
- 26 November 2012
- Published by Springer Nature
- Vol. 2070, 35-82
Estimation Problems and Randomised Group Algorithms
- 5 October 2012
- Published by Springer Nature in Annals of Combinatorics
- Vol. 16 (4) , 891-903
A Family of Near-Polygonal Graphs of Valency 10
- 5 October 2012
- Published by Springer Nature in Annals of Combinatorics
- Vol. 16 (4) , 891-903
A Family of Near-Polygonal Graphs of Valency 10
- 17 August 2012
- Published by Wiley in Journal of Graph Theory
- Vol. 74 (1) , 104-114
Disconnected Colors in Generalized Gallai-Colorings
- 17 August 2012
- Published by Wiley in Journal of Graph Theory
- Vol. 74 (1) , 104-114
Disconnected Colors in Generalized Gallai-Colorings
- Open Access
Bounds on the diameter of Cayley graphs of the symmetric group
In this paper we are concerned with the conjecture that, for any set of generators S of the symmetric group of degree n, the word length in terms of S of every permutation is bounded above by a polynomial of n. We prove this conjecture for sets of generators containing a permutation fixing at least 37% of the points.
Open AccessBounds on the diameter of Cayley graphs of the symmetric group
In this paper we are concerned with the conjecture that, for any set of generators S of the symmetric group of degree n, the word length in terms of S of every permutation is bounded above by a polynomial of n. We prove this conjecture for sets of generators containing a permutation fixing at least 37% of the points.