Existence of Dλ-cycles and Dλ-paths

A cycle of C of a graph G is called a Dλ-cycle if every component of G − V(C) has order less than λ. A Dλ-path is defined analogously. In particular, a D1-cycle is a hamiltonian cycle and a D1-path is a hamiltonian path. Necessary conditions and sufficient conditions are derived for graphs to have a Dλ-cycle or Dλ-path. The results are generalizations of theorems in hamiltonian graph theory. Extensions of notions such as vertex degree and adjacency of vertices to subgraphs of order greater than 1 arise in a natural way

Responsibility and the modern corporation

Corporate governance crises as well as human rights issues in global value chains have pushed notions of Corporate Social Responsibility (CSR), Corporate Citizenship (CC), Triple P (People, Planet, Profit) and sustainable development onto the agenda of corporations and into the discussion of corporate governance. However, it has been argued that the CSR debate tends to rest on rather underspecified conceptions of the public corporation and corporate governance

The Principle of Open Induction on Cantor space and the Approximate-Fan Theorem

The paper is a contribution to intuitionistic reverse mathematics. We work in a weak formal system for intuitionistic analysis. The Principle of Open Induction on Cantor space is the statement that every open subset of Cantor space that is progressive with respect to the lexicographical ordering of Cantor space coincides with Cantor space. The Approximate-Fan Theorem is an extension of the Fan Theorem that follows from Brouwer's principle of induction on bars in Baire space and implies the Principle of Open Induction on Cantor space. The Principle of Open Induction in Cantor space implies the Fan Theorem, but, conversely the Fan Theorem does not prove the Principle of Open Induction on Cantor space. We list a number of equivalents of the Principle of Open Induction on Cantor space and also a number of equivalents of the Approximate-Fan Theorem

Brouwer's Fan Theorem as an axiom and as a contrast to Kleene's Alternative

The paper is a contribution to intuitionistic reverse mathematics. We introduce a formal system called Basic Intuitionistic Mathematics BIM, and then search for statements that are, over BIM, equivalent to Brouwer's Fan Theorem or to its positive denial, Kleene's Alternative to the Fan Theorem. The Fan Theorem is true under the intended intuitionistic interpretation and Kleene's Alternative is true in the model of BIM consisting of the Turing-computable functions. The task of finding equivalents of Kleene's Alternative is, intuitionistically, a nontrivial extension of finding equivalents of the Fan Theorem, although there is a certain symmetry in the arguments that we shall try to make transparent. We introduce closed-and-separable subsets of Baire space and of the set of the real numbers. Such sets may be compact and also positively noncompact. The Fan Theorem is the statement that Cantor space, or, equivalently, the unit interval, is compact, and Kleene's Alternative is the statement that Cantor space, or, equivalently, the unit interval is positively noncompact. The class of the compact closed-and-separable sets and also the class of the closed-and-separable sets that are positively noncompact are characterized in many different ways and a host of equivalents of both the Fan Theorem and Kleene's Alternative is found

On dominating and spanning circuits in graphs

An eulerian subgraph of a graph is called a circuit. As shown by Harary and Nash-Williams, the existence of a Hamilton cycle in the line graph L(G) of a graph G is equivalent to the existence of a dominating circuit in G, i.e., a circuit such that every edge of G is incident with a vertex of the circuit. Important progress in the study of the existence of spanning and dominating circuits was made by Catlin, who defined the reduction of a graph G and showed that G has a spanning circuit if and only if the reduction of G has a spanning circuit. We refine Catlin's reduction technique to obtain a result which contains several known and new sufficient conditions for a graph to have a spanning or dominating circuit in terms of degree-sums of adjacent vertices. In particular, the result implies the truth of the following conjecture of Benhocine et al.: If G is a connected simple graph of order n such that every cut edge of G is incident with a vertex of degree 1 and d(u)+d(v) > 2(1/5n-1) for every edge uv of G, then, for n sufficiently large, L(G) is hamiltonian

Existence of spanning and dominating trails and circuits

Let T be a trail of a graph G. T is a spanning trail (S-trail) if T contains all vertices of G. T is a dominating trail (D-trail) if every edge of G is incident with at least one vertex of T. A circuit is a nontrivial closed trail. Sufficient conditions involving lower bounds on the degree-sum of vertices or edges are derived for graphs to have an S-trail, S-circuit, D-trail, or D-circuit. Thereby a result of Brualdi and Shanny and one mentioned by Lesniak-Foster and Williamson are improved

Cycles containing many vertices of large degree

AbstractLet G be a 2-connected graph of order n, r a real number and Vr=v ϵ V(G)¦d(v)⩾r. It is shown that G contains a cycle missing at most max {0, n − 2r} vertices of Vr, yielding a common generalization of a result of Dirac and one of Shi Ronghua. A stronger conclusion holds if r⩾13(n+2): G contains a cycle C such that either V(C)⊇Vr or ¦ V(C)¦⩾2r. This theorem extends a result of Häggkvist and Jackson and is proved by first showing that if r⩾13(n+2), then G contains a cycle C for which ¦Vr∩V(C)¦is maximal such that N(x)⊆V(C) whenever x ϵ Vr − V(C) (∗). A result closely related to (∗) is stated and a result of Nash-Williams is extended using (∗)

A new calculation of the wake of a flat plate

A new method is presented for the calculation of the wake of a finite flat plate. The method is based upon the recent investigations of the boundary layer near the trailing edge, which led to the triple-deck structure. This multi-layered structure has now been extended to the "classical" wake, which in fact is the continuation of the lowest two layers of the triple-deck. With this new numerical formulation an accuracy of 10-3% can easily be achieved.

The Fan Theorem, its strong negation, and the determinacy of games

IIn the context of a weak formal theory called Basic Intuitionistic Mathematics $\mathsf{BIM}$, we study Brouwer's Fan Theorem and a strong negation of the Fan Theorem, Kleene's Alternative (to the Fan Theorem). We prove that the Fan Theorem is equivalent to contrapositions of a number of intuitionistically accepted axioms of countable choice and that Kleene's Alternative is equivalent to strong negations of these statements. We also discuss finite and infinite games and introduce a constructively useful notion of determinacy. We prove that the Fan Theorem is equivalent to the Intuitionistic Determinacy Theorem, saying that every subset of Cantor space is, in our constructively meaningful sense, determinate, and show that Kleene's Alternative is equivalent to a strong negation of a special case of this theorem. We then consider a uniform intermediate value theorem and a compactness theorem for classical propositional logic, and prove that the Fan Theorem is equivalent to each of these theorems and that Kleene's Alternative is equivalent to strong negations of them. We end with a note on a possibly important statement, provable from principles accepted by Brouwer, that one might call a Strong Fan Theorem.Comment: arXiv admin note: text overlap with arXiv:1106.273

Computer program for the attenuation of high bypass turbofan engine noise

Two computer programs determine effect of boundary layer on attenuation of sound in a circular duct lined with material used in noise suppresion in fan inlet and exhaust ducts of turbofan engines