Related papers: Universal discretization
In this paper, we study the two natural polarizations, namely the standard polarization and the box polarization, of the d-th power of the maximal ideal in a polynomial ring. We show that these polarizations correspond to smooth points in…
One of the most important and useful examples in discrete geometry is a finite sequence of points on the moment curve $\gamma(t)=(t,t^2,t^3,\dots ,t^d)$ or, more generally, on a {\it strictly monotone curve} in $\mathbb R^d$. These…
Given a differential equation with infinite-dimensional symmetry pseudo-group it is shown, using an example, that it is generally not possible to construct enough joint invariants to form an invariant numerical scheme of the equation. To…
Interaction models describe distributed systems as algebraic terms, with gates marking interaction points between local views. Composing local models into a coherent global one requires aligning these gates while respecting the algebraic…
We give a simple, local process for nodes in an undirected graph to form non-adjacent clusters that (1) have at most a polylogarithmic diameter and (2) contain at least half of all vertices. Efficient deterministic distributed clustering…
In smooth and convex multiobjective optimization problems the set of Pareto optima is diffeomorphic to an $m-1$ dimensional simplex, where $m$ is the number of objective functions. The vertices of the simplex are the optima of the…
Many imaging tasks require global information about all pixels in an image. Conventional bottom-up classification networks globalize information by decreasing resolution; features are pooled and downsampled into a single output. But for…
We describe a `discretize-then-relax' strategy to globally minimize integral functionals over functions $u$ in a Sobolev space subject to Dirichlet boundary conditions. The strategy applies whenever the integral functional depends…
Let $\mathrm{R}$ be a real closed field and $\mathrm{D} \subset \mathrm{R}$ an ordered domain. We consider the algorithmic problem of computing the generalized Euler-Poincar\'e characteristic of real algebraic as well as semi-algebraic…
An infinite family of Boolean polynomials which correspond to the discrete average maps, defined in [2], is constructed and their algebraic and combinatorial properties are investigated. They turn out to be balanced, and some recurrence…
In this paper we study the problem of computing max-entropy distributions over a discrete set of objects subject to observed marginals. Interest in such distributions arises due to their applicability in areas such as statistical physics,…
The discretization of least-squares problems for linear ill-posed operator equations in Hilbert spaces is considered. The main subject of this article concerns conditions for convergence of the associated discretized minimum-norm…
Multidimensional continuous-domain inverse problems are often solved by the minimization of a loss functional, formed as the sum of a data fidelity and a regularization. In this work, we present a new construction where the regularization…
Classical approach to regularization is to design norms enhancing smoothness or sparsity and then to use this norm or some power of this norm as a regularization function. The choice of the regularization function (for instance a power…
Let L be the zero set of a nonconstant monic polynomial with complex coefficients. In the context of constructive mathematics without countable choice, it may not be possible to construct an element of L. In this paper we introduce a notion…
Many geometric optimization problems can be reduced to finding points in space (centers) minimizing an objective function which continuously depends on the distances from the centers to given input points. Examples are $k$-Means, Geometric…
We investigate the behavior of integral formulations of variable coefficient elliptic partial differential equations (PDEs) in the presence of steep internal layers. In one dimension, the equations that arise can be solved analytically and…
We generalize the sparsification algorithm of Batson, Spielman and Srivastava, making one part of the result dimension-independent. In particular, we recover discretization inequalities in $L_2$- and sup-norms on general finite-dimensional…
This paper is devoted to developing and applications of a generalized differential theory of variational analysis that allows us to work in incomplete normed spaces, without employing conventional variational techniques based on…
We present a general framework for studying harmonic analysis of functions in the settings of various emerging problems in the theory of diffusion geometry. The starting point of the now classical diffusion geometry approach is the…