Related papers: Counting with 3-valued truth tables of bracketed f…
In this paper we investigate enumeration of some classes of $n$-character strings and binary necklaces. Recall that binary necklaces are necklaces in two colors with length $n$. We prove three results (Theorems 1, 1' and 2) concerning the…
We extend the formalisation of confluence results in Kleene algebras to a formalisation of coherent confluence proofs. For this, we introduce the structure of higher globular Kleene algebra, a higher-dimensional generalisation of modal and…
What might a combinatorial interpretation of the Kronecker coefficients even look like? We introduce a class of combinatorial objects called bitableaux, which we believe are a natural candidate, and we formulate a purely combinatorial…
The question whether a set of formulae G implies a formula f is fundamental. The present paper studies the complexity of the above implication problem for propositional formulae that are built from a systematically restricted set of Boolean…
The paper is devoted to the Poisson brackets compatible with multiplication in associative algebras. These brackets are shown to be quadratic and their relations with the classical Yang--Baxter equation are revealed. The paper also contains…
We present a braid-theoretic approach to combinatorially computing knot Floer homology. To a knot or link K, which is braided about the standard disk open book decomposition for (S^3,\xi_std), we associate a corresponding multi-pointed nice…
We study the equational theory of the Weihrauch lattice with multiplication, meaning the collection of equations between terms built from variables, the lattice operations $\sqcup$, $\sqcap$, the product $\times$, and the finite…
We give a purely combinatorial proof of the Glaisher-Crofton identity which derives from the analysis of discrete structures generated by iterated second derivative. The argument illustrates utility of symbolic and generating function…
We construct a weight matrix for the 3D Ising model satisfying the so-called twisted tetrahedron equation. The result is based on the theory of the n-simplicial complex and the invented recursion procedure on the space of n-simplex…
We give a general method to build categories of combinatorial manifolds, i.e. categories of combinatorial objects satisfying some local property at every "point", as coreflective subcategories of categories of relational presheaves. To do…
In this article we associate a combinatorial differential graded algebra to a cubic planar graph G. This algebra is defined combinatorially by counting binary sequences, which we introduce, and several explicit computations are provided. In…
From an identity connecting a combinatorial sum and Legendre polynomials, we derive closed forms for a number of combinatorial sums. Some of them are obtained via results about the integrals of functions associated with Legendre…
Hecke algebras are beautiful q-extensions of Coxeter groups. In this paper, we prove several results on their characters, with an emphasis on characters induced from trivial and sign representations of parabolic subalgebras. While most of…
The combinatorial theory for the set of parity alternating permutations is expounded. In view of the numbers of ascents and inversions, several enumerative aspects of the set are investigated. In particular, it is shown that signed Eulerian…
We show how concurrent quantales and concurrent Kleene algebras arise as convolution algebras $Q^X$ of functions from structures $X$ with two ternary relations that satisfy relational interchange laws into concurrent quantales or Kleene…
This article provides an algebraic study of intermediate inquisitive and dependence logics. While these logics are usually investigated using team semantics, here we introduce an alternative algebraic semantics and we prove it is complete…
We present an untyped linear lambda calculus with braids, the corresponding combinatory logic, and the semantic models given by crossed G-sets.
We describe a graph-theoretic syntax for self-referential formulas as well as a four-valued logic to include contradictory and independent formulas. We then explore the degree to which generalized truth tables can be realized in our theory,…
Knecht considers the enumeration of coronas. This is a counting problem for two specific types of lozenge tilings. Their exact closed formulas are conjectured in [A380346] and [A380416] on the OEIS. We prove this conjecture by using the…
We study tensors on Lie groupoids suitably compatible with the groupoid structure, called {\em multiplicative}. Our main result gives a complete description of these objects only in terms of infinitesimal data. Special cases include the…