Related papers: Redundant generating functions in lattice path enu…

We study several-matrix models and show that when the potential is convex and a small perturbation of the Gaussian potential, the first order correction to the free energy can be expressed as a generating function for the enumeration of…

In this work a method is presented to derive the generating functional in path integral form for a system with an arbitrary number of degrees of freedom and constrained by general conditions. The method is applied to the case of the…

Let $c_n$ denote the number of nodes at a distance $n$ from the root of a rooted tree. A criterion for proving the rationality and computing the rational generating function of the sequence $\{c_n\}$ is described. This criterion is applied…

An alternative class of the Lagrangian called the multiplicative form is suc- cessfully derived for a system with one degree of freedom for both non-relativistic and relativistic cases. This new Lagrangian can be considered as a…

We derive the P-finite recurrences for classes of sequences with ordinary generating function containing roots of polynomials. The focus is on establishing the D-finite differential equations such that the familiar steps of reducing their…

We use a Hamiltonian (transition matrix) description of height-restricted Dyck paths on the plane in which generating functions for the paths arise as matrix elements of the propagator to evaluate the length and area generating function for…

We compute the generating function of column-strict plane partitions with parts in {1,2,...,n}, at most c columns, p rows of odd length and k parts equal to n. This refines both, Krattenthaler's ["The major counting of nonintersecting…

We solve a problem of Marshal Hall by proving the convergence of the catalan number generating function directly on the basis of its recursion formula.

We introduce a generating function associated to the homogeneous generators of a graded algebra that measures how far is this algebra from being finitely generated. For the case of some algebras of Frobenius endomorphisms we describe this…

We find the exponential generating function for permutations with all valleys even and all peaks odd, and use it to determine the asymptotics for its coefficients, answering a question posed by Liviu Nicolaescu. The generating function can…

In the paper, 2 explicit formulas for the Euler numbers of the second kind are obtained. Based on those formulas a exponential generating function is deduced. Using the generating function some well-known and new identities for the Euler…

We show that many perception tasks, from visual recognition, semantic segmentation, optical flow, depth estimation to vocalization discrimination, are highly redundant functions of their input data. Images or spectrograms, projected into…

The redundancy principle provides the framework to study how rare events are made possible with probability 1 in accelerated time, by making many copies of similar random searchers. But what is $n$ large? To estimate large $n$ with respect…

The generating function for the number of purely crossing partitions of {1,...,n} is found in terms of the generating function for Bell numbers. Further results about generating functions for asymptotic moments of certain random Vandermonde…

In the first part of this paper, we enumerate exactly walks on the square lattice that start from the origin, but otherwise avoid the non positive horizontal half-axis. We call them "walks on the slit plane". We count them by their length,…

The present work analyzes the redundancy of sets of combinatorial objects produced by a weighted random generation algorithm proposed by Denise et al. This scheme associates weights to the terminals symbols of a weighted context-free…

Causal discovery from data affected by latent confounders is an important and difficult challenge. Causal functional model-based approaches have not been used to present variables whose relationships are affected by latent confounders,…

This paper presents a reinterpretation of a second-order linear recurrence sequence as a sequence of continuants derived from the convergents to a continued fraction. As a result, we are able to derive the generating function and Binet…

We count permutations avoiding a nonconsecutive instance of a two- or three-letter pattern, that is, the pattern may occur but only as consecutive entries in the permutation. Two-letter patterns give rise to the Fibonacci numbers. The…

The Ramanujan Machine project detects new expressions related to constants of interest, such as $\zeta$ function values, $\gamma$ and algebraic numbers (to name a few). In particular the project lists a number of conjectures concerning the…