Related papers: A local to global principle for densities over fun…
One strategy for reducing the sign problem in finite-density field theories is to deform the path integral contour from real to complex fields. If the deformed manifold is the appropriate combination of Lefschetz thimbles -- or somewhat…
Let f be a function from the set of rational numbers into itself. We call f a global power map if f(n) = n^k for some integer exponent k. We call f a local power map at the prime number p if f induces a well-defined group homomorphism on…
We generalize Griffiths' theorem on the Hodge filtration of the primitive cohomology of a smooth projective hypersurface, using the local Bernstein-Sato polynomials, the V-filtration of Kashiwara and Malgrange along the hypersurface and the…
For a field $E$ of characteristic different from $2$ and cohomological $2$-dimension one, quadratic forms over the rational function field $E(X)$ are studied. A characterisation in terms of polynomials in $E[X]$ is obtained for having that…
Given a family of analytic functions near 0 \in C^n parametrized by a smooth space, we study the Bernstein polynomial of the fiber on an irreducible variety V of the space of parameters and we show that it is generically constant. We prove…
We describe a finite-field approach to compute density response functions, which allows for efficient $G_0W_0$ and $G_0W_0\Gamma_0$ calculations beyond the random phase approximation. The method is easily applicable to density functional…
We present an algorithm for computing a Smith form with multipliers of a regular matrix polynomial over a field. This algorithm differs from previous ones in that it computes a local Smith form for each irreducible factor in the determinant…
A simple MATLAB implementation of hierarchical shape functions on 2D rectangles is explained and available for download. Global shape functions are ordered for a given polynomial degree according to the indices of the nodes, edges, or…
Functional data that are nonnegative and have a constrained integral can be considered as samples of one-dimensional density functions. Such data are ubiquitous. Due to the inherent constraints, densities do not live in a vector space and,…
In this paper, we prove formulas for local densities of quadratic polynomials over non-dyadic fields and over unramified dyadic fields.
To understand sparse systems we must account for both strong local atom bonds and weak nonlocal van der Waals forces between atoms separated by empty space. A fully nonlocal functional form [H. Rydberg, B.I. Lundqvist, D.C. Langreth, and M.…
We consider density estimators based on the nearest neighbors method applied to discrete point distibutions in spaces of arbitrary dimensionality. If the density is constant, the volume of a hypersphere centered at a random location is…
The paper deals with a comprehensive theory of mappings, whose local behavior can be described by means of linear subspaces, contained in the graphs of two (primal and dual) generalized derivatives. This class of mappings includes the…
Let $C$ be a smooth projective curve defined over the finite field $\mathbb{F}_q$ ($q$ is odd) and let $K=\mathbb{F}_q(C)$ be its function field. Removing one closed point $C^\text{af} = C-\{\infty\}$ results in an integral domain…
In this paper, we tackle the following problem: compute the gcd for several univariate polynomials with parametric coefficients. It amounts to partitioning the parameter space into ``cells'' so that the gcd has a uniform expression over…
We introduce a nonparametric way to estimate the global probability density function for a random persistence diagram. Precisely, a kernel density function centered at a given persistence diagram and a given bandwidth is constructed. Our…
The author \cite{4} proved that, for every set $S$ of positive integers containing 1 (finite or infinite) there exists the density $h=h(E(S))$ of the set $E(S)$ of numbers whose prime factorizations contain exponents only from $S,$ and gave…
Many interesting questions in arithmetic dynamics revolve, in one way or another, around the (local and/or global) reducibility behavior of iterates of a polynomial. We show that for very general families of integer polynomials $f$ (and,…
We introduce the manifold density function, which is an intrinsic method to validate manifold learning techniques. Our approach adapts and extends Ripley's $K$-function, and categorizes in an unsupervised setting the extent to which an…
Following several decades of successive algorithmic improvements, works from the 2010s have showed how to compute the Hermite normal form (HNF) of a univariate polynomial matrix within a complexity bound which is essentially that of…