Related papers: Counting with 3-valued truth tables of bracketed f…
We compute all complex structures on indecomposable 6-dimensional real Lie algebras and their equivalence classes. We also give for each of them a global holomorphic chart on the connected simply connected Lie group associated to the real…
This is an exposition of some new results on associated primes and the depth of different kinds of powers of monomial ideals in order to show a deep connection between commutative algebra and some objects in combinatorics such as simplicial…
The method of brackets is an procedure to evaluate definite integrals. It is based on a small number of operational rules. The flexibility of this method is illustrated with the evaluation of an integral involving the Bessel K0 function and…
Classical r-matrices of the three-dimensional real Lie bialgebras are obtained. In this way all three-dimensional real coboundary Lie bialgebras and their types (triangular, quasitriangular or factorizable) are classified. Then, by using…
We give a combinatorial proof of an identity that involves Eulerian numbers and was obtained algebraically by Brenti and Welker (2009). To do so, we study alcoved triangulations of dilated hypersimplices. As a byproduct, we describe the…
This paper introduces a simple type system for combinatory logic in which combinators have at most one type, whose polymorphism is revealed by application. The combinatory types exactly describe the structure of their values, which may be…
This work lies across three areas (in the title) of investigation that are by themselves of independent interest. A problem that arose in quantum computing led us to a link that tied these areas together. This link consists of a single…
Recently the authors introduced lecture hall tableaux in their study of multivariate little $q$-Jacobi polynomials. In this paper, we enumerate bounded lecture hall tableaux. We show that their enumeration is closely related to standard and…
Let K be a variety of (commutative, integral) residuated lattices. The substructural logic usually associated with K is an algebraizable logic that has K as its equivalent algebraic semantics, and is a logic that preserves truth, i.e., 1 is…
We construct a realizability model of linear dependent type theory from a linear combinatory algebra. Our model motivates a number of additions to the type theory. In particular, we add a universe with two decoding operations: one takes…
Recent articles have shown the connection between representation theory of quivers and the theory of cluster algebras. In this article, we prove that some cluster algebras of type ADE can be recovered from the data of the corresponding…
This booklet serves as an introduction to Kleene Algebra (KA), a set of laws that can be used to study general equivalences between programs. It discusses how general programs can be modeled using regular expressions, how those expressions…
We give a new combinatorial interpretation of Howe dual pairs of the form $(\g,{\rm Sp}_{2\ell})$, where $\g$ is a Lie (super)algebra of classical type. This is done by establishing a symplectic analogue of the RSK algorithm associated to…
For the direct sum of several copies of sl_n, a family of Lie brackets compatible with the initial one is constructed. The structure constants of these brackets are expressed in terms of theta-functions associated with an elliptic curve.…
We investigate the equational theory for Kleene algebra terms with variable complements and constant complements -- (language) complement where it applies only to variables or constants -- w.r.t. languages. While the equational theory…
We provide a combinatorial construction for linear codes attaining the maximum possible number of distinct weights. We then introduce the related problem of determining the existence of linear codes with an arbitrary number of distinct…
Building on \'Esik and Kuich's completeness result for finitely weighted Kleene algebra, we establish relational and language completeness results for finitely weighted Kleene algebra with tests. Similarly as \'Esik and Kuich, we assume…
In this paper, we propose to enumerate all different configurations belonging to a specific class of fractals: A binary initial tile is selected and a finite recursive tiling process is engaged to produce auto-similar binary patterns. For…
Lots of research focuses on the combinatorics behind various bases of cluster algebras. This paper studies the natural basis of a type A cluster algebra, which consists of all cluster monomials. We introduce a new kind of combinatorial…
We define a class of algebras describing links of binary isolating formulas on a set of realizations for a family of 1-types of a complete theory. We prove that a set of labels for binary isolating formulas on a set of realizations for a…