Counting symmetric configurations v3

A parallel backtrack search is carried out to classify, up to isomorphism, all combinatorial (19 4 ) configurations. A total of 269 224 652 such configurations were found. We prove that two of the combinatorial (19 4 ) configurations are not geometrically realizable over any field. Also we confirmed the computation of the 971 171 combinatorial (18 4 ) configurations which lacked an independent verification.

Section: Computational Searchmentioning

confidence: 48%

The combinatorial (19_4) configurations

Osuna

Agustín

2012

“…We begin with a rational coordinatization of a (9 3 ) configuration, shown in Figure 4. This is the (9 3 ) configuration listed as (9 3 ) 2 in Figure 2.2.1 of [10], and as 9.2 in [2]. It is cyclic and self-dual, with an automorphism group of order 9.…”

Section: The Coordinatization Algorithmmentioning

confidence: 95%

“…The anti-Pappian can be obtained by a one-point extension from a geometric (9 3 ) configuration (it is (9 3 ) 3 in [10] and 9.1 in [2], a self-dual configuration with an automorphism group of order 12). When the extension algorithm is applied to find a coordinatization, it is necessary to divide polynomials.…”

Section: Real Coordinatizations -The Anti-pappianmentioning

confidence: 99%

Coordinatizing n_3 configurations

Kocay

2018

Given an n 3 configuration, a one-point extension is a technique that constructs (n + 1) 3 configurations from it. A configuration is geometric if it can be realized by a collection of points and straight lines in the plane. Given a geometric n 3 configuration with a planar coordinatization of its points and lines, a method is presented that uses a one-point extension to produce (n+1) 3 configurations from it, and then constructs geometric realizations of the (n + 1) 3 configurations. It is shown that this can be done using only a homogeneous cubic polynomial in just three variables, independent of n. This transforms a computationally intractable problem into a computationally practical one.

“…In this sense many open problems in symmetric configurations, such as, for example, open problems on self-dual, point-and line-transitive (v 3 ) configurations is, through the above mentioned correspondence, are special cases of open problems on cubic vertextransitive graphs (see [19,20,22,34,58,92,94,103]). And similarly, open problems concerning weakly flag-transitive configurations are special cases of open problems on halfarc-transitive graphs (see [16,96,93]). For further directions concerning configurations see [14,18,33,53,54,56,57,113,114].…”

Section: Problemmentioning

confidence: 99%

Recent trends and future directions in vertex-transitive graphs

Kutnar

Marušič

2008

A graph is said to be vertex-transitive if its automorphism group acts transitively on the vertex set. Some recent developments and possible future directions regarding two famous open problems, asking about existence of Hamilton paths and existence of semiregular automorphisms in vertex-transitive graphs, are discussed, together with some recent results on arc-transitive graphs and half-arc-transitive graphs, two special classes of vertex-transitive graphs that have received particular attention over the last decade.Keywords: Vertex-transitive graph, arc-transitive graph, half-arc-transitive graph, Hamilton cycle, Hamilton path, semiregular group, (im)primitive group.Math. Subj. Class.: 05C25, 20B25 1 In the beginning Vertex-transitive graphs, that is, graphs whose automorphisms groups acts transitively on the corresponding vertex sets, have been an active topic of research for a long time now. Much of this interest is due to their suitability to model scientific phenomena when symmetry is an issue. It is the aim of this article to discuss recent developments surrounding two well known open problems in vertex-transitive graphs -the Hamilton path/cycle problem and the semiregularity problem -as well as the general question addressing structural properties of arc-transitive and half-arc-transitive graphs. In doing so we will also try to contemplate possible directions this area of research is likely to take in the near future. * Supported by "Agencija za raziskovalno dejavnost Republike Slovenije", research program P1-0285.E-mail addresses: klavdija.kutnar@upr.si (Klavdija Kutnar), dragan.marusic@upr.si (Dragan Marušič) Copyright c 2008 DMFA -založništvo K. Kutnar, D. Marušič: Recent Trends and Future Directions in Vertex-Transitive Graphs 113The article is organized as follows. In Section 2 we discuss the problem, posed by the second author in 1981 (see [79]) who asked if it is true that a vertex-transitive digraph contains a nonidentity automorphism with all orbits of equal length, in short, a semiregular automorphism. Section 3 gives a quick overview of the problem, posed by Lovàsz in 1969 (see [72]), who asked if it is true that every connected vertex-transitive graph contains a Hamilton path, thus motivating a great deal of research into vertex-transitive graphs in the following decades. In Section 4, imprimitivity, one of the most fundamental concepts in the theory of permutation groups, is considered with special emphasis given to a recently developed theory which links the existence of blocks of imprimitivity in vertex-transitive graphs, having an abelian semiregular subgroup of automorphisms, to certain conditions that need to be satisfied in the corresponding quotient graph relative to the orbits of such a subgroup. Finally, in Section 5 we deal with some recent structural results on arc-transitive and half-arc-transitive graphs, as well as their link to some open problems in the theory of configurations.For group-theoretic terms not defined here we refer the reader to [124]. Semiregularit...