Related papers: Noncommutative crossing partitions
The study of patterns in permutations in a very active area of current research. Klazar defined and studied an analogous notion of pattern for set partitions. We continue this work, finding exact formulas for the number of set partitions…
We study combinatorial and order theoretic structures arising from the fragment of combinatory logic spanned by the basic combinator ${\bf M}$. This basic combinator, named as the Mockingbird by Smullyan, is defined by the rewrite rule…
This paper deals with join-semilattices whose sections, i.e. principal filters, are pseudocomplemented lattices. The pseudocomplement of a\vee b in the section [b,1] is denoted by a\rightarrow b and can be considered as the connective…
We investigate involutive commutative residuated lattices without unit, which are commutative residuated lattice-ordered semigroups enriched with a unary involutive negation operator. The logic of this structure is discussed and the…
We define a path integral over Dirac operators that averages over noncommutative geometries on a fixed graph, as the title reveals, using quiver representations. We prove algebraic relations that are satisfied by the expectation value of…
Partial compositeness is a mechanism for the generation of fermion masses which replaces a direct Higgs coupling to the fermions by a linear mixing with heavy composite partners. We present the first calculation of the relevant matrix…
The Weihrauch degrees and strong Weihrauch degrees are partially ordered structures representing degrees of unsolvability of various mathematical problems. Their study has been widely applied in computable analysis, complexity theory, and…
A commutative algebra over a field gives rise to a representation of the category of finite sets and surjective maps. We consider the restriction of this representation to the subcategory of sets of cardinality at most $r$. For each $r$, we…
Chen, Deng, Du, Stanley, and Yan introduced the notion of $k$-crossings and $k$-nestings for set partitions, and proved that the sizes of the largest $k$-crossings and $k$-nestings in the partitions of an $n$-set possess a symmetric joint…
This is a survey on the categorification of the poset of generalized non-crossing partitions, using the representation theory of a hereditary artin algebra H, looking at the set P of exceptional subcategories in mod H. This categorification…
We consider a two-point spatial lattice approximation to an open string moving in a flat background with B field. It gives a constrained dipole system under the influence of a vector potential. Solving and quantizing this system recover all…
A triangular partition is a partition whose Ferrers diagram can be separated from its complement (as a subset of $\mathbb{N}^2$) by a straight line. Having their origins in combinatorial number theory and computer vision, triangular…
In this paper we will give a M\"obius number of $NC^{k}(W) \setminus \bf{mins} \cup \{\hat{0} \}$ for a Coxeter group $W$ which contains an affirmative answer for the conjecture 3.7.9 in Armstrong's paper [ Generalized noncrossing…
Skew lattices are non-commutative generalizations of lattices. The coset structure decomposition is an original approach to the study of these algebras describing the relation between its rectangular classes. In this paper we will look at…
For L a finite lattice, let C(L) denote the set of pairs g = (g_0,g_1) such that g_0 is a lower cover of g_1 and order it as follows: g <= d iff g_0 <= d_0, g_1 <= d_1, but not g_1 <= d_0. Let C(L,g) denote the connected component of g in…
In this paper we investigate undirected discrete graphical tree models when all the variables in the system are binary, where leaves represent the observable variables and where all the inner nodes are unobserved. A novel approach based on…
Tree-like tableaux are objects in bijection with alternative or permutation tableaux. They have been the subject of a fruitful combinatorial study for the past few years. In the present work, we define and study a new subclass of tree-like…
Our basic objects are partitions of finite sets of points into disjoint subsets. We investigate sets of partitions which are closed under taking tensor products, composition and involution, and which contain certain base partitions. These…
After investigating by examples the unusual and striking elementary properties of the Penrose tilings and the Arnold cat map, we associate a finite symbolic dynamics with finite grammar rules to each of them. Instead of studying these…
Flow polytopes of acyclic oriented graphs arise naturally in combinatorial optimization, and the study of their volumes and triangulations has revealed intriguing connections across combinatorics, geometry, algebra, and representation…