33 research outputs found
Algorithms for classification of combinatorial objects
A recurrently occurring problem in combinatorics is the need to completely characterize a finite set of finite objects implicitly defined by a set of constraints. For example, one could ask for a list of all possible ways to schedule a football tournament for twelve teams: every team is to play against every other team during an eleven-round tournament, such that every team plays exactly one game in every round. Such a characterization is called a classification for the objects of interest. Classification is typically conducted up to a notion of structural equivalence (isomorphism) between the objects. For example, one can view two tournament schedules as having the same structure if one can be obtained from the other by renaming the teams and reordering the rounds.
This thesis examines algorithms for classification of combinatorial objects up to isomorphism. The thesis consists of five articles â each devoted to a specific family of objects â together with a summary surveying related research and emphasizing the underlying common concepts and techniques, such as backtrack search, isomorphism (viewed through group actions), symmetry, isomorph rejection, and computing isomorphism. From an algorithmic viewpoint the focus of the thesis is practical, with interest on algorithms that perform well in practice and yield new classification results; theoretical properties such as the asymptotic resource usage of the algorithms are not considered.
The main result of this thesis is a classification of the Steiner triple systems of order 19. The other results obtained include the nonexistence of a resolvable 2-(15, 5, 4) design, a classification of the one-factorizations of k-regular graphs of order 12 for k â¤Â 6 and k = 10, 11, a classification of the near-resolutions of 2-(13, 4, 3) designs together with the associated thirteen-player whist tournaments, and a classification of the Steiner triple systems of order 21 with a nontrivial automorphism group.reviewe
Groups, graphs, and hypergraphs: average sizes of kernels of generic matrices with support constraints
We develop a theory of average sizes of kernels of generic matrices with
support constraints defined in terms of graphs and hypergraphs. We apply this
theory to study unipotent groups associated with graphs. In particular, we
establish strong uniformity results pertaining to zeta functions enumerating
conjugacy classes of these groups. We deduce that the numbers of conjugacy
classes of -points of the groups under consideration depend
polynomially on . Our approach combines group theory, graph theory, toric
geometry, and -adic integration.
Our uniformity results are in line with a conjecture of Higman on the numbers
of conjugacy classes of unitriangular matrix groups. Our findings are, however,
in stark contrast to related results by Belkale and Brosnan on the numbers of
generic symmetric matrices of given rank associated with graphs.Comment: 109 page
Quantum Theory from Principles, Quantum Software from Diagrams
This thesis consists of two parts. The first part is about how quantum theory
can be recovered from first principles, while the second part is about the
application of diagrammatic reasoning, specifically the ZX-calculus, to
practical problems in quantum computing. The main results of the first part
include a reconstruction of quantum theory from principles related to
properties of sequential measurement and a reconstruction based on properties
of pure maps and the mathematics of effectus theory. It also includes a
detailed study of JBW-algebras, a type of infinite-dimensional Jordan algebra
motivated by von Neumann algebras. In the second part we find a new model for
measurement-based quantum computing, study how measurement patterns in the
one-way model can be simplified and find a new algorithm for extracting a
unitary circuit from such patterns. We use these results to develop a circuit
optimisation strategy that leads to a new normal form for Clifford circuits and
reductions in the T-count of Clifford+T circuits.Comment: PhD Thesis. Part A is 135 pages. Part B is 95 page
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science (STACS'09)
The Symposium on Theoretical Aspects of Computer Science (STACS) is held alternately in France and in Germany. The conference of February 26-28, 2009, held in Freiburg, is the 26th in this series. Previous meetings took place in Paris (1984), Saarbr¨ucken (1985), Orsay (1986), Passau (1987), Bordeaux (1988), Paderborn (1989), Rouen (1990), Hamburg (1991), Cachan (1992), W¨urzburg (1993), Caen (1994), M¨unchen (1995), Grenoble (1996), L¨ubeck (1997), Paris (1998), Trier (1999), Lille (2000), Dresden (2001), Antibes (2002), Berlin (2003), Montpellier (2004), Stuttgart (2005), Marseille (2006), Aachen (2007), and Bordeaux (2008). ..