Related papers: A local to global principle for densities over fun…
We present a simple formalism for the calculation of the derivatives of the electronic density matrix at any order, within density functional theory. Our approach, contrary to previous ones, is not based on the perturbative expansion of the…
The general number field sieve (GNFS) is the most efficient algorithm known for factoring large integers. It consists of several stages, the first one being polynomial selection. The quality of the chosen polynomials in polynomial selection…
Many real phenomena may be modelled as random closed sets in $\mathbb{R}^d$, of different Hausdorff dimensions. In many real applications, such as fiber processes and $n$-facets of random tessellations of dimension $n\leq d$ in spaces of…
In this paper we prove local-global principles for embedding of fields with involution into central simple algebras with involution over a global field. These should be of interest in study of classical groups over global fields. We deduce…
To compute solutions of sparse polynomial systems efficiently we have to exploit the structure of their Newton polytopes. While the application of polyhedral methods naturally excludes solutions with zero components, an irreducible…
This article introduces a general statistical modeling principle called "Density Sharpening" and applies it to the analysis of discrete count data. The underlying foundation is based on a new theory of nonparametric approximation and…
Let $f\in\mathbb{Z}[T]$ be any polynomial of degree $d>1$ and $F\in\mathbb{Z}[X_{0},...,X_{n}]$ an irreducible homogeneous polynomial of degree $e>1$ such that the projective hypersurface $V(F)$ is smooth. In this paper we give a bound for…
The large sieve is used to estimate the density of integral quadratic polynomials $Q$, such that there exists an odd degree integral polynomial which has resultant $\pm 1$ with $Q$. Given a monic integral polynomial $R$ of odd degree, this…
In the present paper we generate binary pseudorandom sequences using generalized polynomials. A generalized polynomial is a function in whose description we not only allow addition and product (as it is the case in usual polynomials) but…
We establish that the optimal bound for the size of the smallest integral solution of the Oppenheim Diophantine approximation problem $\abs{Q(x)-\xi}< \epsilon$ for a generic ternary form $Q$ is $\abs{x}\ll \epsilon^{-1}$. We also establish…
A recently proposed linear-scaling scheme for density-functional pseudopotential calculations is described in detail. The method is based on a formulation of density functional theory in which the ground state energy is determined by…
A method is described which allows to evaluate efficiently a polynomial in a (possibly trivial) extension of the finite field of its coefficients. Its complexity is shown to be lower than that of standard techniques when the degree of the…
We introduce a density basis of the trigonometric polynomials that is suitable to mixture modelling. Statistical and geometric properties are derived, suggesting it as a circular analogue to the Bernstein polynomial densities. Nonparametric…
The Hohenberg-Kohn theorem of density-functional theory (DFT) is broadly considered the conceptual basis for a full characterization of an electronic system in its ground state by just the one-body particle density. Part I of this review…
In this paper we present a locally and dimension-adaptive sparse grid method for interpolation and integration of high-dimensional functions with discontinuities. The proposed algorithm combines the strengths of the generalised sparse grid…
We develop two methods for expressing the global index of the gradient of a 2 variable polynomial function $f$: in terms of the atypical fibres of $f$, and in terms of the clusters of Milnor arcs at infinity. These allow us to derive upper…
Over-parameterized models like deep nets and random forests have become very popular in machine learning. However, the natural goals of continuity and differentiability, common in regression models, are now often ignored in modern…
We are concerned with the computation of the ${\mathcal L}_\infty$-norm for an ${\mathcal L}_\infty$-function of the form $H(s) = C(s) D(s)^{-1} B(s)$, where the middle factor is the inverse of a meromorphic matrix-valued function, and…
A density-functional theory is developed based on the Maxwell--Schr\"odinger equation with an internal magnetic field in addition to the external electromagnetic potentials. The basic variables of this theory are the electron density and…
This paper extends earlier work on the distribution in the complex plane of the roots of random polynomials. In this paper, the random polynomials are generalized to random finite sums of given "basis" functions. The basis functions are…