On the Number of k‐Dominating Independent Sets

We study the existence and the number of k‐dominating independent sets in certain graph families. While the case namely the case of maximal independent sets—which is originated from Erd?s and Moser—is widely investigated, much less is known in general. In this paper we settle the question for trees and prove that the maximum number of k‐dominating independent sets in n‐vertex graphs is between and if , moreover the maximum number of 2‐dominating independent sets in n‐vertex graphs is between and . Graph constructions containing a large number of k‐dominating independent sets are coming from product graphs, complete bipartite graphs, and finite geometries. The product graph construction is associated with the number of certain Maximum Distance Separable (MDS) codes.     

Analytic and Luzin spaces (non-separable case)

We introduce the concept of κ-analytic and κ-Luzin spaces as images of complete metric spaces by (disjoint) upper semi-continuous compact-valued correspondences which “preserve discreteness” in some sence (Definition in Section 3.1). The case κ = ω coincides with (Lindelöf) analytic spaces studied by Choquet, the first author and others. The main results are characterizations of uniform analytic spaces in terms of other parametrizations, complete sequences of covers, and Suslin subsets of some product of a compact and a complete metric space (Theorems in Section 3.2 and in Section 4), and characterizations of topological analytic spaces as Suslin subsets of paracompact ?ech-complete spaces (Theorem in Section 5).     

Distribution of the maxima of random Takagi functions

This paper concerns the maximum value and the set of maximum points of a random version of Takagi’s continuous, nowhere differentiable function. Let F(x):=∑ _n=1^∞ ε _n ϕ(2 ⁿ⁻¹ x), x ∈ R, where ɛ ₁, ɛ ₂, ... are independent, identically distributed random variables taking values in {−1, 1}, and ϕ is the “tent map” defined by ϕ(x) = 2 dist (x, Z). Let p:= P (ɛ ₁ = 1), M:= max {F(x): x ∈ R}, and := {x ∈ [0, 1): F(x) = M}. An explicit expression for M is given in terms of the sequence {ɛ _n }, and it is shown that the probability distribution μ of M is purely atomic if p < , and is singular continuous if p ≧ . In the latter case, the Hausdorff dimension and the multifractal spectrum of μ are determined. It is shown further that the set is finite almost surely if p < , and is topologically equivalent to a Cantor set almost surely if p ≧ . The distribution of the cardinality of is determined in the first case, and the almost-sure Hausdorff dimension of is shown to be (2p − 1)/2p in the second case. The distribution of the leftmost point of is also given. Finally, some of the results are extended to the more general functions Σa ^{n − 1} ɛ _n ϕ(2 ^{n − 1} x), where 0 < a < 1.      

Irregular 1-sets on the graphs of continuous functions

One can define in a natural way irregular 1-sets on the graphs of several fractal functions, like Takagi’s function, Weierstrass-Cellerier type functions and the typical continuous function. These irregular 1-sets can be useful during the investigation of level-sets and occupation measures of these functions. For example, we see that for Takagi’s function and for certain Weierstrass-Cellerier functions the occupation measure is singular with respect to the Lebesgue measure and for almost every level the level set is finite.     

Critically prime interval orders

We prove that a prime interval order, not necessarily finite, has no prime upper cover if and only if it has width two. On the other hand, we prove that every finite prime N-free order has at least one prime upper cover.     

Stability problem for the Go?a?b-Schinzel type functional equations

Let X be a vector space over a field K of real or complex numbers, n∈N and λ∈K?{0}. We study the stability problem for the Go?a?b-Schinzel type functional equations

f(x+fn(x)y)=λf(x)f(y)     

RESERVOIR DESCRIPTION BY USING A PIECEWISE CONSTANT LEVEL SET METHOD

We consider the permeability estimation problem in two-phase porous media flow. We try to identify the permeability field by utilizing both the production data from wells as well as inverted seismic data. The permeability field is assumed to be piecewise constant, or can be approximated well by a piecewise constant function. A variant of the level set method, called Piecewise Constant Level Set Method is used to represent the interfaces between the regions with different permeability levels. The inverse problem is solved by minimizing a functional, and TV norm regularization is used to deal with the ill-posedness. We also use the operator-splitting technique to decompose the constraint term from the fidelity term. This gives us more flexibility to deal with the constraint and helps to stabilize the algorithm.     

Weak amicable T‐matrices and Plotkin arrays

We introduce the class of weak amicable T‐matrices and use it to construct a class of orthogonal designs, for p = 1 and for p a prime power ≡ 3 (mod 4), and all odd q, q ≤ 21. This class includes new Plotkin arrays of order 24, 40, 56 and for the first time, of orders 8q, q ∈ {9,11,13,15,17,19,21}. © 2006 Wiley Periodicals, Inc. J Combin Designs 16: 44–52, 2008     

Coloring the complements of intersection graphs of geometric figures

Let be the complement of the intersection graph G of a family of translations of a compact convex figure in Rⁿ. When n=2, we show that , where γ(G) is the size of the minimum dominating set of G. The bound on is sharp. For higher dimension we show that , for n?3. We also study the chromatic number of the complement of the intersection graph of homothetic copies of a fixed convex body in Rⁿ.     

Some results on best approximation in spaces with convex structure

Some generalizations of the result proved by S.P Singh[J.Approx.Theory 25(1979),89-90]are presented in convex metric spaces.The results proved contain several known results on the subject.