Selectively c.c.c. spaces

We present a study about a natural way of defining a selective version of the c.c.c. property. This definition and some related properties were already considered under different names in other works, such as Daniels et al. (1994) [9], Scheepers (2000) [12]. Here we will present some of its relations with other selective properties and we present some examples that show the differences among the properties considered. We also study the behavior of these properties when the products are considered.     

D.c. sets,d.c. functions and nonlinear equations

Ad.c. set is a set which is the difference of two convex sets. We show that any set can be viewed as the image of a d.c. set under an appropriate linear mapping. Using this universality we can convert any problem of finding an element of a given compact set in ⁿ into one of finding an element of a d.c. set. On the basis of this approach a method is developed for solving a system of nonlinear equations—inequations. Unlike Newton-type methods, our method does not require either convexity, differentiability assumptions or an initial approximate solution.The revision of this paper was produced during the author's stay supported by a Sophia lecturing-research grant at Sophia University (Tokyo, Japan).     

Characterization and recognition of d.c. functions

A function ${f : \Omega \to \mathbb{R}}$ , where Ω is a convex subset of the linear space X, is said to be d.c. (difference of convex) if f =  g ? h with ${g, h : \Omega \to \mathbb{R}}$ convex functions. While d.c. functions find various applications, especially in optimization, the problem to characterize them is not trivial. There exist a few known characterizations involving cyclically monotone set-valued functions. However, since it is not an easy task to check that a given set-valued function is cyclically monotone, simpler characterizations are desired. The guideline characterization in this paper is relatively simple (Theorem 2.1), but useful in various applications. For example, we use it to prove that piecewise affine functions in an arbitrary linear space are d.c. Additionally, we give new proofs to the known results that C ^1,1 functions and lower-C ² functions are d.c. The main goal remains to generalize to higher dimensions a known characterization of d.c. functions in one dimension: A function ${f : \Omega \to \mathbb{R}, \Omega \subset \mathbb{R}}$ open interval, is d.c. if and only if on each compact interval in Ω the function f is absolutely continuous and has a derivative of bounded variation. We obtain a new necessary condition in this direction (Theorem 3.8). We prove an analogous sufficient condition under stronger hypotheses (Theorem 3.11). The proof is based again on the guideline characterization. Finally, we obtain results concerning the characterization of convex and d.c. functions obeying some kind of symmetry.     

On the Classification of Flag-Transitive c.c*- Geometries

Let ( G) be a flag-transitive c.c*-geometry whose point-stabilizer is not an affine group. We list all known examples and show that, if (, G) is a minimal unknown example, then G is an almost simple group and the commutator subgroup G is a simple group of Lie type.     

Energy measures on p.c.f. self-similar sets

On connected post critically finite (p.c.f.) self-similar sets we give a linear extension method to compute the energy measures of harmonic functions with respect to the standard energy, and as an application we also compute the L²$L^2$ dimensions of these measures on some p.c.f. self-similar sets.     

On Flat Flag-Transitive c.c *-Geometries

We study flat flag-transitive c.c ^*-geometries. We prove that, apart from one exception related to Sym(6), all these geometries are gluings in the meaning of [6]. They are obtained by gluing two copies of an affine space over GF(2). There are several ways of gluing two copies of the n-dimensional affine space over GF(2). In one way, which deserves to be called the canonical one, we get a geometry with automorphism group G = 2²ⁿ · L _n(2) and covered by the truncated Coxeter complex of type D ₂ ⁿ . The non-canonical ways give us geometries with smaller automorphism group (G ≤ 2²ⁿ · (2 ^n?1)n) and which seldom (never ?) can be obtained as quotients of truncated Coxeter complexes.     

A superhigh diamond in the c.e. tt-degrees

The notion of superhigh computably enumerable (c.e.) degrees was first introduced by (Mohrherr in Z Math Logik Grundlag Math 32: 5?C12, 1986) where she proved the existence of incomplete superhigh c.e. degrees, and high, but not superhigh, c.e. degrees. Recent research shows that the notion of superhighness is closely related to algorithmic randomness and effective measure theory. Jockusch and Mohrherr proved in (Proc Amer Math Soc 94:123?C128, 1985) that the diamond lattice can be embedded into the c.e. tt-degrees preserving 0 and 1 and that the two atoms can be low. In this paper, we prove that the two atoms in such embeddings can also be superhigh.     

