相关论文: A procedure for constructing peak functions
We compare possibilities of extension of bounded and unbounded Baire-one functions from subspaces of topological spaces.
We construct a smoothly bounded pseudoconvex domain such that every boundary point has a p.s.h. peak function but some boundary point admits no (local) holomorphic peak function.
Given an observation of the uniform empirical process $\alp_n$, its functional increments $\alp_n(u+a_n\cdot)-\alp_n(u)$ can be viewed as a single random process, when $u$ is distributed under the Lebesgue measure. We investigate the almost…
On a separable C*-algebra A every (completely) bounded map, which preserves closed two sided ideals, can be approximated uniformly by elementary operators if and only if A is a finite direct sum of C*-algebras of continuous sections…
We address the question of constructing explicitly quasi-uniform codes from groups. We determine the size of the codebook, the alphabet and the minimum distance as a function of the corresponding group, both for abelian and some nonabelian…
We propose to use Tarski's least fixpoint theorem as a basis to define recursive functions in the calculus of inductive constructions. This widens the class of functions that can be modeled in type-theory based theorem proving tool to…
In this paper, we study functional approximations where we choose the so-called radial basis function method and more specifically, quasi-interpolation. From the various available approaches to the latter, we form new quasi-Lagrange…
In his constructive development of complex analysis, Errett Bishop used restrictive notions of homotopy and simple connectedness. Working in Bishop-style constructive mathematics, we prove Cauchy's integral theorem using the standard…
We prove that if two additive functions (from a certain class) take large values with roughly the same probability then they must be identical. This is a consequence of a structure theorem making clear the inter-relation between the…
We study constructively the relations between the finite cases of Dickson's lemma. Although there are many constructive proofs of them, the novel aspect of our proofs is the extraction of a corresponding bound. We provide some new one-step…
We introduce a general method for constructing modules for $0$-Hecke algebras and supermodules for $0$-Hecke-Clifford algebras from diagrams of boxes in the plane, and give formulas for the images of these modules in the algebras of…
We use a numerical-analytic technique to construct a sequence of successive approximations to the solution of a system of fractional differential equations, subject to Dirichlet boundary conditions. We prove the uniform convergence of the…
We present algorithmic results for the parallel assembly of many micro-scale objects in two and three dimensions from tiny particles, which has been proposed in the context of programmable matter and self-assembly for building high-yield…
We study the ``approximate squaring'' map f(x) := x ceiling(x) and its behavior when iterated. We conjecture that if f is repeatedly applied to a rational number r = l/d > 1 then eventually an integer will be reached. We prove this when…
A deformed $q$-calculus is developed on the basis of an algebraic structure involving graded brackets. A number operator and left and right shift operators are constructed for this algebra, and the whole structure is related to the algebra…
A construction as a growth process for sampling of the uniform infinite planar triangulation (UIPT), defined in a previous paper, is given. The construction is algorithmic in nature, and is an efficient method of sampling a portion of the…
We study the problem of finding a superoptimal solution to the four block problem. Given a bounded block matrix function $\left(\begin{array}{cc}\Phi_{11} &\Phi_{12}\\\Phi_{21}&\Phi_{22}\end{array}\right)$ on the unit circle the four block…
Belief propagation (BP) can do exact inference in loop-free graphs, but its performance could be poor in graphs with loops, and the understanding of its solution is limited. This work gives an interpretable belief propagation rule that is…
Let A be an abelian group, not necessarily finite. The main objective of this paper is to provide two constructions for a fibered A-biset functor. The first is the lower plus construction, and the other is the upper plus construction. These…
By universal formulas we understand parameterized analytic expressions that have a fixed complexity, but nevertheless can approximate any continuous function on a compact set. There exist various examples of such formulas, including some in…