相关论文: The Generating Function of Ternary Trees and Conti…
Convergence of the Gauss resolution process for a complex singular foliation of dimension r is shown to be equivalent to finite type of a graded sheaf which is built using base (r+2) expansions of integers. As applications it is calculated…
We describe a simple method that produces automatically closed forms for the coefficients of continued fractions expansions of a large number of special functions. The function is specified by a non-linear differential equation and initial…
We introduce the Ceiling Continued Fractions (FCT) framework for constructing three-term Egyptian fraction representations in the Erd\H{o}s-Straus conjecture. The approach exploits divisor structures of shifted integers p+i rather than…
We revisit Ito's (\cite{I1989}) natural extension of the Farey tent map, which generates all regular continued fraction convergents and mediants of a given irrational. With a slight shift in perspective on the order in which these…
We give conjectures on the form of families of integer sequences whose Hankel transforms are, respectively, $(\alpha, \beta)$ Somos $4$ sequences, $(\alpha, 0, \gamma)$ Somos $6$ sequences, and $(\alpha, \beta, \gamma, \delta)$ Somos $8$…
We consider uniform random permutations drawn from a family enumerated through generating trees. We develop a new general technique to establish a central limit theorem for the number of consecutive occurrences of a fixed pattern in such…
We give 50 digits values of the simple continued fractions whose denominators are formed from a) prime numbers, b) twin primes, c) generalized $d$-twins, d) primes of the form $m^2+n^4$, e)primes of the form $m^2+1$, f) Mersenne primes and…
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…
In this paper, we prove that almost every translation of $\mathbb{T}^2$ admits a symbolic coding which has linear complexity $2n+1$. The partitions are constructed with Rauzy fractals associated with sequences of substitutions, which are…
We show that the additive-slow-Farey version of the traditional continued fractions algorithm has a natural interpretation as a method for producing integer partitions of a positive number $n$ into two smaller numbers, with multiplicity. We…
We evaluate the Hankel determinants of various sequences related to Bernoulli and Euler numbers and special values of the corresponding polynomials. Some of these results arise as special cases of Hankel determinants of certain sums and…
A theorem of Meinardus provides asymptotics of the number of weighted partitions under certain assumptions on associated ordinary and Dirichlet generating functions. The ordinary generating functions are closely related to Euler's…
We present a unification and generalization of what is known in the literature as sequentially and hierarchically semi-separable (SSS and HSS) representations for matrices. Describing rank-structured representations of (inverses of) sparse…
A recursive method is given for finding generating functions which enumerate rooted hypermaps by number of vertices, edges and faces for any given number of darts. It makes use of matrix-integral expressions arising from the study of…
We show that the reciprocal of a partial sum with 2m terms of the alternating exponential series is the exponential generating function for permutations in which every increasing run has length congruent to 0 or 1 modulo 2m. More generally…
Many classical identities arise from nothing more mysterious than looking at the same object in two different ways. A number, a function, or a combinatorial object may admit several natural decompositions, and by disassembling it in one way…
We explore a generating function trick which allows us to keep track of infinitely many statistics using finitely many variables, by recording their individual distributions rather than their joint distributions. Building on previous work…
Recently, it has been observed that {0,1,-1}-ternary codes which are simply generated from deep features by hard thresholding, tend to outperform {-1,1}-binary codes in image retrieval. To obtain better ternary codes, we for the first time…
In this work we introduce and study various generalizations of the notion of increasingly labelled trees, where the label of a child node is always larger than the label of its parent node, to multilabelled tree families, where the nodes in…
Legendre found that the continued fraction expansion of $\sqrt N$ having odd period leads directly to an explicit representation of $N$ as the sum of two squares. Similarly, it is shown here that the continued fraction expansion of $\sqrt…