Related papers: Counting Planar Eulerian Orientations
We introduce an algorithm to compute the functions belonging to a suitable set ${\mathscr F}$ defined as follows: $f\in {\mathscr F}$ means that $f(s,x)$, $s\in A\subset {\mathbb R}$ being fixed and $x>0$, has a power series expansion…
The mechanics of an oriented point (point with "spin") based on 3D and 4D Frenet equations is considered. In such mechanics there is an opportunity to describe formally any physical trajectory of a particle with own rotation. We use…
We introduce a new array of type $D$ Eulerian numbers, different from that studied by Brenti, Chow and Hyatt. We find in particular the recurrence relation, Worpitzky formula and the generating function. We also find the probability…
We consider random normal matrix and planar symplectic ensembles, which can be interpreted as two-dimensional Coulomb gases having determinantal and Pfaffian structures, respectively. For general radially symmetric potentials, we derive the…
We compute the generating function of random planar quadrangulations with three marked vertices at prescribed pairwise distances. In the scaling limit of large quadrangulations, this discrete three-point function converges to a simple…
The theory of orthogonal polynomials on the unit circle is developed for a general class of weights leading to systems of recurrence relations and derivatives of the polynomials and their associated functions, and to functional-difference…
The exponential generating function of ordinary generating functions of diagonal sequences of general Sheffer triangles is computed by an application of Lagrange's theorem. For the special Jabotinsky type this is already known. An analogous…
We conclude our work [arXiv:2403.07628, arXiv:2503.12644] on asymptotic expansions at the soft edge for the classical $n$-dimensional Gaussian and Laguerre ensembles, now studying the gap-probability generating functions. We show that the…
Five simple guidelines are proposed to compute the generating function for the nonnegative integer solutions of a system of linear inequalities. In contrast to other approaches, the emphasis is on deriving recurrences. We show how to use…
This paper introduces an efficient algorithm for computing the general oscillatory matrix functions. These computations are crucial for solving second-order semi-linear initial value problems. The method is exploited using the scaling and…
In this paper, we define the notion of descent for the paths in the $p$-Bratteli diagram. This leads to the definition of $p^{k}$-Eulerian polynomials, whose coefficients count the number of paths with a given number of descents. We provide…
We study an abstract setting for cutting planes for integer programming called the infinite group problem. In this abstraction, cutting planes are computed via cut generating function that act on the simplex tableau. In this function space,…
Let $p_k(n)$ be given by the $k$-th power of the Euler Product $\prod _{n=1}^{\infty}(1-q^n)^k=\sum_{n=0}^{\infty}p_k(n)q^{n}$. By investigating the properties of the modular equations of the second and the third order under the Atkin…
Following the ideas of L. Carlitz we introduce a generalization of the Bernoulli and Eulerian polynomials of higher order to vectorial index and argument. These polynomials are used for computation of the vector partition function $W({\bf…
Let $(M,g)$ be a compact Riemann surface with no boundary and $u=(u_1,...,u_n)$ be a solution of the following singular Liouville system: \begin{equation*} \Delta_g u_i+\sum_{j=1}^na_{ij}\rho_j(\frac{h_je^{u_j}}{\int_M h_j…
The generating function method that we had developing has various applications in physics and not only interress undergraduate students but also physicists. We solve simply difficult problems or unsolved commonly used in quantum, nuclear…
More than 150 years after their invention by Hamilton, quaternions are now widely used in the aerospace and computer animation industries to track the paths of moving objects undergoing three-axis rotations. It is shown here that they…
Starting from the moment sequences of classical orthogonal polynomials we derive the orthogonality purely algebraically. We consider also the moments of ($q=1$) classical orthogonal polynomials, and study those cases in which the…
Given an undirected graph G, the edge orientation problem asks for assigning a direction to each edge to convert G into a directed graph. The aim is to minimize the maximum out degree of a vertex in the resulting directed graph. This…
Consider an undirected graph $G = (VG, EG)$ and a set of six \emph{terminals} $T = \set{s_1, s_2, s_3, t_1, t_2, t_3} \subseteq VG$. The goal is to find a collection $\calP$ of three edge-disjoint paths $P_1$, $P_2$, and $P_3$, where $P_i$…