3,257 research outputs found

    Levels of Distribution and the Affine Sieve

    Full text link
    This article is an expanded version of the author's lecture in the Basic Notions Seminar at Harvard, September 2013. Our goal is a brief and introductory exposition of aspects of two topics in sieve theory which have received attention recently: (1) the spectacular work of Yitang Zhang, under the title "Level of Distribution," and (2) the so-called "Affine Sieve," introduced by Bourgain-Gamburd-Sarnak.Comment: 34 pages, 2 figure

    Synchronizing Automata on Quasi Eulerian Digraph

    Full text link
    In 1964 \v{C}ern\'{y} conjectured that each nn-state synchronizing automaton posesses a reset word of length at most (n1)2(n-1)^2. From the other side the best known upper bound on the reset length (minimum length of reset words) is cubic in nn. Thus the main problem here is to prove quadratic (in nn) upper bounds. Since 1964, this problem has been solved for few special classes of \sa. One of this result is due to Kari \cite{Ka03} for automata with Eulerian digraphs. In this paper we introduce a new approach to prove quadratic upper bounds and explain it in terms of Markov chains and Perron-Frobenius theories. Using this approach we obtain a quadratic upper bound for a generalization of Eulerian automata.Comment: 8 pages, 1 figur

    Averages of Fourier coefficients of Siegel modular forms and representation of binary quadratic forms by quadratic forms in four variables

    Full text link
    Let d-d be a a negative discriminant and let TT vary over a set of representatives of the integral equivalence classes of integral binary quadratic forms of discriminant d-d. We prove an asymptotic formula for dd \to \infty for the average over TT of the number of representations of TT by an integral positive definite quaternary quadratic form and obtain results on averages of Fourier coefficients of linear combinations of Siegel theta series. We also find an asymptotic bound from below on the number of binary forms of fixed discriminant d-d which are represented by a given quaternary form. In particular, we can show that for growing dd a positive proportion of the binary quadratic forms of discriminant d-d is represented by the given quaternary quadratic form.Comment: v5: Some typos correcte

    A Survey of Finite Algebraic Geometrical Structures Underlying Mutually Unbiased Quantum Measurements

    Full text link
    The basic methods of constructing the sets of mutually unbiased bases in the Hilbert space of an arbitrary finite dimension are discussed and an emerging link between them is outlined. It is shown that these methods employ a wide range of important mathematical concepts like, e.g., Fourier transforms, Galois fields and rings, finite and related projective geometries, and entanglement, to mention a few. Some applications of the theory to quantum information tasks are also mentioned.Comment: 20 pages, 1 figure to appear in Foundations of Physics, Nov. 2006 two more references adde

    On random primitive sets, directable NDFAs and the generation of slowly synchronizing DFAs

    Full text link
    We tackle the problem of the randomized generation of slowly synchronizing deterministic automata (DFAs) by generating random primitive sets of matrices. We show that when the randomized procedure is too simple the exponent of the generated sets is O(n log n) with high probability, thus the procedure fails to return DFAs with large reset threshold. We extend this result to random nondeterministic automata (NDFAs) by showing, in particular, that a uniformly sampled NDFA has both a 2-directing word and a 3-directing word of length O(n log n) with high probability. We then present a more involved randomized algorithm that manages to generate DFAs with large reset threshold and we finally leverage this finding for exhibiting new families of DFAs with reset threshold of order Ω(n2/4) \Omega(n^2/4) .Comment: 31 pages, 9 figures. arXiv admin note: text overlap with arXiv:1805.0672

    Point regular groups of automorphisms of generalised quadrangles

    Get PDF
    We study the point regular groups of automorphisms of some of the known generalised quadrangles. In particular we determine all point regular groups of automorphisms of the thick classical generalised quadrangles. We also construct point regular groups of automorphisms of the generalised quadrangle of order (q1,q+1)(q-1,q+1) obtained by Payne derivation from the classical symplectic quadrangle W(3,q)\mathsf{W}(3,q). For q=pfq=p^f with f2f\geq 2 we obtain at least two nonisomorphic groups when p5p\geq 5 and at least three nonisomorphic groups when p=2p=2 or 33. Our groups include nonabelian 2-groups, groups of exponent 9 and nonspecial pp-groups. We also enumerate all point regular groups of automorphisms of some small generalised quadrangles.Comment: some minor changes (including to title) after referee's comment
    corecore