Interface model for non-equilibrium evaporation

A microscopic interface condition for condensing/evaporating interfaces is developed by combining a velocity dependent condensation probability [T. Tsuruta, H. Tanaka, T. Masuoka, Int. J. Heat Mass Transfer 42 (1999) 4107] and Maxwell type interface conditions with accommodation. Using methods from kinetic theory, macroscopic interface conditions for mass and energy transport across the phase boundary are derived. This model only applies to simple substances, where diffusive effects in the bulk phases are not present. The results are compared to classical non-equilibrium thermodynamics. The interface conditions are considered for the limit of small deviation from equilibrium, and the corresponding Onsager coefficients are computed. These results are useful as boundary conditions for non-equilibrium evaporation and condensation problems, as done previously by our group [M. Bond, H. Struchtrup, Phys. Rev. E 70 (2004) 061605].     

Lorentz spaces with variable exponents

We introduce Lorentz spaces and with variable exponents. We prove several basic properties of these spaces including embeddings and the identity . We also show that these spaces arise through real interpolation between and . Furthermore, we answer in a negative way the question posed in 12 whether the Marcinkiewicz interpolation theorem holds in the frame of Lebesgue spaces with variable integrability.     

Simultaneous Domination in Graphs

Let \({F_1, F_2, \ldots, F_k}\) be graphs with the same vertex set V. A subset \({S \subseteq V}\) is a simultaneous dominating set if for every i, 1 ≤ i ≤ k, every vertex of F _i not in S is adjacent to a vertex in S in F _i ; that is, the set S is simultaneously a dominating set in each graph F _i . The cardinality of a smallest such set is the simultaneous domination number. We present general upper bounds on the simultaneous domination number. We investigate bounds in special cases, including the cases when the factors, F _i , are r-regular or the disjoint union of copies of K _r . Further we study the case when each factor is a cycle.     

Distinguishing-Transversal in Hypergraphs and Identifying Open Codes in Cubic Graphs

The open neighborhood N(v) of a vertex v in a graph G is the set of vertices adjacent to v in G. A graph is twin-free (or open identifiable) if every two distinct vertices have distinct open neighborhoods. A separating open code in G is a set C of vertices such that \({N(u) \cap C \neq N(v) \cap C}\) for all distinct vertices u and v in G. An open dominating set, or total dominating set, in G is a set C of vertices such that \({N(u) \cap C \ne N(v) \cap C}\) for all vertices v in G. An identifying open code of G is a set C that is both a separating open code and an open dominating set. A graph has an identifying open code if and only if it is twin-free. If G is twin-free, we denote by \({\gamma^{\rm IOC}(G)}\) the minimum cardinality of an identifying open code in G. A hypergraph H is identifiable if every two edges in H are distinct. A distinguishing-transversal T in an identifiable hypergraph H is a subset T of vertices in H that has a nonempty intersection with every edge of H (that is, T is a transversal in H) such that T distinguishes the edges, that is, \({e \cap T \neq f \cap T}\) for every two distinct edges e and f in H. The distinguishing-transversal number \({\tau_D(H)}\) of H is the minimum size of a distinguishing-transversal in H. We show that if H is a 3-uniform identifiable hypergraph of order n and size m with maximum degree at most 3, then \({20\tau_D(H) \leq 12n + 3m}\) . Using this result, we then show that if G is a twin-free cubic graph on n vertices, then \({\gamma^{\rm IOC}(G) \leq 3n/4}\) . This bound is achieved, for example, by the hypercube.     

A note on composed products of polynomials over finite fields

Brawley and Carlitz introduced the method of composed products in order to construct irreducible polynomials of large degree from polynomials of lower degree. A basic ingredient of their construction is a binary operation on a subset \(G \subseteq {\bar{\mathbb{F }}_{q}}\) having certain properties. In this paper we classify all such binary operations when \(|G|= \infty \) (which is the most interesting case) and show that field addition and field multiplication are essentially the only such operations.     

List Edge‐Coloring and Total Coloring in Graphs of Low Treewidth

We prove that the list chromatic index of a graph of maximum degree Δ and treewidth is Δ; and that the total chromatic number of a graph of maximum degree Δ and treewidth is . This improves results by Meeks and Scott.