131 research outputs found

    Constructions of complex Hadamard matrices via tiling Abelian groups

    Get PDF
    Applications in quantum information theory and quantum tomography have raised current interest in complex Hadamard matrices. In this note we investigate the connection between tiling Abelian groups and constructions of complex Hadamard matrices. First, we recover a recent very general construction of complex Hadamard matrices due to Dita via a natural tiling construction. Then we find some necessary conditions for any given complex Hadamard matrix to be equivalent to a Dita-type matrix. Finally, using another tiling construction, due to Szabo, we arrive at new parametric families of complex Hadamard matrices of order 8, 12 and 16, and we use our necessary conditions to prove that these families do not arise with Dita's construction. These new families complement the recent catalogue of complex Hadamard matrices of small order.Comment: 15 page

    On the uniform distribution in residue classes of dense sets of integers with distinct sums

    Get PDF
    A set A⊆{ 1,...,N }{\cal A} \subseteq \Set{1,...,N} is of type B2B_2 if all sums a+ba+b, with a≄ba\ge b, a,b∈Aa,b\in {\cal A}, are distinct. It is well known that the largest such set is of size asymptotic to N1/2N^{1/2}. For a B2B_2 set A{\cal A} of this size we show that, under mild assumptions on the size of the modulus mm and on the difference N^{1/2}-\Abs{{\cal A}} (these quantities should not be too large) the elements of A{\cal A} are uniformly distributed in the residue classes mod mm. Quantitative estimates on how uniform the distribution is are also provided. This generalizes recent results of Lindstr\"om whose approach was combinatorial. Our main tool is an upper bound on the minimum of a cosine sum of kk terms, ∑1kcos⁥λjx\sum_1^k \cos{\lambda_j x}, all of whose positive integer frequencies λj\lambda_j are at most (2−ϔ)k(2-\epsilon)k in size.Comment: 5 pages, no figure

    Filling a box with translates of two bricks

    Full text link
    We give a new proof of the following interesting fact recently proved by Bower and Michael: if a d-dimensional rectangular box can be tiled using translates of two types of rectangular bricks, then it can also be tiled in the following way. We can cut the box across one of its sides into two boxes, one of which can be tiled with the first brick only and the other one with the second brick. Our proof relies on the Fourier Transform. We also show that no such result is true for three, or more, types of bricks
    • 

    corecore