Related papers: Noncommutative crossing partitions
In this note, we give a new proof of a result of Matthew Dyer stating that in an arbitrary Coxeter group $W$, every pair $t,t'$ of distinct reflections lie in a unique maximal dihedral reflection subgroup of $W$. Our proof only relies on…
We introduce a new type of partitions that consists of partitions whose different parts alternate in parity (e.g., $3+2+2+1+1$). Various properties of this partition function are studied. In particular, we obtain its asymptotic behavior by…
We generalize the notion of non-crossing partition on a disk to general surfaces with boundary. For this, we consider a surface $\Sigma$ and introduce the number $C_{\Sigma}(n)$ of non-crossing partitions of a set of $n$ points laying on…
We introduce a class of noncommutatative algebras called representation complete intersections (RCI). A graded associative algebra A is said to be RCI provided there exist arbitrarily large positive integers n such that the scheme Rep_n(A),…
For the Kashiwara crystal of a highest weight representation of an affine Lie algebra of type A and rank e, with highest weight $\Lambda$, there is a labeling by multipartitions and by piecewise linear paths in the real weight space called…
In this paper, we address several intersection problems for $r$-cross $t$-intersecting families of partitions. A $k$-partition of an $n$-set $X$ is a set of $k$ pairwise disjoint non-empty subsets whose union is $X$. For $1\leq i\leq r$,…
We present an algorithm for computing a maximum agreement subtree of two unrooted evolutionary trees. It takes O(n^{1.5} log n) time for trees with unbounded degrees, matching the best known time complexity for the rooted case. Our…
Let $\mathbf{F}=\left\langle F,R\right\rangle $ be a finite Kripke frame. A congruence of $\mathbf{F}$ is a bisimulation of $\mathbf{F}$ that is also an equivalence relation on F. The set of all congruences of $\mathbf{F}$ is a lattice…
We present an elementary type preserving bijection between noncrossing and nonnesting partitions for all classical reflection groups, answering a question of Athanasiadis.
Following an idea of A. Berenstein, we define a commutor for the category of crystals of a finite dimensional complex reductive Lie algebra. We show that this endows the category of crystals with the structure of a coboundary category.…
A non-crossing pairing on a bitstring matches 1s and 0s in a manner such that the pairing diagram is nonintersecting. By considering such pairings on arbitrary bitstrings $1^{n_1} 0^{m_1} ... 1^{n_r} 0^{m_r}$, we generalize classical…
This article investigates combinatorial properties of non-ambiguous trees. These objects we define may be seen either as binary trees drawn on a grid with some constraints, or as a subset of the tree-like tableaux previously defined by…
Built upon the proposal of Kaplan et.al. [hep-lat/0206109], we construct noncommutative lattice gauge theory with manifest supersymmetry. We show that such theory is naturally implementable via orbifold conditions generalizing those used by…
This article investigates structural connections between unrefinable partitions into distinct parts and numerical semigroups. By analysing the hooksets of Young diagrams associated with numerical sets, new criteria for recognising…
This paper treats certain integral lattices with respect to ternary quadratic forms, which are obtained from the data of a non-zero element and a maximal lattice in a quaternary quadratic space. Such a lattice can be described by means of…
We introduce the notion of crossings and nestings of a permutation. We compute the generating function of permutations with a fixed number of weak exceedances, crossings and nestings. We link alignments and permutation patterns to these…
It is proved that the number of partitions of n with odd mex and k parts that aren't ones equals the number of partitions of n with nonnegative crank and k parts that aren't ones..
Join-distributive lattices are finite, meet-semidistributive, and semimodular lattices. They are the same as Dilworth's lattices in 1940, and many alternative definitions and equivalent concepts have been discovered or rediscovered since…
We classify fields having finitely many finite non-commutative (not necessarily central) division algebras over them. In the process, we introduce the notion of anti-closure of a field and also make comments on fields having a linear…
We consider $(k,j)$-colored partitions, partitions in which $k$ colors exist but at most $j$ colors may be chosen per size of part. In particular these generalize overpartitions. Advancing previous work, we find new congruences, including…