Related papers: On the Cryptomorphism between Davis' Subset Lattic…
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…
We construct a family of independent sets for finite, atomic, and graded lattices, extending the well-known cryptomorphism between geometric lattices and matroids. This construction leads to an embedding theorem into geometric lattices that…
We consider the problem of constructing dense lattices of R^n with a given automorphism group. We exhibit a family of such lattices of density at least cn/2^n, which matches, up to a multiplicative constant, the best known density of a…
Extremal problems on set systems with restricted intersections have been an important part of combinatorics in the last 70 year. In this paper, we study the following Ramsey version of these problems. Given a set $L\subseteq…
A novel lattice approach is presented for studying systems comprising a large number of interacting nonrelativistic fermions. The construction is ideally suited for numerical study of fermions near unitarity--a strongly coupled regime…
We propose an interpretation for the meets and joins in the lattice of experimental propositions of a physical theory, answering a question of Birkhoff and von Neumann in [1]. When the lattice is atomistic, it is isomorphic to the lattice…
A numbering of a countable family $S$ is a surjective map from the set of natural numbers $\omega$ onto $S$. The paper studies Rogers semilattices, i.e. upper semilattices induced by the reducibility between numberings, for families…
We introduce an algorithm for computing closure systems derived from a family of implications on a set. Semilattices presentations are explored and used in conjunction with the algorithm to compute various types of lattices freely generated…
Let $La(n,P)$ be the maximum size of a family of subsets of $[n]=\{1,2,...,n\}$ not containing $P$ as a (weak) subposet. The diamond poset, denoted $B_{2}$, is defined on four elements $x,y,z,w$ with the relations $x<y,z$ and $y,z<w$.…
We revisit the results on admissible transformations between normal linear systems of second-order ordinary differential equations with an arbitrary number of dependent variables under several appropriate gauges of the arbitrary elements…
Set systems with strongly restricted intersections, called $\alpha$-intersecting families for a vector $\alpha$, were introduced recently as a generalization of several well-studied intersecting families including the classical oddtown and…
We classify $N{=}1$ SVOAs with no free fermions and with bosonic subalgebra a simply connected WZW algebra which is not of type $\mathrm{E}$. The latter restriction makes the classification tractable; the former restriction implies that the…
Let $\Gamma \leq \mathrm{Aut}(T_{d_1}) \times \mathrm{Aut}(T_{d_2})$ be a group acting freely and transitively on the product of two regular trees of degree $d_1$ and $d_2$. We develop an algorithm which computes the closure of the…
This work proposes an alternative approach to the so-called lattice of embedded subsets, which is included in the product of the subset and partition lattices of a finite set, and whose elements are pairs consisting of a subset and a…
We consider the problem of finding lower bounds on the number of unlabeled $n$-element lattices in some lattice family. We show that if the family is closed under vertical sum, exponential lower bounds can be obtained from vertical sums of…
Covering is a common type of data structure and covering-based rough set theory is an efficient tool to process this data. Lattice is an important algebraic structure and used extensively in investigating some types of generalized rough…
Since Henrik Strietz's 1975 paper proving that the lattice Part($n$) of all partitions of an $n$-element finite set is four-generated, more than half a dozen papers have been devoted to four-element generating sets of this lattice. We prove…
The lattice of partitions of a set and its d-divisible generalization have been much studied for their combinatorial, topological, and representation-theoretic properties. An ordered set partition is a set partition where the subsets are…
We study the closure operators of polymatroids from a lattice theoretic point of view. We show that polymatroid closure operators relate to lattices enriched with a generating set in the same way that matroids relate to geometric lattices.…
The work in this article is concerned with two different types of families of finite sets: separating families and splitting families (they are also called "systems"). These families have applications in combinatorial search, coding theory,…