output
20022013
most citedQuantum Computing

3.6k citations

Showing 2012 · math.COShow all

7 papers · 2 filters

math.CO20121 cited

A Density Hales-Jewett Theorem for matroids

Jim Geelen, Peter Nelson

We show that, if is a real number, and are integers, and is a prime power, then every simple matroid of sufficiently large rank, with no $U_{2…

math.CO2012

A non-abelian analogue of Whitney's 2-isomorphism theorem

Eric Katz

We give a non-abelian analogue of Whitney's 2-isomorphism theorem for graphs. Whitney's theorem states that the cycle space determines a graph up to 2-isomorphism. Instead of consi…

math.CO2012

Combinatorial Solutions Providing Improved Security for the Generalized Russian Cards Problem

Colleen M. Swanson, Douglas R. Stinson

We present the first formal mathematical presentation of the generalized Russian cards problem, and provide rigorous security definitions that capture both basic and extended versi…

math.CO20121 cited

Turyn-type sequences: Classification, Enumeration and Construction

D. Best, D. Z. Djokovic, H. Kharaghani +1

Turyn-type sequences, TT(n), are quadruples of {+,-1}-sequences (A;B;C;D), with lengths n,n,n,n-1 respectively, where the sum of the nonperiodic autocorrelation functions of A,B an…

math.CO20124 cited

Pretty good state transfer on double stars

Xiaoxia Fan, Chris Godsil

Let A be the adjacency matrix of a graph and suppose U(t)=exp(itA). We view A as acting on $\cx^{V(X)}$ and take the standard basis of this space to be the vectors for $u…

math.CO2012

A multivariate hook formula for labelled trees

Valentin Féray, I. P. Goulden

Several hook summation formulae for binary trees have appeared recently in the literature. In this paper we present an analogous formula for unordered increasing trees of size r, w…