Search results for " set"
showing 10 items of 2095 documents
Verbal sets and cyclic coverings
2010
Abstract We consider groups G such that the set of all values of a fixed word w in G is covered by a finite set of cyclic subgroups. Fernandez-Alcober and Shumyatsky studied such groups in the case when w is the word [ x 1 , x 2 ] , and proved that in this case the corresponding verbal subgroup G ′ is either cyclic or finite. Answering a question asked by them, we show that this is far from being the general rule. However, we prove a weaker form of their result in the case when w is either a lower commutator word or a non-commutator word, showing that in the given hypothesis the verbal subgroup w ( G ) must be finite-by-cyclic. Even this weaker conclusion is not universally valid: it fails …
Vector-valued meromorphic functions
2002
A locally complete locally convex space E satisfies that every weakly meromorphic function defined on an open subset of \( \mathbb{C} \) with values in E is meromorphic if and only if E does not contain a countable product of copies of \( \mathbb{C} \). A characterization of locally complete spaces in the spirit of known characterizations of the (metric) convex compactness property is also given.
Basis-set completeness profiles in two dimensions
2002
A two-electron basis-set completeness profile is proposed by analogy with the one-electron profile introduced by D. P. Chong (Can J Chem 1995, 73, 79). It is defined as Y(alpha, beta) = sigmam sigman (Galpha(1)Gbeta(2)/(1/r12)/ psim(1)psin(2)) (psim(1)psin(2)/r12/Galpha(1)Gp(2)) and motivated by the expression for the basis-set truncation correction that occurs in the framework of explicitly correlated methods (Galpha is a scanning Gaussian-type orbital of exponent alpha and [psim] is the orthonormalized one-electron basis under study). The two-electron basis-set profiles provide a visual assessment of the suitability of basis sets to describe electron-correlation effects. Furthermore, they…
Using Search Algorithms for Modeling Economic Processes
2013
Abstract Economic issues are placed in formal practice, when is desired a modelling of the economic process, a manufacturing process, a device, etc. Each share of that economic process is denoted by a, b, c, d, these actions with defined time periods and action pairs are formed strings of the form, ab * cab * bc ., ab, bb, bc. so for them there are no other restrictions. If the graph is viewed as a system image, nodes representing components, then an immediate interpretation of an arc (xi, xj) are the component xi that is said to directly influence component xj. If nodes have the significance of possible states of a system when a spring (xi.xj) means that, the system can jump from state xi …
Degree of monotonicity in aggregation process
2010
In this paper we introduce a fuzzy order relation notion in the description of aggregation process. Namely, we use the fuzzy order relation to define the degree of monotonicity, which is equal to 1 for a monotone function with respect to a crisp order relation. In that case, integration of fuzzy order relation allows us to generalize the notion of monotonicity and we try to investigate the benefits of using fuzzy relations instead of a crisp relation. Further we illustrate this definition by examples and study the properties of aggregation functions which have a certain degree of monotonicity.
The branch set of a quasiregular mapping between metric manifolds
2016
Abstract In this note, we announce some new results on quantitative countable porosity of the branch set of a quasiregular mapping in very general metric spaces. As applications, we solve a recent conjecture of Fassler et al., an open problem of Heinonen–Rickman, and an open question of Heinonen–Semmes.
Witness computation for solving geometric constraint systems
2014
International audience; In geometric constraint solving, the constraints are represented with an equation system F(U, X) = 0, where X denotes the unknowns and U denotes a set of parameters. The target solution for X is noted XT. A witness is a couple (U_W, X_W) such that F(U_W, X_W) = 0. The witness is not the target solution, but they share the same combinatorial features, even when the witness and the target lie on two distinct connected components of the solution set of F(U, X) = 0. Thus a witness enables the qualitative study of the system: the detection of over- and under-constrained systems, the decomposition into irreducible subsystems, the computation of subsystems boundaries. This …
Introduction to generalized topological spaces
2011
[EN] We introduce the notion of generalized topological space (gt-space). Generalized topology of gt-space has the structure of frame and is closed under arbitrary unions and finite intersections modulo small subsets. The family of small subsets of a gt-space forms an ideal that is compatible with the generalized topology. To support the definition of gt-space we prove the frame embedding modulo compatible ideal theorem. Weprovide some examples of gt-spaces and study key topological notions (continuity, separation axioms, cardinal invariants) in terms of generalized spaces.
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…
Approximate convex hull of affine iterated function system attractors
2012
International audience; In this paper, we present an algorithm to construct an approximate convex hull of the attractors of an affine iterated function system (IFS). We construct a sequence of convex hull approximations for any required precision using the self-similarity property of the attractor in order to optimize calculations. Due to the affine properties of IFS transformations, the number of points considered in the construction is reduced. The time complexity of our algorithm is a linear function of the number of iterations and the number of points in the output convex hull. The number of iterations and the execution time increases logarithmically with increasing accuracy. In additio…