Related papers: Uniform linear bound in Chevalley's lemma
The motivation of this paper is the development of an optimisation method for solving optimisation problems appearing in Chebyshev rational and generalised rational approximation problems, where the approximations are constructed as ratios…
In this paper, we demonstrate the application of generalised rational uniform (Chebyshev) approximation in neural networks. In particular, our activation functions are one degree rational functions and the loss function is based on the…
We prove an analytic version of the stable graph regularity lemma from \cite{MaSh}, which applies to stable functions $f\colon V\times W\to [0,1]$. Our methods involve continuous model theory and, in particular, results on the structure of…
In this paper we discuss the generalizations of the concept of Chebyshev's bias from two perspectives. First we give a general framework for the study of prime number races and Chebyshev's bias attached to general $L$-functions satisfying…
We address the problem of the best uniform approximation by linear combinations of a finite system of functions. If the system is Chebyshev and the problem is unconstrained, then the classical Remez algorithm provides a fast and precise…
The estimates of the uniform norm of the Chebyshev polynomials associated with a compact set $K$ in the complex plane are established. These estimates are exact (up to a constant factor) in the case where $K$ consists of a finite number of…
We establish uniform a-priori estimates for solutions of the semilinear Dirichlet problem \begin{equation} \begin{cases} (-\Delta)^m u=h(x,u)\quad&\mbox{in }\Omega,\\ u=\partial_nu=\cdots=\partial_n^{m-1}u=0\quad&\mbox{on }\partial\Omega,…
We prove results on existence of limits in the definition of (weighted) directional Chebyshev constants at all points of the standard simplex $\Sigma \subset {\bf R}^d$ for (locally) regular compact sets $K\subset {\bf C}^d$.
The Shapley-Folkman theorem shows that Minkowski averages of uniformly bounded sets tend to be convex when the number of terms in the sum becomes much larger than the ambient dimension. In optimization, Aubin and Ekeland [1976] show that…
In this paper we apply ideas from the theory of Uniform Distribution of sequences to Functional Analysis and then drawing inspiration from the consequent results, we study concepts and results in Uniform Distribution itself. So let $E$ be a…
Finite sample bounds on the estimation error of the mean by the empirical mean, uniform over a class of functions, can often be conveniently obtained in terms of Rademacher or Gaussian averages of the class. If a function of n variables has…
We present a new algorithm for constructing a Chevalley basis for any Chevalley Lie algebra over a finite field. This is a necessary component for some constructive recognition algorithms of exceptional quasisimple groups of Lie type. When…
An elliptic divisibility sequence, generated by a point in the image of a rational isogeny, is shown to possess a uniformly bounded number of prime terms. This result applies over the rational numbers, assuming Lang's conjecture, and over…
In this paper, we prove a general Schwarz lemma at the boundary for holomorphic mappings from the polydisc to the unit ball in any dimensions. For the special case of one complex variable, the obtained results give the classic boundary…
In this article, the authors survey and review the studies of boundary value problems for regular functions in Clifford analysis, which include theoretical foundations and useful methods. Its theoretical bases consist of the generalized…
It is well known in convex analysis that proximal mappings on Hilbert spaces are $1$-Lipschitz. In the present paper we show that proximal mappings on uniformly convex Banach spaces are uniformly continuous on bounded sets. Moreover, we…
By a theorem of Chevalley the image of a morphism of varieties is a constructible set. The algebraic version of this fact is usually stated as a result on "extension of specializations" or "lifting of prime ideals". We present a difference…
We establish a fixed point theorem for mappings of square matrices of all sizes which respect the matrix sizes and direct sums of matrices. The conclusions are stronger if such a mapping also respects matrix similarities, i.e., is a…
Lower bounds for the first and the second eigenvalue of uniform hypergraphs which are regular and linear are obtained. One of these bounds is a generalization of the Alon-Boppana Theorem to hypergraphs.
The graph Cheeger constant and Cheeger inequalities are generalized to the case of hypergraphs whose edges have the same cardinality. In particular, it is shown that the second largest eigenvalue of the generalized normalized Laplacian is…