Related papers: Transversal Lattices
A coding lattice $\Lambda_c$ and a shaping lattice $\Lambda_s$ forms a nested lattice code $\mathcal{C}$ if $\Lambda_s \subseteq \Lambda_c$. Under some conditions, $\mathcal{C}$ is a finite cyclic group formed by rectangular encoding. This…
A polygon $P$ is called a reptile, if it can be decomposed into $k\ge 2$ nonoverlapping and congruent polygons similar to $P$. We prove that if a cyclic quadrilateral is a reptile, then it is a trapezoid. Comparing with results of U. Betke…
A fibration is said to be isotrivial if all of its smooth fibres are isomorphic to a single fixed variety. We classify the elliptic K3 surfaces that are isotrivial, and use them to construct Lagrangian fibrations that are isotrivial. We…
The circumcircle of a planar convex polygon P is a circle C that passes through all vertices of P. If such a C exists, then P is said to be cyclic. Fix C to have unit radius. While any two angles of a uniform cyclic triangle are negatively…
Bicircular lift matroids are a class of matroids defined on the edge set of a graph. For a given graph $G$, the circuits of its bicircular lift matroid are the edge sets of those subgraphs of $G$ that contain at least two cycles, and are…
We study the multiplication operation of square matrices over lattices. If the underlying lattice is distributive, then matrices form a semigroup; we investigate idempotent and nilpotent elements and the maximal subgroups of this matrix…
By Dirichlet's Unit Theorem, under the log embedding the units in the ring of integers of a number field form a lattice, called the log-unit lattice. We investigate the geometry of these lattices when the number field is a biquadratic or…
When $\mathbb{Z}^d$ is represented as a finite disjoint union of translated integer sublattices, the translated sublattices must possess some special properties. Such a representation is called a \emph{lattice tiling}. We develop a…
Let S be a distributive {∨, 0}-semilattice. In a previous paper, the second author proved the following result: Suppose that S is a lattice. Let K be a lattice, let $\phi$: Con K $\to$ S be a {∨, 0}-homomorphism. Then $\phi$ is,…
Rough sets are efficient for data pre-processing in data mining. Matroids are based on linear algebra and graph theory, and have a variety of applications in many fields. Both rough sets and matroids are closely related to lattices. For a…
Swartz proved that any matroid can be realized as the intersection lattice of an arrangement of codimension one homotopy spheres on a sphere. This was an unexpected extension from the oriented matroid case, but unfortunately the…
We focus on checking the validity of the half-plane property on two prominent classes of transversal matroids, namely lattice path matroids and bicircular matroids. We show that lattice path matroids satisfy the half-plane property.…
We call a lattice crosscut-simplicial if the crosscut complex of every atomic interval is equal to the boundary of a simplex. Every interval of such a lattice is either contractible or homotopy equivalent to a sphere. Recently, Hersh and…
Let f be a self-map of the set A. We give a necessary and sufficient condition for the existence of a lattice structure on A such that f becomes a lattice endomorphism with respect to this structure.
Motivated by the characterization of the lattice of cyclic flats of a matroid, the convolution of a ranked lattice and a discrete measure is defined, generalizing polymatroid convolution. Using the convolution technique we prove that if a…
We are interested in expanding our understanding of symplectic matroids by exploring the properties of a class of symplectic matroids with a "lattice of flats". Taking a well-behaved family of subdivisions of the cross polytope we obtain a…
We introduce the minor-closed, dual-closed class of multi-path matroids. We give a polynomial-time algorithm for computing the Tutte polynomial of a multi-path matroid, we describe their basis activities, and we prove some basic structural…
In this paper, we study positroids and its overlap with two classes of matroids: transversal and paving matroids. We exhibit a new class of fundamental transversal matroids and classify the Le-diagram for rank two transversal positroids. We…
An intertwine of a pair of matroids is a matroid such that it, but none of its proper minors, has minors that are isomorphic to each matroid in the pair. For pairs for which neither matroid can be obtained, up to isomorphism, from the other…
With every family of finitely many subsets of a finite-dimensional vector space over the Galois-field with two elements we associate a cyclic transversal polytope. It turns out that those polytopes generalize several well-known polytopes…