In the present paper, we introduce Eulerian polynomials with parameters a and b and give the definition of them. By using the definition of generating function for our polynomials, we derive some new identities in Analytic Numbers Theory. Also, we give relations between Eulerian polynomials with parameters a and b, Bernstein polynomials, Poly-logarithm functions, Bernoulli and Euler numbers. Mo...

Solvation is an elementary process in nature and is of paramount importance to more sophisticated chemical, biological and biomolecular processes. The understanding of solvation is an essential prerequisite for the quantitative description and analysis of biomolecular systems. This work presents a Lagrangian formulation of our differential geometry based solvation models. The Lagrangian represe...

This paper describes a motion blur technique which can be applied to rendering fluid simulations that are carried out in the Eulerian framework. Existing motion blur techniques can be applied to rigid bodies, deformable solids, clothes, and several other kinds of objects, and produce satisfactory results. As there is no specific reason to discriminate fluids from the above objects, one may cons...

The influence of Eulerian and Lagrangian scales on the turbulent relative dispersion is investigated through a three-dimensional Eulerian consistent Lagrangian stochastic model. As a general property of this class of models, it is found to depend solely on a parameter beta based on the Kolmogorov constants C(K) and C0. This parameter represents the ratio between the Lagrangian and Eulerian scal...

The Schrödinger equation for the four-dimensional double singular oscillator is separable in Eulerian, doble polar and spheroidal coordinates in IR. It is shown that the coefficients for the expansion of double polar basis in terms of the Eulerian basis can be expressed through the Clebsch-Gordan coefficients of the group SU(2) analytically continued to real values of their arguments. The coeff...

Labeled graphs, in which edges are labeled by letters from some alphabet Σ, are extensively used to model many types of relations associated with actions, costs, owners, or other properties. Each path in a labeled graph induces a word in Σ∗ – the one obtained by concatenating the letters along the edges in the path. Classical graph-theory problems give rise to new problems that take these words...

Eulerian poset is a basic and widely used combinatorial concept. It is the combinatorial version of manifolds and has the analogue of the Poincaré duality in the form of the DehnSommerville equations (linear relations among f -vectors). The concept has always been defined in the combinatorial language. As a topologist, my main insight is that a poset is Eulerian if and only if its underlying po...

A dual-eulerian graph is a plane graph which has an ordering defined on its edge set which forms simultaneously an Euler circuit in the graph and an euler circuit in the dual graph. Dual-eulerian graphs were defined and studied in the context of silicon optimization of cmos layouts. They are necessarily of low connectivity with exponentially many planar embeddings. We give a polynomial time alg...

2. Main result. By an eulerian digraph we mean a digraph in which the in-degree is equal to the out-degree at each vertex. Let ED ME ( n, t) be the number of labelled loop-free eulerian digraphs with n vertices in which the multiplicity of each edge is at most t. Allowing loops would multiply ED ME (n, t) by exactly (t + 1) n, since loops do not affect the eulerian property. For the case where ...

Not every graph has an Eulerian tour. But every finite, strongly connected graph has a multi-Eulerian tour, which we define as a closed path that uses each directed edge at least once, and uses edges e and f the same number of times whenever tail(e) = tail(f). This definition leads to a simple generalization of the BEST Theorem. We then show that the minimal length of a multi-Eulerian tour is b...