Related papers: Chebyshev centers and radius of the set of permuto…
Given a number of Extended Chebyshev (EC) spaces on adjacent intervals, all of the same dimension, we join them via convenient connection matrices without increasing the dimension. The global space is called a Piecewise Extended Chebyshev…
The present paper is devoted to the study of the maximum number of limit cycles bifurcated from the periodic orbits of the quadratic isochronous center $\dot{x}=-y+\frac{16}{3}x^{2}-\frac{4}{3}y^{2},\dot{y}=x+\frac{8}{3}xy$ by the averaging…
A-nuclei (groups of regular permutations) of a quasigroup are studied. A quasigroup is A-nuclear if and only if it is group isotope. Any quasigroup with permutation medial or paramedial identity is an abelian group isotope. Definition of…
Let P be a point inside a convex quadrilateral ABCD. The lines from P to the vertices of the quadrilateral divide the quadrilateral into four triangles. If we locate a triangle center in each of these triangles, the four triangle centers…
The center of distances of a metric space $(X,d)$ is the set $C(X)$ of all $t\in \mathbb R^+$ for which the equation $d(x,p)=t$ has a solution for each $p\in X$. We prove that the equalities $C(X)=\{0\}$ or $C(X)=\{0,\operatorname{diam}X\}…
For a function that is analytic on and around an interval, Chebyshev polynomial interpolation provides spectral convergence. However, if the function has a singularity close to the interval, the rate of convergence is near one. In these…
A half-geodesic is a closed geodesic realizing the distance between any pair of its points. All geodesics in a round sphere are half-geodesics. Conversely, this note establishes that Riemannian spheres with all geodesics closed and…
We systematically investigate the farthest distance function, farthest points, Klee sets, and Chebyshev centers, with respect to Bregman distances induced by Legendre functions. These objects are of considerable interest in Information…
While measurements of the hyperfine structure of hydrogen-like atoms are traditionally regarded as test of bound-state QED, we assume that theoretical QED predictions are accurate and discuss the information about the electromagnetic…
Quasi-polar spaces are sets of points having the same intersection numbers with respect to hyperplanes as classical polar spaces. Non-classical examples of quasi-quadrics have been constructed using a technique called pivoting [5]. We…
For any finite point set in $D$-dimensional space equipped with the 1-norm, we present random linear embeddings to $k$-dimensional space, with a new metric, having the following properties. For any pair of points from the point set that are…
A new spectral type method for solving the one dimensional quantum-mechanical Lippmann-Schwinger integral equation in configuration space is described. The radial interval is divided into partitions, not necessarily of equal length. Two…
A new method of antenna radiation pattern reconstruction using Chebyshev polynomials was presented in this paper. The analysis starts from the data measured in the frequency domain, and it corresponds to a direct propagating between two…
Understanding the functional graph of a nonlinear map over a finite domain is crucial for analyzing its dynamical complexity and potential applications in cryptography and pseudorandom generation. In this paper, we investigate the graph…
Approximation theory plays a central role in numerical analysis, undergoing continuous evolution through a spectrum of methodologies. Notably, Lebesgue, Weierstrass, Fourier, and Chebyshev approximations stand out among these methods.…
The commuting graph of a semigroup is the set of non-central elements; the edges are defined as pairs $(u,v)$ satisfying $uv=vu$. We provide an example of a field $F$ and an integer $n$ such that the commuting graph of…
We introduce and study a simple Markovian model of random separable permutations. Our first main result is the almost sure convergence of these permutations towards a random limiting object in the sense of permutons, which we call the…
A record in a permutation is a maximum or a minimum, from the left or from the right. The entries of a permutation can be partitioned into two types: the ones that are records are called external points, the others are called internal…
We give linear-time quasiconvex programming algorithms for finding a Moebius transformation of a set of spheres in a unit ball or on the surface of a unit sphere that maximizes the minimum size of a transformed sphere. We can also use…
The commuting graph of a finite soluble group with trivial centre is investigated. It is shown that the diameter of such a graph is at most 8 or the graph is disconnected. Examples of soluble groups with trivial centre and commuting graph…