Related papers: Combinatorics of explicit substitutions
The study of combinatorial properties of mathematical objects is a very important research field and continued fractions have been deeply studied in this sense. However, multidimensional continued fractions, which are a generalization…
Many combinatorial sequences (for example, the Catalan and Motzkin numbers) may be expressed as the constant term of $P(x)^k Q(x)$, for some Laurent polynomials $P(x)$ and $Q(x)$ in the variable $x$ with integer coefficients. Denoting such…
In this thesis I discuss combinatorial optimization problems, from the statistical physics perspective. The starting point are the motivations which brought physicists together with computer scientists and mathematicians to work on this…
We propose investigating a summation analog of the paradigm for parallel integration. We make some first steps towards an indefinite summation method applicable to summands that rationally depend on the summation index and a P-recursive…
We provide a characterisation of strongly normalising terms of the lambda-mu-calculus by means of a type system that uses intersection and product types. The presence of the latter and a restricted use of the type omega enable us to…
Many random combinatorial objects have a component structure whose joint distribution is equal to that of a process of mutually independent random variables, conditioned on the value of a weighted sum of the variables. It is interesting to…
We define a generic algorithmic framework to prove pure discrete spectrum for the substitutive symbolic dynamical systems associated with some infinite families of Pisot substitutions. We focus on the families obtained as finite products of…
In this paper, we derive new combinatorial formulas for symmetric Macdonald polynomials $P_{\lambda}(X;q,t)$ and integral Macdonald polynomials $J_{\lambda}(X;q,t)$, in terms of several new statistics and the major index for a partition…
We address a problem connected to the unfolding semantics of functional programming languages: give a useful characterization of those infinite lambda-terms that are lambda_{letrec}-expressible in the sense that they arise as infinite…
The upsilon distribution, the sum of independent chi random variates and a normal, is introduced. As a special case, the upsilon distribution includes Lecoutre's lambda-prime distribution. The upsilon distribution finds application in…
We define a new generalization of Catalan numbers to multinomial coefficients. With arithmetic methods, we study their integrality and the integrality of their Lucasnomial generalization. We give a complete characterization of regular Lucas…
We introduce proper display calculi for intuitionistic, bi-intuitionistic and classical linear logics with exponentials, which are sound, complete, conservative, and enjoy cut-elimination and subformula property. Based on the same design,…
Probabilistic programming is an approach to reasoning under uncertainty by encoding inference problems as programs. In order to solve these inference problems, probabilistic programming languages (PPLs) employ different inference…
In this paper, we study the combinatorial structures of straight and ordinary m\'enage permutations. Based on these structures, we prove four formulas. The first two formulas define a relationship between the m\'enage numbers and the…
Intersection types are a standard tool in operational and semantical studies of the lambda calculus. De Carvalho showed how multi types, a quantitative variant of intersection types providing a handy presentation of the relational…
Some combinatorial properties of fixed boundary rhombus random tilings with octagonal symmetry are studied. A geometrical analysis of their configuration space is given as well as a description in terms of discrete dynamical systems, thus…
We provide a context around a conjectured closed form for the Hankel transform of linear combinations of consecutive pairs of Catalan numbers. This generalizes the formula for the Hankel transforms of the shifted Catalan numbers and the…
Combinatorial counting problems pervade artificial intelligence, statistics, and discrete mathematics. Whether the task is enumerating subsets, multisets, permutations, partitions, or compositions under structural and arithmetic…
Permutation tableaux are combinatorial objects related with permutations and various statistics on them. They appeared in connection with total positivity in Grassmannians, and stationary probabilities in a PASEP model. In particular they…
We study statistics of tiles in random incommensurable Kakutani sequences of partitions in $\mathbb{R}^d$. We provide explicit formulas that illustrate the dependence on the combinatorial structure, the volumes of the participating tiles…