The Frieze-Kannan regularity lemma is a powerful tool in combinatorics. It has also found applications in the design of approximation algorithms and recently in the design of fast combinatorial algorithms for boolean matrix multiplication. The algorithmic applications of this lemma require one to efficiently construct a partition satisfying the conditions of the lemma. Williams [25] recently as...

for all x, y ∈ X. Kannan [] proved that if X is complete, then a Kannan mapping has a fixed point. It is interesting that Kannan’s theorem is independent of the Banach contraction principle []. Also, Kannan’s fixed point theorem is very important because Subrahmanyam [] proved that Kannan’s theorem characterizes the metric completeness. That is, a metric space X is complete if and only if ev...

We give a Riemann–Hilbert approach to the theory of matrix orthogonal polynomials. We will focus on the algebraic aspects of the problem, obtaining difference and differential relations satisfied by the corresponding orthogonal polynomials. We will show that in the matrix case there is some extra freedom that allows us to obtain a family of ladder operators, some of them of 0-th order, somethin...

Formal treatments of epistemology and epistemological issues have come a great way in recent years. Valuable results have been produced by Bayesians, in formal learning theory (also known as computational epistemology in [Kelly 96] and epistemic logic. While the first to formal approaches concentrate on learning and knowledge acquisition issues, the latter concentrate on axiomatics and validity...

As modern technology continues to advance, how can we prevent the human from becoming the weakest component of the human-machine system? When operators are overwhelmed, judicious employment of automation can be beneficial. Ideally, a system which can accurately estimate current operator workload can make better choices when to employ automation. Supervised machine learning models can be trained...

The purpose of this paper is to develop an equivariant intersection theory for actions of linear algebraic groups on algebraic schemes. The theory is based on our construction of equivariant Chow groups. They are algebraic analogues of equivariant cohomology groups which have all the functorial properties of ordinary Chow groups. In addition, they enjoy many of the properties of equivariant coh...

let $f$ be a locally univalent function on the unit disk $u$. we consider the normalized extensions of $f$ to the euclidean unit ball $b^nsubseteqmathbb{c}^n$ given by$$phi_{n,gamma}(f)(z)=left(f(z_1),(f'(z_1))^gammahat{z}right),$$ where $gammain[0,1/2]$, $z=(z_1,hat{z})in b^n$ and$$psi_{n,beta}(f)(z)=left(f(z_1),(frac{f(z_1)}{z_1})^betahat{z}right),$$in which $betain[0,1]$, $f(z_1)neq 0$ and $...

Let $f$ be a locally univalent function on the unit disk $U$. We consider the normalized extensions of $f$ to the Euclidean unit ball $B^nsubseteqmathbb{C}^n$ given by $$Phi_{n,gamma}(f)(z)=left(f(z_1),(f'(z_1))^gammahat{z}right),$$  where $gammain[0,1/2]$, $z=(z_1,hat{z})in B^n$ and $$Psi_{n,beta}(f)(z)=left(f(z_1),(frac{f(z_1)}{z_1})^betahat{z}right),$$ in which $betain[0,1]$, $f(z_1)neq 0$ a...