Any bipartite Eulerian graph, any Eulerian graph with evenly many vertices, and any bipartite graph with evenly many vertices and edges, has an even number of spanning trees. More generally, a graph has evenly many spanning trees if and only if it has an Eulerian edge cut. ∗Work supported in part by NSF grant CCR-9258355 and by matching funds from Xerox Corp.

We introduce new recurrences for the type B and type D Eulerian polynomials, and interpret them combinatorially. These recurrences are analogous to a well-known recurrence for the type A Eulerian polynomials. We also discuss their relationship to polynomials introduced by Savage and Visontai in connection to the real-rootedness of the corresponding Eulerian polynomials.

Here presented is constructive generalization of exponential Euler polynomial and exponential splines based on the interrelationship between the set of concepts of Eulerian polynomials, Eulerian numbers, and Eulerian fractions and the set of concepts related to spline functions. The applications of generalized exponential Euler polynomials in series transformations and expansions are also given.

This paper describes RHALE, a multi-material arbitrary Lagrangian-Eulerian (MMALE) shock physics code. RHALE is the successor to CTH, Sandia’s 3-D Eulerian shock physics code, and will be capable of solving problems that CTH cannot adequately address. We discuss the Lagrangian solid mechanics capabilities of RHALE, which include arbitrary mesh connectivity, superior artificial viscosity, and im...

This review article aims to provide a comprehensive and understandable account of the theoretical foundation, modeling issues, and numerical implementation of the Lagrangian–Eulerian (LE) approach for multiphase flows. The LE approach is based on a statistical description of the dispersed phase in terms of a stochastic point process that is coupled with an Eulerian statistical representation of...

Abstract In this paper, we explore the interrelationship between Eulerian numbers and B splines. Specifically, using B splines, we give the explicit formulas of the refined Eulerian numbers, and descents polynomials. Moreover, we prove that the coefficients of descent polynomials D d (t) are logconcave. This paper also provides a new approach to study Eulerian numbers and descent polynomials.

A graph is subeulerian if it is spanned by an eulerian supergraph. Boesch, Suffel and Tindell have characterized the class of subeulerian graphs and determined the minimum number of additional lines required to make a subeulerian graph eulerian. In this paper, we consider the related notion of a subsemi-eulerian graph, i.e. a graph which is spanned by a supergraph having an open trail containin...

The Stochastic Eulerian Tour Problem was introduced in 2008 [1] as a stochastic variant of the well-known Eulerian Tour Problem. In a follow-up paper the same authors investigated some heuristics for solving the Stochastic Eulerian Tour Problem [2]. After a thorough study of these two publications a few issues emerged. In this short research commentary we would like to discuss these issues. For...

Numerical modeling of machining processes is of significance in the parametric analysis and optimization of their performance. In this paper, a finite element-based model of abrasive waterjet (AWJ) cutting of a ductile material is presented with the help of an explicit, nonlinear finite element method. In this model, both solid-solid interaction and fluid-structure interaction are considered. T...