Some remarks on multiplicity codes

Multiplicity codes are algebraic error-correcting codes generalizing classical polynomial evaluation codes, and are based on evaluating polynomials and their derivatives. This small augmentation confers upon them better local decoding, list-decoding and local list-decoding algorithms than their classical counterparts. We survey what is known about these codes, present some variations and improvements, and finally list some interesting open problems.Comment: 21 pages in Discrete Geometry and Algebraic Combinatorics, AMS Contemporary Mathematics Series, 201

Quantum Algorithms for Some Hidden Shift Problems

Almost all of the most successful quantum algorithms discovered to date exploit the ability of the Fourier transform to recover subgroup structures of functions, especially periodicity. The fact that Fourier transforms can also be used to capture shift structure has received far less attention in the context of quantum computation. In this paper, we present three examples of "unknown shift" problems that can be solved efficiently on a quantum computer using the quantum Fourier transform. For one of these problems, the shifted Legendre symbol problem, we give evidence that the problem is hard to solve classically, by showing a reduction from breaking algebraically homomorphic cryptosystems. We also define the hidden coset problem, which generalizes the hidden shift problem and the hidden subgroup problem. This framework provides a unified way of viewing the ability of the Fourier transform to capture subgroup and shift structure

Multiple Bernoulli series and volumes of moduli spaces of flat bundles over surfaces

Using Szenes formula for multiple Bernoulli series we explain how to compute Witten series associated to classical Lie algebras. Particular instances of these series compute volumes of moduli spaces of flat bundles over surfaces, and also certain multiple zeta values.Comment: 51 pages, 3 figures; formula in Proposition 3.1 for the Lie group of type G_2 is corrected; new references adde

Periodic representations for cubic irrationalities

In this paper we present some results related to the problem of finding periodic representations for algebraic numbers. In particular, we analyze the problem for cubic irrationalities. We show an interesting relationship between the convergents of bifurcating continued fractions related to a couple of cubic irrationalities, and a particular generalization of the Redei polynomials. Moreover, we give a method to construct a periodic bifurcating continued fraction for any cubic root paired with another determined cubic root

Continued fractions in function fields: polynomial analogues of McMullen's and Zaremba's conjectures

We examine the polynomial analogues of McMullen's and Zaremba's conjectures on continued fractions with bounded partial quotients. It has already been proved by Blackburn that if the base field is infinite, then the polynomial analogue of Zaremba's conjecture holds; we will prove this again with a different method and examine some known results for finite base fields. Translating to the polynomial setting a result of Mercat, we will prove that the polynomial analogue of McMullen's conjecture holds over infinite algebraic extensions of finite fields and that, over finite fields, it would be a consequence of the polynomial analogue of Zaremba's conjecture. We will then prove that the polynomial analogue of McMullen's conjecture holds over uncountable base fields, over $\overline{\mathbb Q}$ (thanks to the theory of reduction of a formal Laurent series modulo a prime) and over number fields. For this purpose, we will examine the connection between the continued fractions of polynomial multiples of $\sqrt D$ and pullbacks of generalized Jacobians of the hyperelliptic curve $U^2=D(T)$.Comment: Corrected typos in Chapter