Normal coloring - an equivalent version of Petersen coloring - is a special proper 5-edge-coloring of cubic graphs. Every edge in a normally colored graph is normal, i.e. it uses together with its four neighbours either only three colors or all five colors. Jaeger conjectured that every bridgeless cubic graph has a normal coloring. This conjecture, if true, imply for example Cycle double cover conjecture. Here we solve a weakened version of Jaeger's problem. We are looking for a proper 5-edge-coloring such that at least a part of the edges is normal. We show a coloring of generalized prisms with two thirds of the edges normal and a coloring of graphs without short cycles with almost half of the edges normal. Then we propose a new approach to normal coloring - chains. We use chains to prove that there cannot be only one single mistake in an almost normally colored graph. We also prove some statements about cuts in a normally colored graph which also follow from nowhere-zero Petersen flow. Finally, we examine a four-cycle in a normally colored graph. 1

We say that a~graph admits a~nowhere-zero k-flow if we can assign a~direction and a~positive integer (<k) as a~flow to each edge so that total in-flow into $v$ and total out-flow from $v$ are equal for each vertex $v$. In 1954, Tutte conjectured that every bridgeless graph admits a~nowhere-zero 5-flow and the conjecture is still open. Kochol in his recent papers introduces a~computational method how to prove that a~minimal counterexample cannot contain short circuits (up to length 10). In this Thesis, we provide a~comprehensive view on this method. Moreover, since Kochol does not share his implementation and in order to independently verify the method, we provide our source code that validates Kochol's results and extend them: we prove that any minimal counterexample to the conjecture does not contain any circuit of length less than 12. Powered by TCPDF (www.tcpdf.org)

This essay is an academic justification for a means of producing images explained mainly through ideas of experiential memory.

We study reducibility for nowhere-zero flows. A reducibility proof typically consists of showing that some induced subgraphs cannot appear in a minimum counter-example to some conjecture. We derive algebraic proofs of reducibility. We define variables which in some sense count the number of nowhere-zero flows of certain type in a graph and then deduce equalities and inequalities that must hold for all graphs. We then show how to use these algebraic expressions to prove reducibility. In our case, these inequalities and equalities are linear. We can thus use the well developed theory of linear programming to obtain certificates of these proof. We make publicly available computer programs we wrote to generate the algebraic expressions and obtain the certificates.

We study reducibility for nowhere-zero flows. A reducibility proof typically consists of showing that some induced subgraphs cannot appear in a minimum counter-example to some conjecture. We derive algebraic proofs of reducibility. We define variables which in some sense count the number of nowhere-zero flows of certain type in a graph and then deduce equalities and inequalities that must hold for all graphs. We then show how to use these algebraic expressions to prove reducibility. In our case, these inequalities and equalities are linear. We can thus use the well developed theory of linear programming to obtain certificates of these proof. We make publicly available computer programs we wrote to generate the algebraic expressions and obtain the certificates.

In this paper, we use the following scheme to construct a continuous, nowhere-differentiable function 𝑓 which is the uniform limit of a sequence of sawtooth functions 𝑓ₙ : [0, 1] → [0, 1] with increasingly sharp teeth. Let 𝑋 = [0, 1] x [0, 1] and 𝐹(𝑋) be the Hausdorff metric space determined by 𝑋. We define contraction maps 𝑤₁ , 𝑤₂ , 𝑤₃ on 𝑋. These maps define a contraction map 𝑤 on 𝐹(𝑋) via 𝑤(𝐴) = 𝑤₁(𝐴) ⋃ 𝑤₂(𝐴) ⋃ 𝑤₃(𝐴). The iteration under 𝑤 of the diagonal in 𝑋 defines a sequence of graphs of continuous functions 𝑓ₙ. Since 𝑤 is a contraction map in the compact metric space 𝐹(𝑋), 𝑤 has a unique fixed point. Hence, these iterations converge to the fixed point-which turns out to be the graph of our continuous, nowhere-differentiable function 𝑓. Chapter 2 contains the background we will need to engage our task. Chapter 3 includes two results from the Baire Category Theorem. The first is the well known fact that the set of continuous, nowhere-differentiable functions on [0,1] is a residual set in 𝐶[0,1]. The second fact is that the set of continuous functions on [0,1] which have a dense set of proper local extrema is residual in 𝐶[0,1]. In the fourth and last chapter we actually construct our function and prove it is continuous, nowhere-differentiable and has a dense set of proper local extrema. Lastly we iterate the set {(0,0), (1,1)} under 𝑤 and plot its points. Any terms not defined in Chapters 2 through 4 may be found in [2,4]. The same applies to the basic properties of metric spaces which have not been explicitly stated. Throughout, we will let 𝒩 and 𝕽 denote the natural numbers and the real numbers, respectively.