Q 1-degrees of c.e. sets

We show that the Q-degree of a hyperhypersimple set includes an infinite collection of Q ₁-degrees linearly ordered under ${\leq_{Q_1}}$ with order type of the integers and consisting entirely of hyperhypersimple sets. Also, we prove that the c.e. Q ₁-degrees are not an upper semilattice. The main result of this paper is that the Q ₁-degree of a hemimaximal set contains only one c.e. 1-degree. Analogous results are valid for ${\Pi_1^0}$ s ₁-degrees.     

On the bounded quasi‐degrees of c.e. sets

We study the degree structure of bQ‐reducibility and we prove that for any noncomputable c.e. incomplete bQ‐degree a, there exists a nonspeedable bQ‐degree incomparable with it. The structure $\mathcal {D}_{\mbox{bs}}$ of the $\mbox{bs}$‐degrees is not elementary equivalent neither to the structure of the $\mbox{be}$‐degrees nor to the structure of the $\mbox{e}$‐degrees. If c.e. degrees a and b form a minimal pair in the c.e. bQ‐degrees, then a and b form a minimal pair in the bQ‐degrees. Also, for every simple set S there is a noncomputable nonspeedable set A which is bQ‐incomparable with S and bQ‐degrees of S and A does not form a minimal pair.     

Characterization of d.c. functions in terms of quasidifferentials

A characterization of d.c. functions f:Ω→R in terms of the quasidifferentials of f is obtained, where Ω is an open convex set in a real Banach space. Recall that f is called d.c. (difference of convex) if it can be represented as a difference of two finite convex functions. The relation of the obtained results with known characterizations is discussed, specifically the ones from [R. Ellaia, A. Hassouni, Characterization of nonsmooth functions through their generalized gradients, Optimization 22 (1991), 401-416] in the finite-dimensional case and [A. Elhilali Alaoui, Caractérisation des fonctions DC, Ann. Sci. Math. Québec 20 (1996), 1-13] in the case of a Banach space.     

On the equations defining toric l.c.i.-singularities

Based on Nakajima's Classification Theorem we describe the precise form of the binomial equations which determine toric locally complete intersection (``l.c.i.') singularities.

     

Graphs with the n‐e.c. adjacency property constructed from resolvable designs

Only recently have techniques been introduced that apply design theory to construct graphs with the n‐e.c. adjacency property. We supply a new random construction for generating infinite families of finite regular n‐e.c. graphs derived from certain resolvable Steiner 2‐designs. We supply an extension of our construction to the infinite case, and thereby give a new representation of the infinite random graph. We describe a family of deterministic graphs in infinite affine planes which satisfy the 3‐e.c. property. © 2009 Wiley Periodicals, Inc. J Combin Designs 17: 294–306, 2009     

A Splitting with Infimum in the d‐c. e. Degrees

In this paper we prove that any c. e. degree is splittable with an c. e. infimum over any lesser c. e. degree in the class of d‐c. e. degrees.     

On the existence of universal numberings for finite families of d.c.e. sets

We investigate properties of universal numberings of finite families of d.c.e. sets. We show different cases of finite families of d.c.e. sets for which there is a universal numbering and for which there is not.     

A method for solving d.c. programming problems. Application to fuel mixture nonconvex optimization problem

We present a numerical method for solving the d.c. programming problem

Selections for quasi-l.s.c. mappings with uniformly equi-LC n range

Every quasi-lower semi-continuous (q.l.s.c.) mapping admits a lower semi-continuous (l.s.c.) selection preserving all important (from the selection point of view) properties of the former mapping. Special-type extensions of l.s.c. mappings are established on this base.     

A Method for Converting a Class of Univariate Functions into d.c. Functions

D.c. functions are functions that can be expressed as the sum of a concave function and a convex function (or as the difference of two convex functions). In this paper, we extend the class of univariate functions that can be represented as d.c. functions. This expanded class is very broad including a large number of nonlinear and/or nonsmooth univariate functions. In addition, the procedure specifies explicitly the functional and numerical forms of the concave and convex functions that comprise the d.c. representation of the univariate functions. The procedure is illustrated using two numerical examples. Extensions of the conversion procedure for discontinuous univariate functions is also discussed.     

There is no low maximal d. c. e. degree – Corrigendum

We give a corrected proof of an extension of the Robinson Splitting Theorem for the d. c. e. degrees. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)