4 citations · 5 across the 6 of their papers we have counts for
6 papers
Enumeration of Row-Column Designs
Gerold Jäger, Klas Markström, Lars-Daniel Öhman +1
We computationally completely enumerate a number of types of row-column designs up to isotopism, including double, sesqui and triple arrays as known from the literature, and two ne…
Condorcet Domains of Degree at most Seven
Dolica Akello-Egwell, Charles Leedham-Green, Alastair Litterick +2
In this paper we give the first explicit enumeration of all maximal Condorcet domains on alternatives. This has been accomplished by developing a new algorithm for constr…
Avoiding and extending partial edge colorings of hypercubes
Carl Johan Casselgren, Per Johansson, Klas Markström
We consider the problem of extending and avoiding partial edge colorings of hypercubes; that is, given a partial edge coloring of the -dimensional hypercube , we are in…
Discriminating Non-Isomorphic Graphs with an Experimental Quantum Annealer
Zoe Gonzalez Izquierdo, Ruilin Zhou, Klas Markström +1
We demonstrate experimentally the ability of a quantum annealer to distinguish between sets of non-isomorphic graphs that share the same classical Ising spectrum. Utilizing the pau…
Existence thresholds and Ramsey properties of random posets
Victor Falgas-Ravry, Klas Markström, Andrew Treglown +1
Let denote the power set of , ordered by inclusion, and let denote the random poset obtained from by retaining each element…
The 1-vertex transfer matrix and accurate estimation of channel capacity
Shmuel Friedland, Per Hakan Lundow, Klas Markstrom
The notion of a 1-vertex transfer matrix for multi-dimensional codes is introduced. It is shown that the capacity of such codes, or the topological entropy, can be expressed as the…