Search results for "Crete"
showing 10 items of 2495 documents
Some remarks on the category SET(L), part III
2004
This paper considers the category SET(L) of L-subsets of sets with a fixed basis L and is a continuation of our previous investigation of this category. Here we study its general properties (e.g., we derive that the category is a topological construct) as well as some of its special objects and morphisms.
Dichotomies properties on computational complexity of S-packing coloring problems
2015
This work establishes the complexity class of several instances of the S -packing coloring problem: for a graph G , a positive integer k and a nondecreasing list of integers S = ( s 1 , ? , s k ) , G is S -colorable if its vertices can be partitioned into sets S i , i = 1 , ? , k , where each S i is an s i -packing (a set of vertices at pairwise distance greater than s i ). In particular we prove a dichotomy between NP-complete problems and polynomial-time solvable problems for lists of at most four integers.
Weak regularity of functions and sets in Asplund spaces
2006
Abstract In this paper, we study a new concept of weak regularity of functions and sets in Asplund spaces. We show that this notion includes prox-regular functions, functions whose subdifferential is weakly submonotone and amenable functions in infinite dimension. We establish also that weak regularity is equivalent to Mordukhovich regularity in finite dimension. Finally, we give characterizations of the weak regularity of epi-Lipschitzian sets in terms of their local representations.
Scaling properties of topologically random channel networks
1996
Abstract The analysis deals with the scaling properties of infinite topologically random channel networks (ITRNs) fast introduced by Shreve (1967, J. Geol. , 75: 179–186) to model the branching structure of rivers as a random process. The expected configuration of ITRNs displays scaling behaviour only asymptotically, when the ruler (or ‘yardstick’) length is reduced to a very small extent. The random model can also reproduce scaling behaviour at larger ruler lengths if network magnitude and diameter are functionally related according to a reported deterministic rule. This indicates that subsets of rrRNs can be scaling and, although rrRNs are asymptotically plane-filling due to the law of la…
Dirichlet Forms, Poincaré Inequalities, and the Sobolev Spaces of Korevaar and Schoen
2004
We answer a question of Jost on the validity of Poincare inequalities for metric space-valued functions in a Dirichlet domain. We also investigate the relationship between Dirichlet domains and the Sobolev-type spaces introduced by Korevaar and Schoen.
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…
Lagrangians, Hamiltonians and Noether’s Theorem
2015
This chapter is intended to remind the basic notions of the Lagrangian and Hamiltonian formalisms as well as Noether’s theorem. We shall first start with a discrete system with N degrees of freedom, state and prove Noether’s theorem. Afterwards we shall generalize all the previously introduced notions to continuous systems and prove the generic formulation of Noether’s Theorem. Finally we will reproduce a few well known results in Quantum Field Theory.
A formal proof of the ε-optimality of absorbing continuous pursuit algorithms using the theory of regular functions
2014
Published version of an article from the journal: Applied Intelligence. Also available on Springerlink: http://dx.doi.org/10.1007/s10489-014-0541-1 The most difficult part in the design and analysis of Learning Automata (LA) consists of the formal proofs of their convergence accuracies. The mathematical techniques used for the different families (Fixed Structure, Variable Structure, Discretized etc.) are quite distinct. Among the families of LA, Estimator Algorithms (EAs) are certainly the fastest, and within this family, the set of Pursuit algorithms have been considered to be the pioneering schemes. Informally, if the environment is stationary, their ε-optimality is defined as their abili…
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.
Strongly invertible links and divides
2008
Abstract To a proper generic immersion of a finite number of copies of the unit interval in a 2-disc, called a divide, A’Campo associates a link in S 3 . From the more general notion of ordered Morse signed divides, one obtains a braid presentation of links of divides. In this paper, we prove that every strongly invertible link is isotopic to the link of an ordered Morse signed divide. We give fundamental moves for ordered Morse signed divides and show that strongly invertible links are equivalent if and only if we can pass from one ordered Morse signed divide to the other by a sequence of such moves. Then we associate a polynomial to an ordered Morse signed divide, invariant for these move…