Related papers: Counting with 3-valued truth tables of bracketed f…
The article explores the arithmetic of multiplication as a model of many valued projective logic. It is demonstrated that closed numerical intervals within this framework constitute Heyting algebras. The conditions for these algebras to be…
This text contains over three hundred specific open questions on various topics in additive combinatorics, each placed in context by reviewing all relevant results. While the primary purpose is to provide an ample supply of problems for…
We develop the usage of certain type theories as specification languages for algebraic theories and inductive types. We observe that the expressive power of dependent type theories proves useful in the specification of more complicated…
From the matrix point of view, we use the recursion to discuss four combinatorial numbers in terms of the integer lattice paths, this is different from Andr\'a's method (Andra). We give four tables and matrices, and their relations, and…
A detailed combinatorial analysis of planar lattice convex polygonal lines is presented. This makes it possible to answer an open question of Vershik regarding the existence of a limit shape when the number of vertices is constrained. The…
We discuss tableaux for the Implicational Propositional Calculus and show how they may be used to establish its completeness.
We construct a Seifert surface for a given null-homologous transverse link in a contact manifold that is compatible with a planar open book decomposition, then obtain a formula of the self-linking number. It extends Bennequin's self-linking…
We give a combinatorial intepretation of cluster variables of a specific cluster algebra under a mutation sequence of period 6, in terms of perfect matchings of subgraphs of the brane tiling dual to the quiver associated with the cluster…
Assume that $V$ is a braided vector space with diagonal type. It is shown that a monomial belongs to Nichols braided Lie algebra $\mathfrak L(V)$ if and only if this monomial is connected. A basis of Nichols braided Lie algebra and…
A new heuristic method for the evaluation of definite integrals is presented. This method of brackets has its origin in methods developed for the evaluation of Feynman diagrams. The operational rules are described and the method is…
We present a Coq library about Kleene algebra with tests, including a proof of their completeness over the appropriate notion of languages, a decision procedure for their equational theory, and tools for exploiting hypotheses of a…
Kleene algebra with tests (KAT) was introduced as an algebraic structure to model and reason about classic imperative programs, i.e. sequences of discrete transitions guarded by Boolean tests. This paper introduces two generalisations of…
Knots and links which are closed 3-braids are a very special class. Like 2-bridge knots and links, they are simple enough to admit a complete classification. At the same time they are rich enough to serve as a source of examples on which,…
We study Kleene iteration in the categorical context. A celebrated completeness result by Kozen introduced Kleene algebra (with tests) as a ubiquitous tool for lightweight reasoning about program equivalence, and yet, numerous variants of…
We introduce the Delta-framework, LF-Delta, a dependent type theory based on the Edinburgh Logical Framework LF, extended with the strong proof-functional connectives, i.e. strong intersection, minimal relevant implication and strong union.…
Kleene algebras (KA) and Kleene algebras with tests (KAT) provide an algebraic framework to capture the behavior of conventional programming constructs. This paper explores a broader understanding of these structures, in order to enable the…
A class of n-ary Poisson structures of constant rank is indicated. Then, one proves that the ternary Poisson brackets are exactly those which are defined by a decomposable 3-vector field. The key point is the proof of a lemma which tells…
We investigate the enumeration of varieties of boolean theories related to Horn clauses. We describe a number of combinatorial equivalences among different characterizations and calculate the number of different theories in $n$ variables…
A paper of the first author and Zilke proposed seven combinatorial problems around formulas for the characteristic polynomial and the exponents of an isolated quasihomogeneous singularity. The most important of them was a conjecture on the…
In this paper we define 3-crossed modules for commutative (Lie) algebras and investigate the relation between this construction and the simplicial algebras. Also we define the projective 3-crossed resolution for investigate a higher…