Related papers: Inverse Theorem on Row Sequences of Linear Pad\'e-…
The algorithm for finding the optimal consistent approximation of an inconsistent pairwise comparisons matrix is based on a logarithmic transformation of a pairwise comparisons matrix into a vector space with the Euclidean metric.…
We consider multipoint Pad\'e approximation to Cauchy transforms of complex measures. We show that if the support of a measure is an analytic Jordan arc and if the measure itself is absolutely continuous with respect to the equilibrium…
We show that several problems of compacting orthogonal graph drawings to use the minimum number of rows, area, length of longest edge or total edge length cannot be approximated better than within a polynomial factor of optimal in…
We define the analogue of linear equivalence of graph divisors for the rotor-router model, and use it to prove polynomial time computability of some problems related to rotor-routing. Using the connection between linear equivalence for…
In this paper, using generalized metric projection, we propose a new extragradient method for finding a common element of the solutions set of a generalized equilibrium problem and a variational inequality for an $\alpha$-inverse-strongly…
Following Schmidt, Thurnheer and Bugeaud-Kristensen, we study how Dirichlet's theorem on linear forms needs to be modified when one requires that the vectors of coefficients of the linear forms make a bounded acute angle with respect to a…
In this paper we study the problem of approximation of the $L^2$-topological invariants by their finite dimensional analogues. We obtain generalizations of the theorem of L\"uck, dealing with towers of finitely sheeted normal coverings. We…
Mittag-Leffler condition ensures the exactness of the inverse limit of short exact sequences indexed on a partially ordered set $(I,\leq)$ admitting a $countable$ cofinal subset. We extend Mittag-Leffler condition by relatively relaxing the…
This paper studies the low-rank property of the inverse of a class of large-scale structured matrices in the tensor-train (TT) format, which is typically discretized from differential operators. An interesting question that we are concerned…
The Linearization Theorem for proper Lie groupoids organizes and generalizes several results for classic geometries. Despite the various approaches and recent works on the subject, the problem of understanding invariant linearization…
We shall prove a convergence result relative to sequences of Minkowski symmetrals of general compact sets. In particular, we investigate the case when this process is induced by sequences of subspaces whose elements belong to a finite…
Recently, Ghosh \& Haynes \cite{HG} proved a Khintchine-type result for the problem of Diophantine approximation in certain projective spaces. In this note we complement their result by observing that a Jarn\'{\i}k-type result also holds…
Given two arbitrary closed sets in Euclidean space, a simple transversality condition guarantees that the method of alternating projections converges locally, at linear rate, to a point in the intersection. Exact projection onto nonconvex…
We establish a correspondence between inverse sumset theorems (which can be viewed as classifications of approximate (abelian) groups) and inverse theorems for the Gowers norms (which can be viewed as classifications of approximate…
We prove over fields of power series the analogues of several Diophantine approximation results obtained over the field of real numbers. In particular we establish the power series analogue of Kronecker's theorem for matrices, together with…
The present paper deals with the convergence properties of multi-level Hermite-Pad\'e approximants for a class of meromorphic functions given by rational perturbations with real coefficients of a Nikishin system of functions, and study the…
Rakhmanov's theorem for orthogonal polynomials on the unit circle gives a sufficient condition on the orthogonality measure for orthogonal polynomials on the unit circle, in order that the reflection coefficients (the recurrence…
We derive the necessary and sufficient condition, for a given Polynomial Recurrence Sequence to converge to a given target rational K. By converge, we mean that the Nth term of the sequence, is equal to K, as N tends to positive infinity.…
We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.
We prove various results on the size and structure of subsets of vector spaces over finite fields which, in some sense, have too many mutually orthogonal pairs of vectors. In particular, we obtain sharp finite field variants of a theorem of…