Related papers: Generating Posets with Interfaces
A poset is said to be (2+2)-free if it does not contain an induced subposet that is isomorphic to 2+2, the union of two disjoint 2-element chains. Two elements in a poset are indistinguishable if they have the same strict up-set and the…
In order to generate novel 3D shapes with machine learning, one must allow for interpolation. The typical approach for incorporating this creative process is to interpolate in a learned latent space so as to avoid the problem of generating…
The notion of level posets is introduced. This class of infinite posets has the property that between every two adjacent ranks the same bipartite graph occurs. When the adjacency matrix is indecomposable, we determine the length of the…
We study two subspace systems in a separable infinite-dimensional Hilbert space up to (bounded) isomorphism. One of the main result of this paper is the following: Isomorphism classes of two subspace systems given by graphs of bounded…
Let $P(n)$ be the set of all posets with $n$ elements. Let $P^{(j)}(n)$, $1\leq j\leq 2^n,$ be the number of all posets with $n$ elements possessing exactly $j$ antichains. We have determined the numbers $P^{(j)}(7),$ $1\leq j\leq 128$, and…
In this article we will describe an algorithm to constructively enumerate non-isomorphic Union closed Sets and Moore sets. We confirm the number of isomorphism classes of Union closed Sets and Moore sets on n<=6 elements presented by other…
A poset is (3+1)-free if it does not contain the disjoint union of chains of length 3 and 1 as an induced subposet. These posets play a central role in the (3+1)-free conjecture of Stanley and Stembridge. Lewis and Zhang have enumerated…
This article focuses on automatically generating polynomial equations that are inductive loop invariants of computer programs. We propose a new algorithm for this task, which is based on polynomial interpolation. Though the proposed…
An unlabeled poset is said to be (2+2)-free if it does not contain an induced subposet that is isomorphic to 2+2, the union of two disjoint 2-element chains. Let $p_n$ denote the number of (2+2)-free posets of size $n$. In a recent paper,…
We propose a matrix approach for generating naturally labeled posets by representing each poset $P$ on the set $[n]$ as a Boolean poset matrix $A$. This algebraic representation enables a systematic handling of partial orderings through…
A monoid $M$ generated by a set $S$ of symbols can be described as the set of equivalence classes of finite words in $S$ under some relations that specify when some contiguous sequence of symbols can be replaced by another. If $a,b\in S$, a…
The abstract induced subgraph poset of a graph is the isomorphism class of the induced subgraph poset of the graph, suitably weighted by subgraph counting numbers. The abstract bond lattice and the abstract edge-subgraph poset are defined…
We apply the homomorphism complex construction to partially ordered sets, introducing a new topological construction based on the set of maximal chains in a graded poset. Our primary objects of study are distributive lattices, with special…
Loop invariants play a very important role in proving correctness of programs. In this paper, we address the problem of generating invariants of polynomial loop programs. We present a new approach, for generating polynomial equation…
We consider a number of examples of groups together with an infinite conjugation invariant generating set, including: the free group with the generating set of all separable elements; surface groups with the generating set of all…
Polyzetas, indexed by words, satisfy shuffle and quasi-shuffle identities. In this respect, one can explore the multiplicative and algorithmic (locally finite) properties of their generating series. In this paper, we construct pairs of…
We study the isomorphism types of simply connected complexes of rank 7/4 using a local invariant called the parity. We show that the parity can be computed explicitly in certain constructions arising from surgery.
We consider the problem of generating all ideals of a poset. It is a long standing open problem, whether or not the ideals of any poset can be generated in constant amortized time, CAT for short. We refine the tree traversal, a method…
We introduce Cayley posets as posets arising naturally from pairs $S<T$ of semigroups, much in the same way that Cayley graph arises from a (semi)group and a subset. We show that Cayley posets are a common generalization of several known…
We give various formulas to compute the number of all involutions, i.e. elements of order 2, in an incidence algebra $I(X,\mathbb{K})$, where $X$ is a finite poset (star, Y and Rhombuses) and $\mathbb{K}$ is a finite field of characteristic…