Related papers: Noether's problem and rationality problem for mult…
We consider a generalisation of the classical Lehmer problem about the parity distribution of an integer and its modular inverse. We use some known estimates of exponential sums to study a more general question of simultaneous distribution…
We discuss an elementary, yet unsolved, problem of Niederreiter concerning the enumeration of a class of subspaces of finite dimensional vector spaces over finite fields. A short and self-contained account of some recent progress on this…
The computational properties of modal and propositional dependence logics have been extensively studied over the past few years, starting from a result by Sevenster showing NEXPTIME-completeness of the satisfiability problem for modal…
One might think that, once we know something is computable, how efficiently it can be computed is a practical question with little further philosophical importance. In this essay, I offer a detailed case that one would be wrong. In…
Let $X,Y$ be two irreducible subvarieties of the projective space $\mathbb{P}^n$, and $d\geq 1$ an integer number. The main result of this paper is an algorithm to construct {\bf explicitly}, in terms of $d$ and the ideals defining $X$ and…
We offer some elementary characterisations of group and round quadratic forms. These characterisations are applied to establish new (and recover existing) characterisations of Pfister forms. We establish "going-up" results for group and…
We develop the basic formalism of complex $q$-analysis to study the solutions of second order $q$-difference equations which reduce, in the $q\rightarrow 1$ limit, to the ordinary Laplace equation in Euclidean and Minkowski space. After…
In this note, we extend the result of \cite{PoulyG16} about the complexity of solving polynomial differential equations over unbounded domains to work with non-rational input. In order to deal with arbitrary input, we phrase the result in…
The issue of field redefinition invariance of path integrals in quantum field theory is reexamined. A ``paradox'' is presented involving the reduction to an effective quantum-mechanical theory of a $(d+1)$-dimensional free scalar field in a…
Solving systems of m multivariate quadratic equations in n variables (MQ-problem) over finite fields is NP-hard. The security of many cryptographic systems is based on this problem. Up to now, the best algorithm for solving the underdefined…
Optimal decentralized controller design is notoriously difficult, but recent research has identified large subclasses of such problems that may be convexified and thus are amenable to solution via efficient numerical methods. One recently…
We discuss Parshin's conjecture on rational K-theory over finite fields and its implications for motivic cohomology with compact support.
In this communication, we show that both infinite-dimensional versions of Noether's theorems, and the explanation of quantum anomalies can be obtained using similar formulas for the derivatives of functions whose values are measures…
In this thesis we give an in-depth introduction to the General Number Field Sieve, as it was used by Buhler, Lenstra, and Pomerance, before looking at one of the modern developments of this algorithm: A randomized version with provable…
This is a survey of the diversity of problems in additive number theory. Equity requires the consideration of less currently popular problems, and suggests their inclusion in the additive canon. Of particular interest are problems about the…
Following T. H. Chan, we consider the problem of approximation of a given rational fraction a/q by sums of several rational fractions a_1/q_1, ..., a_n/q_n with smaller denominators. We show that in the special cases of n=3 and n=4 and…
We give an improved polynomial bound on the complexity of the equation solvability problem, or more generally, of finding the value sets of polynomials over finite nilpotent rings. Our proof depends on a result in additive combinatorics,…
We show that Pashin's conjecture on the vanishing of rational higher K-groups of smooth, projective varieties over finite fields can be thought of as a combination of three weaker conjectures.
We show that the semi-simplicity conjecture for finitely generated fields follows from the conjunction of the semi-simplicity conjecture for finite fields and for the maximal abelian extension of the field of rational numbers.
The exact bound state spectrum of rationally extended shape invariant real as well as $PT$ symmetric complex potentials are obtained by using potential group approach. The generators of the potential groups are modified by introducing a new…