A novel 3D computational model was developed for the turbulent particulate two-phase flow simulation in rectangular channel. The is based on Eulerian approach applied to Reynolds-averaged Navier–Stokes modeling and statistical Probability Distribution Function method. uniqueness of method lies direct calculation normal transverse components Reynolds stresses both gas particles. Two cases were e...

This paper uses the special Cosserat theory of hyperelastic shells satisfying Kirchoff's hypothesis and irrotational flow theory to model the interaction between a heavy thin elastic sheet and an infinite ocean beneath it. From a general discussion of three-dimensional motions, involving an Eulerian description of the flow and a Lagrangian description of the elastic sheet, a special case of two...

Solid rocket motor flows depend strongly on alumina granulometry, which spreads up with coalescence. Solving droplet sizes in unsteady flows is a modeling and numerical challenge, specially when high loadings generate retrocoupling. As an alternative to Lagrangian approaches, the Eulerian Multi-Fluid model describes polydispersity with size-sorted droplet fluids called sections. A two size mome...

The well-known Eulerian path problem can be solved in polynomial time (more exactly, there exists a linear time algorithm for this problem) [3]. In this paper, we model the problem using a string matching framework, and then initiate an algorithmic study on a variant of this problem, called the (2, 1)–STRING–MATCH problem (which is actually a generalization of the Eulerian path problem). Then, ...

In this paper, we evaluate the number of Eulerian circuits that can be obtained by an arbitrary rotation in a Markovian string, i.e., corresponding to a given Markovian type. Since all rotations do not result in an Eulerian circuit, but several of them, called Eulerian components; we also investigate the number of Eulerian components that result from a random rotation in a Markovian string. We ...

recently, e. m'{a}v{c}ajov'{a} and m. v{s}koviera proved that every bidirected eulerian graph which admits a nowhere zero flow, admits a nowhere zero $4$-flow. this result shows the validity of bouchet's nowhere zero conjecture for eulerian bidirected graphs. in this paper we prove the same theorem in a different terminology and with a short and simple proof. more precisely, we p...

The main goal of this work is to establish a bijection between Dyck words and a family of Eulerian digraphs. We do so by providing two algorithms implementing such bijection in both directions. The connection between Dyck words and Eulerian digraphs exploits a novel combinatorial structure: a binary matrix, we call Dyck matrix, representing the cycles of an Eulerian digraph. 1. Background, and ...

An identity of Chung, Graham and Knuth involving binomial coefficients and Eulerian numbers motivates our study of a class of polynomials that we call binomial-Eulerian polynomials. These polynomials share several properties with the Eulerian polynomials. For one thing, they are h-polynomials of simplicial polytopes, which gives a geometric interpretation of the fact that they are palindromic a...