Related papers: Libert\'e et accumulation
We consider a parabolic non-local free boundary problem that has been derived as a limit of a bulk-surface reaction-diffusion system which models cell polarization. The authors have justified the well-posedness of this problem and have…
The anthropic principle is an inevitable constraint on the space of possible theories. As such it is central to determining the limits of physics. In particular, we contend that what is ultimately possible in physics is determined by…
We prove two theorems concerning extreme values of general Gaussian fields. Our first theorem concerns with the concept of multiple peaks. A theorem of Chatterjee states that when a centered Gaussian field admits the so-called…
This paper establishes a combinatorial central limit theorem for stratified randomization, which holds under a Lindeberg-type condition. The theorem allows for an arbitrary number or sizes of strata, with the sole requirement being that…
We consider a Hamiltonian system of free boundary type, showing first uniform bounds and existence of solutions and of the free boundary. Then, for any smooth and bounded domain, we prove uniqueness of positive solutions in a suitable…
Answering a question posed by Adam Epstein, we show that the collection of conjugacy classes of polynomials admitting a parabolic fixed point and at most one infinite critical orbit is a set of bounded height in the relevant moduli space.…
Let $\mathbb{F}_q$ stand for the finite field of odd characteristic $p$ with $q$ elements ($q=p^{n},n\in \mathbb{N} $) and $\mathbb{F}_q^*$ denote the set of all the nonzero elements of $\mathbb{F}_{q}$. Let $m$ and $t$ be positive…
We study a resource allocation setting where $m$ discrete items are to be divided among $n$ agents with additive utilities, and the agents' utilities for individual items are drawn at random from a probability distribution. Since common…
The aim of this paper is twofold. First, three theoretical principles are formalized: randomization, overrepresentation and restriction. We develop these principles and give a rationale for their use in choosing the sampling design in a…
This paper investigates the necessary conditions of optimality for uni- formly overtaking optimal control on infinite horizon with free right endpoint. Clarke's form of the Pontryagin Maximum Principle is proved without the as- sumption on…
It is generally hard to count, or even estimate, how many integer points lie in a polytope P. Barvinok and Hartigan have approached the problem by way of information theory, showing how to efficiently compute a random vector which samples…
We derive positivity bounds for scattering amplitudes of particles with arbitrary spin using unitarity, analyticity and crossing symmetry. The bounds imply the positivity of certain low-energy coefficients of the effective action that…
Independence and conditional independence are fundamental concepts for reasoning about groups of random variables in probabilistic programs. Verification methods for independence are still nascent, and existing methods cannot handle…
In this article, we show that every stationary random measure on $\mathbb R^d$ that is essentially free (i.e., has no symmetries a.s.) admits a point process as a factor (i.e., as a measurable and translation-equivariant function of the…
We take another look at the general problem of selecting a preferred probability measure among those that comply with some given constraints. The dominant role that entropy maximization has obtained in this context is questioned by arguing…
To most applied statisticians, a fitting procedure's degrees of freedom is synonymous with its model complexity, or its capacity for overfitting to data. In particular, it is often used to parameterize the bias-variance tradeoff in model…
The properties of the high energy behavior of the scattering amplitude of massive, neutral and spinless particles in higher dimensional field theories are investigated. The axiomatic formulation of Lehmann, Symanzik and Zimmermann is…
We exhibit a probabilistic algorithm which computes a rational point of an absolutely irreducible variety over a finite field defined by a reduced regular sequence. Its time--space complexity is roughly quadratic in the logarithm of the…
Consider an elliptic curve, defined over the rational numbers, and embedded in projective space. The rational points on the curve are viewed as integer vectors with coprime coordinates. What can be said about a rational point if a bound is…
In this expository article, we compare Malle's conjecture on counting number fields of bounded discriminant with recent conjectures of Ellenberg--Satriano--Zureick-Brown and Darda--Yasuda on counting points of bounded height on classifying…