Search results for "Bounded function"

showing 10 items of 508 documents

Mappings of finite distortion: The zero set of the Jacobian

2003

This paper is part of our program to establish the fundamentals of the theory of mappings of finite distortion [6], [1], [8], [13], [14], [7] which form a natural generalization of the class of mappings of bounded distortion, also called quasiregular mappings. Let us begin with the definition. We assume that Ω ⊂ Rn is a connected open set. We say that a mapping f : Ω → Rn has finite distortion if:

Discrete mathematicsClass (set theory)Zero setGeneralizationApplied MathematicsGeneral MathematicsOpen setDistortion (mathematics)symbols.namesakeBounded functionJacobian matrix and determinantsymbolsCoincidence pointMathematicsJournal of the European Mathematical Society
researchProduct

Codimension growth of two-dimensional non-associative algebras

2007

Let F be a field of characteristic zero and let A be a two-dimensional non-associative algebra over F. We prove that the sequence c n (A), n =1,2,..., of codimensions of A is either bounded by n + 1 or grows exponentially as 2 n . We also construct a family of two-dimensional algebras indexed by rational numbers with distinct T-ideals of polynomial identities and whose codimension sequence is n + 1, n > 2.

Discrete mathematicsCombinatoricsSequencePolynomialRational numberApplied MathematicsGeneral MathematicsBounded functionZero (complex analysis)Field (mathematics)CodimensionIdeal (ring theory)MathematicsProceedings of the American Mathematical Society
researchProduct

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.

Discrete mathematicsConnected spacePure mathematicsEndomorphismCompact spaceComposition operatorBounded functionApplied MathematicsSpectrum (functional analysis)Maximal idealOperator theoryAnalysisMathematicsJournal of Mathematical Analysis and Applications
researchProduct

Some Questions of Heinrich on Ultrapowers of Locally Convex Spaces

1993

In this note we treat some open problems of Heinrich on ultrapowers of locally convex spaces. In section 1 we investigate the localization of bounded sets in the full ultrapower of a locally convex space, in particular the coincidence of the full and the bounded ultrapower, mainly concentrating in the case of (DF)-spaces. In section 2 we provide a partial answer to a question of Heinrich on commutativity of strict inductive limits and ultrapowers. In section 3 we analyze the relation between some natural candidates for the notion of superreflexivity in the setting of Frechet spaces. We give an example of a Frechet-Schwartz space which is not the projective limit of a sequence of superreflex…

Discrete mathematicsConvex analysisMathematics::Functional AnalysisPure mathematicsSequenceGeneral MathematicsBanach spaceConvex setUltraproductSpace (mathematics)Mathematics::LogicBounded functionLocally convex topological vector spaceMathematicsMathematische Nachrichten
researchProduct

Derived categories of irreducible projective curves of arithmetic genus one

2006

We investigate the bounded derived category of coherent sheaves on irreducible singular projective curves of arithmetic genus one. A description of the group of exact auto-equivalences and the set of all $t$ -structures of this category is given. We describe the moduli space of stability conditions, obtain a complete classification of all spherical objects in this category and show that the group of exact auto-equivalences acts transitively on them. Harder–Narasimhan filtrations in the sense of Bridgeland are used as our main technical tool.

Discrete mathematicsDerived categoryPure mathematicsAlgebra and Number TheoryFourier–Mukai transformGroup (mathematics)Moduli spaceCoherent sheafMathematics::Algebraic GeometryMathematics::Category TheoryBounded functionArithmetic genusAlgebraic curveMathematicsCompositio Mathematica
researchProduct

Functional calculi for convolution operators on a discrete, periodic, solvable group

2009

