Related papers: Cyclic Flats of Binary Matroids
Lattices induced by coverings arise naturally in matroid theory and combinatorial optimization, providing a structured framework for analyzing relationships between independent sets and closures. In this paper, we explore the structural…
This article examines the dynamic phase transitions and pattern formations attributed to binary systems modeled by the Cahn-Hilliard equation. In particular, we consider a two-dimensional lattice structure and determine how different…
A two-dimensional bistable lattice is a periodic triangular network of non-linear bi-stable rods. The energy of each rod is piecewise quadratic and has two minima. Consequently, a rod undergoes a reversible phase transition when its…
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.…
The dynamics of a linear dynamical system over a finite field can be described by using the elementary divisors of the corresponding matrix. It is natural to extend the investigation to a general finite commutative ring. In a previous…
The introduction of covering-based rough sets has made a substantial contribution to the classical rough sets. However, many vital problems in rough sets, including attribution reduction, are NP-hard and therefore the algorithms for solving…
Let $A$, $B$, and $S$ be (v,0)-semilattices and let $f: A\to B$ be a (v,0)-embedding. Then the canonical map, $f \otimes \id\_S$, of the tensor product $A \otimes S$ into the tensor product $B \otimes S$ is not necessarily an embedding. The…
By placing fermions only on the even sites of a lattice, one may halve the momentum spectrum and construct a theory without doublers. The interaction is nonlocal. The fermion propagator is not a sparse matrix, but because the unwanted…
For any minor-closed class of matroids over a fixed finite field, we state an exact structural characterization for the sufficiently connected matroids in the class. We also state a number of conjectures that might be approachable using the…
A periodic lattice in Euclidean 3-space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…
We generalize the well-studied notion of a modular pair of a finite matroid to arbitrary families of sets in infinite matroids, and use it to develop the theory of infinite matroids in several as-yet-unexplored areas. Our results include a…
We describe the design and implementation of a 2D optical lattice of double wells suitable for isolating and manipulating an array of individual pairs of atoms in an optical lattice. Atoms in the square lattice can be placed in a double…
Multi-dimensional cyclic code is a natural generalization of cyclic code. In an earlier paper we explored two-dimensional constacyclic codes over finite fields. Following the same technique, here we characterize the algebraic structure of…
We prove a new exchange property for bases of a matroid that generalizes the multiple symmetric exchange property. For every bases $B_1,\dots,B_k$ of a matroid and a subset $A_1\subset B_1$ there exist subsets $A_2\subset…
We call a positive definite Hermitian lattice regular if it represents all integers which can be represented locally by the lattice. We investigate binary regular Hermitian lattices over imaginary quadratic fields $\mathbb{Q}(\sqrt{-m})$…
Flat energy bands of model lattice Hamiltonians provide a key ingredient in designing dispersionless wave excitations and have become a versatile platform to study various aspects of interacting many-body systems. Their essential merit lies…
Certain lattice wave systems in translationally invariant settings have one or more spectral bands that are strictly flat or independent of momentum in the tight binding approximation, arising from either internal symmetries or fine-tuned…
Dedekind stated and proved the well-known fact that a lattice is modular if and only if it does not contain a pentagon as a sublattice. In this paper we consider a similar result in the literature for the case of certain class of modular…
Cycle polytopes of matroids have been introduced in combinatorial optimization as a generalization of important classes of polyhedral objects like cut polytopes and Eulerian subgraph polytopes associated to graphs. Here we start an…
Unimodal (i.e. single-humped) permutations may be decomposed into a product of disjoint cycles. Some enumerative results concerning their cyclic structure -- e.g. 2/3 of them contain fixed points -- are given. We also obtain in effect a…