Related papers: Comparing EQP and MOD_{p^k}P using Polynomial Degr…

Let $\mathbf{A}$ be a finite nilpotent algebra in a congruence modular variety with finitely many fundamental operations. If $\mathbf{A}$ is of prime power order, then it is known that there is a polynomial $p$ such that for every $n \in…

We prove a general lower bound of quantum decision tree complexity in terms of some entropy notion. We regard the computation as a communication process in which the oracle and the computer exchange several rounds of messages, each round…

We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard, Hoyer, and Tapp, and imply an O(N^{3/4} log N) quantum upper…

Let X = (x_0,...,x_{n-1})$ be a sequence of n numbers. For \epsilon > 0, we say that x_i is an \epsilon-approximate median if the number of elements strictly less than x_i, and the number of elements strictly greater than x_i are each less…

This paper studies so-called "null polynomials modulo m", i.e., polynomials with integer coefficients that satisfy f(x)=0 (mod m) for any integer x. The study on null polynomials is helpful to reduce congruences of higher degrees modulo m…

The modular degree m_E of an elliptic curve E/Q is the minimal degree of any surjective morphism X_0(N) -> E, where N is the conductor of E. We give a necessarily set of criteria for m_E to be odd. Specializing to N prime our results imply…

For a prime $p$ and a matrix $A \in \mathbb{Z}^{n \times n}$, write $A$ as $A = p (A \,\mathrm{quo}\, p) + (A \,\mathrm{rem}\, p)$ where the remainder and quotient operations are applied element-wise. Write the $p$-adic expansion of $A$ as…

In this paper, we establish lower bounds for the oracle complexity of the first-order methods minimizing regularized convex functions. We consider the composite representation of the objective. The smooth part has H\"older continuous…

We obtain new bounds of multivariate exponential sums with monomials, when the variables run over rather short intervals. Furthermore, we use the same method to derive estimates on similar sums with multiplicative characters to which…

It is often useful to have polynomial upper or lower bounds on a one-dimensional function that are valid over a finite interval, called a trust region. A classical way to produce polynomial bounds of degree $k$ involves bounding the range…

Let $F$ be a number field, $O_F$ the integral closure of $\mathbb{Z}$ in $F$ and $P(T) \in O_F[T]$ a monic separable polynomial such that $P(0) \not=0$ and $P(1) \not=0$. We give precise sufficient conditions on a given positive integer $k$…

We obtain an upper bound on the number of extended irreducible q-ary Goppa codes of degree $r$ and length $q^n+1$, where $q=p^t$ and $n$ and $r>2$ are prime numbers.

Recent breakthroughs in quantum query complexity have shown that any formula of size n can be evaluated with O(sqrt(n)log(n)/log log(n)) many quantum queries in the bounded-error setting [FGG08, ACRSZ07, RS08b, Rei09]. In particular, this…

The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPR-pairs). Some lower bound techniques are available for qubit communication…

We consider a certain mixed polynomial which is an extended Lens equation $L_{n,m}=\bar z^m-p(z)/q(z)$ with $\text{degree}\, q=n$, $\text{degree}\, p<n$ whose numerator is a mixed polynomial of degree $(n+m;n,m)$. Then we consider its…

We combine the classical notions and techniques for bounded query classes with those developed in quantum computing. We give strong evidence that quantum queries to an oracle in the class NP does indeed reduce the query complexity of…

In this article we introduce a new complexity class called PQMA_log(2). Informally, this is the class of languages for which membership has a logarithmic-size quantum proof with perfect completeness and soundness which is polynomially close…

We consider approximate {\em path-reporting} distance oracles, distance labeling and labeled routing with extremely low space requirement, for general undirected graphs. For distance oracles, we show how to break the n\log n space bound of…

Let $N$ be a positive integer and let $S_N$ be the set of polynomials with integer coefficients, degree less than $N$, and minimal positive integral over $[0,1]$. D. Bazzanella initiated the study of $S_N$ because of its relation to the…

We prove that for every integer $k$, every finite set of points in the plane can be $k$-colored so that every half-plane that contains at least $2k-1$ points, also contains at least one point from every color class. We also show that the…