Related papers: Combinatorics of explicit substitutions
Years ago Zeev Rudnick defined the ${\lambda}$-Poisson generic sequences as the infinite sequences of symbols in a finite alphabet where the number of occurrences of long words in the initial segments follow the Poisson distribution with…
We give a domination condition implying good-$\lambda$ and exponential inequalities for couples of measurable functions. Those inequalities recover several classical and new estimations involving some operators in Harminic Analysis. Among…
We provide a survey of results from symbolic dynamics and algebraic topology relating to Grout, a new user-friendly program developed to calculate combinatorial properties and topological invariants of a large class of symbolic…
We introduce LAM, a subsystem of IMALL2 with restricted additive rules able to manage duplication linearly, called linear additive rules. LAM is presented as the type assignment system for a calculus endowed with copy constructors, which…
We begin by deriving a number of combinatorial identities satisfied by the $q$-super Catalan numbers. In particular, we extend some of the known combinatorial identities (Touchard, Koshy, Reed Dawson) to the $q$-super Catalan numbers. Next,…
The goal of this paper is to demonstrate the general modeling and practical simulation of random equations with mixture model parameter random variables. Random equations, understood as stationary (non-dynamical) equations with parameters…
Recent work on combinatory logic demonstrates a compositional translation from lambda calculus that gives meaning to open terms. As the meaning of open terms is a key difficulty in the study of metaprogramming, we investigate whether this…
We characterize the compactness properties of the product of \lambda\ copies of the space \omega\ with the discrete topology, dealing in particular with the case \lambda\ singular, using regular and uniform ultrafilters, infinitary…
In various supersymmetric extensions of the Standard Model there appear non-topological solitons due to the existence of U(1) global symmetries associated with Baryon and/or Lepton quantum numbers. Trilinear couplings (A-terms) in the…
The logic programming paradigm provides the basis for a new intensional view of higher-order notions. This view is realized primarily by employing the terms of a typed lambda calculus as representational devices and by using a richer form…
For each integer $k\ge 1$, we define an algorithm which associates to a partition whose maximal value is at most $k$ a certain subset of all partitions. In the case when we begin with a partition $\lambda$ which is square, i.e…
The lambda-calculus with de Bruijn indices assembles each alpha-class of lambda-terms in a unique term, using indices instead of variable names. Intersection types provide finitary type polymorphism and can characterise normalisable…
The Lambek calculus can be considered as a version of non-commutative intuitionistic linear logic. One of the interesting features of the Lambek calculus is the so-called "Lambek's restriction," that is, the antecedent of any provable…
Combinatory logic shows that bound variables can be eliminated without loss of expressiveness. It has applications both in the foundations of mathematics and in the implementation of functional programming languages. The original…
We compare predictions of the quantum loop expansion to (essentially) infinite orders with (essentially) exact results in a simple quantum mechanical model.We find that there are exponentially small corrections to the loop expansion, which…
The causal set theory d'Alembertian has rational coefficients for which alternating expressions are known. Here, a combinatorial interpretation of these numbers is given.
A hyperplane arrangement in $\mathbb{R}^n$ is a finite collection of affine hyperplanes. Counting regions of hyperplane arrangements is an active research direction in enumerative combinatorics. In this paper, we consider the arrangement…
Using standard methods (due to Janson, Stein-Chen, and Talagrand) from probabilistic combinatorics, we explore the following general theme: As one progresses from each member of a family of objects ${\cal A}$ being "covered" by at most one…
It is common practice to compare the computational power of different models of computation. For example, the recursive functions are strictly more powerful than the primitive recursive functions, because the latter are a proper subset of…
In a series of papers, P. Blasiak et al. developed a wide-ranging generalization of Bell numbers (and of Stirling numbers of the second kind) that appears to be relevant to the so-called Boson normal ordering problem. They provided a…