MIT Open Access Articles: Recent submissions

Now showing items 4-6 of 53605

    • Uniacute Spherical Codes 

      Lepsveridze, Saba; Saatashvili, Aleksandre; Zhao, Yufei (Springer Berlin Heidelberg, 2025-01-02)
      A spherical L-code, where L ⊆ [−1,∞), consists of unit vectors in Rd whose pairwise inner products are contained in L. Determining the maximum cardinality NL (d) of an L-code in Rd is a fundamental question in discrete ...

    • New Partitioning Techniques and Faster Algorithms for Approximate Interval Scheduling 

      Compton, Spencer; Mitrović, Slobodan; Rubinfeld, Ronitt (Springer US, 2024-07-18)
      Interval scheduling is a basic algorithmic problem and a classical task in combinatorial optimization. We develop techniques for partitioning and grouping jobs based on their starting/ending times, enabling us to view an ...

    • Hypergeometric L-functions in average polynomial time, II 

      Costa, Edgar; Kedlaya, Kiran S.; Roe, David (Springer International Publishing, 2025-01-30)
      We describe an algorithm for computing, for all primes p ≤ X , the trace of Frobenius at p of a hypergeometric motive over Q in time quasilinear in X. This involves computing the trace modulo p e for suitable e; as in our ...