Related papers: On cobweb posets most relevant codings
Theoretical and computational frameworks of modern science are dominated by binary structures. This binary bias, seen in the ubiquity of pair-wise networks and formal operations of two arguments in mathematical models, limits our capacity…
We introduce new partial order structures on the underlying sets of free nonsymmetric operads. These posets involve decorated ordered rooted trees, and their terminal intervals are lattices. These lattices are not graded, not self-dual, and…
Counting linear extensions is a fundamental problem in poset theory. It is known to be #P-complete, with polynomial-time formulas available in special cases. In this work, we develop new recursive formulas for counting linear extensions of…
The well known binary and decimal representations of the integers, and other similar number systems, admit many generalisations. Here, we investigate whether still every integer could have a finite expansion on a given integer base b, when…
We investigate the local topological structure of non-metrizable topological groups through the lens of Tukey order and cofinal types. Motivated by recent advances in topological groups admitting an $\omega^\omega$-base, we introduce the…
Tree sets are posets with additional structure that generalize tree-like objects in graphs, matroids, or other combinatorial structures. They are a special class of abstract separation systems. We study infinite tree sets and how they…
Linear-programming pseudocodewords play a pivotal role in our understanding of the linear-programming decoding algorithms. These pseudocodewords are known to be equivalent to the graph-cover pseudocodewords. The latter pseudocodewords, when…
In certain finite posets, the expected down-degree of their elements is the same whether computed with respect to either the uniform distribution or the distribution weighting an element by the number of maximal chains passing through it.…
We consider group-valued cocycles over dynamical systems with hyperbolic behavior. The base system is either a hyperbolic diffeomorphism or a mixing subshift of finite type. The cocycle $A$ takes values in the group of invertible bounded…
Reasoning about the effect of interventions and counterfactuals is a fundamental task found throughout the data sciences. A collection of principles, algorithms, and tools has been developed for performing such tasks in the last decades…
The complement of an arrangement A of a finite number of affine hyperplanes in complex n-space has the structure of a poset of spaces indexed by the intersection poset, L(A). The space corresponding to G in L(A) is homotopy equivalent to…
Higher-order information is crucial for relational learning in many domains where relationships extend beyond pairwise interactions. Hypergraphs provide a natural framework for modeling such relationships, which has motivated recent…
In [1] we introduced the notion of 'structured space', i.e. a space which locally resembles various algebraic structures. In [2] and [3] we studied some cohomology theories related to these space. In this paper we continue in this…
We study preorders on (equivalence classes of) maximal chains in the general context of polygonal lattices endowed with suitably nice edge labellings. We show that, given a quotient of polygonal lattices, such edge labellings descend to the…
An analog of Kreimer's coproduct from renormalization of Feynman integrals in quantum field theory, endows an analog of Kontsevich's graph complex with a dg-coalgebra structure. The graph complex is generated by orientation classes of…
Directed acyclic graphical (DAG) models are a powerful tool for representing causal relationships among jointly distributed random variables, especially concerning data from across different experimental settings. However, it is not always…
A structure is called homogeneous if every isomorphism between finitely induced substructures of the structure extends to an automorphism of the structure. Recently, P. J. Cameron and J. Ne\v{s}et\v{r}il introduced a relaxed version of…
We propose the use of hyperedge replacement graph grammars for factor graphs, or factor graph grammars (FGGs) for short. FGGs generate sets of factor graphs and can describe a more general class of models than plate notation, dynamic…
Combinatorial Hopf algebras of trees exemplify the connections between operads and bialgebras. Painted trees were introduced recently as examples of how graded Hopf operads can bequeath Hopf structures upon compositions of coalgebras. We…
In this paper, we study abstract dynamical systems with discrete phase spaces. One example of such a system is induced by the $3 x{+}1$-map on the set of all natural numbers, also known as the Collatz map. Our main focus is on dynamical…