Adjoint Complement to the Universal Momentum Law of the Wall

The paper is devoted to an adjoint complement to the universal Law of the Wall (LoW) for fluid dynamic momentum boundary layers. The latter typically follows from a strongly simplified, unidirectional shear flow under a constant stress assumption. We first derive the adjoint companion of the simplified momentum equation, while distinguishing between two strategies. Using mixing-length arguments, we demonstrate that the frozen turbulence strategy and a LoW-consistent (differentiated) approach provide virtually the same adjoint momentum equations, that differ only in a single scalar coefficient controlling the inclination in the logarithmic region. Moreover, it is seen that an adjoint LoW can be derived which resembles its primal counterpart in many aspects. The strategy is also compatible with wall-function assumptions for prominent RANS-type two-equation turbulence models, which ground on the mixing-length hypothesis. As a direct consequence of the frequently employed assumption that all primal flow properties algebraically scale with the friction velocity, it is demonstrated that a simple algebraic expression provides a consistent closure of the adjoint momentum equation in the logarithmic layer. This algebraic adjoint closure might also serve as an approximation for more general adjoint flow optimization studies using standard one- or two-equation Boussinesq-viscosity models for the primal flow. Results obtained from the suggested algebraic closure are verified against the primal/adjoint LoW formulations for both, low- and high-Re settings. Applications included in this paper refer to two- and three-dimensional shape optimizations of internal and external engineering flows. Related results indicate that the proposed adjoint algebraic turbulence closure accelerates the optimization process and provides improved optima at no computational surplus in comparison to the frozen turbulence approach.

A link between minimal value set polynomials and tamely ramified towers of function fields over finite fields

In this paper, we introduce the notions of [Formula: see text]-polynomial and [Formula: see text]-minimal value set polynomial where [Formula: see text] is a polynomial over a finite field [Formula: see text] and [Formula: see text] is a finite subset of an algebraic closure of [Formula: see text]. We study some properties of these polynomials and we prove that the polynomials used by Garcia, Stichtenoth and Thomas in their work on good recursive tame towers are [Formula: see text]-minimal value set polynomials for [Formula: see text], whose [Formula: see text]-value sets can be explicitly computed in terms of the monomial [Formula: see text].

L-fuzzy cosets in universal algebras

In this paper, we introduce the notion of fuzzy costs in a more general context, in universal algebra by the use of coset terms. We study the structure of fuzzy cosets by applying the general theory of algebraic fuzzy systems. Fuzzy cosets generated by a fuzzy set are characterized in different ways. It is also proved that the class of fuzzy cosets determined by an element forms an algebraic closure fuzzy set system. Finally, we give a set of necessary and sufficient conditions for a given variety of algebras to be congruence permutable by applying the theory of fuzzy cosets.

Intermediate rings of complex-valued continuous functions

<p>For a completely regular Hausdorff topological space X, let C(X, C) be the ring of complex-valued continuous functions on X, let C ∗ (X, C) be its subring of bounded functions, and let Σ(X, C) denote the collection of all the rings that lie between C ∗ (X, C) and C(X, C). We show that there is a natural correlation between the absolutely convex ideals/ prime ideals/maximal ideals/z-ideals/z ◦ -ideals in the rings P(X, C) in Σ(X, C) and in their real-valued counterparts P(X, C) ∩ C(X). These correlations culminate to the fact that the structure space of any such P(X, C) is βX. For any ideal I in C(X, C), we observe that C ∗ (X, C)+I is a member of Σ(X, C), which is further isomorphic to a ring of the type C(Y, C). Incidentally these are the only C-type intermediate rings in Σ(X, C) if and only if X is pseudocompact. We show that for any maximal ideal M in C(X, C), C(X, C)/M is an algebraically closed field, which is furthermore the algebraic closure of C(X)/M ∩C(X). We give a necessary and sufficient condition for the ideal CP (X, C) of C(X, C), which consists of all those functions whose support lie on an ideal P of closed sets in X, to be a prime ideal, and we examine a few special cases thereafter. At the end of the article, we find estimates for a few standard parameters concerning the zero-divisor graphs of a P(X, C) in Σ(X, C).</p>

On n-dependent groups and fields II

We continue the study of n-dependent groups, fields and related structures, largely motivated by the conjecture that every n-dependent field is dependent. We provide evidence toward this conjecture by showing that every infinite n-dependent valued field of positive characteristic is henselian, obtaining a variant of Shelah’s Henselianity Conjecture in this case and generalizing a recent result of Johnson for dependent fields. Additionally, we prove a result on intersections of type-definable connected components over generic sets of parameters in n-dependent groups, generalizing Shelah’s absoluteness of $G^{00}$ in dependent theories and relative absoluteness of $G^{00}$ in $2$ -dependent theories. In an effort to clarify the scope of this conjecture, we provide new examples of strictly $2$ -dependent fields with additional structure, showing that Granger’s examples of non-degenerate bilinear forms over dependent fields are $2$ -dependent. Along the way, we obtain some purely model-theoretic results of independent interest: we show that n-dependence is witnessed by formulas with all but one variable singletons; provide a type-counting criterion for $2$ -dependence and use it to deduce $2$ -dependence for compositions of dependent relations with arbitrary binary functions (the Composition Lemma); and show that an expansion of a geometric theory T by a generic predicate is dependent if and only if it is n-dependent for some n, if and only if the algebraic closure in T is disintegrated. An appendix by Martin Bays provides an explicit isomorphism in the Kaplan-Scanlon-Wagner theorem.

On computable aspects of algebraic and definable closure

We investigate the computability of algebraic closure and definable closure with respect to a collection of formulas. We show that for a computable collection of formulas of quantifier rank at most $n$, in any given computable structure, both algebraic and definable closure with respect to that collection are $\varSigma ^0_{n+2}$ sets. We further show that these bounds are tight.

An Explicit Algebraic Closure for Passive Scalar-Flux: Applications in Channel Flows at a Wide Range of Reynolds Numbers

In this paper, we propose an algebraic model for turbulent scalar-flux vector that stems from tensor representation theory. The resulting closure contains direct dependence on mean velocity gradients and quadratic products of the Reynolds stress tensor. Model coefficients are determined from Direct Numerical Simulations (DNS) data of homogeneous shear flows subjected to arbitrary mean scalar gradient orientations, while a correction function was applied at one model coefficient based on a turbulent channel flow case. Model performance is evaluated in Poiseuille and Couette flows at several Reynolds numbers for Pr=0.7, along with a case at a higher Prandtl number (Pr=7.0) that typically occurs in water–boundary interaction applications. Overall, the proposed model provides promising results for wide near-wall interaction applications. To put the performance of the proposed model into context, we compare with Younis algebraic model, which is known to provide reasonable predictions for several engineering flows.

On Fuzzy Deductive Systems of Hilbert Algebras

In this paper, we study fuzzy deductive systems of Hilbert algebras whose truth values are in a complete lattice satisfying the infinite meet distributive law. Several characterizations are obtained for fuzzy deductive systems generated by a fuzzy set. It is also proved that the class of all fuzzy deductive systems of a Hilbert algebra forms an algebraic closure fuzzy set system. Furthermore, we obtain a lattice isomorphism between the class of fuzzy deductive systems and the class of fuzzy congruence relations in the variety of Hilbert algebras.