相关论文: Constellations and multicontinued fractions: appli…

We introduce the set of (non-spanning) tree-decorated planar maps, and show that they are in bijection with the Cartesian product between the set of trees and the set of maps with a simple boundary. As a consequence, we count the number of…

Most numerical models of binary stars - in particular neutron stars in compact binaries - assume the companions to be either corotational or irrotational. Either one of these assumptions leads to a significant simplification in the…

We present a triangulation--independent area--ordering prescription which naturally generalizes the well known path ordering one. For such a prescription it is natural that the two--form ``connection'' should carry three ``color'' indices…

We survey the history and recent developments around two decades-old problems that continue to attract a great deal of interest: the slicing $\times 2$, $\times 3$ conjecture of H. Furstenberg in ergodic theory, and the distance set problem…

Chirotopes are a common combinatorial abstraction of (planar) point sets. In this paper we investigate decomposition methods for chirotopes, and their application to the problem of counting the number of triangulations supported by a given…

Constellations and hypermaps generalize combinatorial maps, i.e. embedding of graphs in a surface, in terms of factorization of permutations. In this paper, we extend a result of Jackson and Visentin (1990) stating an enumerative relation…

Percolation on a plane is usually associated with clusters spanning two opposite sides of a rectangular system. Here we investigate three-leg clusters generated on a square lattice and spanning the three sides of equilateral triangles. If…

We developed a modification to the calculation of the two-point correlation function commonly used in the analysis of large scale structure in cosmology. An estimator of the two-point correlation function is constructed by contrasting the…

A few years ago we identified a recursion that works directly with the gaps among the generators in each stage of Eratosthenes sieve. This recursion provides explicit enumerations of sequences of gaps among the generators, which are known…

We perform the asymptotic enumeration of two classes of rooted maps on orientable surfaces of genus g: m-hypermaps and m-constellations. For m=2, they correspond respectively to maps with even face degrees and bipartite maps. We obtain…

We address the enumeration of Eulerian orientations of 4-valent planar maps according to three parameters: the number of vertices, the number of alternating vertices (having in/out/in/out incident edges), and the number of clockwise…

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…

We characterize a family of number triangles whose production matrices are closely related to the original number triangle. We study a number of such triangles that are of combinatorial significance. For a specific subfamily, these…

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…

In a partially ordered semigroup with the duality (or polarity) transform, it is possible to define a generalisation of continued fractions. General sufficient conditions for convergence of continued fractions with deterministic terms are…

We give a formula for the bivariate generating function of a stationary 1-dependent counting process in terms of its run probability generating function, with a probabilistic proof. The formula reduces to the well known bivariate generating…

A method to construct trihamiltonian extensions of a separable system is presented. The procedure is tested for systems, with a natural Hamiltonian, separable in classical sense in one of the four orthogonal separable coordinate systems of…

Projection methods are popular algorithms for iteratively solving feasibility problems in Euclidean or even Hilbert spaces. They employ (selections of) nearest point mappings to generate sequences that are designed to approximate a point in…

On the sighting of the constellations and their stars, they seem to be near each other at first sight but some of thema are actually quite further from the others. Froma the geocentric point view can the Zodiac Costellations be perceived as…

In this paper, we introduce the polynomial continued fraction, a close relative of the well-known simple continued fraction expansions which are widely used in number theory and in general. While they may not possess all the intriguing…