Search results for "maximal"
showing 10 items of 239 documents
Extremal solutions and strong relaxation for nonlinear multivalued systems with maximal monotone terms
2018
Abstract We consider differential systems in R N driven by a nonlinear nonhomogeneous second order differential operator, a maximal monotone term and a multivalued perturbation F ( t , u , u ′ ) . For periodic systems we prove the existence of extremal trajectories, that is solutions of the system in which F ( t , u , u ′ ) is replaced by ext F ( t , u , u ′ ) (= the extreme points of F ( t , u , u ′ ) ). For Dirichlet systems we show that the extremal trajectories approximate the solutions of the “convex” problem in the C 1 ( T , R N ) -norm (strong relaxation).
Factorization of homomorphisms through H∞(D)
2003
AbstractWeakly compact homomorphisms between (URM) algebras with connected maximal ideal space are shown to factor through H∞(D) by means of composition operators and to be strongly nuclear. The spectrum of such homomorphisms is also described. Strongly nuclear composition operators between algebras of bounded analytic functions are characterized. The path connected components of the space of endomorphisms on H∞(D) in the uniform operator topology are determined.
On the hardness of optimization in power-law graphs
2008
Our motivation for this work is the remarkable discovery that many large-scale real-world graphs ranging from Internet and World Wide Web to social and biological networks appear to exhibit a power-law distribution: the number of nodes y"i of a given degree i is proportional to i^-^@b where @b>0 is a constant that depends on the application domain. There is practical evidence that combinatorial optimization in power-law graphs is easier than in general graphs, prompting the basic theoretical question: Is combinatorial optimization in power-law graphs easy? Does the answer depend on the power-law exponent @b? Our main result is the proof that many classical NP-hard graph-theoretic optimizati…
Bounds for minimum feedback vertex sets in distance graphs and circulant graphs
2008
Graphs and Algorithms
ℏ-Normalizers and local definitions of saturated formations of finite groups
1989
We define, in each finite groupG, h-normalizers associated with a Schunck class ℏ of the formEΦ f with f a formation. We use these normalizers in order to give some sufficient conditions for a saturated formation of finite groups to have a maximal local definition.
C-Supplemented subgroups of finite groups
2000
A subgroup H of a group G is said to be c-supplemented in G if there exists a subgroup K of G such that HKa G and H\ K is contained in CoreGOHU .W e follow Hall's ideas to characterize the structure of the finite groups in which every subgroup is c-supplemented. Properties of c-supplemented subgroups are also applied to determine the structure of some finite groups.
General inductive inference types based on linearly-ordered sets
1996
In this paper, we reconsider the definitions of procrastinating learning machines. In the original definition of Freivalds and Smith [FS93], constructive ordinals are used to bound mindchanges. We investigate the possibility of using arbitrary linearly ordered sets to bound mindchanges in a similar way. It turns out that using certain ordered sets it is possible to define inductive inference types more general than the previously known ones. We investigate properties of the new inductive inference types and compare them to other types.
Maximal function estimates and self-improvement results for Poincaré inequalities
2018
Our main result is an estimate for a sharp maximal function, which implies a Keith–Zhong type self-improvement property of Poincaré inequalities related to differentiable structures on metric measure spaces. As an application, we give structure independent representation for Sobolev norms and universality results for Sobolev spaces. peerReviewed
On nilpotent Moufang loops with central associators
2007
Abstract In this paper, we investigate Moufang p-loops of nilpotency class at least three for p > 3 . The smallest examples have order p 5 and satisfy the following properties: (1) They are of maximal nilpotency class, (2) their associators lie in the center, and (3) they can be constructed using a general form of the semidirect product of a cyclic group and a group of maximal class. We present some results concerning loops with these properties. As an application, we classify proper Moufang loops of order p 5 , p > 3 , and collect information on their multiplication groups.
Maximal regularity for Kolmogorov operators in L2 spaces with respect to invariant measures
2006
Abstract We prove an optimal embedding result for the domains of Kolmogorov (or degenerate hypoelliptic Ornstein–Uhlenbeck) operators in L 2 spaces with respect to invariant measures. We use an interpolation method together with optimal L 2 estimates for the space derivatives of T ( t ) f near t = 0 , where T ( t ) is the Ornstein–Uhlenbeck semigroup and f is any function in L 2 .