Suppose T is a bounded self-adjoint operator on the Hilbert space L2(X,μ) and let T=∫SpL2TλdE(λ) be its spectral resolution. Let F be a Borel bounded function on [−a,a], SpL2T⊂[−a,a]. We say that F is a spectral Lp-multiplier for T, if F(T)=∫SpL2TF(λ)dE(λ) is a bounded operator on Lp(X,μ). The paper deals with l1-multipliers, where X=G is a discrete (countable) solvable group with ∀x∈G, x4=1, μ is the counting measure and TΦ:l2(G)∋ξ↦ξ∗Φ∈l2(G), where Φ=Φ∗ is a l1(G) function, suppΦ generates G. The main result of the paper states that there exists a Ψ on G such that all l1-multipliers for TΨ are real analytic at every interior point of Spl2(G)TΨ. We also exhibit self-adjoint Φ′s in l1(G) suc…

Discrete mathematicsDiscrete groupDiscrete groupHilbert spacel1-multipliersFunction (mathematics)ConvolutionBounded operatorFunctional calculiCombinatoricssymbols.namesakeCounting measureSolvable groupBounded functionsymbolsConvolution operatorAnalysisMathematicsJournal of Functional Analysis
researchProduct

BLD -mappings in $W^{2,2}$ are locally invertible

2000

We prove that mappings of bounded length distortion are local homeomorphisms if they have L 2 -integrable weak second derivatives.

Discrete mathematicsDistortion (mathematics)Invertible matrixIntegrable systemlawGeneral MathematicsBounded functionMathematics::General TopologySecond derivativeMathematicslaw.inventionMathematische Annalen
researchProduct

Logical definability of NP-optimisation problems with monadic auxiliary predicates

1993

Given a first-order formula ϕ with predicate symbols e1...el, so,...,sr, an NP-optimisation problem on -structures can be defined as follows: for every -structure G, a sequence of relations on G is a feasible solution iff satisfies ϕ, and the value of such a solution is defined to be ¦S0¦. In a strong sense, every polynomially bounded NP-optimisation problem has such a representation, however, it is shown here that this is no longer true if the predicates s1, ...,sr are restricted to be monadic. The result is proved by an Ehrenfeucht-Fraisse game and remains true in several more general situations.

Discrete mathematicsEdge coloringBounded functionPredicate (grammar)Clique numberNp optimization problemsMathematics
researchProduct

Quadratic rational solvable groups

2012

Abstract A finite group G is quadratic rational if all its irreducible characters are either rational or quadratic. If G is a quadratic rational solvable group, we show that the prime divisors of | G | lie in { 2 , 3 , 5 , 7 , 13 } , and no prime can be removed from this list. More generally, if G is solvable and the field Q ( χ ) generated by the values of χ over Q satisfies | Q ( χ ) : Q | ⩽ k , for all χ ∈ Irr ( G ) , then the set of prime divisors of | G | is bounded in terms of k . Also, we prove that the degree of the field generated by the values of all characters of a semi-rational solvable group (see Chillag and Dolfi, 2010 [1] ) or a quadratic rational solvable group over Q is bou…

Discrete mathematicsFinite groupAlgebra and Number TheoryField (mathematics)Isotropic quadratic formPrime (order theory)CombinatoricsQuadratic equationSolvable groupSolvable groupRational characterBounded functionQuadratic fieldQuadratic fieldMathematicsJournal of Algebra
researchProduct

Finite State Verifiers with Constant Randomness

2012

We give a new characterization of NL as the class of languages whose members have certificates that can be verified with small error in polynomial time by finite state machines that use a constant number of random bits, as opposed to its conventional description in terms of deterministic logarithmic-space verifiers. It turns out that allowing two-way interaction with the prover does not change the class of verifiable languages, and that no polynomially bounded amount of randomness is useful for constant-memory computers when used as language recognizers, or public-coin verifiers.

Discrete mathematicsFinite-state machine010102 general mathematics0102 computer and information sciencesGas meter prover01 natural sciencesRegular language010201 computation theory & mathematicsBounded functionProbabilistic automaton0101 mathematicsConstant (mathematics)Time complexityRandomnessMathematics
researchProduct