Related papers: Godel Implication on Finite Chains: Truth Tables a…

This paper develops a deeper understanding of the structure and combinatorial significance of the partition function for Hermitian random matrices. The coefficients of the large N expansion of the logarithm of this partition function,also…

In this paper we provide an alternative semantics for Equilibrium Logic and its monotonic basis, the logic of Here-and-There (also known as G\"odel's G3 logic) that relies on the idea of "denotation" of a formula, that is, a function that…

Let $n$ be a positive integer and $\mathcal M$ a set of rational $n \times n$-matrices such that $\mathcal M$ generates a finite multiplicative semigroup. We show that any matrix in the semigroup is a product of matrices in $\mathcal M$…

In this article we study decreasing and increasing factorisations of the cycle, which are decompositions of the cycle $(1~2\dots n)$ into a product of $n-1$ transpositions satisfying monotonicity conditions. We explicit a bijection between…

In this work, we study the function $f_2(G)$ that counts the number of exact factorizations of a finite group $G$. We compute $f_2(G)$ for some well-known families of finite groups and use the results of Wiegold and Williamson \cite{WW} to…

Geometric grid classes and the substitution decomposition have both been shown to be fundamental in the understanding of the structure of permutation classes. In particular, these are the two main tools in the recent classification of…

We are interested in proving input-output properties of functions that handle infinite data such as streams or non-wellfounded trees. We provide a finitary refinement type system which is (sound and) complete for Scott-open properties…

We explore some connections between vectors of integers and integer partitions seen as bi-infinite words. This methodology enables us on the one hand to obtain enumerations connecting products of hook lengths and vectors of integers. This…

A new summation method is introduced to convert a relatively wide family of infinite sums and local expansions into integrals. The integral representations yield global information such as analytic continuability, position of singularities,…

Abstract algebraic logic is a theory that provides general tools for the algebraic study of arbitrary propositional logics. According to this theory, every logic L is associated with a matrix semantics Mod*(L). This paper is a contribution…

If $G$ is a strongly connected finite directed graph, the set $\mathcal{T}G$ of rooted directed spanning trees of $G$ is naturally equipped with a structure of directed graph: there is a directed edge from any spanning tree to any other…

Let $c=(C_n)_{n\ge 0}$ be the Catalan sequence and $T$ a linear and bounded operator on a Banach space $X$ such $4T$ is a power-bounded operator. The Catalan generating function is defined by the following Taylor series, $$…

We establish a fundamental theorem of orders (FTO) which allows us to express all orders uniquely as an intersection of `irreducible orders' along which the index and the conductor distributes multiplicatively. We define a subclass of…

We give a uniform explicit construction of finite two-generator presentations for the special linear groups over the integers in all ranks at least three. The construction builds on the generating-pair work of Conder--Liversidge--Vsemirnov…

We introduce G{\aa}rding polynomials, a class of real multivariate polynomials characterized by positivity regions that are invariant under translation by positive vectors and closed under strictly positive affine transformations. We prove…

Using a recursive approach, we show that the generating function for sets of Motzkin paths avoiding a single (not necessarily consecutive) pattern is rational over $x$ and the Catalan generating function $C(x) =…

We introduce a logical foundation to reason on tree structures with constraints on the number of node occurrences. Related formalisms are limited to express occurrence constraints on particular tree regions, as for instance the children of…

In this paper, we give a finite number of defining relations satisfied by a finite number of generators for the elliptic Lie algebras and superalgebras ${\frak g}_R$ with rank $\geq 2$. Here the $R$'s denote the reduced and non-reduced…

Fuzzy Description Logics (FDLs) are logic-based formalisms used to represent and reason with vague or imprecise knowledge. It has been recently shown that reasoning in most FDLs using truth values from the interval [0,1] becomes undecidable…

A bracket is a function that assigns a number to each monomial in variables \tau_0, \tau_1, ... We show that any bracket satisfying the string and the dilaton relations gives rise to a power series lying in the algebra A generated by the…