Related papers: A procedure for constructing peak functions
This article introduces a method, which starting from simple and quite general mathematical data, allows to construct linear algebras of operators which are, each of them, endowed with a bialgebra structure (coproduct and counity). Moreover…
The book "A Course in Constructive Algebra" (1988) shows the way of understanding classical basic algebra in a constructive style similar to Bishop's Constructive Mathematics. Classical theorems are revisited, with a new flavour, and become…
We construct bisymmetric, strictly increasing binary operations on real intervals which are not continuous. This answers a natural question in the theory of bisymmetric and mean-type operations by showing that continuity may fail for…
We consider the set of points in projective $n$-space that generate an extension of degree $e$ over given number field $k$, and deduce an asymptotic formula for the number of such points of absolute height at most $X$, as $X$ tends to…
This paper presents a novel method of approximating the scalar Wiener-Hopf equation; and therefore constructing an approximate solution. The advantages of this method over the existing methods are reliability and explicit error bounds.…
We investigate two constructive approaches to defining quasi-compact and quasi-separated schemes (qcqs-schemes), namely qcqs-schemes as locally ringed lattices and as functors from rings to sets. We work in Homotopy Type Theory and…
We describe a universal element in the group algebra of symmetric groups, whose characters provides the counting of quarter and eighth BPS states at weak coupling in N=4 SYM, refined according to representations of the global symmetry…
The aim of this work is to introduced the concept of the best one-sided approximation of unbounded functions in weighted space by using algebraic operators in terms the average modulus of smoothness. We also show an estimate of the degree…
A deep approximation is an approximating function defined by composing more than one layer of simple functions. We study deep approximations of functions of one variable using layers consisting of low-degree polynomials or simple conformal…
This paper provides conditions under which subsampling and the bootstrap can be used to construct estimators of the quantiles of the distribution of a root that behave well uniformly over a large class of distributions $\mathbf{P}$. These…
We introduce in this article a new method to estimate the minimum distance of codes from algebraic surfaces. This lower bound is generic, i.e. can be applied to any surface, and turns out to be ``liftable'' under finite morphisms, paving…
We provide a new method to approximate a (possibly discontinuous) function using Christoffel-Darboux kernels. Our knowledge about the unknown multivariate function is in terms of finitely many moments of the Young measure supported on the…
A four-term recurrence relation for squared spherical Bessel functions is shown to yield closed-form expressions for several types of finite weighted sums of these functions. The resulting sum rules, which may contain an arbitrarily large…
Criterion for a companion matrix to have a certain number of flat portions on the boundary of its numerical range is given. The criterion is specialized to the cases of 3-by-3 and 4-by-4 matrices. In the latter case, it is proved that a…
We combine the fundamental results of Breuillard, Green, and Tao on the structure of approximate groups, together with "tame" arithmetic regularity methods based on work of the authors and Terry, to give a structure theorem for finite…
Let K be any compact set in the complex plane that has a connected complement, let A(K) be the uniforn algebra of all continuous complex functions on K that are holomorphic on the interior of K, let bK be the topological boundary of K, let…
Quasiminimal structures play an important role in non-elementary categoricity. In this paper we explore possibilities of constructing quasiminimal models of a given first-order theory. We present several constructions with increasing…
An expression for the four point function for half-BPS operators belonging to the [0,p,0] SU(4) representation in N=4 superconformal theories at strong coupling in the large N limit is suggested for any p. It is expressed in terms of the…
We use the lexicographic order to define a hierarchy of primal and dual bounds on the optimum of a bounded integer program. These bounds are constructed using lex maximal and minimal feasible points taken under different permutations. Their…
We employ the notions of `sequential function' and `interrogation' (dialogue) in order to define new partial combinatory algebra structures on sets of functions. These structures are analyzed using J. Longley's preorder-enriched category of…