Related papers: Pebble Minimization of Polyregular Functions

An integer point in a polyhedron is called irreducible iff it is not the midpoint of two other integer points in the polyhedron. We prove that the number of irreducible integer points in $n$-dimensional polytope with radius $k$ given by a…

In the present paper, the following convexity principle is proved: any closed convex multifunction, which is metrically regular in a certain uniform sense near a given point, carries small balls centered at that point to convex sets, even…

Regularity results for minimal configurations of variational problems involving both bulk and surface energies and subject to a volume constraint are established. The bulk energies are convex functions with p-power growth, but are otherwise…

We answer an open question in the theory of transducer degrees initially posed in [3], on the structure of polynomial transducer degrees, in particular the question of what degrees, if any, lie below the degree of $n^3$. Transducer degrees…

We obtain in arbitrary codimension a removability result on the order of singularity of weak limits and bubbles of Willmore immersions measured by the second residue. This permits to reduce significantly the number of possible bubbling…

A "blendstring" is a piecewise polynomial interpolant with high-degree two-point Hermite interpolational polynomials on each piece, analogous to a cubic spline. Blendstrings are smoother and can be more accurate than cubic splines, and can…

For a dynamical system on n-dimensional projective space over a number field or a function field, we show that semi-stable reduction implies the minimality of the resultant. We use this to show that every such dynamical system over a number…

Sullivan's multi-bubble isoperimetric conjectures in $n$-dimensional Euclidean and spherical spaces assert that standard bubbles uniquely minimize total perimeter among all $q-1$ bubbles enclosing prescribed volume, for any $q \leq n+2$.…

Usual termination proofs for a functional program require to check all the possible reduction paths. Due to an exponential gap between the height and size of such the reduction tree, no naive formalization of termination proofs yields a…

A (positive definite and non-classic integral) quadratic form is called strongly $s$-regular if it satisfies a strong regularity property on the number of representations of squares of integers. In this article, we prove that for any…

In this paper we show that if an entire function $f(z_1,z_2)$ of two (or more) complex variables verifies $\norm{f(z_1,z_2)}\leq K(\norm{P(z_1,z_2)})$, where $P(z_1,z_2)$ is a polynomial that is not a power in $\CC[[z_1,z_2]]$, and $K$ is…

We consider the embedding problem in coding theory: given an independence (a code-related property) and an independent language $L$, find a maximal independent language containing $L$. We consider the case where the code-related property is…

We study the problem of reconstructing a function on a manifold satisfying some mild conditions, given data on the values and some derivatives of the function at arbitrary points on the manifold. While the problem of finding a polynomial of…

We obtain in arbitrary codimension a removability result on the order of singularity of Willmore surfaces realising the width of Willmore min-max problems on spheres. As a consequence, out of the twelve families of non-planar minimal…

In prior work the authors introduced a parabolic flow of pluriclosed metrics. Here we give improved regularity results for solutions to this equation. Furthermore, we exhibit this equation as the gradient flow of the lowest eigenvalue of a…

We study continuous quadratic submodular minimization with bounds and propose a polynomially sized semidefinite relaxation, which is provably tight for dimension $n \le 3$ and empirically tight for larger $n$. We apply the relaxation to two…

Given a configuration of indistinguishable pebbles on the vertices of a graph, a pebbling move consists of removing two pebbles from one vertex and placing one pebble on an adjacent vertex. The pebbling number of a graph is the least…

The search for multivariate quadrature rules of minimal size with a specified polynomial accuracy has been the topic of many years of research. Finding such a rule allows accurate integration of moments, which play a central role in many…

In this note, we first try to prove a uniform lower bound of nodal volume in elliptic homogenization setting. This lower bound is far from optimal. But, we can prove a constant lower bound in dimension two. Motivated by the proof, we extend…

The permutation language $P_n$ consists of all words that are permutations of a fixed alphabet of size $n$. Using divide-and-conquer, we construct a regular expression $R_n$ that specifies $P_n$. We then give explicit bounds for the length…