An undirected graph is Eulerian if it is connected and all its vertices are of even degree. Similarly, a directed graph is Eulerian, if for each vertex its in-degree is equal to its out-degree. It is well known that Eulerian graphs can be recognized in polynomial time while the problems of finding a maximum Eulerian subgraph or a maximum induced Eulerian subgraph are NP-hard. In this paper, we ...

This paper presents a new approach for the geometrically nonlinear analysis of thin-walled space frames. The proposed approach employs an Eulerian (convected) system for the definition of local element freedoms, and is capable of representing the effects of large displacements, finite rotations and cross-sectional warping. The use of the Eulerian system has been shown to be advantageous in the ...

Consider an undirected Eulerian graph, a graph in which each vertex has even degree. An Eulerian orientation of the graph is an orientation of its edges such that for each vertex v, the number of incoming edges of v equals to outgoing edges of v, i.e. din(v) = dout(v). Let P0 denote the set of all Eulerian orientations of graph G. In this paper, we are concerned with the questions of sampling u...

We derive a non-dimensional metric to quantify the expected Lagrangian persistence of objectively defined Eulerian vortices in two-dimensional unsteady flows. This persistence metric is the averaged deviation of the vorticity from its spatial mean over the Eulerian vortex, normalized by the instantaneous material leakage from the Eulerian vortex. The metric offers a modeland frame-independent t...

Problems involving a transition between dense and dilute dispersed phase regimes often require hybridization of Eulerian-Eulerian (EE) Eulerian-Lagrangian (EL) methods for accurate efficient computational modeling. A hybrid EE-EL formulation is developed in this work from first principles, which asymptotes to well-established EE EL limiting conditions. smooth dynamic criterion corresponding alg...

Sum-free enumerative formulae are derived for several classes of rooted planar maps with no vertices of odd valency (eulerian maps) and with two vertices of odd valency (unicursal maps). As corollaries we obtain simple formulae for the numbers of unrooted eulerian and unicursal planar maps. Also, we obtain a sum-free formula for the number of rooted bi-eulerian (eulerian and bipartite) maps and...

Using the theory of exponential Riordan arrays and orthogonal polynomials, we demonstrate that the Eulerian polynomials and the shifted Eulerian polynomials are moment sequences for a simple family of orthogonal polynomials. The coefficient arrays of these families of orthogonal polynomials are shown to be exponential Riordan arrays. Using the theory of orthogonal polynomials we are then able t...

A new approach to cosmological hydrodynamics is discussed which is based on a moving, quasi-Lagrangian mesh. The softened Lagrangian hydrodynamics (SLH) method utilizes a high resolution Lagrangian hydrodynamic code combined with a low resolution Eulerian solver to deal with severe mesh distortions. Most of the volume of a simulation is treated with the Lagrangian code and only in sites where t...