Related papers: Counting isomorphism classes of $\beta$-normal lin…
We use category-theoretic techniques to provide two proofs showing that for a higher-rank graph $\Lambda$, its cubical (co-)homology and categorical (co-)homology groups are isomorphic in all degrees, thus answering a question of Kumjian,…
We provide a proof of strong normalisation for lambda+, a recently introduced, explicitly typed, non-deterministic lambda-calculus where isomorphic propositions are identified. Such a proof is a non-trivial adaptation of the reducibility…
We study Milner's lambda-calculus with partial substitutions. Particularly, we show confluence on terms and metaterms, preservation of \b{eta}-strong normalisation and characterisation of strongly normalisable terms via an intersection…
We use Constraint Satisfaction Methods to construct and enumerate finite $L$-algebras up to isomorphism. These objects were recently introduced by Rump and appear in Garside theory, algebraic logic, and the study of the combinatorial…
Germs of tubular neighborhood embeddings for submanifolds N of manifolds M are in one-one correspondence with germs of Euler-like vector fields near N. In many contexts, this reduces the proof of `normal forms results' for geometric…
In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs. To this end we develop new techniques applicable for the structural and…
It is often the case that a Selmer group of an abelian variety and a group related to an ideal class group can both be naturally embedded into the same cohomology group. One hopes to compute one from the other by finding how close each is…
Matroid theory is often thought of as a generalization of graph theory. In this paper we propose an analogous correspondence between embedded graphs and delta-matroids. We show that delta-matroids arise as the natural extension of graphic…
Following our previous work, we suggest here a large class of algebras of scalars in which simultaneous and correlated computations can be performed owing to the existence of surjective algebra homomorphisms. This may replace the currently…
Let $A$ and $B$ be two connected graded algebras finitely generated in degree one. If $A$ is isomorphic to $B$ as ungraded algebras, then they are also isomorphic to each other as graded algebras.
It has been known since Ehrhard and Regnier's seminal work on the Taylor expansion of $\lambda$-terms that this operation commutes with normalization: the expansion of a $\lambda$-term is always normalizable and its normal form is the…
This is a short description of graphic lambda calculus, with special emphasis on a duality suggested by the two different appearances of knot diagrams, in lambda calculus and emergent algebra sectors of the graphic lambda calculus…
To each symmetric graded Frobenius superalgebra we associate a W-algebra. We then define a linear isomorphism between the trace of the Frobenius Heisenberg category and a central reduction of this W-algebra. We conjecture that this is an…
In this paper we show that two skew diagrams lambda/mu and alpha/beta can represent the same multiplicity free skew character [lambda/mu]=[alpha/beta] only in the the trivial cases when lambda/mu and alpha/beta are the same up to…
We provide formulas for the degrees of the projections of the locus of square matrices with given rank from linear spaces spanned by a choice of matrix entries. The motivation for these computations stem from applications to `matrix…
The Graded Classification Conjecture (GCC) states that the pointed $K_0^{\operatorname{gr}}$-group is a complete invariant of the Leavitt path algebras of finite graphs when these algebras are considered with their natural grading by…
In the past decades for more and more graph classes the Graph Isomorphism Problem was shown to be solvable in polynomial time. An interesting family of graph classes arises from intersection graphs of geometric objects. In this work we show…
In this work we provide alternative formulations of the concepts of lambda theory and extensional theory without introducing the notion of substitution and the sets of all, free and bound variables occurring in a term. We also clarify the…
Working with generating functions, the combinatorics of a recurrence relation can be expressed in a way that allows for more efficient calculation of the quantity. This is true of the Catalan numbers for an ordered binary tree…
The notion of bounded expansion captures uniform sparsity of graph classes and renders various algorithmic problems that are hard in general tractable. In particular, the model-checking problem for first-order logic is fixed-parameter…