Related papers: Graded posets zeta matrix formula
In order theory, partially ordered sets are only equipped with one relation which decides the entire structure/Hasse diagram of the set. In this paper, we have presented how partially ordered sets can be studied under simultaneous partially…
We consider a model of strongly correlated electrons in 1D called the t-J model, which was solved by graded algebraic Bethe ansatz. We use it to design graded tensor networks which can be contracted approximately to obtain a Matrix Product…
By using only combinatorial data on two posets X and Y, we construct a set of so-called formulas. A formula produces simultaneously, for any abelian category A, a functor between the categories of complexes of diagrams over X and Y with…
We provide a method to construct new associators out of Drinfel'd's KZ associator. We obtain two analytic families of associators whose coefficients we can describe explicitly by a generalization of multiple zeta values. The two families…
We investigate relations between elliptic multiple zeta values and describe a method to derive the number of indecomposable elements of given weight and length. Our method is based on representing elliptic multiple zeta values as iterated…
The modular decomposition of a graph $G$ is a natural construction to capture key features of $G$ in terms of a labeled tree $(T,t)$ whose vertices are labeled as "series" ($1$), "parallel" ($0$) or "prime". However, full information of $G$…
This article examines noncrossing partitions of the unit circle in the complex plane; we call these continuous noncrossing partitions. More precisely, we focus on the degree-$d$ continuous noncrossing partitions where unit complex numbers…
Two bases of states are presented for modules of the graded parafermionic conformal field theory associated to the coset $\osp(1,2)_k/\uh(1)$. The first one is formulated in terms of the two fundamental (i.e., lowest dimensional)…
In this paper we consider representations of certain combinatorial categories, including the poset $\D$ of positive integers and division, the Young lattice $\mathscr{Y}$ of partitions of finite sets, the opposite category of the orbit…
Category-level pose estimation is a challenging task with many potential applications in computer vision and robotics. Recently, deep-learning-based approaches have made great progress, but are typically hindered by the need for large…
Motivated by questions about simplification of topology, we take a discrete approach to the dependency of simplifying operations, using methods based on combinatorial gradient dynamics. We interpret the filter in persistent homology as a…
For a given poset, we consider its representations by systems of subspaces of a unitary space ordered by inclusion. We classify such systems for all posets for which an explicit classification is possible.
Algorithmic decidability is established for two order-theoretic properties of downward closed subsets defined by finitely many obstructions in two infinite posets. The properties under consideration are: (a) being atomic, i.e. not being…
The orbits in $\Gamma_{\infty}(3) \backslash \Gamma(3)$ are in bijection with sets of invariants satisfying certain relations. We explain how wedge product matrices give an alternative definition of the invariants of matrix orbits. This new…
The object of this paper is to transform a set of local chain complexes to a single global complex using an equivalence relation of congruence of cells, solving topologically the numerical inaccuracies of floating-point arithmetics. While…
We compute the quadratic embedding constant for complete bipartite graphs with disjoint edges removed. Moreover, we study the quadratic embedding property for theta graphs, i.e., graphs consisting of three paths with common initial points…
A graded poset structure is defined for the sets of Littlewood-Richardson (LR) tableaux that count the multiplicity of an irreducible GL(n)-module in the tensor product of irreducibles indexed by a sequence of rectangular partitions. This…
Since orthomodular posets serve as an algebraic axiomatization of the logic of quantum mechanics, it is a natural question how the connective of implication can be defined in this logic. It should be introduced in such a way that it is…
This paper examines operad structures derived from poset matrices by formulating a set of new construction rules for poset matrices. In this direction, eleven different partial composition operations will be introduced as the basis for the…
A family of simplicial complexes, connected with simplicial maps and indexed by a poset $P$, is called a poset tower. The concept of poset towers subsumes classical objects of study in the persistence literature, as, for example,…