Search results for "General Mathematics"
showing 10 items of 3795 documents
The fractal interpolation for countable systems of data
2003
In this paper we will extend the fractal interpolation from the finite case to the case of countable sets of data. The main result is that, given an countable system of data in [a, b] ? Y, where [a, b] is a real interval and Y a compact and arcwise connected metric space, there exists a countable iterated function system whose attractor is the graph of a fractal interpolation function.
Common fixed point theorems for multi-valued maps
2012
Abstract We establish some results on coincidence and common fixed points for a two-pair of multi-valued and single-valued maps in complete metric spaces. Presented theorems generalize recent results of Gordji et al [4] and several results existing in the literature.
Meir-Keeler Type Contractions for Tripled Fixed Points
2012
Abstract In 2011, Berinde and Borcut [6] introduced the notion of tripled fixed point in partially ordered metric spaces. In our paper, we give some new tripled fixed point theorems by using a generalization of Meir-Keeler contraction.
Brauer characters and coprime action
2016
Abstract It is an open problem to show that under a coprime action, the number of invariant Brauer characters of a finite group is the number of the Brauer characters of the fixed point subgroup. We prove that this is true if the non-abelian simple groups satisfy a stronger condition.
On ideals of polynomials and multilinear mappings between Banach spaces
2003
It is shown that for every quasi-normed ideal ${\cal Q}$ of n-homogeneous continuous polynomials between Banach spaces there is a quasi-normed ideal ${\cal A}$ of n-linear continuous mappings ${\cal A}$ such that $q \in {\cal Q}$ if and only if the associated n-linear mapping $\check{q}$ of q is in ${\cal A}$.
Weakly compact multilinear mappings
1997
The notion of Arens regularity of a bilinear form on a Banach space E is extended to continuous m-linear forms, in such a way that the natural associated linear mappings, E→L (m−1E) and (m – l)-linear mappings E × … × E → E', are all weakly compact. Among other applications, polynomials whose first derivative is weakly compact are characterized.
Domination spaces and factorization of linear and multilinear summing operators
2015
[EN] It is well known that not every summability property for multilinear operators leads to a factorization theorem. In this paper we undertake a detailed study of factorization schemes for summing linear and nonlinear operators. Our aim is to integrate under the same theory a wide family of classes of mappings for which a Pietsch type factorization theorem holds. Our construction includes the cases of absolutely p-summing linear operators, (p, sigma)-absolutely continuous linear operators, factorable strongly p-summing multilinear operators, (p(1), ... , p(n))-dominated multilinear operators and dominated (p(1), ... , p(n); sigma)-continuous multilinear operators.
Restricted weak type on maximal linear and multilinear integral maps
2006
It is shown that multilinear operators of the form T ( f 1 , . . . , f k ) ( x ) T(f_1,...,f_k)(x) = ∫ R n K ( x , y 1 , . . . , y k ) f 1 ( y 1 ) . . . f k ( y k ) d y 1 . . . d y k =\!\int _{\mathbb {R}^n}\!K(x,y_1,...,y_k)f_1(y_1)... f_k(y_k)dy_1...dy_k of restricted weak type ( 1 , . . . , 1 , q ) (1,...,1,q) are always of weak type ( 1 , . . . , 1 , q ) (1,...,1,q) whenever the map x → K x x\to K_x is a locally integrable L 1 ( R n ) L^1(\mathbb {R}^n) -valued function.
Summability and estimates for polynomials and multilinear mappings
2008
Abstract In this paper we extend and generalize several known estimates for homogeneous polynomials and multilinear mappings on Banach spaces. Applying the theory of absolutely summing nonlinear mappings, we prove that estimates which are known for mappings on l p spaces in fact hold true for mappings on arbitrary Banach spaces.
Hopcroft's algorithm and tree-like automata
2011
Minimizing a deterministic finite automata (DFA) is a very important problem in theory of automata and formal languages. Hopcroft's algorithm represents the fastest known solution to the such a problem. In this paper we analyze the behavior of this algorithm on a family binary automata, called tree-like automata, associated to binary labeled trees constructed by words. We prove that all the executions of the algorithm on tree-like automata associated to trees, constructed by standard words, have running time with the same asymptotic growth rate. In particular, we provide a lower and upper bound for the running time of the algorithm expressed in terms of combinatorial properties of the trees…