Related papers: The boundary of the Eulerian number triangle
In this paper we consider a fully third order nonlinear boundary value problem which is of great interest of many researchers. First we establish the existence, uniqueness of solution. Next, we propose simple iterative methods on both…
The generalized Lucas numbers are polynomials in two variables with nonnegative integer coefficients. Lucas versions of some combinatorial numbers with known formulas in terms of quotient and products of nonnegative integers have been…
Everyone knows that the Euler characteristic of a combinatorial manifold is given by the alternating sum of its numbers of simplices. It is shown that there are other linear combinations of the numbers of simplices which are combinatorial…
This paper focuses on computing the directional extremal boundary of a union of equal-radius circles. We introduce an efficient algorithm that accurately determines this boundary by analyzing the intersections and dominant relationships…
The numbers of even and odd permutations with a given ascent number are investigated using an operator that was previously introduced by the author. Their difference is called a signed Eulerian number. By means of the operator the…
A "truncation" of Pascal's triangle is a triangular array of numbers that satisfies the usual Pascal recurrence but with a boundary condition that declares some terminal set of numbers along each row of the array to be zero. Presented here…
We prove that properly rescaled large planar Eulerian triangulations converge to the Brownian map. This result requires more than a standard application of the methods that have been used to obtain the convergence of other families of…
We derive explicit formulas for the matroidal mixed Eulerian numbers. We resolve a question posed by Berget, Spink, and Tseng, demonstrating that the invariant defined by matroidal mixed Eulerian numbers is precisely equivalent to Derksen's…
We consider the problem of sampling from the uniform distribution on the set of Eulerian orientations of subgraphs of the triangular lattice. Although it is known that this can be achieved in polynomial time for any graph, the algorithm…
We make connections of a counting problem of Eulerian cycles for undirected graphs to homological spectral graph theory, and formulate explicitly a trace formula that identifies the number of Eulerian circuits on an Eulerian graph with the…
Many combinatorial and other number triangles are solutions of recurrences of the Graham-Knuth-Patashnik (GKP) type. Such triangles and their defining recurrences are investigated analytically. They are acted on by a transformation group…
We investigate an overdetermined Torsion problem, with a non-constant positively homogeneous boundary constraint on the gradient. We interpret this problem as the Euler equation of a shape optimization problems, we prove existence and…
In this paper, we will define general Eulerian numbers and Eulerian polynomials based on general arithmetic progressions. Under the new definitions, we have been successful in extending several well-known properties of traditional Eulerian…
The Euler scheme is up to date the most important numerical method for ordinary differential inclusions, because the use of the available higher-order methods is prohibited by their enormous complexity after spatial discretization.…
A polynomial triangle is an array whose inputs are the coefficients in integral powers of a polynomial. Although polynomial coefficients have appeared in several works, there is no systematic treatise on this topic. In this paper we plan to…
The Eulerian polynomials enumerate permutations according to their number of descents. We initiate the study of descent polynomials over Cayley permutations, which we call Caylerian polynomials. Some classical results are generalized by…
A threshold graph is any graph which can be constructed from the empty graph by repeatedly adding a new vertex that is either adjacent to every vertex or to no vertices. The Eulerian number $\genfrac{\langle}{\rangle}{0pt}{}{n}{k}$ counts…
In this work, we consider a boundary value problem for nonlinear triharmonic equation. Due to the reduction of nonlinear boundary value problems to operator equation for nonlinear terms we establish the existence, uniqueness and positivity…
A rational linear combination of Chern numbers is an oriented diffeomorphism invariant of smooth complex projective varieties if and only if it is a linear combination of the Euler and Pontryagin numbers. In dimension at least three only…
A method of reducing the problem of the calculation of tree multiparticle cross sections in $\phi^4$ theory to the solution of a singular classical Euclidean boundary value problem is introduced. The solutions are obtained numerically in…