No description available.

This study examines two &lsquo / socialist&rsquo / utopias of the late 19th century: W. Morris&rsquo / s News from Nowhere and E. Bellamy&rsquo / s Looking Backward. The major concern is to question the validity of title &lsquo / socialist&rsquo / for these two texts. The reference points for such an analysis are: modernity, Marxism of the late 19th century and the practice of discipline. In this context, the intention is to find out ruptures and continuities with respect to the central ideas of socialism and basic premises of modernity. The study explorates that there are serious points of rupture in these two texts with respect to the major premises of modernity, because in Morris&rsquo / s utopia there is a romantic search for restoring communism of the 14th century, in Bellamy&rsquo / s text there are typical reactionary modernist suggestions concerning the nature of typical socialist societies. In that sense, due to the disassociation between socialism and modernity in these two texts, it is very problematic to classify these utopias as socialist. The study also questions whether the sources of such disassociation are embedded in Marxism itself. In response to such question, the study argues that this is the case to a great extent.

“Homeomorphic'' is the standard equivalence relation in topology. To a topologist, spaces which are homeomorphic to each other aren't merely similar to each other, they are the same space. We study a class of functions which are homeomorphic at “most'' of the points of their domains and codomains, but which may fail to satisfy some of the properties required to be a homeomorphism at a “small'' portion of the points of these spaces. Such functions we call “almost homeomorphisms.'' One of the nice properties of almost homeomorphisms is the preservation of almost open sets, i.e. sets which are “close'' to being open, except for a “small'' set of points where the set is “defective.'' We also find a surprising result that all non-empty, perfect, Polish spaces are almost homeomorphic to each other.A standard technique in algebraic topology is to pass between a continuous map between topological spaces and the corresponding homomorphism of fundamental groups using the π1 functor. It is a non-trivial question to ask when a specific homomorphism is induced by a continuous map; that is, what is the image of the π1 functor on homomorphisms?We will call homomorphisms in the image of the π1 functor “tangible homomorphisms'' and call homomorphisms that are not induced by continuous functions “intangible homomorphisms.'' For example, Conner and Spencer used ultrafilters to prove there is a map from HEG to Z2 not induced by any continuous function f : HE→ Y , where Y is some topological space with π1(Y ) = Z2. However, in standard situations, such as when the domain is a simplicial complex, only tangible homomorphisms appear..Our job is to describe conditions when intangible homomorphisms exist and how easily these maps can be constructed. We use methods from Shelah and Pawlikowski to prove that Conner and Spencer could not have constructed these homomorphisms with a weak version of the Axiom of Choice. This leads us to define and examine a class of pathological objects that cannot be constructed without a strong version of the Axiom of Choice, which we call the class of inscrutable objects. Objects that do not need a strong version of the Axiom of Choice are scrutable. We show that the scrutable homomorphisms from the fundamental group of a Peano continuum are exactly the homomorphisms induced by a continuous function.

Název práce: Geometrické lineární a nelineární problémy prostor· funkcí Autor: Petr Petráček Katedra: Katedra matematické analýzy 'kolitel: prof. RNDr. Jaroslav Lukeš, DrSc., Katedra matematické analýzy Abstrakt: Tato práce sestává ze čtyř vědeckých článk·. lánky prezentované v prvních dvou kapitolách se věnují teorii reálných a komplexních L1-preduál·. lánky prezentované v třetí a čtvrté kapitole jsou věnovány problematice line- ability a algebrability podmnožin reálných funkcí a měr. V Kapitole 1 předsta- vujeme charakterizaci komplexních L1-preduál· pomocí komplexního barycent- rického zobrazení. Tato charakterizace je přirozeným rozšířením charakterizace reálných L1 preduál· pocházející od Bednara a Laceyho. V Kapitole 2 odpoví- dáme na otázku položenou Laceym v roce 1973. Dokazujeme přitom existenci kompaktního prostoru K a uzavřeného podprostoru H ⊂ C(K) obsahujícího kon- stantní funkce, pro který platí ∂HK = K, H je maximální vzhledem k ∂HK a H není L1-preduál. V Kapitole 3 se věnujeme lineabilitě množin nikde mono- tonních znaménkových Radonových měr na Rd . Konkrétně dokazujeme existence vektorového prostoru dimenze c jehož každý nenulový prvek je nikde monotonní míra absolutně spojitá vzhledem k d-rozměrné Lebesgueově míře. Nadto dokazu- jeme, že existuje takový lineární prostor, který je hustý...