Related papers: The boundary of the Eulerian number triangle
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (globally) a discrete energy involving mean curvature. Although we…
In this paper we study properties of numbers $K_n^l$ of connected components of bifurcation diagrams for multiboundary singularities $B_n^l$. These numbers generalize classic Bernoulli-Euler numbers. We prove a recurrent relation on the…
We make a systematic study of matroidal mixed Eulerian numbers which are certain intersection numbers in the matroid Chow ring generalizing the mixed Eulerian numbers introduced by Postnikov. These numbers are shown to be valuative and obey…
In this paper, we study relations among several types of Eulerian polynomials from a combinatorial viewpoint. We establish an identity between the restricted Eulerian polynomials of types $A$ and $B$. As an application, we present a…
In this paper, we are interested in numerical solution of some linear boundary value problems with Dirichlet boundary part, by the means of simulation of random walks. We use a probabilistic interpretation of solution $u$, assuming that the…
In general graph theory, the only relationship between vertices are expressed via the edges. When the vertices are embedded in an Euclidean space, the geometric relationships between vertices and edges can be interesting objects of study.…
We present a topological recursion formula for calculating the intersection numbers defined on the moduli space of open Riemann surfaces. The spectral curve is $x = \frac{1}{2}y^2$, the same as spectral curve used to calculate intersection…
A non-linear differential equation arising from a stochastic process known as branching Brownian motion is considered. We find an explicit solution and show the uniqueness of the solution under some boundedness conditions using…
We study in this paper the continuous and discrete Euler-Lagrange equations arising from a quadratic lagrangian. Those equations may be thought as numerical schemes and may be solved through a matrix based framework. When the lagrangian is…
We use the classical umbral calculus to describe Riordan arrays. Here, a Riordan array is generated by a pair of umbrae, and this provides efficient proofs of several basic results of the theory such as the multiplication rule, the…
A widely investigated subject in combinatorial geometry, originated from Erd\H{o}s, is the following. Given a point set $P$ of cardinality $n$ in the plane, how can we describe the distribution of the determined distances? This has been…
We enumerate rooted triangulations of a sphere with multiple holes by the total number of edges and the length of each boundary component. The proof relies on a combinatorial identity due to W.T. Tutte.
The number of planar Eulerian maps with n edges is well-known to have a simple expression. But what is the number of planar Eulerian orientations with n edges? This problem appears to be difficult. To approach it, we define and count…
The aim of this paper is to study degenerate Eulerian polynomials and degenerate Eulerian numbers, respectively as degenerate versions of the Eulerian polynomials and the Eulerian numbers, and to derive some of their properties.…
We present a formal version of the numbers of vertices, edges, and faces for infinite planar regular triangular meshes of degree r>6. These numbers are defined via Euler summation of sequences obtained from iterated expansions of a convex…
A sequence inverse relationship can be defined by a pair of infinite inverse matrices. If the pair of matrices are the same, they define a dual relationship. Here presented is a unified approach to construct dual relationships via…
We define a triangular array closely related to Stern's diatomic array and show that for a fixed integer $r\geq 1$, the sum $u_r(n)$ of the $r$th powers of the entries in row $n$ satisfy a linear recurrence with constant coefficients. The…
The restricted planar elliptic three body problem models the motion of a massless body under the Newtonian gravitational force of the two other bodies, the primaries, which evolve in Keplerian ellipses. A trajectory is called oscillatory if…
We introduce Eulerian maps with blocked edges as a general way to implement statistical matter models on random maps by a modification of intrinsic distances. We show how to code these dressed maps by means of mobiles, i.e. decorated trees…
We lift to the multivariate Eulerian polynomials the identity implying that univariate Eulerian polynomials are palindromic. As a consequence of this generalization, we obtain nice combinatorial identities that can be directly extracted…