The Takagi function τ: [0,1] → [0, 1] is a continuous non-differentiable function constructed by Takagi in 1903. The level sets L(y) = x : τ(x) = y of the Takagi function τ(x) are studied by introducing a notion of local level set into which level sets are partitioned. Local level sets are simple to analyze, reducing questions to understanding the relation of level sets to local level sets, which is more complicated. It is known that for a “generic” full Lebesgue measure set of ordinates y, the level sets are finite sets. In contrast, here it is shown for a “generic” full Lebesgue measure set of abscissas x, the level set L(τ(x)) is uncountable. An interesting singular monotone function is constructed associated to local level sets, and is used to show the expected number of local level sets at a random level y is exactly ( 3 2 ).
In @cite_7 we further analyze the structure of global level sets @math using local level sets. We give a new proof of a theorem of Buczolich @cite_13 showing that if one draws @math uniformly from @math , then with probability one the level set @math is a finite set; we improve on it by showing that the expected number of points in such a random" level set @math is infinite. We also complement this result by showing that the set of levels @math having a level set of positive Hausdorff dimension is large" in the sense that it has full Hausdorff dimension @math , although it is of Lebesgue measure @math .
@cite_13 @cite_7
2119842257 2000931246 1611433572 2949304946
Let T be Takagi’s continuous but nowhere-differentiable function. This paper considers the size of the level sets of T both from a probabilistic point of view and from the perspective of Baire category. We first give more elementary proofs of three recently published results. The first, due to Z. Buczolich, states that almost all level sets (with respect to Lebesgue measure on the range of T) are finite. The second, due to J. Lagarias and Z. Maddock, states that the average number of points in a level set is infinite. The third result, also due to Lagarias and Maddock, states that the average number of local level sets contained in a level set is 3 2. In the second part of the paper it is shown that, in contrast to the above results, the set of ordinates y with uncountably infinite level sets is residual, and a fairly explicit description of this set is given. The final result of the paper is an answer to a question of Lagarias and Maddock: it is shown that most level sets (in the sense of Baire category) contain infinitely many local level sets, and that a continuum of level sets even contain uncountably many local level sets. Let f be a random Boolean formula that is an instance of 3-SAT. We consider the problem of computing the least real number k such that if the ratio of the number of clauses over the number of variables of f strictly exceeds k , then f is almost certainly unsatisfiable. By a well-known and more or less straightforward argument, it can be shown that kF5.191. This upper bound was improved by to 4.758 by first providing new improved bounds for the occupancy problem. There is strong experimental evidence that the value of k is around 4.2. In this work, we define, in terms of the random formula f, a decreasing sequence of random variables such that, if the expected value of any one of them converges to zero, then f is almost certainly unsatisfiable. By letting the expected value of the first term of the sequence converge to zero, we obtain, by simple and elementary computations, an upper bound for k equal to 4.667. From the expected value of the second term of the sequence, we get the value 4.601q . In general, by letting the U This work was performed while the first author was visiting the School of Computer Science, Carleton Ž University, and was partially supported by NSERC Natural Sciences and Engineering Research Council . of Canada , and by a grant from the University of Patras for sabbatical leaves. The second and third Ž authors were supported in part by grants from NSERC Natural Sciences and Engineering Research . Council of Canada . During the last stages of this research, the first and last authors were also partially Ž . supported by EU ESPRIT Long-Term Research Project ALCOM-IT Project No. 20244 . †An extended abstract of this paper was published in the Proceedings of the Fourth Annual European Ž Symposium on Algorithms, ESA’96, September 25]27, 1996, Barcelona, Spain Springer-Verlag, LNCS, . pp. 27]38 . That extended abstract was coauthored by the first three authors of the present paper. Correspondence to: L. M. Kirousis Q 1998 John Wiley & Sons, Inc. CCC 1042-9832r98r030253-17 253 Let T be Takagi's continuous but nowhere-differentiable function. It is known that almost all level sets (with respect to Lebesgue measure on the range of T) are finite. We show that the most common cardinality of the level sets of T is two, and investigate in detail the set of ordinates y such that the level set at level y has precisely two elements. As a by-product, we obtain a simple iterative procedure for solving the equation T(x)=y. We show further that any positive even integer occurs as the cardinality of some level set, and investigate which cardinalities occur with positive probability if an ordinate y is chosen at random from the range of T. The key to the results is a system of set equations for the level sets, which are derived from the partial self-similarity of T. These set equations yield a system of linear relationships between the cardinalities of level sets at various levels, from which all the results of this paper flow. Given a discrete random walk on a finite graph @math , the vacant set and vacant net are, respectively, the sets of vertices and edges which remain unvisited by the walk at a given step @math . These sets induce subgraphs of the underlying graph. Let @math be the subgraph of @math induced by the vacant set of the walk at step @math . Similarly, let @math be the subgraph of @math induced by the edges of the vacant net. For random @math -regular graphs @math , it was previously established that for a simple random walk, the graph @math of the vacant set undergoes a phase transition in the sense of the phase transition on Erd os -Renyi graphs @math . Thus, for @math there is an explicit value @math of the walk, such that for @math , @math has a unique giant component, plus components of size @math , whereas for @math all the components of @math are of size @math . We establish the threshold value @math for a phase transition in the graph @math of the vacant net of a simple random walk on a random @math -regular graph. We obtain the corresponding threshold results for the vacant set and vacant net of two modified random walks. These are a non-backtracking random walk, and, for @math even, a random walk which chooses unvisited edges whenever available. This allows a direct comparison of thresholds between simple and modified walks on random @math -regular graphs. The main findings are the following: As @math increases the threshold for the vacant set converges to @math in all three walks. For the vacant net, the threshold converges to @math for both the simple random walk and non-backtracking random walk. When @math is even, the threshold for the vacant net of the unvisited edge process converges to @math , which is also the vertex cover time of the process.